================================================================
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| = 108, paralellism = 9.818) [
    Step 0: 3#3->4 11#5->6 1#7->0 7#11->12 4#15->16 2#25->26 9#33->34 8#38->37 10#40->39 5#43->44 
    Step 1: 1#0->1 12#2->3 3#4->11 11#6->14 6#9->10 7#12->18 4#16->20 2#26->27 9#34->41 8#37->36 10#39->38 5#44->45 
    Step 2: 1#1->2 12#3->4 3#11->12 11#14->19 7#18->22 4#20->26 2#27->28 8#36->35 10#38->37 9#41->42 5#45->40 
    Step 3: 1#2->3 12#4->11 6#10->9 3#12->18 11#19->24 7#22->30 4#26->25 2#28->29 8#35->27 10#37->36 5#40->32 
    Step 4: 6#9->10 12#11->12 3#18->22 4#25->33 8#27->26 7#30->38 5#32->31 10#36->37 9#42->35 
    Step 5: 1#3->2 6#10->11 12#12->18 3#22->23 11#24->32 8#26->20 2#29->21 5#31->30 4#33->34 9#35->36 7#38->43 
    Step 6: 6#11->12 12#18->22 8#20->16 3#23->24 5#30->29 7#43->44 
    Step 7: 1#2->9 6#12->13 8#16->8 12#22->30 3#24->23 5#29->28 4#34->26 9#36->35 7#44->39 
    Step 8: 8#8->1 6#13->14 4#26->34 5#28->27 12#30->38 11#32->24 9#35->36 10#37->29 7#39->31 
    Step 9: 8#1->2 1#9->10 6#14->6 3#23->22 11#24->19 5#27->35 10#29->30 7#31->32 4#34->41 9#36->37 12#38->43 
    Step 10: 8#2->3 1#10->11 11#19->14 2#21->29 3#22->18 7#32->40 5#35->42 9#37->38 12#43->44 
]
Multirobot solution analysis: (
    total makespan           = 11
    total distance           = 52
    total trajectory         = 108
    average parallelism      = 9.818
    average distance         = 4.333
    average trajectory       = 9.000
    parallelism distribution  = [ 0 0 0 0 0 1 0 0 4 1 4 1 ]
    distance distribution     = [ 0 1 1 3 3 1 2 ]
    trajectory distribution   = [ 0 0 0 0 0 1 1 3 2 2 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)      = 43.809
            CPU/machine TIME (seconds)     = 43.760
        ]
        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                = 216
                Produced CNF variables         = 51128
                Produced CNF clauses           = 373194
                Search steps                   = 0
                Wall clock TIME (seconds)      = 14.055
                CPU/machine TIME (seconds)     = 14.150
            ]
        }
]
----------------------------------------------------------------