================================================================
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| = 119, paralellism = 9.154) [
    Step 0: 3#1->2 5#5->12 9#8->7 13#9->16 1#18->21 7#23->24 10#27->34 11#37->38 
    Step 1: 6#0->1 9#7->14 5#12->11 12#13->6 2#15->8 1#21->22 7#24->25 10#34->33 8#36->37 11#38->31 
    Step 2: 3#2->3 5#11->10 9#14->13 13#16->15 1#22->23 7#25->26 11#31->24 10#33->32 8#37->38 
    Step 3: 6#1->7 3#3->2 2#8->9 5#10->4 9#13->18 13#15->14 1#23->19 7#26->33 10#32->25 8#38->31 
    Step 4: 3#2->1 5#4->3 2#9->10 13#14->13 9#18->21 1#19->15 11#24->23 8#31->30 7#33->32 
    Step 5: 12#6->0 6#7->14 2#10->4 13#13->18 1#15->8 9#21->28 11#23->19 10#25->24 8#30->29 7#32->31 
    Step 6: 3#1->7 5#3->2 2#4->10 6#14->13 13#18->21 11#19->15 4#20->25 10#24->23 8#29->30 7#31->38 
    Step 7: 5#2->1 3#7->6 2#10->9 6#13->18 11#15->14 13#21->22 10#23->19 4#25->32 9#28->29 7#38->39 
    Step 8: 3#6->13 1#8->7 2#9->16 6#18->21 10#19->15 13#22->23 8#30->37 
    Step 9: 5#1->2 3#13->18 10#15->8 6#21->22 9#29->30 4#32->33 8#37->36 
    Step 10: 12#0->6 10#8->9 11#14->13 3#18->21 6#22->29 13#23->24 9#30->31 8#36->35 
    Step 11: 5#2->1 1#7->8 10#9->3 11#13->14 3#21->22 13#24->25 6#29->30 9#31->32 4#33->40 8#35->28 7#39->38 
    Step 12: 5#1->0 12#6->7 1#8->9 2#16->15 13#25->26 8#28->21 6#30->31 9#32->33 7#38->37 4#40->39 
]
Multirobot solution analysis: (
    total makespan           = 13
    total distance           = 58
    total trajectory         = 119
    average parallelism      = 9.154
    average distance         = 4.462
    average trajectory       = 9.154
    parallelism distribution  = [ 0 0 0 0 0 0 2 2 2 6 1 ]
    distance distribution     = [ 1 0 2 2 0 2 1 1 2 1 ]
    trajectory distribution   = [ 0 0 0 1 1 0 0 1 2 4 4 ]
)
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)      = 17.177
            CPU/machine TIME (seconds)     = 17.180
        ]
        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                = 238
                Produced CNF variables         = 56303
                Produced CNF clauses           = 502446
                Search steps                   = 0
                Wall clock TIME (seconds)      = 54.247
                CPU/machine TIME (seconds)     = 54.420
            ]
        }
]
----------------------------------------------------------------