135 lines
		
	
	
		
			5.9 KiB
		
	
	
	
		
			Plaintext
		
	
	
	
	
	
			
		
		
	
	
			135 lines
		
	
	
		
			5.9 KiB
		
	
	
	
		
			Plaintext
		
	
	
	
	
	
INFO     Running translator.
 | 
						|
INFO     translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/zenotravel-strips-automatic/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/zenotravel-strips-automatic/instances/instance-8.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-2002/domains/zenotravel-strips-automatic/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/zenotravel-strips-automatic/instances/instance-8.pddl
 | 
						|
Parsing...
 | 
						|
Parsing: [0.010s CPU, 0.015s 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.010s CPU, 0.021s wall-clock]
 | 
						|
Preparing model... [0.020s CPU, 0.010s wall-clock]
 | 
						|
Generated 40 rules.
 | 
						|
Computing model... [0.160s CPU, 0.159s wall-clock]
 | 
						|
1249 relevant atoms
 | 
						|
652 auxiliary atoms
 | 
						|
1901 final queue length
 | 
						|
3749 total queue pushes
 | 
						|
Completing instantiation... [0.300s CPU, 0.300s wall-clock]
 | 
						|
Instantiating: [0.500s CPU, 0.497s wall-clock]
 | 
						|
Computing fact groups...
 | 
						|
Finding invariants...
 | 
						|
9 initial candidates
 | 
						|
Finding invariants: [0.020s CPU, 0.026s wall-clock]
 | 
						|
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
 | 
						|
Instantiating groups... [0.010s CPU, 0.006s wall-clock]
 | 
						|
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
 | 
						|
Choosing groups...
 | 
						|
0 uncovered facts
 | 
						|
Choosing groups: [0.000s CPU, 0.002s wall-clock]
 | 
						|
Building translation key... [0.000s CPU, 0.001s wall-clock]
 | 
						|
Computing fact groups: [0.040s CPU, 0.039s wall-clock]
 | 
						|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s 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.010s CPU, 0.015s wall-clock]
 | 
						|
Translating task: [0.270s CPU, 0.266s wall-clock]
 | 
						|
0 effect conditions simplified
 | 
						|
0 implied preconditions added
 | 
						|
Detecting unreachable propositions...
 | 
						|
0 operators removed
 | 
						|
0 axioms removed
 | 
						|
12 propositions removed
 | 
						|
Detecting unreachable propositions: [0.140s CPU, 0.137s wall-clock]
 | 
						|
Reordering and filtering variables...
 | 
						|
12 of 12 variables necessary.
 | 
						|
0 of 12 mutex groups necessary.
 | 
						|
1095 of 1095 operators necessary.
 | 
						|
0 of 0 axiom rules necessary.
 | 
						|
Reordering and filtering variables: [0.040s CPU, 0.038s wall-clock]
 | 
						|
Translator variables: 12
 | 
						|
Translator derived variables: 0
 | 
						|
Translator facts: 84
 | 
						|
Translator goal facts: 7
 | 
						|
Translator mutex groups: 0
 | 
						|
Translator total mutex groups size: 0
 | 
						|
Translator operators: 1095
 | 
						|
Translator axioms: 0
 | 
						|
Translator task size: 5143
 | 
						|
Translator peak memory: 39884 KB
 | 
						|
Writing output... [0.090s CPU, 0.106s wall-clock]
 | 
						|
Done! [1.100s CPU, 1.114s wall-clock]
 | 
						|
planner.py version 0.0.1
 | 
						|
 | 
						|
Time:	 0.23s
 | 
						|
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.05s
 | 
						|
Memory:		 63MB (+0MB)
 | 
						|
Unblocking actions...
 | 
						|
Solving...
 | 
						|
Solving Time:	 0.00s
 | 
						|
Memory:		 63MB (+0MB)
 | 
						|
SAT
 | 
						|
Testing...
 | 
						|
SERIALIZABLE
 | 
						|
Testing Time:	 0.16s
 | 
						|
Memory:		 72MB (+9MB)
 | 
						|
Answer: 1
 | 
						|
occurs(action(("fly","plane1","city0","city2","fl6","fl5")),1) occurs(action(("refuel","plane2","city3","fl0","fl1")),1) occurs(action(("zoom","plane3","city0","city4","fl3","fl2","fl1")),1) occurs(action(("board","person3","plane1","city2")),2) occurs(action(("fly","plane2","city3","city1","fl1","fl0")),2) occurs(action(("board","person6","plane3","city4")),2) occurs(action(("fly","plane3","city4","city2","fl1","fl0")),2) occurs(action(("zoom","plane1","city2","city1","fl5","fl4","fl3")),2) occurs(action(("debark","person3","plane1","city1")),3) occurs(action(("debark","person6","plane3","city2")),3) occurs(action(("zoom","plane1","city1","city3","fl3","fl2","fl1")),3) occurs(action(("board","person1","plane2","city1")),3) occurs(action(("refuel","plane2","city1","fl0","fl1")),3) occurs(action(("fly","plane2","city1","city0","fl1","fl0")),4) occurs(action(("refuel","plane3","city2","fl0","fl1")),4) occurs(action(("fly","plane1","city3","city3","fl1","fl0")),4) occurs(action(("debark","person1","plane2","city0")),5) occurs(action(("fly","plane3","city2","city1","fl1","fl0")),5)
 | 
						|
SATISFIABLE
 | 
						|
 | 
						|
Models       : 1+
 | 
						|
Calls        : 2
 | 
						|
Time         : 0.328s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
 | 
						|
CPU Time     : 0.316s
 | 
						|
 | 
						|
Choices      : 162      (Domain: 143)
 | 
						|
Conflicts    : 39       (Analyzed: 39)
 | 
						|
Restarts     : 0       
 | 
						|
Model-Level  : 54.0    
 | 
						|
Problems     : 2        (Average Length: 4.50 Splits: 0)
 | 
						|
Lemmas       : 39       (Deleted: 0)
 | 
						|
  Binary     : 2        (Ratio:   5.13%)
 | 
						|
  Ternary    : 0        (Ratio:   0.00%)
 | 
						|
  Conflict   : 39       (Average Length:   62.6 Ratio: 100.00%) 
 | 
						|
  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
 | 
						|
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
 | 
						|
Backjumps    : 39       (Average:  3.49 Max:  29 Sum:    136)
 | 
						|
  Executed   : 36       (Average:  2.95 Max:  29 Sum:    115 Ratio:  84.56%)
 | 
						|
  Bounded    : 3        (Average:  7.00 Max:   7 Sum:     21 Ratio:  15.44%)
 | 
						|
 | 
						|
Rules        : 16484   
 | 
						|
Atoms        : 16484   
 | 
						|
Bodies       : 1        (Original: 0)
 | 
						|
Tight        : Yes
 | 
						|
Variables    : 4661     (Eliminated:    0 Frozen:  187)
 | 
						|
Constraints  : 21019    (Binary:  97.9% Ternary:   1.0% Other:   1.2%)
 | 
						|
 | 
						|
Memory Peak  : 72MB
 | 
						|
Max. Length  : 5 steps
 | 
						|
Sol. Length  : 5 steps
 | 
						|
Models       : 1
 | 
						|
 | 
						|
 |