================================================================
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| = 122, paralellism = 8.714) [
    Step 0: 15#0->5 5#2->3 2#8->7 6#9->15 1#12->13 13#24->23 12#26->27 
    Step 1: 9#1->2 14#4->9 15#5->0 2#7->6 6#15->16 7#17->12 12#27->28 
    Step 2: 15#0->1 5#3->4 2#6->5 14#9->15 7#12->11 1#13->7 10#20->17 11#21->27 16#25->24 
    Step 3: 9#2->3 2#5->0 1#7->6 10#17->12 8#22->21 16#24->20 11#27->26 
    Step 4: 15#1->2 9#3->8 1#6->5 10#12->13 14#15->9 3#19->22 16#20->17 13#23->24 11#26->25 12#28->27 
    Step 5: 15#2->1 5#4->3 9#8->7 14#9->15 10#13->14 6#16->19 16#17->12 3#22->28 13#24->20 12#27->26 
    Step 6: 15#1->2 5#3->8 9#7->13 16#12->6 10#14->18 6#19->22 13#20->17 11#25->24 3#28->27 
    Step 7: 2#0->1 15#2->3 16#6->7 5#8->9 14#15->16 13#17->12 11#24->20 12#26->25 
    Step 8: 15#3->8 1#5->0 16#7->2 5#9->15 13#12->6 9#13->14 14#16->19 11#20->17 6#22->28 12#25->24 3#27->26 
    Step 9: 16#2->3 13#6->7 7#11->5 11#17->12 14#19->16 12#24->20 3#26->25 6#28->27 
    Step 10: 16#3->4 7#5->6 13#7->2 15#8->9 11#12->13 14#16->19 12#20->17 3#25->24 6#27->26 
    Step 11: 1#0->5 13#2->3 7#6->12 4#10->16 11#13->7 14#19->22 8#21->27 3#24->20 6#26->25 
    Step 12: 2#1->0 1#5->11 11#7->2 15#9->8 7#12->6 9#14->13 4#16->19 14#22->21 6#25->24 8#27->28 
    Step 13: 2#0->1 16#4->9 7#6->5 9#13->7 12#17->12 4#19->22 14#21->27 6#24->23 
]
Multirobot solution analysis: (
    total makespan           = 14
    total distance           = 68
    total trajectory         = 122
    average parallelism      = 8.714
    average distance         = 4.250
    average trajectory       = 7.625
    parallelism distribution  = [ 0 0 0 0 0 0 3 3 4 3 1 ]
    distance distribution     = [ 2 1 3 2 2 0 3 2 ]
    trajectory distribution   = [ 0 0 2 0 1 1 4 1 2 4 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.987
            CPU/machine TIME (seconds)     = 3.980
        ]
        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                = 244
                Produced CNF variables         = 48104
                Produced CNF clauses           = 571971
                Search steps                   = 0
                Wall clock TIME (seconds)      = 30.004
                CPU/machine TIME (seconds)     = 30.160
            ]
        }
]
----------------------------------------------------------------