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