143 lines
14 KiB
Plaintext
143 lines
14 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-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/logistics-round-1-strips/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/logistics-round-1-strips/instances/instance-15.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.030s CPU, 0.030s wall-clock]
|
||
|
|
Normalizing task... [0.010s CPU, 0.002s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.000s CPU, 0.009s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.030s CPU, 0.031s wall-clock]
|
||
|
|
Preparing model... [0.030s CPU, 0.022s wall-clock]
|
||
|
|
Generated 51 rules.
|
||
|
|
Computing model... [0.460s CPU, 0.466s wall-clock]
|
||
|
|
3520 relevant atoms
|
||
|
|
2762 auxiliary atoms
|
||
|
|
6282 final queue length
|
||
|
|
8165 total queue pushes
|
||
|
|
Completing instantiation... [0.560s CPU, 0.559s wall-clock]
|
||
|
|
Instantiating: [1.090s CPU, 1.093s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
6 initial candidates
|
||
|
|
Finding invariants: [0.010s CPU, 0.015s wall-clock]
|
||
|
|
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Instantiating groups... [0.050s CPU, 0.047s wall-clock]
|
||
|
|
Collecting mutex groups... [0.010s CPU, 0.004s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
0 uncovered facts
|
||
|
|
Choosing groups: [0.010s CPU, 0.012s wall-clock]
|
||
|
|
Building translation key... [0.010s CPU, 0.008s wall-clock]
|
||
|
|
Computing fact groups: [0.120s CPU, 0.120s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.004s wall-clock]
|
||
|
|
Building dictionary for full mutex groups... [0.000s CPU, 0.003s wall-clock]
|
||
|
|
Building mutex information...
|
||
|
|
Building mutex information: [0.000s CPU, 0.004s wall-clock]
|
||
|
|
Translating task...
|
||
|
|
Processing axioms...
|
||
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Processing axioms: [0.020s CPU, 0.026s wall-clock]
|
||
|
|
Translating task: [0.480s CPU, 0.486s wall-clock]
|
||
|
|
0 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
35 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.260s CPU, 0.258s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
26 of 35 variables necessary.
|
||
|
|
0 of 35 mutex groups necessary.
|
||
|
|
1620 of 2538 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.060s CPU, 0.054s wall-clock]
|
||
|
|
Translator variables: 26
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 471
|
||
|
|
Translator goal facts: 14
|
||
|
|
Translator mutex groups: 0
|
||
|
|
Translator total mutex groups size: 0
|
||
|
|
Translator operators: 1620
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 6799
|
||
|
|
Translator peak memory: 40792 KB
|
||
|
|
Writing output... [0.120s CPU, 0.138s wall-clock]
|
||
|
|
Done! [2.200s CPU, 2.211s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 1.21s
|
||
|
|
Memory: 115MB
|
||
|
|
|
||
|
|
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.01s
|
||
|
|
Memory: 115MB (+0MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.01s
|
||
|
|
|
||
|
|
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.19s
|
||
|
|
Memory: 134MB (+19MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.01s
|
||
|
|
Memory: 137MB (+3MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.27s
|
||
|
|
|
||
|
|
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.21s
|
||
|
|
Memory: 147MB (+10MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Answer: 1
|
||
|
|
occurs(action(("load-airplane","package12","plane5","city1-6")),1) occurs(action(("fly-airplane","plane3","city3-6","city1-6")),2) occurs(action(("fly-airplane","plane6","city2-6","city1-6")),2) occurs(action(("fly-airplane","plane1","city2-6","city3-6")),2) occurs(action(("fly-airplane","plane2","city1-6","city3-6")),2) occurs(action(("fly-airplane","plane5","city1-6","city3-6")),2) occurs(action(("fly-airplane","plane7","city1-6","city3-6")),2) occurs(action(("drive-truck","truck4","city2-3","city2-4","city2")),2) occurs(action(("load-truck","package17","truck4","city2-3")),2) occurs(action(("load-truck","package20","truck4","city2-3")),2) occurs(action(("drive-truck","truck5","city3-4","city3-3","city3")),3) occurs(action(("drive-truck","truck3","city1-5","city1-6","city1")),3) occurs(action(("unload-airplane","package12","plane5","city3-6")),3) occurs(action(("fly-airplane","plane4","city1-6","city3-6")),3) occurs(action(("drive-truck","truck2","city1-3","city1-2","city1")),3) occurs(action(("drive-truck","truck4","city2-4","city2-2","city2")),3) occurs(action(("fly-airplane","plane5","city3-6","city1-6")),3) occurs(action(("fly-airplane","plane7","city3-6","city1-6")),3) occurs(action(("fly-airplane","plane1","city3-6","city2-6")),3) occurs(action(("fly-airplane","plane6","city1-6","city2-6")),3) occurs(action(("fly-airplane","plane3","city1-6","city3-6")),3) occurs(action(("load-truck","package21","truck4","city2-4")),3) occurs(action(("load-truck","package13","truck5","city3-4")),3) occurs(action(("load-truck","package23","truck3","city1-5")),3) occurs(action(("drive-truck","truck1","city1-6","city1-3","city1")),4) occurs(action(("fly-airplane","plane1","city2-6","city1-6")),4) occurs(action(("drive-truck","truck5","city3-3","city3-5","city3")),4) occurs(action(("drive-truck","truck4","city2-2","city2-1","city2")),4) occurs(action(("fly-airplane","plane2","city3-6","city1-6")),4) occurs(action(("fly-airplane","plane4","city3-6","city1-6")),4) occurs(action(("drive-truck","truck2","city1-2","city1-3","city1")),4) occurs(action(("load-truck","package10","truck5","city3-3")),4) occurs(action(("load-airplane","package12","plane3","city3-6")),4) occurs(action(("unload-truck","package23","truck3","city1-6")),4) occurs(action(("load-truck","package15","truck4","city2-2")),4) occurs(action(("load-truck","package18","truck5","city3-3")),4) occurs(action(("drive-truck","truck4","city2-1","city2-6","city2")),5) occurs(action(("unload-airplane","package12","plane3","city3-6")),5) occurs(action(("drive-truck","truck5","city3-5","city3-6","city3")),5) occurs(action(("drive-truck","truck1","city1-3","city1-4","city1")),5) occurs(action(("drive-truck","truck2","city1-3","city1-4","city1")),5) occurs(action(("drive-truck","truck3","city1-6","city1-2","city1")),5) occurs(action(("fly-airplane","plane1","city1-6","city2-6")),5) occurs(action(("load-airplane","package23","plane1","city1-6")),5) occurs(action(("load-truck","package14","truck4","city2-1")),5) occurs(action(("load-truck","package16","truck5","city3-5")),5) occurs(action(("fly-airplane","plane2","city1-6","city2-6")),6) occurs(action(("fly-airplane","plane4","city1-6","city2-6")),6) occurs(action(("fly-airplane","plane7","city1-6","city2-6")),6) occurs(action(("load-truck","package12","truck5","city3-6")),6) occurs(action(("drive-truck","truck5","city3-6","city3-3","city3")),6) occurs(action(("drive-truck","truck1","city1-4","city1-5","city1")),6) occurs(action(("drive-truck","truck2","city1-4","city1-1","city1")),6) occurs(action(("fly-airplane","plane6","city2-6","city1-6")),6) occurs(action(("unload-truck","package10","truck5","city3-6")),6) occurs(action(("fly-airplane","plane1","city2-6","city3-6")),6) occurs(action(("unload-truck","package21","truck4","city2-6")),6) occurs(action(("unload-airplane","package23","plane1","city2-6")),6) occurs(action(("load-truck","package11","truck2","city1-4")),6) occurs(action(("unload-truck","package13","truck5","city3-6")),6) occurs(action(("unload-truck","package14","truck4","city2-6")),6) occurs(action(("unload-truck","package
|
||
|
|
Solving Time: 0.02s
|
||
|
|
Memory: 152MB (+5MB)
|
||
|
|
SAT
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 3
|
||
|
|
Time : 1.824s (Solving: 0.01s 1st Model: 0.01s Unsat: 0.00s)
|
||
|
|
CPU Time : 1.790s
|
||
|
|
|
||
|
|
Choices : 626
|
||
|
|
Conflicts : 45 (Analyzed: 45)
|
||
|
|
Restarts : 0
|
||
|
|
Model-Level : 327.0
|
||
|
|
Problems : 3 (Average Length: 7.00 Splits: 0)
|
||
|
|
Lemmas : 45 (Deleted: 0)
|
||
|
|
Binary : 0 (Ratio: 0.00%)
|
||
|
|
Ternary : 0 (Ratio: 0.00%)
|
||
|
|
Conflict : 45 (Average Length: 58.1 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 45 (Average: 6.91 Max: 59 Sum: 311)
|
||
|
|
Executed : 45 (Average: 6.91 Max: 59 Sum: 311 Ratio: 100.00%)
|
||
|
|
Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%)
|
||
|
|
|
||
|
|
Rules : 590204
|
||
|
|
Atoms : 590204
|
||
|
|
Bodies : 1 (Original: 0)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 28208 (Eliminated: 0 Frozen: 0)
|
||
|
|
Constraints : 77762 (Binary: 90.9% Ternary: 6.7% Other: 2.4%)
|
||
|
|
|
||
|
|
Memory Peak : 153MB
|
||
|
|
Max. Length : 10 steps
|
||
|
|
Sol. Length : 10 steps
|
||
|
|
|
||
|
|
|