================================================================ 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| = 32, paralellism = 4.571) [ Step 0: 1#6->3 2#13->14 4#4->7 6#8->9 Step 1: 1#3->2 3#12->13 4#7->8 6#9->5 7#0->4 Step 2: 1#2->1 3#13->9 5#10->6 7#4->7 Step 3: 1#1->0 2#14->13 3#9->10 5#6->3 6#5->2 7#7->11 Step 4: 2#13->12 4#8->9 6#2->5 7#11->7 Step 5: 1#0->1 2#12->11 4#9->13 5#3->6 6#5->2 7#7->8 Step 6: 2#11->7 5#6->5 7#8->9 ] Multirobot solution analysis: ( total makespan = 7 total distance = 18 total trajectory = 32 average parallelism = 4.571 average distance = 2.571 average trajectory = 4.571 parallelism distribution = [ 0 0 1 3 1 2 ] distance distribution = [ 0 1 4 1 ] trajectory distribution = [ 0 0 1 2 3 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.257 CPU/machine TIME (seconds) = 0.260 ] 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 = 32 Produced CNF variables = 16436 Produced CNF clauses = 7984 Search steps = 0 Wall clock TIME (seconds) = 0.375 CPU/machine TIME (seconds) = 0.400 ] } ] ----------------------------------------------------------------