================================================================
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| = 119, paralellism = 10.818) [
    Step 0: 5#1->2 2#4->3 1#6->7 15#9->10 3#18->21 9#23->24 12#27->26 10#36->29 13#37->30 
    Step 1: 2#3->4 7#5->12 1#7->6 11#8->9 15#10->11 14#13->18 4#15->14 6#20->25 3#21->22 9#24->31 12#26->33 13#30->23 
    Step 2: 5#2->8 2#4->3 1#6->7 11#9->10 15#11->17 4#14->13 14#18->21 13#23->19 6#25->24 9#31->32 12#33->40 
    Step 3: 8#0->6 2#3->2 1#7->1 11#10->4 7#12->11 4#13->18 13#19->15 14#21->28 3#22->23 6#24->25 10#29->36 12#40->39 
    Step 4: 1#1->0 11#4->3 8#6->13 7#11->10 13#15->16 4#18->21 3#23->19 6#25->24 14#28->29 9#32->31 10#36->35 12#39->38 
    Step 5: 1#0->6 2#2->1 5#8->7 7#10->4 8#13->18 13#16->9 3#19->15 4#21->22 6#24->23 14#29->30 10#35->36 12#38->39 
    Step 6: 11#3->2 5#7->14 13#9->10 3#15->16 8#18->21 4#22->29 6#23->19 10#36->35 
    Step 7: 2#1->7 7#4->3 1#6->0 5#14->13 15#17->11 6#19->15 8#21->28 4#29->36 9#31->24 12#39->40 
    Step 8: 1#0->6 2#7->1 13#10->4 15#11->17 5#13->18 6#15->14 3#16->9 8#28->29 14#30->31 4#36->37 12#40->33 
    Step 9: 2#1->0 11#2->8 3#9->10 6#14->7 15#17->11 5#18->21 9#24->23 8#29->30 14#31->32 12#33->34 10#35->36 4#37->38 
    Step 10: 7#3->9 6#7->1 11#8->2 5#21->28 9#23->19 8#30->31 14#32->25 12#34->27 10#36->29 4#38->37 
]
Multirobot solution analysis: (
    total makespan           = 11
    total distance           = 57
    total trajectory         = 119
    average parallelism      = 10.818
    average distance         = 3.800
    average trajectory       = 7.933
    parallelism distribution  = [ 0 0 0 0 0 0 0 1 1 2 2 5 ]
    distance distribution     = [ 2 3 0 0 3 0 3 0 3 ]
    trajectory distribution   = [ 0 0 0 0 0 2 3 7 0 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.261
            CPU/machine TIME (seconds)     = 17.260
        ]
        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                = 238
                Produced CNF variables         = 41305
                Produced CNF clauses           = 338691
                Search steps                   = 0
                Wall clock TIME (seconds)      = 20.070
                CPU/machine TIME (seconds)     = 20.200
            ]
        }
]
----------------------------------------------------------------