tplp-planning-benchmark/fd-pc-e1-sh/ipc-1998_logistics-round-1-strips_33.out

147 lines
7.8 KiB
Plaintext
Raw Normal View History

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-33.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-33.pddl
Parsing...
Parsing: [0.020s CPU, 0.017s 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.020s CPU, 0.027s wall-clock]
Preparing model... [0.010s CPU, 0.014s wall-clock]
Generated 51 rules.
Computing model... [0.100s CPU, 0.093s wall-clock]
560 relevant atoms
534 auxiliary atoms
1094 final queue length
1317 total queue pushes
Completing instantiation... [0.080s CPU, 0.075s wall-clock]
Instantiating: [0.220s CPU, 0.215s wall-clock]
Computing fact groups...
Finding invariants...
6 initial candidates
Finding invariants: [0.000s CPU, 0.010s wall-clock]
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
Instantiating groups... [0.020s 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.010s CPU, 0.001s wall-clock]
Computing fact groups: [0.030s CPU, 0.031s 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.000s CPU, 0.003s wall-clock]
Translating task: [0.060s CPU, 0.058s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
17 propositions removed
Detecting unreachable propositions: [0.030s CPU, 0.035s wall-clock]
Reordering and filtering variables...
17 of 17 variables necessary.
0 of 17 mutex groups necessary.
318 of 318 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.010s CPU, 0.009s wall-clock]
Translator variables: 17
Translator derived variables: 0
Translator facts: 133
Translator goal facts: 7
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 318
Translator axioms: 0
Translator task size: 1405
Translator peak memory: 33880 KB
Writing output... [0.020s CPU, 0.030s wall-clock]
Done! [0.400s CPU, 0.403s wall-clock]
planner.py version 0.0.1
Time: 0.07s
Memory: 48MB
Iteration 1
Queue: [5]
Grounded Until: 0
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.03s
Memory: 50MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 51MB (+1MB)
UNSAT
Iteration Time: 0.05s
Iteration 2
Queue: [7]
Grounded Until: 5
Grounding... [('step', [6]), ('step', [7]), ('check', [7])]
Grounding Time: 0.01s
Memory: 51MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 51MB (+0MB)
UNSAT
Iteration Time: 0.02s
Iteration 3
Queue: [9]
Grounded Until: 7
Grounding... [('step', [8]), ('step', [9]), ('check', [9])]
Grounding Time: 0.01s
Memory: 51MB (+0MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("load-truck","package2","truck2","city1-2")),1) occurs(action(("load-truck","package7","truck8","city2-1")),1) occurs(action(("load-airplane","package1","plane1","city1-2")),1) occurs(action(("load-truck","package3","truck8","city2-1")),1) occurs(action(("drive-truck","truck1","city2-2","city2-1","city2")),2) occurs(action(("fly-airplane","plane1","city1-2","city2-2")),2) occurs(action(("drive-truck","truck8","city2-1","city2-2","city2")),2) occurs(action(("load-truck","package4","truck4","city3-1")),2) occurs(action(("unload-airplane","package1","plane1","city2-2")),3) occurs(action(("unload-truck","package3","truck8","city2-2")),3) occurs(action(("drive-truck","truck1","city2-1","city2-2","city2")),3) occurs(action(("load-truck","package1","truck1","city2-2")),4) occurs(action(("load-airplane","package3","plane1","city2-2")),4) occurs(action(("load-airplane","package5","plane1","city2-2")),4) occurs(action(("load-airplane","package6","plane1","city2-2")),4) occurs(action(("unload-truck","package7","truck8","city2-2")),5) occurs(action(("drive-truck","truck1","city2-2","city2-1","city2")),5) occurs(action(("drive-truck","truck2","city1-2","city1-1","city1")),5) occurs(action(("fly-airplane","plane1","city2-2","city3-2")),5) occurs(action(("drive-truck","truck4","city3-1","city3-2","city3")),5) occurs(action(("unload-truck","package1","truck1","city2-1")),6) occurs(action(("unload-truck","package2","truck2","city1-1")),6) occurs(action(("unload-airplane","package3","plane1","city3-2")),6) occurs(action(("unload-airplane","package5","plane1","city3-2")),6) occurs(action(("unload-airplane","package6","plane1","city3-2")),6) occurs(action(("drive-truck","truck3","city1-2","city1-1","city1")),6) occurs(action(("drive-truck","truck6","city1-2","city1-1","city1")),6) occurs(action(("unload-truck","package4","truck4","city3-2")),6) occurs(action(("drive-truck","truck8","city2-2","city2-1","city2")),6) occurs(action(("load-truck","package1","truck8","city2-1")),7) occurs(action(("load-truck","package3","truck4","city3-2")),7) occurs(action(("load-airplane","package4","plane1","city3-2")),7) occurs(action(("load-truck","package6","truck4","city3-2")),7) occurs(action(("drive-truck","truck1","city2-1","city2-2","city2")),7) occurs(action(("drive-truck","truck6","city1-1","city1-2","city1")),7) occurs(action(("drive-truck","truck3","city1-1","city1-2","city1")),7) occurs(action(("drive-truck","truck2","city1-1","city1-2","city1")),7) occurs(action(("drive-truck","truck2","city1-2","city1-1","city1")),8) occurs(action(("fly-airplane","plane1","city3-2","city2-2")),8) occurs(action(("unload-truck","package1","truck8","city2-1")),9) occurs(action(("unload-truck","package3","truck4","city3-2")),9) occurs(action(("unload-airplane","package4","plane1","city2-2")),9) occurs(action(("unload-truck","package6","truck4","city3-2")),9) occurs(action(("drive-truck","truck2","city1-1","city1-2","city1")),9)
Solving Time: 0.00s
Memory: 52MB (+1MB)
SAT
SATISFIABLE
Models : 1+
Calls : 3
Time : 0.163s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
CPU Time : 0.150s
Choices : 261
Conflicts : 30 (Analyzed: 28)
Restarts : 0
Model-Level : 124.0
Problems : 3 (Average Length: 9.00 Splits: 0)
Lemmas : 28 (Deleted: 0)
Binary : 4 (Ratio: 14.29%)
Ternary : 7 (Ratio: 25.00%)
Conflict : 28 (Average Length: 4.9 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 28 (Average: 7.25 Max: 21 Sum: 203)
Executed : 21 (Average: 5.29 Max: 21 Sum: 148 Ratio: 72.91%)
Bounded : 7 (Average: 7.86 Max: 11 Sum: 55 Ratio: 27.09%)
Rules : 0
Atoms : 0
Bodies : 0
Tight : Yes
Variables : 6103 (Eliminated: 0 Frozen: 2836)
Constraints : 19503 (Binary: 89.0% Ternary: 8.7% Other: 2.3%)
Memory Peak : 52MB
Max. Length : 9 steps
Sol. Length : 9 steps