================================================================
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| = 123, paralellism = 11.182) [
    Step 0: 7#1->2 4#4->10 9#5->12 2#14->7 6#15->16 5#18->21 8#20->25 14#27->26 1#32->31 15#37->38 
    Step 1: 7#2->3 2#7->1 13#8->15 9#12->5 16#13->14 5#21->28 11#23->22 8#25->24 14#26->33 1#31->30 12#36->37 15#38->39 
    Step 2: 2#1->2 7#3->4 9#5->12 3#6->13 17#9->8 16#14->7 13#15->19 11#22->21 8#24->31 5#28->35 1#30->29 14#33->34 15#39->32 
    Step 3: 10#0->1 2#2->3 17#8->15 4#10->9 9#12->11 3#13->14 13#19->23 11#21->18 1#29->28 8#31->30 5#35->36 12#37->38 
    Step 4: 10#1->2 7#4->10 4#9->8 9#11->17 17#15->19 11#18->13 13#23->22 1#28->21 8#30->29 15#32->31 14#34->33 5#36->37 12#38->39 
    Step 5: 2#3->9 16#7->1 4#8->15 7#10->4 11#13->6 17#19->23 1#21->18 15#31->38 14#33->40 5#37->30 12#39->32 
    Step 6: 10#2->8 7#4->3 11#6->0 2#9->10 3#14->7 4#15->19 1#18->13 13#22->21 17#23->24 5#30->31 12#32->33 15#38->37 14#40->39 
    Step 7: 16#1->2 7#3->9 10#8->15 2#10->11 13#21->28 17#24->25 8#29->30 5#31->32 14#39->40 
    Step 8: 11#0->1 16#2->3 7#9->8 1#13->6 10#15->14 4#19->23 17#25->26 13#28->29 8#30->31 
    Step 9: 11#1->2 1#6->0 2#11->10 10#14->13 6#16->15 4#23->22 17#26->27 13#29->30 8#31->24 5#32->25 14#40->39 
    Step 10: 1#0->1 16#3->9 6#15->14 9#17->11 4#22->29 8#24->23 5#25->26 13#30->31 12#33->40 14#39->38 
]
Multirobot solution analysis: (
    total makespan           = 11
    total distance           = 59
    total trajectory         = 123
    average parallelism      = 11.182
    average distance         = 3.471
    average trajectory       = 7.235
    parallelism distribution  = [ 0 0 0 0 0 0 0 0 2 2 2 2 3 ]
    distance distribution     = [ 1 2 3 1 4 2 1 0 2 ]
    trajectory distribution   = [ 0 0 2 0 0 5 0 5 3 2 ]
)
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.813
            CPU/machine TIME (seconds)     = 17.820
        ]
        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                = 246
                Produced CNF variables         = 44539
                Produced CNF clauses           = 451454
                Search steps                   = 0
                Wall clock TIME (seconds)      = 20.505
                CPU/machine TIME (seconds)     = 20.640
            ]
        }
]
----------------------------------------------------------------