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

143 lines
7.5 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.016s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.005s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.020s wall-clock]
Preparing model... [0.010s CPU, 0.012s wall-clock]
Generated 43 rules.
Computing model... [0.100s CPU, 0.094s 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.292s wall-clock]
Computing fact groups...
Finding invariants...
16 initial candidates
Finding invariants: [0.040s CPU, 0.038s wall-clock]
Checking invariant weight... [0.000s CPU, 0.003s wall-clock]
Instantiating groups... [0.020s CPU, 0.025s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
Choosing groups...
24 uncovered facts
Choosing groups: [0.010s CPU, 0.006s wall-clock]
Building translation key... [0.000s CPU, 0.002s wall-clock]
Computing fact groups: [0.080s CPU, 0.083s 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.170s CPU, 0.178s 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.100s CPU, 0.090s 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.040s 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.780s CPU, 0.789s wall-clock]
planner.py version 0.0.1
Time: 0.17s
Memory: 54MB
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: 54MB (+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.05s
Memory: 54MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 55MB (+1MB)
UNSAT
Iteration Time: 0.07s
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.05s
Memory: 58MB (+3MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("lift","hoist0","crate5","pallet0","depot0")),1) occurs(action(("lift","hoist2","crate1","pallet5","distributor1")),1) occurs(action(("drive","truck1","depot0","distributor1")),1) occurs(action(("lift","hoist1","crate4","crate0","distributor0")),1) occurs(action(("drive","truck0","distributor1","distributor0")),1) occurs(action(("load","hoist1","crate4","truck0","distributor0")),2) occurs(action(("load","hoist2","crate1","truck1","distributor1")),2) occurs(action(("drive","truck0","distributor0","distributor1")),2) occurs(action(("drive","truck1","distributor1","depot0")),2) occurs(action(("unload","hoist2","crate4","truck0","distributor1")),3) occurs(action(("lift","hoist1","crate0","pallet4","distributor0")),3) occurs(action(("drive","truck0","distributor1","depot0")),3) occurs(action(("drive","truck1","depot0","distributor1")),3) occurs(action(("drop","hoist2","crate4","pallet5","distributor1")),4) occurs(action(("drop","hoist1","crate0","pallet1","distributor0")),4) occurs(action(("drive","truck0","depot0","distributor1")),4) occurs(action(("drive","truck1","distributor1","depot0")),4) occurs(action(("lift","hoist1","crate0","pallet1","distributor0")),5) occurs(action(("lift","hoist2","crate3","crate2","distributor1")),5) occurs(action(("drop","hoist1","crate0","pallet3","distributor0")),6) occurs(action(("load","hoist0","crate5","truck1","depot0")),6) occurs(action(("load","hoist2","crate3","truck0","distributor1")),6) occurs(action(("drive","truck1","depot0","distributor1")),6) occurs(action(("drive","truck0","distributor1","distributor0")),6) occurs(action(("unload","hoist1","crate3","truck0","distributor0")),7) occurs(action(("unload","hoist2","crate1","truck1","distributor1")),7) occurs(action(("drive","truck1","distributor1","distributor0")),7) occurs(action(("drive","truck0","distributor0","distributor1")),7) occurs(action(("drop","hoist1","crate3","pallet1","distributor0")),8) occurs(action(("drop","hoist2","crate1","crate4","distributor1")),8) occurs(action(("drive","truck1","distributor0","distributor1")),8) occurs(action(("unload","hoist2","crate5","truck1","distributor1")),9) occurs(action(("lift","hoist1","crate0","pallet3","distributor0")),9) occurs(action(("drop","hoist2","crate5","crate1","distributor1")),10) occurs(action(("drop","hoist1","crate0","pallet3","distributor0")),10) occurs(action(("drive","truck0","distributor1","distributor0")),10) occurs(action(("drive","truck1","distributor1","depot0")),10)
Solving Time: 0.01s
Memory: 59MB (+1MB)
SAT
SATISFIABLE
Models : 1+
Calls : 3
Time : 0.319s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
CPU Time : 0.300s
Choices : 202
Conflicts : 49 (Analyzed: 48)
Restarts : 0
Model-Level : 60.0
Problems : 3 (Average Length: 7.00 Splits: 0)
Lemmas : 48 (Deleted: 0)
Binary : 9 (Ratio: 18.75%)
Ternary : 4 (Ratio: 8.33%)
Conflict : 48 (Average Length: 34.8 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 48 (Average: 3.73 Max: 18 Sum: 179)
Executed : 45 (Average: 3.21 Max: 18 Sum: 154 Ratio: 86.03%)
Bounded : 3 (Average: 8.33 Max: 12 Sum: 25 Ratio: 13.97%)
Rules : 11512
Atoms : 11512
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 6625 (Eliminated: 0 Frozen: 1251)
Constraints : 38896 (Binary: 93.9% Ternary: 3.2% Other: 2.9%)
Memory Peak : 59MB
Max. Length : 10 steps
Sol. Length : 10 steps