================================================================
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| = 101, paralellism = 9.182) [
    Step 0: 1#25->26 2#3->4 3#15->16 4#43->44 8#33->34 9#40->32 10#5->13 
    Step 1: 1#26->27 3#16->20 4#44->45 6#11->10 7#38->43 8#34->35 10#13->12 
    Step 2: 1#27->28 3#20->26 4#45->40 5#9->8 6#10->11 7#43->48 8#35->42 9#32->24 10#12->18 11#2->3 
    Step 3: 1#28->36 3#26->25 4#40->32 6#11->12 7#48->47 8#42->35 9#24->23 10#18->22 11#3->10 
    Step 4: 1#36->37 2#4->11 3#25->33 4#32->24 5#8->9 6#12->18 7#47->48 8#35->42 9#23->31 10#22->21 11#10->17 
    Step 5: 1#37->38 2#11->12 4#24->19 5#9->8 6#18->22 7#48->43 8#42->46 9#31->23 10#21->29 11#17->10 
    Step 6: 2#12->18 4#19->14 5#8->16 6#22->30 7#43->48 8#46->42 11#10->9 
    Step 7: 1#38->43 2#18->22 4#14->13 5#16->20 6#30->31 7#48->49 8#42->35 9#23->24 10#29->28 
    Step 8: 1#43->38 2#22->23 3#33->34 4#13->12 5#20->26 6#31->39 7#49->48 8#35->36 9#24->19 10#28->27 11#9->8 
    Step 9: 1#38->30 2#23->31 3#34->41 4#12->11 5#26->25 6#39->44 7#48->49 8#36->28 10#27->35 11#8->7 
    Step 10: 1#30->22 2#31->32 4#11->4 5#25->33 6#44->43 7#49->48 8#28->27 9#19->14 10#35->34 11#7->0 
]
Multirobot solution analysis: (
    total makespan           = 11
    total distance           = 57
    total trajectory         = 101
    average parallelism      = 9.182
    average distance         = 5.182
    average trajectory       = 9.182
    parallelism distribution  = [ 0 0 0 0 0 0 3 0 2 4 2 ]
    distance distribution     = [ 0 1 1 1 1 3 1 1 0 1 ]
    trajectory distribution   = [ 0 0 0 0 0 0 1 4 0 4 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)      = 44.165
            CPU/machine TIME (seconds)     = 44.160
        ]
        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                = 101
                Produced CNF variables         = 123268
                Produced CNF clauses           = 81618
                Search steps                   = 0
                Wall clock TIME (seconds)      = 5.586
                CPU/machine TIME (seconds)     = 5.700
            ]
        }
]
----------------------------------------------------------------