================================================================
reLOC 0.08-osaka : Multirobot Solution solver
(C) Copyright 2011-2013 Pavel Surynek
----------------------------------------------------------------
Reading graph...
Reading initial arrangement...
Reading goal arrangement...
Solving layer: 2
Solving layer: 3
Solving layer: 4
Solving layer: 5
Solving layer: 6
Solving layer: 7
Solving layer: 8
Solving layer: 9
Solving layer: 10
Solving layer: 11
Solving layer: 12
Solving layer: 13
Solving layer: 14
Computed optimal makespan:13
Makespan optimal solution:
Mulirobot solution: (|moves| = 118, paralellism = 9.077) [
    Step 0: 1#19->16 4#9->8 5#17->12 7#1->6 10#26->27 
    Step 1: 1#16->15 2#10->9 3#2->1 4#8->3 5#12->11 6#22->19 8#20->17 10#27->28 13#0->5 14#25->26 
    Step 2: 2#9->8 3#1->0 4#3->2 6#19->16 7#6->12 8#17->20 10#28->22 11#24->25 14#26->27 
    Step 3: 1#15->14 2#8->7 4#2->1 6#16->10 7#12->17 8#20->24 10#22->19 11#25->26 12#4->3 13#5->6 14#27->28 
    Step 4: 1#14->18 2#7->13 5#11->5 6#10->9 7#17->20 8#24->25 9#21->22 10#19->16 11#26->27 13#6->12 
    Step 5: 4#1->6 5#5->11 6#9->8 7#20->24 8#25->26 9#22->19 10#16->15 11#27->21 12#3->4 13#12->17 
    Step 6: 1#18->14 2#13->12 3#0->1 4#6->5 6#8->7 7#24->25 8#26->27 9#19->16 10#15->9 11#21->22 13#17->20 
    Step 7: 1#14->18 2#12->17 3#1->6 6#7->2 7#25->26 8#27->21 9#16->15 10#9->8 11#22->19 13#20->24 
    Step 8: 2#17->20 3#6->12 6#2->3 7#26->27 8#21->22 9#15->14 10#8->7 11#19->16 12#4->9 13#24->25 
    Step 9: 2#20->24 3#12->17 4#5->0 9#14->8 10#7->2 11#16->15 12#9->10 13#25->26 
    Step 10: 1#18->14 2#24->25 3#17->20 4#0->1 5#11->12 7#27->21 10#2->7 11#15->9 
    Step 11: 1#14->13 3#20->24 4#1->0 5#12->17 6#3->2 8#22->19 10#7->6 11#9->4 
    Step 12: 1#13->7 3#24->23 4#0->5 5#17->20 6#2->1 7#21->22 8#19->16 9#8->9 
]
Multirobot solution analysis: (
    total makespan           = 13
    total distance           = 75
    total trajectory         = 118
    average parallelism      = 9.077
    average distance         = 5.357
    average trajectory       = 8.429
    parallelism distribution  = [ 0 0 0 0 1 0 0 4 1 5 2 ]
    distance distribution     = [ 1 1 0 1 2 2 2 4 ]
    trajectory distribution   = [ 0 0 1 1 0 0 2 1 3 5 0 1 ]
)
Phase statistics (current phase = 'SAT') [
        Phase (name = 'root_phase') [
            Total SAT solver calls         = 0
            Satisfiable SAT solver calls   = 0
            Unsatisfiable SAT solver calls = 0
            Indeterminate SAT solver calls = 0
            Move executions                = 0
            Produced CNF variables         = 0
            Produced CNF clauses           = 0
            Search steps                   = 0
            Wall clock TIME (seconds)      = 3.862
            CPU/machine TIME (seconds)     = 3.860
        ]
        Sub-phases {
            Phase (name = 'SAT') [
                Total SAT solver calls         = 13
                Satisfiable SAT solver calls   = 1
                Unsatisfiable SAT solver calls = 12
                Indeterminate SAT solver calls = 0
                Move executions                = 118
                Produced CNF variables         = 232037
                Produced CNF clauses           = 168479
                Search steps                   = 0
                Wall clock TIME (seconds)      = 27.271
                CPU/machine TIME (seconds)     = 27.430
            ]
        }
]
----------------------------------------------------------------