================================================================ 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 Computed optimal makespan:6 Makespan optimal solution: Mulirobot solution: (|moves| = 21, paralellism = 3.500) [ Step 0: 2#12->11 4#10->6 5#8->9 6#0->1 Step 1: 1#13->14 2#11->7 3#4->0 4#6->3 6#1->2 Step 2: 2#7->4 4#3->6 5#9->13 6#2->5 Step 3: 3#0->1 4#6->3 6#5->9 Step 4: 2#4->0 6#9->8 Step 5: 3#1->2 5#13->9 6#8->12 ] Multirobot solution analysis: ( total makespan = 6 total distance = 11 total trajectory = 21 average parallelism = 3.500 average distance = 1.833 average trajectory = 3.500 parallelism distribution = [ 0 1 2 2 1 ] distance distribution = [ 2 1 1 1 ] trajectory distribution = [ 1 0 2 2 0 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) = 0.256 CPU/machine TIME (seconds) = 0.250 ] Sub-phases { Phase (name = 'SAT') [ Total SAT solver calls = 6 Satisfiable SAT solver calls = 1 Unsatisfiable SAT solver calls = 5 Indeterminate SAT solver calls = 0 Move executions = 21 Produced CNF variables = 8891 Produced CNF clauses = 3629 Search steps = 0 Wall clock TIME (seconds) = 0.132 CPU/machine TIME (seconds) = 0.180 ] } ] ----------------------------------------------------------------