================================================================
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
Computed optimal makespan:13
Makespan optimal solution:
Mulirobot solution: (|moves| = 102, paralellism = 7.846) [
    Step 0: 1#20->25 2#5->12 3#0->6 5#36->29 7#27->26 9#13->14 10#9->3 
    Step 1: 1#25->24 2#12->11 3#6->7 4#23->19 6#8->9 7#26->33 9#14->13 10#3->2 
    Step 2: 1#24->23 2#11->10 3#7->8 4#19->15 5#29->28 6#9->3 7#33->32 8#37->30 10#2->1 
    Step 3: 2#10->9 3#8->7 5#28->21 6#3->2 7#32->25 8#30->31 9#13->18 10#1->0 
    Step 4: 1#23->19 2#9->8 3#7->14 5#21->28 6#2->1 7#25->32 8#31->24 10#0->6 
    Step 5: 2#8->7 4#15->16 5#28->29 9#18->21 10#6->13 
    Step 6: 1#19->15 2#7->6 4#16->9 5#29->30 6#1->2 7#32->25 8#24->23 9#21->22 10#13->18 
    Step 7: 1#15->16 2#6->13 3#14->7 4#9->10 5#30->31 6#2->3 7#25->24 8#23->19 9#22->29 10#18->21 
    Step 8: 1#16->9 2#13->18 3#7->8 4#10->11 5#31->32 6#3->4 7#24->23 8#19->15 10#21->28 
    Step 9: 1#9->3 2#18->21 4#11->12 5#32->25 6#4->10 7#23->19 8#15->16 9#29->30 
    Step 10: 1#3->2 2#21->22 3#8->9 4#12->5 5#25->20 6#10->11 7#19->15 9#30->31 
    Step 11: 1#2->1 2#22->23 6#11->12 7#15->8 9#31->32 10#28->29 
    Step 12: 2#23->24 3#9->10 6#12->11 7#8->2 8#16->15 9#32->25 10#29->30 
]
Multirobot solution analysis: (
    total makespan           = 13
    total distance           = 57
    total trajectory         = 102
    average parallelism      = 7.846
    average distance         = 5.700
    average trajectory       = 10.200
    parallelism distribution  = [ 0 0 0 0 1 1 2 5 3 1 ]
    distance distribution     = [ 0 0 1 1 1 2 0 3 1 ]
    trajectory distribution   = [ 0 0 0 0 0 0 0 2 1 3 2 1 1 ]
)
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.706
            CPU/machine TIME (seconds)     = 17.700
        ]
        Sub-phases {
            Phase (name = 'SAT') [
                Total SAT solver calls         = 13
                Satisfiable SAT solver calls   = 1
                Unsatisfiable SAT solver calls = 12
                Indeterminate SAT solver calls = 0
                Move executions                = 102
                Produced CNF variables         = 149823
                Produced CNF clauses           = 135852
                Search steps                   = 0
                Wall clock TIME (seconds)      = 12.040
                CPU/machine TIME (seconds)     = 12.210
            ]
        }
]
----------------------------------------------------------------