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-2002/domains/driverlog-strips-automatic/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/instances/instance-7.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/driverlog-strips-automatic/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/instances/instance-7.pddl
 | 
						|
Parsing...
 | 
						|
Parsing: [0.020s CPU, 0.018s wall-clock]
 | 
						|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
 | 
						|
Instantiating...
 | 
						|
Generating Datalog program... [0.000s CPU, 0.005s wall-clock]
 | 
						|
Normalizing Datalog program...
 | 
						|
Normalizing Datalog program: [0.020s CPU, 0.018s wall-clock]
 | 
						|
Preparing model... [0.010s CPU, 0.012s wall-clock]
 | 
						|
Generated 35 rules.
 | 
						|
Computing model... [0.060s CPU, 0.057s wall-clock]
 | 
						|
412 relevant atoms
 | 
						|
273 auxiliary atoms
 | 
						|
685 final queue length
 | 
						|
904 total queue pushes
 | 
						|
Completing instantiation... [0.050s CPU, 0.051s wall-clock]
 | 
						|
Instantiating: [0.140s CPU, 0.143s wall-clock]
 | 
						|
Computing fact groups...
 | 
						|
Finding invariants...
 | 
						|
11 initial candidates
 | 
						|
Finding invariants: [0.020s CPU, 0.018s wall-clock]
 | 
						|
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
 | 
						|
Instantiating groups... [0.010s CPU, 0.008s wall-clock]
 | 
						|
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
 | 
						|
Choosing groups...
 | 
						|
3 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.030s CPU, 0.033s 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.010s CPU, 0.003s wall-clock]
 | 
						|
Translating task: [0.050s CPU, 0.050s wall-clock]
 | 
						|
27 effect conditions simplified
 | 
						|
0 implied preconditions added
 | 
						|
Detecting unreachable propositions...
 | 
						|
0 operators removed
 | 
						|
0 axioms removed
 | 
						|
12 propositions removed
 | 
						|
Detecting unreachable propositions: [0.030s CPU, 0.027s wall-clock]
 | 
						|
Reordering and filtering variables...
 | 
						|
15 of 15 variables necessary.
 | 
						|
3 of 15 mutex groups necessary.
 | 
						|
252 of 252 operators necessary.
 | 
						|
0 of 0 axiom rules necessary.
 | 
						|
Reordering and filtering variables: [0.010s CPU, 0.009s wall-clock]
 | 
						|
Translator variables: 15
 | 
						|
Translator derived variables: 0
 | 
						|
Translator facts: 78
 | 
						|
Translator goal facts: 10
 | 
						|
Translator mutex groups: 3
 | 
						|
Translator total mutex groups size: 12
 | 
						|
Translator operators: 252
 | 
						|
Translator axioms: 0
 | 
						|
Translator task size: 1168
 | 
						|
Translator peak memory: 33624 KB
 | 
						|
Writing output... [0.020s CPU, 0.024s wall-clock]
 | 
						|
Done! [0.300s CPU, 0.309s wall-clock]
 | 
						|
planner.py version 0.0.1
 | 
						|
 | 
						|
Time:	 0.10s
 | 
						|
Memory: 49MB
 | 
						|
 | 
						|
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:		 49MB (+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.02s
 | 
						|
Memory:		 50MB (+1MB)
 | 
						|
Unblocking actions...
 | 
						|
Solving...
 | 
						|
Answer: 1
 | 
						|
occurs(action(("board-truck","driver1","truck3","s1")),1) occurs(action(("walk","driver2","s2","p2-1")),1) occurs(action(("walk","driver3","s2","p2-1")),1) occurs(action(("drive-truck","truck3","s1","s2","driver1")),2) occurs(action(("load-truck","package5","truck1","s1")),2) occurs(action(("walk","driver2","p2-1","s1")),2) occurs(action(("walk","driver3","p2-1","s1")),2) occurs(action(("load-truck","package2","truck3","s2")),3) occurs(action(("board-truck","driver2","truck2","s1")),3) occurs(action(("board-truck","driver3","truck1","s1")),3) occurs(action(("drive-truck","truck3","s2","s1","driver1")),3) occurs(action(("unload-truck","package5","truck1","s1")),3) occurs(action(("unload-truck","package2","truck3","s1")),4) occurs(action(("drive-truck","truck2","s1","s0","driver2")),4) occurs(action(("load-truck","package4","truck1","s1")),4) occurs(action(("drive-truck","truck1","s1","s2","driver3")),4) occurs(action(("load-truck","package5","truck3","s1")),4) occurs(action(("drive-truck","truck3","s1","s0","driver1")),4) occurs(action(("unload-truck","package4","truck1","s2")),5) occurs(action(("unload-truck","package5","truck3","s0")),5) occurs(action(("disembark-truck","driver2","truck2","s0")),5) occurs(action(("disembark-truck","driver1","truck3","s0")),5) occurs(action(("drive-truck","truck1","s2","s1","driver3")),5)
 | 
						|
Solving Time:	 0.00s
 | 
						|
Memory:		 51MB (+1MB)
 | 
						|
SAT
 | 
						|
SATISFIABLE
 | 
						|
 | 
						|
Models       : 1+
 | 
						|
Calls        : 2
 | 
						|
Time         : 0.137s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
 | 
						|
CPU Time     : 0.130s
 | 
						|
 | 
						|
Choices      : 101     
 | 
						|
Conflicts    : 27       (Analyzed: 27)
 | 
						|
Restarts     : 0       
 | 
						|
Model-Level  : 28.0    
 | 
						|
Problems     : 2        (Average Length: 4.50 Splits: 0)
 | 
						|
Lemmas       : 33       (Deleted: 0)
 | 
						|
  Binary     : 13       (Ratio:  39.39%)
 | 
						|
  Ternary    : 3        (Ratio:   9.09%)
 | 
						|
  Conflict   : 27       (Average Length:    7.4 Ratio:  81.82%) 
 | 
						|
  Loop       : 6        (Average Length:    2.0 Ratio:  18.18%) 
 | 
						|
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
 | 
						|
Backjumps    : 27       (Average:  3.00 Max:  13 Sum:     81)
 | 
						|
  Executed   : 26       (Average:  2.96 Max:  13 Sum:     80 Ratio:  98.77%)
 | 
						|
  Bounded    : 1        (Average:  1.00 Max:   1 Sum:      1 Ratio:   1.23%)
 | 
						|
 | 
						|
Rules        : 25034   
 | 
						|
Atoms        : 25034   
 | 
						|
Bodies       : 1        (Original: 0)
 | 
						|
Tight        : Yes
 | 
						|
Variables    : 1429     (Eliminated:    0 Frozen:  555)
 | 
						|
Constraints  : 4339     (Binary:  90.5% Ternary:   5.5% Other:   4.0%)
 | 
						|
 | 
						|
Memory Peak  : 51MB
 | 
						|
Max. Length  : 5 steps
 | 
						|
Sol. Length  : 5 steps
 | 
						|
 | 
						|
 |