================================================================
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| = 110, paralellism = 8.462) [
    Step 0: 1#9->10 2#17->12 3#22->19 4#1->2 7#26->27 8#24->23 9#4->3 10#0->5 
    Step 1: 1#10->9 2#12->13 3#19->22 5#20->17 7#27->26 9#3->8 11#25->24 
    Step 2: 1#9->4 2#13->7 3#22->19 4#2->3 5#17->12 6#21->27 7#26->25 9#8->14 10#5->0 11#24->20 
    Step 3: 2#7->2 3#19->22 4#3->8 5#12->11 6#27->26 8#23->24 9#14->15 10#0->5 11#20->17 
    Step 4: 1#4->3 2#2->1 3#22->21 4#8->9 8#24->20 9#15->16 10#5->6 11#17->12 
    Step 5: 1#3->4 2#1->2 3#21->27 5#11->5 7#25->24 8#20->17 9#16->19 11#12->13 
    Step 6: 2#2->3 3#27->21 4#9->15 5#5->0 7#24->20 8#17->12 9#19->22 10#6->7 11#13->14 
    Step 7: 5#0->1 6#26->27 7#20->17 8#12->11 9#22->28 10#7->13 11#14->8 
    Step 8: 1#4->9 3#21->22 4#15->16 5#1->2 6#27->26 7#17->20 8#11->5 10#13->12 11#8->7 
    Step 9: 2#3->8 3#22->19 4#16->15 5#2->1 6#26->27 7#20->24 8#5->6 10#12->17 11#7->13 
    Step 10: 1#9->4 2#8->7 3#19->16 5#1->0 6#27->21 7#24->25 10#17->20 11#13->12 
    Step 11: 3#16->10 4#15->14 5#0->5 6#21->22 7#25->26 8#6->1 9#28->27 10#20->24 11#12->17 
    Step 12: 2#7->2 3#10->9 4#14->18 5#5->6 6#22->19 7#26->25 9#27->21 10#24->23 11#17->20 
]
Multirobot solution analysis: (
    total makespan           = 13
    total distance           = 38
    total trajectory         = 110
    average parallelism      = 8.462
    average distance         = 3.455
    average trajectory       = 10.000
    parallelism distribution  = [ 0 0 0 0 0 0 2 4 6 1 ]
    distance distribution     = [ 2 1 1 2 2 1 1 ]
    trajectory distribution   = [ 0 0 0 0 0 0 1 1 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)      = 4.046
            CPU/machine TIME (seconds)     = 4.050
        ]
        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                = 110
                Produced CNF variables         = 153889
                Produced CNF clauses           = 112970
                Search steps                   = 0
                Wall clock TIME (seconds)      = 13.633
                CPU/machine TIME (seconds)     = 13.800
            ]
        }
]
----------------------------------------------------------------