1
0
tplp-planning-benchmark/fd-pb-e3/ipc-2002_depots-strips-automatic_10.out

143 lines
8.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-10.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-10.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.007s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.022s wall-clock]
Preparing model... [0.020s CPU, 0.015s wall-clock]
Generated 43 rules.
Computing model... [0.180s CPU, 0.180s wall-clock]
1215 relevant atoms
1128 auxiliary atoms
2343 final queue length
4343 total queue pushes
Completing instantiation... [0.310s CPU, 0.308s wall-clock]
Instantiating: [0.530s CPU, 0.535s wall-clock]
Computing fact groups...
Finding invariants...
16 initial candidates
Finding invariants: [0.050s CPU, 0.047s wall-clock]
Checking invariant weight... [0.000s CPU, 0.003s wall-clock]
Instantiating groups... [0.040s CPU, 0.037s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
Choosing groups...
30 uncovered facts
Choosing groups: [0.010s CPU, 0.007s wall-clock]
Building translation key... [0.000s CPU, 0.003s wall-clock]
Computing fact groups: [0.110s CPU, 0.108s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.003s wall-clock]
Building mutex information...
Building mutex information: [0.010s CPU, 0.004s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.010s CPU, 0.017s wall-clock]
Translating task: [0.340s CPU, 0.346s wall-clock]
1080 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
38 propositions removed
Detecting unreachable propositions: [0.170s CPU, 0.173s wall-clock]
Reordering and filtering variables...
32 of 32 variables necessary.
24 of 32 mutex groups necessary.
816 of 816 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.090s CPU, 0.082s wall-clock]
Translator variables: 32
Translator derived variables: 0
Translator facts: 204
Translator goal facts: 4
Translator mutex groups: 24
Translator total mutex groups size: 252
Translator operators: 816
Translator axioms: 0
Translator task size: 7332
Translator peak memory: 37720 KB
Writing output... [0.120s CPU, 0.125s wall-clock]
Done! [1.400s CPU, 1.411s wall-clock]
planner.py version 0.0.1
Time: 1.30s
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.46s
Memory: 166MB (+51MB)
Unblocking actions...
Solving...
Solving Time: 0.02s
Memory: 166MB (+0MB)
UNSAT
Iteration Time: 0.56s
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.64s
Memory: 203MB (+37MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("lift","hoist0","crate1","pallet0","depot0")),1) occurs(action(("lift","hoist3","crate5","pallet3","distributor0")),1) occurs(action(("lift","hoist1","crate0","pallet1","depot1")),1) occurs(action(("drive","truck0","depot1","depot0")),1) occurs(action(("drive","truck1","depot2","distributor2")),1) occurs(action(("lift","hoist5","crate3","crate2","distributor2")),1) occurs(action(("lift","hoist2","crate4","pallet2","depot2")),1) occurs(action(("load","hoist5","crate3","truck1","distributor2")),2) occurs(action(("drive","truck1","distributor2","depot0")),2) occurs(action(("load","hoist0","crate1","truck0","depot0")),2) occurs(action(("drive","truck0","depot0","depot1")),2) occurs(action(("lift","hoist5","crate2","pallet5","distributor2")),3) occurs(action(("unload","hoist0","crate3","truck1","depot0")),3) occurs(action(("load","hoist1","crate0","truck0","depot1")),3) occurs(action(("drive","truck1","depot0","distributor2")),3) occurs(action(("drop","hoist0","crate3","pallet0","depot0")),4) occurs(action(("load","hoist5","crate2","truck1","distributor2")),4) occurs(action(("drive","truck0","depot1","depot0")),4) occurs(action(("drop","hoist3","crate5","pallet3","distributor0")),4) occurs(action(("unload","hoist1","crate1","truck0","depot1")),4) occurs(action(("drive","truck1","distributor2","depot2")),4) occurs(action(("lift","hoist3","crate5","pallet3","distributor0")),5) occurs(action(("unload","hoist0","crate0","truck0","depot0")),5) occurs(action(("load","hoist2","crate4","truck1","depot2")),5) occurs(action(("drop","hoist1","crate1","pallet1","depot1")),5) occurs(action(("drive","truck1","depot2","distributor2")),5) occurs(action(("unload","hoist5","crate4","truck1","distributor2")),6) occurs(action(("drive","truck0","depot0","distributor0")),6) occurs(action(("load","hoist0","crate0","truck0","depot0")),6) occurs(action(("drop","hoist3","crate5","pallet3","distributor0")),6) occurs(action(("drive","truck1","distributor2","depot2")),6) occurs(action(("drop","hoist5","crate4","pallet5","distributor2")),7) occurs(action(("lift","hoist3","crate5","pallet3","distributor0")),7) occurs(action(("lift","hoist1","crate1","pallet1","depot1")),7) occurs(action(("drive","truck1","depot2","distributor0")),7) occurs(action(("drive","truck0","distributor0","distributor2")),7) occurs(action(("lift","hoist0","crate3","pallet0","depot0")),8) occurs(action(("unload","hoist5","crate0","truck0","distributor2")),8) occurs(action(("load","hoist3","crate5","truck1","distributor0")),8) occurs(action(("drop","hoist0","crate3","pallet0","depot0")),9) occurs(action(("drop","hoist5","crate0","crate4","distributor2")),9) occurs(action(("unload","hoist3","crate2","truck1","distributor0")),9) occurs(action(("drive","truck0","distributor2","distributor0")),9) occurs(action(("drop","hoist3","crate2","pallet3","distributor0")),10) occurs(action(("drive","truck1","distributor0","depot1")),10) occurs(action(("drop","hoist1","crate1","pallet1","depot1")),10) occurs(action(("drive","truck0","distributor0","distributor1")),10)
Solving Time: 0.04s
Memory: 204MB (+1MB)
SAT
SATISFIABLE
Models : 1+
Calls : 3
Time : 2.654s (Solving: 0.02s 1st Model: 0.02s Unsat: 0.00s)
CPU Time : 2.630s
Choices : 364
Conflicts : 80 (Analyzed: 79)
Restarts : 0
Model-Level : 78.0
Problems : 3 (Average Length: 7.00 Splits: 0)
Lemmas : 79 (Deleted: 0)
Binary : 3 (Ratio: 3.80%)
Ternary : 6 (Ratio: 7.59%)
Conflict : 79 (Average Length: 72.1 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 79 (Average: 4.99 Max: 79 Sum: 394)
Executed : 71 (Average: 3.77 Max: 79 Sum: 298 Ratio: 75.63%)
Bounded : 8 (Average: 12.00 Max: 12 Sum: 96 Ratio: 24.37%)
Rules : 600477
Atoms : 600477
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 22264 (Eliminated: 0 Frozen: 18234)
Constraints : 72995 (Binary: 95.7% Ternary: 2.1% Other: 2.2%)
Memory Peak : 205MB
Max. Length : 10 steps
Sol. Length : 10 steps