================================================================
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
Computed optimal makespan:10
Makespan optimal solution:
Mulirobot solution: (|moves| = 30, paralellism = 3.000) [
    Step 0: 3#0->5 1#24->20 4#25->26 
    Step 1: 2#4->9 3#5->6 1#20->17 4#26->25 
    Step 2: 3#6->7 1#17->12 4#25->24 
    Step 3: 3#7->8 2#9->4 1#12->11 4#24->23 
    Step 4: 3#8->14 1#11->12 
    Step 5: 2#4->9 1#12->17 3#14->15 
    Step 6: 3#15->16 1#17->12 
    Step 7: 2#9->4 3#16->19 4#23->24 
    Step 8: 1#12->6 3#19->22 4#24->25 
    Step 9: 2#4->9 1#6->1 3#22->28 
]
Multirobot solution analysis: (
    total makespan           = 10
    total distance           = 16
    total trajectory         = 30
    average parallelism      = 3.000
    average distance         = 4.000
    average trajectory       = 7.500
    parallelism distribution  = [ 0 2 6 2 ]
    distance distribution     = [ 1 0 0 0 1 0 0 0 0 1 ]
    trajectory distribution   = [ 0 0 0 0 1 1 0 0 1 1 ]
)
Phase statistics (current phase = 'root_phase') [
        Phase (name = 'root_phase') [
            Total SAT solver calls         = 10
            Satisfiable SAT solver calls   = 1
            Unsatisfiable SAT solver calls = 9
            Indeterminate SAT solver calls = 0
            Move executions                = 60
            Produced CNF variables         = 21940
            Produced CNF clauses           = 111565
            Search steps                   = 0
            Wall clock TIME (seconds)      = 1.113
            CPU/machine TIME (seconds)     = 1.160
        ]
]
----------------------------------------------------------------