================================================================
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| = 83, paralellism = 6.385) [
    Step 0: 1#0->1 2#23->19 3#36->35 4#8->7 5#27->26 6#37->30 7#13->18 8#9->3 
    Step 1: 1#1->2 2#19->15 3#35->36 5#26->25 6#30->29 7#18->21 8#3->4 
    Step 2: 1#2->1 2#15->16 3#36->37 4#7->14 5#25->24 7#21->28 8#4->3 
    Step 3: 1#1->0 2#16->15 3#37->30 5#24->23 6#29->36 8#3->9 
    Step 4: 2#15->8 3#30->29 5#23->19 7#28->35 8#9->10 
    Step 5: 1#0->1 2#8->9 3#29->28 4#14->7 5#19->15 6#36->37 8#10->4 
    Step 6: 1#1->0 2#9->16 3#28->21 4#7->14 5#15->8 8#4->3 
    Step 7: 1#0->1 4#14->15 5#8->9 6#37->30 7#35->28 
    Step 8: 1#1->0 3#21->22 5#9->10 7#28->35 8#3->2 
    Step 9: 2#16->9 3#22->29 4#15->19 5#10->11 6#30->37 7#35->28 
    Step 10: 2#9->10 3#29->30 4#19->23 5#11->12 6#37->38 7#28->35 8#2->8 
    Step 11: 1#0->1 2#10->11 3#30->31 4#23->24 5#12->5 6#38->39 7#35->36 8#8->9 
    Step 12: 1#1->2 2#11->12 3#31->32 4#24->25 6#39->40 8#9->10 
]
Multirobot solution analysis: (
    total makespan           = 13
    total distance           = 38
    total trajectory         = 83
    average parallelism      = 6.385
    average distance         = 4.750
    average trajectory       = 10.375
    parallelism distribution  = [ 0 0 0 0 3 4 4 2 ]
    distance distribution     = [ 0 1 1 1 2 0 1 0 0 0 0 1 ]
    trajectory distribution   = [ 0 0 0 0 0 0 0 0 3 1 2 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)      = 17.692
            CPU/machine TIME (seconds)     = 17.690
        ]
        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                = 83
                Produced CNF variables         = 103861
                Produced CNF clauses           = 94758
                Search steps                   = 0
                Wall clock TIME (seconds)      = 3.053
                CPU/machine TIME (seconds)     = 3.210
            ]
        }
]
----------------------------------------------------------------