================================================================ 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 Computed optimal makespan:7 Makespan optimal solution: Mulirobot solution: (|moves| = 28, paralellism = 4.000) [ Step 0: 1#15->16 2#14->9 3#13->12 4#6->7 5#10->5 Step 1: 1#16->15 2#9->10 4#7->8 Step 2: 2#10->11 3#12->7 5#5->1 Step 3: 1#15->10 2#11->12 3#7->3 4#8->4 Step 4: 1#10->11 2#12->13 3#3->2 5#1->5 Step 5: 1#11->12 2#13->17 3#2->1 4#4->3 5#5->10 Step 6: 1#12->13 3#1->0 4#3->4 5#10->9 ] Multirobot solution analysis: ( total makespan = 7 total distance = 19 total trajectory = 28 average parallelism = 4.000 average distance = 3.800 average trajectory = 5.600 parallelism distribution = [ 0 0 2 3 2 ] distance distribution = [ 0 0 1 1 0 2 ] trajectory distribution = [ 0 0 0 0 2 3 ] ) 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.695 CPU/machine TIME (seconds) = 0.690 ] Sub-phases { Phase (name = 'SAT') [ Total SAT solver calls = 7 Satisfiable SAT solver calls = 1 Unsatisfiable SAT solver calls = 6 Indeterminate SAT solver calls = 0 Move executions = 28 Produced CNF variables = 10243 Produced CNF clauses = 6388 Search steps = 0 Wall clock TIME (seconds) = 0.176 CPU/machine TIME (seconds) = 0.220 ] } ] ----------------------------------------------------------------