1
0
tplp-planning-benchmark/fd-pa-e1-sh/ipc-2002_depots-strips-automatic_7.out

143 lines
7.1 KiB
Plaintext

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.000s CPU, 0.006s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.021s wall-clock]
Preparing model... [0.020s CPU, 0.012s wall-clock]
Generated 43 rules.
Computing model... [0.090s CPU, 0.098s wall-clock]
693 relevant atoms
630 auxiliary atoms
1323 final queue length
2339 total queue pushes
Completing instantiation... [0.160s CPU, 0.158s wall-clock]
Instantiating: [0.290s CPU, 0.296s wall-clock]
Computing fact groups...
Finding invariants...
16 initial candidates
Finding invariants: [0.040s CPU, 0.040s wall-clock]
Checking invariant weight... [0.010s CPU, 0.003s wall-clock]
Instantiating groups... [0.020s CPU, 0.026s wall-clock]
Collecting mutex groups... [0.010s CPU, 0.001s wall-clock]
Choosing groups...
24 uncovered facts
Choosing groups: [0.000s CPU, 0.006s wall-clock]
Building translation key... [0.000s CPU, 0.002s wall-clock]
Computing fact groups: [0.090s CPU, 0.086s 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.066s wall-clock]
Done! [0.790s CPU, 0.799s wall-clock]
planner.py version 0.0.1
Time: 0.20s
Memory: 54MB
Iteration 1
Queue: [0, 5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75]
Grounded Until: 0
Solving...
Solving Time: 0.00s
Memory: 54MB (+0MB)
UNSAT
Iteration Time: 0.00s
Iteration 2
Queue: [5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80]
Grounded Until: 0
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.07s
Memory: 55MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 57MB (+2MB)
UNSAT
Iteration Time: 0.09s
Iteration 3
Queue: [10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85]
Grounded Until: 5
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 0.07s
Memory: 59MB (+2MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("lift","hoist0","crate5","pallet0","depot0")),1) occurs(action(("lift","hoist2","crate3","crate2","distributor1")),1) occurs(action(("lift","hoist1","crate4","crate0","distributor0")),1) occurs(action(("load","hoist2","crate3","truck0","distributor1")),2) occurs(action(("drive","truck1","depot0","distributor0")),2) occurs(action(("lift","hoist2","crate1","pallet5","distributor1")),3) occurs(action(("load","hoist1","crate4","truck1","distributor0")),3) occurs(action(("drive","truck0","distributor1","depot0")),3) occurs(action(("drop","hoist0","crate5","pallet0","depot0")),3) occurs(action(("lift","hoist1","crate0","pallet4","distributor0")),4) occurs(action(("drop","hoist2","crate1","crate2","distributor1")),4) occurs(action(("drive","truck1","distributor0","distributor1")),4) occurs(action(("unload","hoist0","crate3","truck0","depot0")),4) occurs(action(("unload","hoist2","crate4","truck1","distributor1")),5) occurs(action(("load","hoist0","crate3","truck0","depot0")),5) occurs(action(("drop","hoist1","crate0","pallet1","distributor0")),5) occurs(action(("drop","hoist2","crate4","pallet5","distributor1")),6) occurs(action(("lift","hoist0","crate5","pallet0","depot0")),6) occurs(action(("lift","hoist1","crate0","pallet1","distributor0")),6) occurs(action(("drive","truck0","depot0","distributor1")),6) occurs(action(("drive","truck1","distributor1","depot0")),6) occurs(action(("lift","hoist2","crate1","crate2","distributor1")),7) occurs(action(("load","hoist0","crate5","truck1","depot0")),7) occurs(action(("drive","truck0","distributor1","depot0")),7) occurs(action(("drop","hoist2","crate1","crate4","distributor1")),8) occurs(action(("drop","hoist1","crate0","pallet3","distributor0")),8) occurs(action(("drive","truck1","depot0","distributor1")),8) occurs(action(("drive","truck0","depot0","distributor0")),8) occurs(action(("unload","hoist2","crate5","truck1","distributor1")),9) occurs(action(("unload","hoist1","crate3","truck0","distributor0")),9) occurs(action(("drop","hoist2","crate5","crate1","distributor1")),10) occurs(action(("drop","hoist1","crate3","pallet1","distributor0")),10)
Solving Time: 0.01s
Memory: 61MB (+2MB)
SAT
SATISFIABLE
Models : 1+
Calls : 3
Time : 0.395s (Solving: 0.01s 1st Model: 0.01s Unsat: 0.00s)
CPU Time : 0.380s
Choices : 183
Conflicts : 46 (Analyzed: 45)
Restarts : 0
Model-Level : 47.0
Problems : 3 (Average Length: 7.00 Splits: 0)
Lemmas : 45 (Deleted: 0)
Binary : 9 (Ratio: 20.00%)
Ternary : 7 (Ratio: 15.56%)
Conflict : 45 (Average Length: 24.5 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.29 Max: 24 Sum: 283)
Executed : 31 (Average: 3.29 Max: 24 Sum: 148 Ratio: 52.30%)
Bounded : 14 (Average: 9.64 Max: 12 Sum: 135 Ratio: 47.70%)
Rules : 12676
Atoms : 12676
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 7423 (Eliminated: 0 Frozen: 4868)
Constraints : 49096 (Binary: 93.6% Ternary: 3.1% Other: 3.3%)
Memory Peak : 61MB
Max. Length : 10 steps
Sol. Length : 10 steps