================================================================
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
Solving layer: 15
Solving layer: 16
Computed optimal makespan:15
Makespan optimal solution:
Mulirobot solution: (|moves| = 122, paralellism = 8.133) [
    Step 0: 16#0->5 10#1->6 15#4->3 2#12->13 4#19->16 14#24->23 1#27->28 
    Step 1: 6#2->1 16#5->0 10#6->7 7#9->4 2#13->14 4#16->15 8#17->12 9#22->19 17#25->24 
    Step 2: 6#1->6 15#3->2 10#7->13 8#12->11 4#15->9 9#19->16 11#20->17 12#21->22 
    Step 3: 16#0->5 15#2->1 10#13->7 2#14->18 9#16->15 11#17->12 17#24->20 13#26->25 
    Step 4: 15#1->0 10#7->2 5#10->16 11#12->13 17#20->17 12#22->19 14#23->24 13#25->26 
    Step 5: 10#2->3 6#6->1 4#9->10 8#11->12 11#13->7 9#15->14 17#17->20 14#24->25 13#26->27 1#28->22 
    Step 6: 7#4->9 16#5->6 11#7->2 8#12->17 9#14->13 5#16->15 17#20->24 14#25->26 13#27->28 
    Step 7: 15#0->5 3#8->7 4#10->16 9#13->12 5#15->14 8#17->20 17#24->25 14#26->27 
    Step 8: 10#3->8 15#5->0 9#12->11 5#14->13 4#16->15 8#20->24 14#27->21 
    Step 9: 11#2->3 16#6->5 5#13->12 4#15->14 12#19->16 8#24->23 13#28->27 
    Step 10: 6#1->2 7#9->10 5#12->6 4#14->13 12#16->15 1#22->28 17#25->24 13#27->26 
    Step 11: 5#6->1 10#8->14 7#10->16 4#13->12 12#15->9 14#21->27 17#24->20 13#26->25 1#28->22 
    Step 12: 16#5->6 3#7->8 12#9->4 4#12->13 10#14->15 7#16->19 17#20->17 1#22->21 13#25->24 14#27->26 
    Step 13: 16#6->7 3#8->9 9#11->5 4#13->14 17#17->12 1#21->27 13#24->20 14#26->25 
    Step 14: 9#5->6 16#7->8 17#12->13 7#19->22 14#25->24 1#27->26 
]
Multirobot solution analysis: (
    total makespan           = 15
    total distance           = 55
    total trajectory         = 122
    average parallelism      = 8.133
    average distance         = 3.235
    average trajectory       = 7.176
    parallelism distribution  = [ 0 0 0 0 0 1 3 6 3 2 ]
    distance distribution     = [ 2 2 0 4 3 2 2 1 ]
    trajectory distribution   = [ 0 0 2 1 0 4 3 1 3 1 2 ]
)
Phase statistics (current phase = 'root_phase') [
        Phase (name = 'root_phase') [
            Total SAT solver calls         = 15
            Satisfiable SAT solver calls   = 1
            Unsatisfiable SAT solver calls = 14
            Indeterminate SAT solver calls = 0
            Move executions                = 244
            Produced CNF variables         = 54735
            Produced CNF clauses           = 375240
            Search steps                   = 0
            Wall clock TIME (seconds)      = 304.634
            CPU/machine TIME (seconds)     = 304.750
        ]
]
----------------------------------------------------------------