================================================================ 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 Computed optimal makespan:4 Makespan optimal solution: Mulirobot solution: (|moves| = 11, paralellism = 2.750) [ Step 0: 1#13->12 2#6->2 3#10->5 Step 1: 1#12->11 2#2->1 Step 2: 1#11->10 2#1->0 3#5->6 Step 3: 1#10->5 2#0->1 3#6->7 ] Multirobot solution analysis: ( total makespan = 4 total distance = 6 total trajectory = 11 average parallelism = 2.750 average distance = 2.000 average trajectory = 3.667 parallelism distribution = [ 0 1 3 ] distance distribution = [ 0 1 0 1 ] trajectory distribution = [ 0 0 1 2 ] ) 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.723 CPU/machine TIME (seconds) = 0.730 ] Sub-phases { Phase (name = 'SAT') [ Total SAT solver calls = 4 Satisfiable SAT solver calls = 1 Unsatisfiable SAT solver calls = 3 Indeterminate SAT solver calls = 0 Move executions = 11 Produced CNF variables = 1400 Produced CNF clauses = 1273 Search steps = 0 Wall clock TIME (seconds) = 0.032 CPU/machine TIME (seconds) = 0.050 ] } ] ----------------------------------------------------------------