================================================================
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: 1#7->8 2#25->26 3#3->4 4#15->16 6#9->10 7#11->12 8#38->37 9#33->34 10#40->39 
    Step 1: 1#8->9 2#26->25 3#4->11 4#16->20 5#43->38 7#12->13 8#37->36 9#34->35 10#39->40 12#2->3 
    Step 2: 1#9->2 2#25->33 3#11->12 4#20->26 5#38->30 7#13->14 8#36->28 12#3->4 
    Step 3: 3#12->18 4#26->34 6#10->3 7#14->19 8#28->27 10#40->45 11#5->6 12#4->11 
    Step 4: 1#2->9 2#33->25 3#18->22 5#30->29 6#3->4 7#19->24 8#27->26 9#35->36 10#45->44 12#11->12 
    Step 5: 1#9->10 3#22->21 4#34->33 5#29->37 7#24->23 8#26->20 9#36->35 10#44->39 11#6->5 12#12->18 
    Step 6: 1#10->17 3#21->29 4#33->34 5#37->36 6#4->11 7#23->24 8#20->16 9#35->27 10#39->38 11#5->6 12#18->22 
    Step 7: 1#17->10 2#25->26 3#29->21 4#34->33 5#36->35 6#11->12 7#24->23 8#16->8 9#27->28 10#38->37 11#6->14 12#22->30 
    Step 8: 1#10->3 2#26->27 4#33->34 6#12->13 7#23->31 8#8->9 9#28->36 10#37->29 11#14->19 12#30->38 
    Step 9: 1#3->10 2#27->28 3#21->22 6#13->5 7#31->32 8#9->2 9#36->37 10#29->30 12#38->43 
    Step 10: 1#10->11 2#28->29 3#22->18 4#34->41 5#35->42 6#5->6 7#32->40 8#2->3 9#37->38 11#19->14 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 0 0 2 2 4 2 1 ]
    distance distribution     = [ 0 1 1 3 3 1 2 ]
    trajectory distribution   = [ 0 0 0 0 0 1 1 2 3 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)      = 42.547
            CPU/machine TIME (seconds)     = 42.540
        ]
        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                = 108
                Produced CNF variables         = 146421
                Produced CNF clauses           = 97226
                Search steps                   = 0
                Wall clock TIME (seconds)      = 6.136
                CPU/machine TIME (seconds)     = 6.250
            ]
        }
]
----------------------------------------------------------------