================================================================
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
Computed optimal makespan:12
Makespan optimal solution:
Mulirobot solution: (|moves| = 123, paralellism = 10.250) [
    Step 0: 1#35->34 2#7->8 3#25->26 4#3->4 5#15->16 6#43->44 7#9->10 8#11->12 9#38->30 11#40->39 12#5->13 
    Step 1: 2#8->9 3#26->27 4#4->11 7#10->17 8#12->18 9#30->31 11#39->38 12#13->14 13#2->3 
    Step 2: 1#34->26 2#9->10 3#27->28 4#11->12 6#44->43 8#18->22 9#31->32 11#38->37 12#14->19 
    Step 3: 1#26->20 2#10->11 3#28->29 4#12->18 5#16->8 6#43->44 8#22->21 10#33->34 11#37->36 12#19->24 
    Step 4: 1#20->16 2#11->12 3#29->37 4#18->22 5#8->1 6#44->49 9#32->40 10#34->26 11#36->35 12#24->23 13#3->10 
    Step 5: 1#16->8 2#12->18 3#37->38 4#22->30 6#49->44 8#21->29 9#40->32 10#26->27 11#35->34 13#10->11 
    Step 6: 2#18->22 3#38->39 6#44->43 7#17->10 8#29->28 9#32->24 10#27->35 11#34->26 12#23->31 13#11->12 
    Step 7: 1#8->9 2#22->23 3#39->38 4#30->29 6#43->48 7#10->3 8#28->27 9#24->19 10#35->36 11#26->20 12#31->32 13#12->18 
    Step 8: 1#9->10 2#23->24 3#38->30 4#29->21 6#48->43 9#19->14 10#36->37 11#20->16 12#32->31 13#18->12 
    Step 9: 1#10->11 2#24->32 3#30->22 5#1->8 6#43->38 7#3->2 8#27->26 9#14->6 10#37->29 12#31->39 13#12->13 
    Step 10: 1#11->12 2#32->40 3#22->23 5#8->9 6#38->37 7#2->1 8#26->34 10#29->30 11#16->15 12#39->44 13#13->14 
    Step 11: 1#12->13 2#40->45 3#23->24 6#37->36 7#1->8 9#6->5 10#30->31 11#15->7 12#44->43 
]
Multirobot solution analysis: (
    total makespan           = 12
    total distance           = 79
    total trajectory         = 123
    average parallelism      = 10.250
    average distance         = 6.077
    average trajectory       = 9.462
    parallelism distribution  = [ 0 0 0 0 0 0 0 0 3 4 4 1 ]
    distance distribution     = [ 1 0 2 0 0 2 3 2 0 0 1 1 ]
    trajectory distribution   = [ 0 0 0 0 1 0 1 2 2 2 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)      = 41.968
            CPU/machine TIME (seconds)     = 41.950
        ]
        Sub-phases {
            Phase (name = 'SAT') [
                Total SAT solver calls         = 12
                Satisfiable SAT solver calls   = 1
                Unsatisfiable SAT solver calls = 11
                Indeterminate SAT solver calls = 0
                Move executions                = 123
                Produced CNF variables         = 199772
                Produced CNF clauses           = 136745
                Search steps                   = 0
                Wall clock TIME (seconds)      = 20.155
                CPU/machine TIME (seconds)     = 20.300
            ]
        }
]
----------------------------------------------------------------