================================================================
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| = 128, paralellism = 9.846) [
    Step 0: 7#1->6 12#4->3 5#17->12 1#19->16 11#24->23 10#26->27 
    Step 1: 13#0->1 3#2->7 12#3->8 4#9->4 5#12->11 1#16->15 6#22->19 11#23->24 14#25->26 10#27->28 
    Step 2: 4#4->3 7#6->12 2#10->9 5#11->5 1#15->14 6#19->16 11#24->25 14#26->27 10#28->22 
    Step 3: 13#1->0 4#3->2 5#5->11 3#7->6 2#9->4 7#12->17 1#14->13 6#16->10 8#20->24 10#22->19 11#25->26 14#27->28 
    Step 4: 13#0->5 4#2->1 2#4->3 3#6->12 12#8->9 1#13->7 7#17->20 10#19->16 9#21->22 8#24->25 11#26->27 
    Step 5: 4#1->0 2#3->2 13#5->6 1#7->13 12#9->4 3#12->17 10#16->15 7#20->24 9#22->19 8#25->26 11#27->21 
    Step 6: 4#0->5 2#2->1 12#4->3 13#6->12 6#10->9 1#13->7 10#15->14 3#17->20 9#19->16 11#21->22 7#24->25 8#26->27 
    Step 7: 2#1->6 12#3->4 1#7->2 6#9->8 13#12->17 10#14->13 9#16->15 3#20->24 11#22->19 8#27->21 
    Step 8: 1#2->7 12#4->9 2#6->12 6#8->3 9#15->14 13#17->20 11#19->16 8#21->22 3#24->23 7#25->26 
    Step 9: 6#3->2 4#5->0 1#7->8 12#9->10 2#12->17 9#14->18 11#16->15 13#20->24 8#22->19 7#26->27 
    Step 10: 1#8->3 12#10->16 5#11->12 10#13->7 11#15->9 2#17->20 9#18->14 8#19->22 13#24->25 
    Step 11: 6#2->1 1#3->8 10#7->6 11#9->4 5#12->17 9#14->15 12#16->10 2#20->24 8#22->19 13#25->26 7#27->21 
    Step 12: 4#0->5 1#8->7 9#15->9 5#17->20 8#19->16 7#21->22 2#24->25 
]
Multirobot solution analysis: (
    total makespan           = 13
    total distance           = 75
    total trajectory         = 128
    average parallelism      = 9.846
    average distance         = 5.357
    average trajectory       = 9.143
    parallelism distribution  = [ 0 0 0 0 0 1 1 0 2 4 3 2 ]
    distance distribution     = [ 1 1 0 1 2 2 2 4 ]
    trajectory distribution   = [ 0 0 1 0 0 0 2 2 1 5 1 1 1 ]
)
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)      = 3.851
            CPU/machine TIME (seconds)     = 3.850
        ]
        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                = 256
                Produced CNF variables         = 38779
                Produced CNF clauses           = 365819
                Search steps                   = 0
                Wall clock TIME (seconds)      = 8.633
                CPU/machine TIME (seconds)     = 8.730
            ]
        }
]
----------------------------------------------------------------