143 lines
		
	
	
		
			6.3 KiB
		
	
	
	
		
			Plaintext
		
	
	
	
	
	
			
		
		
	
	
			143 lines
		
	
	
		
			6.3 KiB
		
	
	
	
		
			Plaintext
		
	
	
	
	
	
INFO     Running translator.
 | 
						|
INFO     translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/gripper-round-1-strips/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/gripper-round-1-strips/instances/instance-3.pddl']
 | 
						|
INFO     translator arguments: []
 | 
						|
INFO     translator time limit: None
 | 
						|
INFO     translator memory limit: None
 | 
						|
INFO     callstring: /home/pluehne/.usr/bin/python /home/wv/bin/linux/64/fast-downward-10997/builds/release64/bin/translate/translate.py /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/gripper-round-1-strips/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/gripper-round-1-strips/instances/instance-3.pddl
 | 
						|
Parsing...
 | 
						|
Parsing: [0.010s CPU, 0.012s wall-clock]
 | 
						|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
 | 
						|
Instantiating...
 | 
						|
Generating Datalog program... [0.000s CPU, 0.002s wall-clock]
 | 
						|
Normalizing Datalog program...
 | 
						|
Normalizing Datalog program: [0.020s CPU, 0.012s wall-clock]
 | 
						|
Preparing model... [0.000s CPU, 0.006s wall-clock]
 | 
						|
Generated 24 rules.
 | 
						|
Computing model... [0.020s CPU, 0.020s wall-clock]
 | 
						|
141 relevant atoms
 | 
						|
100 auxiliary atoms
 | 
						|
241 final queue length
 | 
						|
316 total queue pushes
 | 
						|
Completing instantiation... [0.020s CPU, 0.022s wall-clock]
 | 
						|
Instantiating: [0.060s CPU, 0.062s wall-clock]
 | 
						|
Computing fact groups...
 | 
						|
Finding invariants...
 | 
						|
10 initial candidates
 | 
						|
Finding invariants: [0.010s CPU, 0.009s wall-clock]
 | 
						|
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
 | 
						|
Instantiating groups... [0.010s CPU, 0.003s wall-clock]
 | 
						|
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
 | 
						|
Choosing groups...
 | 
						|
0 uncovered facts
 | 
						|
Choosing groups: [0.000s CPU, 0.001s wall-clock]
 | 
						|
Building translation key... [0.000s CPU, 0.001s wall-clock]
 | 
						|
Computing fact groups: [0.020s CPU, 0.017s wall-clock]
 | 
						|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock]
 | 
						|
Building dictionary for full mutex groups... [0.000s CPU, 0.000s wall-clock]
 | 
						|
Building mutex information...
 | 
						|
Building mutex information: [0.000s CPU, 0.001s wall-clock]
 | 
						|
Translating task...
 | 
						|
Processing axioms...
 | 
						|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
 | 
						|
Processing axioms: [0.000s CPU, 0.001s wall-clock]
 | 
						|
Translating task: [0.020s CPU, 0.019s wall-clock]
 | 
						|
0 effect conditions simplified
 | 
						|
0 implied preconditions added
 | 
						|
Detecting unreachable propositions...
 | 
						|
0 operators removed
 | 
						|
0 axioms removed
 | 
						|
3 propositions removed
 | 
						|
Detecting unreachable propositions: [0.010s CPU, 0.010s wall-clock]
 | 
						|
Reordering and filtering variables...
 | 
						|
11 of 11 variables necessary.
 | 
						|
8 of 11 mutex groups necessary.
 | 
						|
66 of 66 operators necessary.
 | 
						|
0 of 0 axiom rules necessary.
 | 
						|
Reordering and filtering variables: [0.010s CPU, 0.004s wall-clock]
 | 
						|
Translator variables: 11
 | 
						|
Translator derived variables: 0
 | 
						|
Translator facts: 44
 | 
						|
Translator goal facts: 8
 | 
						|
Translator mutex groups: 8
 | 
						|
Translator total mutex groups size: 32
 | 
						|
Translator operators: 66
 | 
						|
Translator axioms: 0
 | 
						|
Translator task size: 453
 | 
						|
Translator peak memory: 33112 KB
 | 
						|
Writing output... [0.000s CPU, 0.010s wall-clock]
 | 
						|
Done! [0.130s CPU, 0.138s wall-clock]
 | 
						|
planner.py version 0.0.1
 | 
						|
 | 
						|
Time:	 0.04s
 | 
						|
Memory: 47MB
 | 
						|
 | 
						|
Iteration 1
 | 
						|
Queue:		 [(0,0,0,True), (1,5,0,True), (2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
 | 
						|
Grounded Until:	 0
 | 
						|
Solving...
 | 
						|
Solving Time:	 0.00s
 | 
						|
Memory:		 47MB (+0MB)
 | 
						|
UNSAT
 | 
						|
Iteration Time:	 0.00s
 | 
						|
 | 
						|
Iteration 2
 | 
						|
Queue:		 [(1,5,0,True), (2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
 | 
						|
Grounded Until:	 0
 | 
						|
Grounding...	 [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
 | 
						|
Grounding Time:	 0.03s
 | 
						|
Memory:		 49MB (+2MB)
 | 
						|
Unblocking actions...
 | 
						|
Solving...
 | 
						|
Solving Time:	 0.02s
 | 
						|
Memory:		 50MB (+1MB)
 | 
						|
UNSAT
 | 
						|
Iteration Time:	 0.06s
 | 
						|
 | 
						|
Iteration 3
 | 
						|
Queue:		 [(2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
 | 
						|
Grounded Until:	 5
 | 
						|
Grounding...	 [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
 | 
						|
Grounding Time:	 0.03s
 | 
						|
Memory:		 51MB (+1MB)
 | 
						|
Unblocking actions...
 | 
						|
Solving...
 | 
						|
Answer: 1
 | 
						|
occurs(action(("pick","ball8","rooma","right")),1) occurs(action(("pick","ball4","rooma","left")),1) occurs(action(("drop","ball4","roomb","left")),2) occurs(action(("move","rooma","roomb")),2) occurs(action(("drop","ball8","roomb","right")),3) occurs(action(("pick","ball5","rooma","left")),3) occurs(action(("move","roomb","rooma")),3) occurs(action(("drop","ball5","roomb","left")),4) occurs(action(("pick","ball3","rooma","right")),4) occurs(action(("move","rooma","roomb")),4) occurs(action(("drop","ball3","roomb","right")),5) occurs(action(("pick","ball6","rooma","left")),5) occurs(action(("move","roomb","rooma")),5) occurs(action(("drop","ball6","roomb","left")),6) occurs(action(("pick","ball7","rooma","right")),6) occurs(action(("move","rooma","roomb")),6) occurs(action(("drop","ball7","roomb","right")),7) occurs(action(("pick","ball1","rooma","left")),7) occurs(action(("move","roomb","rooma")),7) occurs(action(("pick","ball2","rooma","right")),8) occurs(action(("drop","ball2","roomb","right")),9) occurs(action(("drop","ball1","roomb","left")),9) occurs(action(("move","rooma","roomb")),9) occurs(action(("move","roomb","rooma")),10)
 | 
						|
Solving Time:	 0.07s
 | 
						|
Memory:		 52MB (+1MB)
 | 
						|
SAT
 | 
						|
SATISFIABLE
 | 
						|
 | 
						|
Models       : 1+
 | 
						|
Calls        : 3
 | 
						|
Time         : 0.207s (Solving: 0.09s 1st Model: 0.06s Unsat: 0.02s)
 | 
						|
CPU Time     : 0.210s
 | 
						|
 | 
						|
Choices      : 2653    
 | 
						|
Conflicts    : 1582     (Analyzed: 1581)
 | 
						|
Restarts     : 18       (Average: 87.83 Last: 33)
 | 
						|
Model-Level  : 38.0    
 | 
						|
Problems     : 3        (Average Length: 7.00 Splits: 0)
 | 
						|
Lemmas       : 1586     (Deleted: 0)
 | 
						|
  Binary     : 77       (Ratio:   4.85%)
 | 
						|
  Ternary    : 39       (Ratio:   2.46%)
 | 
						|
  Conflict   : 1581     (Average Length:   13.3 Ratio:  99.68%) 
 | 
						|
  Loop       : 5        (Average Length:   11.0 Ratio:   0.32%) 
 | 
						|
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
 | 
						|
Backjumps    : 1581     (Average:  1.60 Max:  37 Sum:   2534)
 | 
						|
  Executed   : 1568     (Average:  1.54 Max:  37 Sum:   2440 Ratio:  96.29%)
 | 
						|
  Bounded    : 13       (Average:  7.23 Max:  12 Sum:     94 Ratio:   3.71%)
 | 
						|
 | 
						|
Rules        : 5518    
 | 
						|
Atoms        : 5518    
 | 
						|
Bodies       : 1        (Original: 0)
 | 
						|
Tight        : Yes
 | 
						|
Variables    : 5296     (Eliminated:    0 Frozen: 4336)
 | 
						|
Constraints  : 13432    (Binary:  81.1% Ternary:  13.6% Other:   5.3%)
 | 
						|
 | 
						|
Memory Peak  : 52MB
 | 
						|
Max. Length  : 10 steps
 | 
						|
Sol. Length  : 10 steps
 | 
						|
 | 
						|
 |