================================================================ 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| = 15, paralellism = 2.500) [ Step 0: 1#4->9 3#25->24 Step 1: 2#0->1 1#9->8 3#24->20 Step 2: 1#8->7 3#20->17 Step 3: 2#1->2 1#7->6 3#17->12 Step 4: 1#6->5 3#12->13 Step 5: 2#2->1 1#5->0 3#13->14 ] Multirobot solution analysis: ( total makespan = 6 total distance = 5 total trajectory = 15 average parallelism = 2.500 average distance = 1.667 average trajectory = 5.000 parallelism distribution = [ 0 3 3 ] distance distribution = [ 1 0 0 1 ] trajectory distribution = [ 0 0 1 0 0 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) = 4.066 CPU/machine TIME (seconds) = 4.070 ] 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 = 30 Produced CNF variables = 7962 Produced CNF clauses = 34259 Search steps = 0 Wall clock TIME (seconds) = 0.228 CPU/machine TIME (seconds) = 0.310 ] } ] ----------------------------------------------------------------