143 lines
		
	
	
		
			7.8 KiB
		
	
	
	
		
			Plaintext
		
	
	
	
	
	
			
		
		
	
	
			143 lines
		
	
	
		
			7.8 KiB
		
	
	
	
		
			Plaintext
		
	
	
	
	
	
INFO     Running translator.
 | 
						|
INFO     translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/logistics-round-1-strips/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/logistics-round-1-strips/instances/instance-1.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/logistics-round-1-strips/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/logistics-round-1-strips/instances/instance-1.pddl
 | 
						|
Parsing...
 | 
						|
Parsing: [0.020s CPU, 0.021s wall-clock]
 | 
						|
Normalizing task... [0.000s CPU, 0.002s wall-clock]
 | 
						|
Instantiating...
 | 
						|
Generating Datalog program... [0.000s CPU, 0.005s wall-clock]
 | 
						|
Normalizing Datalog program...
 | 
						|
Normalizing Datalog program: [0.030s CPU, 0.031s wall-clock]
 | 
						|
Preparing model... [0.020s CPU, 0.015s wall-clock]
 | 
						|
Generated 51 rules.
 | 
						|
Computing model... [0.120s CPU, 0.124s wall-clock]
 | 
						|
643 relevant atoms
 | 
						|
678 auxiliary atoms
 | 
						|
1321 final queue length
 | 
						|
1575 total queue pushes
 | 
						|
Completing instantiation... [0.090s CPU, 0.083s wall-clock]
 | 
						|
Instantiating: [0.260s CPU, 0.260s wall-clock]
 | 
						|
Computing fact groups...
 | 
						|
Finding invariants...
 | 
						|
6 initial candidates
 | 
						|
Finding invariants: [0.010s CPU, 0.012s wall-clock]
 | 
						|
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
 | 
						|
Instantiating groups... [0.010s 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.002s wall-clock]
 | 
						|
Building translation key... [0.000s CPU, 0.002s wall-clock]
 | 
						|
Computing fact groups: [0.030s CPU, 0.033s 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.004s wall-clock]
 | 
						|
Translating task: [0.070s CPU, 0.068s wall-clock]
 | 
						|
0 effect conditions simplified
 | 
						|
0 implied preconditions added
 | 
						|
Detecting unreachable propositions...
 | 
						|
0 operators removed
 | 
						|
0 axioms removed
 | 
						|
14 propositions removed
 | 
						|
Detecting unreachable propositions: [0.040s CPU, 0.037s wall-clock]
 | 
						|
Reordering and filtering variables...
 | 
						|
14 of 14 variables necessary.
 | 
						|
0 of 14 mutex groups necessary.
 | 
						|
360 of 360 operators necessary.
 | 
						|
0 of 0 axiom rules necessary.
 | 
						|
Reordering and filtering variables: [0.010s CPU, 0.009s wall-clock]
 | 
						|
Translator variables: 14
 | 
						|
Translator derived variables: 0
 | 
						|
Translator facts: 144
 | 
						|
Translator goal facts: 6
 | 
						|
Translator mutex groups: 0
 | 
						|
Translator total mutex groups size: 0
 | 
						|
Translator operators: 360
 | 
						|
Translator axioms: 0
 | 
						|
Translator task size: 1532
 | 
						|
Translator peak memory: 34136 KB
 | 
						|
Writing output... [0.030s CPU, 0.032s wall-clock]
 | 
						|
Done! [0.460s CPU, 0.468s wall-clock]
 | 
						|
planner.py version 0.0.1
 | 
						|
 | 
						|
Time:	 0.15s
 | 
						|
Memory: 52MB
 | 
						|
 | 
						|
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:		 52MB (+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:		 57MB (+5MB)
 | 
						|
Unblocking actions...
 | 
						|
Solving...
 | 
						|
Solving Time:	 0.00s
 | 
						|
Memory:		 58MB (+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.04s
 | 
						|
Memory:		 60MB (+2MB)
 | 
						|
Unblocking actions...
 | 
						|
Solving...
 | 
						|
Answer: 1
 | 
						|
occurs(action(("load-truck","package3","truck1","city1-1")),1) occurs(action(("unload-truck","package3","truck1","city1-1")),2) occurs(action(("load-truck","package3","truck1","city1-1")),3) occurs(action(("drive-truck","truck3","city3-1","city3-2","city3")),4) occurs(action(("drive-truck","truck1","city1-1","city1-2","city1")),4) occurs(action(("load-truck","package4","truck1","city1-1")),4) occurs(action(("load-truck","package6","truck3","city3-1")),4) occurs(action(("fly-airplane","plane1","city4-2","city3-2")),5) occurs(action(("fly-airplane","plane2","city4-2","city1-2")),5) occurs(action(("unload-truck","package4","truck1","city1-2")),5) occurs(action(("unload-truck","package6","truck3","city3-2")),5) occurs(action(("drive-truck","truck1","city1-2","city1-1","city1")),5) occurs(action(("drive-truck","truck3","city3-2","city3-1","city3")),5) occurs(action(("drive-truck","truck5","city5-1","city5-2","city5")),5) occurs(action(("unload-truck","package3","truck1","city1-2")),5) occurs(action(("load-airplane","package2","plane2","city1-2")),6) occurs(action(("load-airplane","package4","plane2","city1-2")),6) occurs(action(("load-airplane","package6","plane1","city3-2")),6) occurs(action(("fly-airplane","plane2","city1-2","city4-2")),6) occurs(action(("fly-airplane","plane1","city3-2","city4-2")),6) occurs(action(("load-airplane","package3","plane2","city1-2")),6) occurs(action(("drive-truck","truck5","city5-2","city5-1","city5")),6) occurs(action(("load-airplane","package5","plane2","city4-2")),7) occurs(action(("fly-airplane","plane2","city4-2","city6-2")),7) occurs(action(("unload-airplane","package4","plane2","city4-2")),7) occurs(action(("unload-airplane","package6","plane1","city4-2")),7) occurs(action(("unload-airplane","package2","plane2","city6-2")),8) occurs(action(("unload-airplane","package5","plane2","city6-2")),8) occurs(action(("drive-truck","truck6","city6-1","city6-2","city6")),8) occurs(action(("unload-airplane","package3","plane2","city6-2")),8) occurs(action(("fly-airplane","plane2","city6-2","city4-2")),8) occurs(action(("load-truck","package3","truck6","city6-2")),9) occurs(action(("load-airplane","package4","plane2","city4-2")),9) occurs(action(("fly-airplane","plane2","city4-2","city3-2")),9) occurs(action(("load-airplane","package6","plane1","city4-2")),9) occurs(action(("fly-airplane","plane1","city4-2","city1-2")),9) occurs(action(("drive-truck","truck6","city6-2","city6-1","city6")),9) occurs(action(("unload-truck","package3","truck6","city6-1")),10) occurs(action(("unload-airplane","package4","plane2","city3-2")),10) occurs(action(("unload-airplane","package6","plane1","city1-2")),10) occurs(action(("fly-airplane","plane1","city1-2","city6-2")),10) occurs(action(("fly-airplane","plane2","city3-2","city4-2")),10)
 | 
						|
Solving Time:	 0.00s
 | 
						|
Memory:		 61MB (+1MB)
 | 
						|
SAT
 | 
						|
SATISFIABLE
 | 
						|
 | 
						|
Models       : 1+
 | 
						|
Calls        : 3
 | 
						|
Time         : 0.268s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
 | 
						|
CPU Time     : 0.260s
 | 
						|
 | 
						|
Choices      : 217     
 | 
						|
Conflicts    : 2        (Analyzed: 2)
 | 
						|
Restarts     : 0       
 | 
						|
Model-Level  : 164.0   
 | 
						|
Problems     : 3        (Average Length: 7.00 Splits: 0)
 | 
						|
Lemmas       : 2        (Deleted: 0)
 | 
						|
  Binary     : 0        (Ratio:   0.00%)
 | 
						|
  Ternary    : 0        (Ratio:   0.00%)
 | 
						|
  Conflict   : 2        (Average Length:   15.5 Ratio: 100.00%) 
 | 
						|
  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
 | 
						|
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
 | 
						|
Backjumps    : 2        (Average: 32.50 Max:  37 Sum:     65)
 | 
						|
  Executed   : 2        (Average: 32.50 Max:  37 Sum:     65 Ratio: 100.00%)
 | 
						|
  Bounded    : 0        (Average:  0.00 Max:   0 Sum:      0 Ratio:   0.00%)
 | 
						|
 | 
						|
Rules        : 54938   
 | 
						|
Atoms        : 54938   
 | 
						|
Bodies       : 1        (Original: 0)
 | 
						|
Tight        : Yes
 | 
						|
Variables    : 6947     (Eliminated:    0 Frozen:    0)
 | 
						|
Constraints  : 19227    (Binary:  89.1% Ternary:   8.7% Other:   2.2%)
 | 
						|
 | 
						|
Memory Peak  : 61MB
 | 
						|
Max. Length  : 10 steps
 | 
						|
Sol. Length  : 10 steps
 | 
						|
 | 
						|
 |