================================================================
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
Solving layer: 15
Computed optimal makespan:14
Makespan optimal solution:
Mulirobot solution: (|moves| = 125, paralellism = 8.929) [
    Step 0: 8#1->6 4#2->7 1#8->3 5#9->15 6#17->12 2#19->16 12#24->23 11#26->27 
    Step 1: 1#3->2 8#6->1 4#7->13 3#10->9 6#12->11 5#15->14 9#20->17 12#23->24 15#25->26 11#27->28 
    Step 2: 14#0->5 1#2->7 3#9->8 5#14->18 2#16->15 9#17->12 10#21->27 7#22->19 12#24->20 15#26->25 
    Step 3: 14#5->0 1#7->2 3#8->3 4#13->14 2#15->9 7#19->16 15#25->24 10#27->26 
    Step 4: 14#0->5 8#1->6 2#9->8 9#12->13 4#14->15 7#16->10 15#24->23 11#28->27 
    Step 5: 13#4->9 8#6->1 2#8->7 9#13->12 4#15->16 10#26->25 
    Step 6: 3#3->4 14#5->0 2#7->6 13#9->15 9#12->13 4#16->19 12#20->17 11#27->21 
    Step 7: 1#2->7 3#4->9 2#6->5 9#13->14 13#15->16 12#17->12 4#19->22 10#25->24 
    Step 8: 8#1->2 1#7->13 3#9->15 12#12->6 9#14->8 13#16->19 11#21->27 4#22->28 10#24->20 
    Step 9: 14#0->1 8#2->3 9#8->7 1#13->14 3#15->16 13#19->22 10#20->17 15#23->24 11#27->26 
    Step 10: 8#3->4 9#7->8 1#14->15 3#16->19 10#17->12 13#22->21 15#24->20 11#26->25 4#28->27 
    Step 11: 14#1->2 8#4->9 2#5->0 9#8->3 10#12->13 1#15->16 5#18->14 3#19->22 15#20->17 11#25->24 4#27->26 
    Step 12: 14#2->7 9#3->4 12#6->1 8#9->15 6#11->5 5#14->8 1#16->19 15#17->12 13#21->27 3#22->28 11#24->23 4#26->25 
    Step 13: 12#1->2 9#4->3 5#8->9 15#12->11 10#13->14 8#15->16 4#25->24 13#27->26 3#28->22 
]
Multirobot solution analysis: (
    total makespan           = 14
    total distance           = 64
    total trajectory         = 125
    average parallelism      = 8.929
    average distance         = 4.267
    average trajectory       = 8.333
    parallelism distribution  = [ 0 0 0 0 0 1 0 5 4 2 1 1 ]
    distance distribution     = [ 1 0 0 5 1 1 4 0 2 ]
    trajectory distribution   = [ 0 0 2 0 0 1 1 3 3 2 1 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)      = 3.837
            CPU/machine TIME (seconds)     = 3.840
        ]
        Sub-phases {
            Phase (name = 'SAT') [
                Total SAT solver calls         = 14
                Satisfiable SAT solver calls   = 1
                Unsatisfiable SAT solver calls = 13
                Indeterminate SAT solver calls = 0
                Move executions                = 250
                Produced CNF variables         = 44534
                Produced CNF clauses           = 448556
                Search steps                   = 0
                Wall clock TIME (seconds)      = 72.198
                CPU/machine TIME (seconds)     = 72.300
            ]
        }
]
----------------------------------------------------------------