tplp-planning-benchmark/fd-pb-e2/ipc-2002_depots-strips-automatic_7.out

143 lines
7.4 KiB
Plaintext
Raw Normal View History

INFO Running translator.
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/depots-strips-automatic/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/depots-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/depots-strips-automatic/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/depots-strips-automatic/instances/instance-7.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.006s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.021s wall-clock]
Preparing model... [0.010s CPU, 0.013s wall-clock]
Generated 43 rules.
Computing model... [0.100s CPU, 0.100s wall-clock]
693 relevant atoms
630 auxiliary atoms
1323 final queue length
2339 total queue pushes
Completing instantiation... [0.150s CPU, 0.157s wall-clock]
Instantiating: [0.290s CPU, 0.298s wall-clock]
Computing fact groups...
Finding invariants...
16 initial candidates
Finding invariants: [0.040s CPU, 0.039s wall-clock]
Checking invariant weight... [0.010s CPU, 0.003s wall-clock]
Instantiating groups... [0.020s CPU, 0.024s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
Choosing groups...
24 uncovered facts
Choosing groups: [0.000s CPU, 0.006s wall-clock]
Building translation key... [0.010s CPU, 0.002s wall-clock]
Computing fact groups: [0.090s CPU, 0.082s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.002s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.003s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.010s CPU, 0.009s wall-clock]
Translating task: [0.180s CPU, 0.179s wall-clock]
558 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
32 propositions removed
Detecting unreachable propositions: [0.090s CPU, 0.091s wall-clock]
Reordering and filtering variables...
29 of 29 variables necessary.
21 of 29 mutex groups necessary.
408 of 408 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.050s CPU, 0.048s wall-clock]
Translator variables: 29
Translator derived variables: 0
Translator facts: 156
Translator goal facts: 5
Translator mutex groups: 21
Translator total mutex groups size: 177
Translator operators: 408
Translator axioms: 0
Translator task size: 3877
Translator peak memory: 35416 KB
Writing output... [0.060s CPU, 0.067s wall-clock]
Done! [0.790s CPU, 0.797s wall-clock]
planner.py version 0.0.1
Time: 0.43s
Memory: 68MB
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: 68MB (+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.37s
Memory: 113MB (+45MB)
Unblocking actions...
Solving...
Solving Time: 0.03s
Memory: 117MB (+4MB)
UNSAT
Iteration Time: 0.45s
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.42s
Memory: 141MB (+24MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("lift","hoist0","crate5","pallet0","depot0")),1) occurs(action(("lift","hoist2","crate1","pallet5","distributor1")),1) occurs(action(("lift","hoist1","crate4","crate0","distributor0")),1) occurs(action(("drive","truck0","distributor1","distributor0")),1) occurs(action(("drive","truck1","depot0","distributor0")),1) occurs(action(("drop","hoist2","crate1","crate3","distributor1")),2) occurs(action(("load","hoist1","crate4","truck1","distributor0")),2) occurs(action(("drive","truck1","distributor0","distributor1")),2) occurs(action(("drive","truck0","distributor0","distributor1")),2) occurs(action(("unload","hoist2","crate4","truck1","distributor1")),3) occurs(action(("lift","hoist1","crate0","pallet4","distributor0")),3) occurs(action(("drop","hoist0","crate5","pallet0","depot0")),3) occurs(action(("drive","truck1","distributor1","depot0")),3) occurs(action(("drop","hoist2","crate4","pallet5","distributor1")),4) occurs(action(("lift","hoist0","crate5","pallet0","depot0")),5) occurs(action(("lift","hoist2","crate1","crate3","distributor1")),5) occurs(action(("drive","truck0","distributor1","depot0")),5) occurs(action(("drive","truck1","depot0","distributor1")),5) occurs(action(("drop","hoist2","crate1","crate4","distributor1")),6) occurs(action(("drop","hoist1","crate0","pallet3","distributor0")),6) occurs(action(("load","hoist0","crate5","truck0","depot0")),6) occurs(action(("drive","truck0","depot0","distributor0")),6) occurs(action(("lift","hoist1","crate0","pallet3","distributor0")),7) occurs(action(("lift","hoist2","crate3","crate2","distributor1")),7) occurs(action(("drive","truck0","distributor0","distributor1")),7) occurs(action(("drive","truck1","distributor1","depot0")),7) occurs(action(("drop","hoist1","crate0","pallet3","distributor0")),8) occurs(action(("load","hoist2","crate3","truck0","distributor1")),8) occurs(action(("unload","hoist2","crate5","truck0","distributor1")),9) occurs(action(("unload","hoist1","crate3","truck0","distributor0")),9) occurs(action(("drive","truck0","distributor1","distributor0")),9) occurs(action(("drive","truck1","depot0","distributor0")),9) occurs(action(("drop","hoist2","crate5","crate1","distributor1")),10) occurs(action(("drop","hoist1","crate3","pallet1","distributor0")),10)
Solving Time: 0.21s
Memory: 145MB (+4MB)
SAT
SATISFIABLE
Models : 1+
Calls : 3
Time : 1.608s (Solving: 0.19s 1st Model: 0.18s Unsat: 0.01s)
CPU Time : 1.590s
Choices : 2658
Conflicts : 1123 (Analyzed: 1122)
Restarts : 16 (Average: 70.12 Last: 54)
Model-Level : 70.0
Problems : 3 (Average Length: 7.00 Splits: 0)
Lemmas : 1278 (Deleted: 0)
Binary : 200 (Ratio: 15.65%)
Ternary : 103 (Ratio: 8.06%)
Conflict : 1122 (Average Length: 20.0 Ratio: 87.79%)
Loop : 156 (Average Length: 43.5 Ratio: 12.21%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 1122 (Average: 4.05 Max: 30 Sum: 4547)
Executed : 939 (Average: 2.32 Max: 30 Sum: 2599 Ratio: 57.16%)
Bounded : 183 (Average: 10.64 Max: 12 Sum: 1948 Ratio: 42.84%)
Rules : 168775
Atoms : 168775
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 28576 (Eliminated: 0 Frozen: 26873)
Constraints : 97602 (Binary: 87.8% Ternary: 6.7% Other: 5.5%)
Memory Peak : 145MB
Max. Length : 10 steps
Sol. Length : 10 steps