130 lines
		
	
	
		
			6.1 KiB
		
	
	
	
		
			Plaintext
		
	
	
	
	
	
			
		
		
	
	
			130 lines
		
	
	
		
			6.1 KiB
		
	
	
	
		
			Plaintext
		
	
	
	
	
	
INFO     Running translator.
 | 
						|
INFO     translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-round-1-strips/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-round-1-strips/instances/instance-27.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/mystery-round-1-strips/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-round-1-strips/instances/instance-27.pddl
 | 
						|
Parsing...
 | 
						|
Parsing: [0.010s CPU, 0.017s wall-clock]
 | 
						|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
 | 
						|
Instantiating...
 | 
						|
Generating Datalog program... [0.010s CPU, 0.004s wall-clock]
 | 
						|
Normalizing Datalog program...
 | 
						|
Normalizing Datalog program: [0.030s CPU, 0.026s wall-clock]
 | 
						|
Preparing model... [0.010s CPU, 0.013s wall-clock]
 | 
						|
Generated 42 rules.
 | 
						|
Computing model... [0.170s CPU, 0.167s wall-clock]
 | 
						|
1446 relevant atoms
 | 
						|
813 auxiliary atoms
 | 
						|
2259 final queue length
 | 
						|
4448 total queue pushes
 | 
						|
Completing instantiation... [0.400s CPU, 0.403s wall-clock]
 | 
						|
Instantiating: [0.620s CPU, 0.617s wall-clock]
 | 
						|
Computing fact groups...
 | 
						|
Finding invariants...
 | 
						|
12 initial candidates
 | 
						|
Finding invariants: [0.020s CPU, 0.024s wall-clock]
 | 
						|
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
 | 
						|
Instantiating groups... [0.020s CPU, 0.010s wall-clock]
 | 
						|
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
 | 
						|
Choosing groups...
 | 
						|
0 uncovered facts
 | 
						|
Choosing groups: [0.000s CPU, 0.003s wall-clock]
 | 
						|
Building translation key... [0.010s CPU, 0.002s wall-clock]
 | 
						|
Computing fact groups: [0.050s CPU, 0.046s wall-clock]
 | 
						|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
 | 
						|
Building dictionary for full mutex groups... [0.000s CPU, 0.001s 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.010s CPU, 0.016s wall-clock]
 | 
						|
Translating task: [0.290s CPU, 0.295s wall-clock]
 | 
						|
0 effect conditions simplified
 | 
						|
0 implied preconditions added
 | 
						|
Detecting unreachable propositions...
 | 
						|
0 operators removed
 | 
						|
0 axioms removed
 | 
						|
19 propositions removed
 | 
						|
Detecting unreachable propositions: [0.150s CPU, 0.149s wall-clock]
 | 
						|
Reordering and filtering variables...
 | 
						|
19 of 19 variables necessary.
 | 
						|
0 of 19 mutex groups necessary.
 | 
						|
1161 of 1161 operators necessary.
 | 
						|
0 of 0 axiom rules necessary.
 | 
						|
Reordering and filtering variables: [0.050s CPU, 0.050s wall-clock]
 | 
						|
Translator variables: 19
 | 
						|
Translator derived variables: 0
 | 
						|
Translator facts: 152
 | 
						|
Translator goal facts: 2
 | 
						|
Translator mutex groups: 0
 | 
						|
Translator total mutex groups size: 0
 | 
						|
Translator operators: 1161
 | 
						|
Translator axioms: 0
 | 
						|
Translator task size: 6734
 | 
						|
Translator peak memory: 37720 KB
 | 
						|
Writing output... [0.100s CPU, 0.117s wall-clock]
 | 
						|
Done! [1.290s CPU, 1.310s wall-clock]
 | 
						|
planner.py version 0.0.1
 | 
						|
 | 
						|
Time:	 0.27s
 | 
						|
Memory: 63MB
 | 
						|
 | 
						|
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:		 63MB (+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.08s
 | 
						|
Memory:		 63MB (+0MB)
 | 
						|
Unblocking actions...
 | 
						|
Solving...
 | 
						|
Answer: 1
 | 
						|
occurs(action(("feast","love","popover","scallion","kentucky","oregon")),1) occurs(action(("feast","triumph","onion","muffin","goias","bosnia")),1) occurs(action(("feast","love","scallion","guava","arizona","pennsylvania")),2) occurs(action(("overcome","loneliness","satisfaction","scallion","mars","uranus")),2) occurs(action(("feast","satisfaction","scallion","guava","arizona","pennsylvania")),2) occurs(action(("feast","triumph","muffin","scallion","surrey","guanabara")),2) occurs(action(("overcome","grief","triumph","scallion","uranus","earth")),3) occurs(action(("overcome","boils","triumph","scallion","uranus","earth")),3) occurs(action(("feast","triumph","scallion","guava","manitoba","arizona")),3) occurs(action(("feast","love","guava","wurst","kentucky","oregon")),3) occurs(action(("feast","satisfaction","guava","wurst","kentucky","oregon")),3) occurs(action(("succumb","grief","triumph","guava","uranus","earth")),4) occurs(action(("succumb","boils","triumph","guava","uranus","earth")),4) occurs(action(("overcome","abrasion","love","wurst","mars","uranus")),4) occurs(action(("feast","love","wurst","guava","oregon","bavaria")),4) occurs(action(("overcome","anxiety","satisfaction","wurst","mercury","mars")),4) occurs(action(("feast","satisfaction","wurst","guava","oregon","bavaria")),4) occurs(action(("feast","triumph","guava","scallion","quebec","kentucky")),5)
 | 
						|
Solving Time:	 0.00s
 | 
						|
Memory:		 63MB (+0MB)
 | 
						|
SAT
 | 
						|
SATISFIABLE
 | 
						|
 | 
						|
Models       : 1+
 | 
						|
Calls        : 2
 | 
						|
Time         : 0.416s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
 | 
						|
CPU Time     : 0.400s
 | 
						|
 | 
						|
Choices      : 82      
 | 
						|
Conflicts    : 5        (Analyzed: 5)
 | 
						|
Restarts     : 0       
 | 
						|
Model-Level  : 47.0    
 | 
						|
Problems     : 2        (Average Length: 4.50 Splits: 0)
 | 
						|
Lemmas       : 5        (Deleted: 0)
 | 
						|
  Binary     : 1        (Ratio:  20.00%)
 | 
						|
  Ternary    : 0        (Ratio:   0.00%)
 | 
						|
  Conflict   : 5        (Average Length:   32.0 Ratio: 100.00%) 
 | 
						|
  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
 | 
						|
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
 | 
						|
Backjumps    : 5        (Average:  9.80 Max:  27 Sum:     49)
 | 
						|
  Executed   : 4        (Average:  8.40 Max:  27 Sum:     42 Ratio:  85.71%)
 | 
						|
  Bounded    : 1        (Average:  7.00 Max:   7 Sum:      7 Ratio:  14.29%)
 | 
						|
 | 
						|
Rules        : 20787   
 | 
						|
Atoms        : 20787   
 | 
						|
Bodies       : 1        (Original: 0)
 | 
						|
Tight        : Yes
 | 
						|
Variables    : 6097     (Eliminated:    0 Frozen:  512)
 | 
						|
Constraints  : 21545    (Binary:  96.2% Ternary:   1.7% Other:   2.1%)
 | 
						|
 | 
						|
Memory Peak  : 64MB
 | 
						|
Max. Length  : 5 steps
 | 
						|
Sol. Length  : 5 steps
 | 
						|
 | 
						|
 |