================================================================
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
Computed optimal makespan:11
Makespan optimal solution:
Mulirobot solution: (|moves| = 127, paralellism = 11.545) [
    Step 0: 1#32->31 2#14->7 5#18->21 6#15->16 7#1->2 8#20->25 9#5->12 14#27->26 15#37->38 
    Step 1: 1#31->30 2#7->1 4#4->10 5#21->28 7#2->3 8#25->24 11#23->22 12#36->37 13#8->15 14#26->33 15#38->39 16#13->14 
    Step 2: 1#30->29 2#1->2 3#6->13 7#3->4 8#24->31 11#22->21 12#37->38 13#15->19 15#39->32 16#14->7 17#9->8 
    Step 3: 1#29->22 2#2->3 3#13->14 4#10->9 5#28->35 8#31->30 9#12->5 10#0->1 12#38->39 13#19->23 14#33->34 15#32->25 16#7->6 17#8->15 
    Step 4: 4#9->8 5#35->36 8#30->29 9#5->12 10#1->2 11#21->18 12#39->40 13#23->24 14#34->33 15#25->32 16#6->0 17#15->19 
    Step 5: 1#22->21 4#8->15 5#36->37 6#16->9 7#4->10 8#29->28 11#18->13 13#24->31 14#33->34 15#32->39 17#19->23 
    Step 6: 1#21->18 2#3->4 4#15->19 5#37->30 6#9->16 9#12->11 10#2->8 11#13->6 13#31->32 15#39->38 16#0->1 17#23->24 
    Step 7: 1#18->13 3#14->7 5#30->31 7#10->9 8#28->21 10#8->15 11#6->0 13#32->39 14#34->33 15#38->37 16#1->2 17#24->25 
    Step 8: 1#13->6 4#19->23 5#31->24 7#9->8 8#21->22 9#11->17 10#15->14 11#0->1 13#39->38 14#33->32 15#37->36 16#2->3 17#25->26 
    Step 9: 1#6->0 4#23->30 5#24->25 6#16->15 10#14->13 11#1->2 12#40->33 13#38->31 14#32->39 16#3->9 17#26->27 
    Step 10: 1#0->1 2#4->10 4#30->29 5#25->26 6#15->14 8#22->23 9#17->11 12#33->40 14#39->38 15#36->37 
]
Multirobot solution analysis: (
    total makespan           = 11
    total distance           = 59
    total trajectory         = 127
    average parallelism      = 11.545
    average distance         = 3.471
    average trajectory       = 7.471
    parallelism distribution  = [ 0 0 0 0 0 0 0 0 1 1 3 4 1 1 ]
    distance distribution     = [ 1 2 3 1 4 2 1 0 2 ]
    trajectory distribution   = [ 0 0 1 0 1 5 0 4 3 3 ]
)
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)      = 17.896
            CPU/machine TIME (seconds)     = 17.900
        ]
        Sub-phases {
            Phase (name = 'SAT') [
                Total SAT solver calls         = 11
                Satisfiable SAT solver calls   = 1
                Unsatisfiable SAT solver calls = 10
                Indeterminate SAT solver calls = 0
                Move executions                = 127
                Produced CNF variables         = 287732
                Produced CNF clauses           = 179106
                Search steps                   = 0
                Wall clock TIME (seconds)      = 35.889
                CPU/machine TIME (seconds)     = 36.020
            ]
        }
]
----------------------------------------------------------------