================================================================
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| = 129, paralellism = 9.923) [
    Step 0: 2#15->19 5#5->12 6#0->6 7#23->30 8#36->35 10#27->26 11#37->38 12#13->14 13#9->16 
    Step 1: 2#19->23 5#12->11 6#6->7 7#30->29 9#8->15 10#26->25 12#14->13 
    Step 2: 2#23->30 3#1->2 5#11->10 6#7->14 7#29->28 8#35->36 9#15->8 10#25->24 11#38->31 
    Step 3: 1#18->21 2#30->37 3#2->3 5#10->9 6#14->15 7#28->35 8#36->29 9#8->7 10#24->23 12#13->6 
    Step 4: 1#21->18 2#37->36 3#3->4 4#20->25 5#9->8 6#15->19 8#29->28 9#7->14 10#23->22 11#31->38 12#6->0 
    Step 5: 1#18->13 2#36->29 3#4->3 5#8->7 6#19->23 9#14->15 10#22->21 11#38->31 12#0->1 
    Step 6: 1#13->14 2#29->22 3#3->9 4#25->32 5#7->6 6#23->24 7#35->36 9#15->19 10#21->18 11#31->30 12#1->2 
    Step 7: 1#14->7 2#22->21 4#32->39 5#6->0 6#24->31 8#28->35 9#19->23 10#18->13 11#30->29 12#2->3 13#16->15 
    Step 8: 1#7->1 2#21->18 3#9->8 4#39->38 6#31->32 7#36->37 8#35->28 9#23->24 10#13->6 11#29->22 13#15->19 
    Step 9: 1#1->2 2#18->13 3#8->15 4#38->39 6#32->31 8#28->35 9#24->25 10#6->7 11#22->21 12#3->9 13#19->23 
    Step 10: 1#2->3 2#13->14 3#15->19 4#39->40 5#0->6 6#31->30 7#37->38 8#35->28 9#25->32 10#7->1 11#21->18 12#9->8 13#23->24 
    Step 11: 1#3->9 2#14->15 3#19->23 4#40->39 6#30->31 8#28->21 9#32->33 10#1->2 11#18->13 12#8->7 13#24->25 
    Step 12: 3#23->22 5#6->0 7#38->37 10#2->3 11#13->14 13#25->26 
]
Multirobot solution analysis: (
    total makespan           = 13
    total distance           = 58
    total trajectory         = 129
    average parallelism      = 9.923
    average distance         = 4.462
    average trajectory       = 9.923
    parallelism distribution  = [ 0 0 0 0 0 1 1 0 3 1 6 0 1 ]
    distance distribution     = [ 1 0 2 2 0 2 1 1 2 1 ]
    trajectory distribution   = [ 0 0 0 0 0 0 2 1 2 3 2 2 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.521
            CPU/machine TIME (seconds)     = 17.520
        ]
        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                = 129
                Produced CNF variables         = 250190
                Produced CNF clauses           = 221890
                Search steps                   = 0
                Wall clock TIME (seconds)      = 36.309
                CPU/machine TIME (seconds)     = 36.470
            ]
        }
]
----------------------------------------------------------------