143 lines
		
	
	
		
			5.9 KiB
		
	
	
	
		
			Plaintext
		
	
	
	
	
	
			
		
		
	
	
			143 lines
		
	
	
		
			5.9 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-15.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-15.pddl
 | 
						|
Parsing...
 | 
						|
Parsing: [0.010s CPU, 0.018s wall-clock]
 | 
						|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
 | 
						|
Instantiating...
 | 
						|
Generating Datalog program... [0.010s CPU, 0.005s wall-clock]
 | 
						|
Normalizing Datalog program...
 | 
						|
Normalizing Datalog program: [0.020s CPU, 0.022s wall-clock]
 | 
						|
Preparing model... [0.010s CPU, 0.018s wall-clock]
 | 
						|
Generated 42 rules.
 | 
						|
Computing model... [1.750s CPU, 1.745s wall-clock]
 | 
						|
17570 relevant atoms
 | 
						|
6412 auxiliary atoms
 | 
						|
23982 final queue length
 | 
						|
56683 total queue pushes
 | 
						|
Completing instantiation... [6.230s CPU, 6.222s wall-clock]
 | 
						|
Instantiating: [8.040s CPU, 8.035s wall-clock]
 | 
						|
Computing fact groups...
 | 
						|
Finding invariants...
 | 
						|
12 initial candidates
 | 
						|
Finding invariants: [0.120s CPU, 0.115s wall-clock]
 | 
						|
Checking invariant weight... [0.000s CPU, 0.003s wall-clock]
 | 
						|
Instantiating groups... [0.050s CPU, 0.052s wall-clock]
 | 
						|
Collecting mutex groups... [0.000s CPU, 0.004s wall-clock]
 | 
						|
Choosing groups...
 | 
						|
0 uncovered facts
 | 
						|
Choosing groups: [0.010s CPU, 0.012s wall-clock]
 | 
						|
Building translation key... [0.000s CPU, 0.007s wall-clock]
 | 
						|
Computing fact groups: [0.220s CPU, 0.223s wall-clock]
 | 
						|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.003s wall-clock]
 | 
						|
Building dictionary for full mutex groups... [0.000s CPU, 0.003s wall-clock]
 | 
						|
Building mutex information...
 | 
						|
Building mutex information: [0.010s CPU, 0.004s wall-clock]
 | 
						|
Translating task...
 | 
						|
Processing axioms...
 | 
						|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
 | 
						|
Processing axioms: [0.240s CPU, 0.242s wall-clock]
 | 
						|
Translating task: [4.730s CPU, 4.739s wall-clock]
 | 
						|
0 effect conditions simplified
 | 
						|
0 implied preconditions added
 | 
						|
Detecting unreachable propositions...
 | 
						|
0 operators removed
 | 
						|
0 axioms removed
 | 
						|
52 propositions removed
 | 
						|
Detecting unreachable propositions: [2.420s CPU, 2.412s wall-clock]
 | 
						|
Reordering and filtering variables...
 | 
						|
52 of 52 variables necessary.
 | 
						|
0 of 52 mutex groups necessary.
 | 
						|
16665 of 16665 operators necessary.
 | 
						|
0 of 0 axiom rules necessary.
 | 
						|
Reordering and filtering variables: [0.700s CPU, 0.700s wall-clock]
 | 
						|
Translator variables: 52
 | 
						|
Translator derived variables: 0
 | 
						|
Translator facts: 681
 | 
						|
Translator goal facts: 1
 | 
						|
Translator mutex groups: 0
 | 
						|
Translator total mutex groups size: 0
 | 
						|
Translator operators: 16665
 | 
						|
Translator axioms: 0
 | 
						|
Translator task size: 98645
 | 
						|
Translator peak memory: 98056 KB
 | 
						|
Writing output... [1.590s CPU, 1.744s wall-clock]
 | 
						|
Done! [17.930s CPU, 18.085s wall-clock]
 | 
						|
planner.py version 0.0.1
 | 
						|
 | 
						|
Time:	 3.69s
 | 
						|
Memory: 310MB
 | 
						|
 | 
						|
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.02s
 | 
						|
Memory:		 310MB (+0MB)
 | 
						|
UNSAT
 | 
						|
Iteration Time:	 0.02s
 | 
						|
 | 
						|
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:	 1.39s
 | 
						|
Memory:		 310MB (+0MB)
 | 
						|
Unblocking actions...
 | 
						|
Solving...
 | 
						|
Solving Time:	 0.36s
 | 
						|
Memory:		 321MB (+11MB)
 | 
						|
UNSAT
 | 
						|
Iteration Time:	 2.59s
 | 
						|
 | 
						|
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:	 1.62s
 | 
						|
Memory:		 350MB (+29MB)
 | 
						|
Unblocking actions...
 | 
						|
Solving...
 | 
						|
Answer: 1
 | 
						|
occurs(action(("feast","learning","broccoli","pistachio","surrey","moravia")),1) occurs(action(("overcome","jealousy","learning","pistachio","mars","neptune")),2) occurs(action(("feast","entertainment","pepper","bacon","goias","surrey")),3) occurs(action(("feast","entertainment","bacon","ham","moravia","bavaria")),4) occurs(action(("feast","entertainment","ham","lobster","alsace","arizona")),5) occurs(action(("feast","learning","pistachio","broccoli","surrey","moravia")),6) occurs(action(("feast","learning","broccoli","lemon","goias","surrey")),7) occurs(action(("feast","learning","lemon","cod","bavaria","alsace")),8) occurs(action(("feast","learning","cod","chicken","pennsylvania","quebec")),9) occurs(action(("succumb","jealousy","learning","chicken","mars","neptune")),10)
 | 
						|
Solving Time:	 3.26s
 | 
						|
Memory:		 399MB (+49MB)
 | 
						|
SAT
 | 
						|
SATISFIABLE
 | 
						|
 | 
						|
Models       : 1+
 | 
						|
Calls        : 3
 | 
						|
Time         : 12.318s (Solving: 3.30s 1st Model: 3.20s Unsat: 0.09s)
 | 
						|
CPU Time     : 11.970s
 | 
						|
 | 
						|
Choices      : 10017   
 | 
						|
Conflicts    : 5091     (Analyzed: 5090)
 | 
						|
Restarts     : 51       (Average: 99.80 Last: 95)
 | 
						|
Model-Level  : 19.0    
 | 
						|
Problems     : 3        (Average Length: 7.00 Splits: 0)
 | 
						|
Lemmas       : 5090     (Deleted: 2326)
 | 
						|
  Binary     : 322      (Ratio:   6.33%)
 | 
						|
  Ternary    : 196      (Ratio:   3.85%)
 | 
						|
  Conflict   : 5090     (Average Length:  348.3 Ratio: 100.00%) 
 | 
						|
  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
 | 
						|
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
 | 
						|
Backjumps    : 5090     (Average:  2.15 Max:  48 Sum:  10924)
 | 
						|
  Executed   : 4952     (Average:  1.88 Max:  48 Sum:   9556 Ratio:  87.48%)
 | 
						|
  Bounded    : 138      (Average:  9.91 Max:  12 Sum:   1368 Ratio:  12.52%)
 | 
						|
 | 
						|
Rules        : 298781  
 | 
						|
Atoms        : 298781  
 | 
						|
Bodies       : 1        (Original: 0)
 | 
						|
Tight        : Yes
 | 
						|
Variables    : 161389   (Eliminated:    0 Frozen: 153360)
 | 
						|
Constraints  : 880305   (Binary:  98.9% Ternary:   0.5% Other:   0.6%)
 | 
						|
 | 
						|
Memory Peak  : 399MB
 | 
						|
Max. Length  : 10 steps
 | 
						|
Sol. Length  : 10 steps
 | 
						|
 | 
						|
 |