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

143 lines
8.7 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-14.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-14.pddl
Parsing...
Parsing: [0.020s CPU, 0.027s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.011s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.030s CPU, 0.040s wall-clock]
Preparing model... [0.020s CPU, 0.023s wall-clock]
Generated 43 rules.
Computing model... [0.390s CPU, 0.389s wall-clock]
2763 relevant atoms
2328 auxiliary atoms
5091 final queue length
10383 total queue pushes
Completing instantiation... [0.820s CPU, 0.820s wall-clock]
Instantiating: [1.270s CPU, 1.288s wall-clock]
Computing fact groups...
Finding invariants...
16 initial candidates
Finding invariants: [0.040s CPU, 0.041s wall-clock]
Checking invariant weight... [0.010s CPU, 0.005s wall-clock]
Instantiating groups... [0.070s CPU, 0.068s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.003s wall-clock]
Choosing groups...
42 uncovered facts
Choosing groups: [0.020s CPU, 0.015s wall-clock]
Building translation key... [0.000s CPU, 0.005s wall-clock]
Computing fact groups: [0.160s CPU, 0.158s wall-clock]
Building STRIPS to SAS dictionary... [0.010s CPU, 0.002s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.005s wall-clock]
Building mutex information...
Building mutex information: [0.010s CPU, 0.008s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.040s CPU, 0.043s wall-clock]
Translating task: [0.930s CPU, 0.926s wall-clock]
3040 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
54 propositions removed
Detecting unreachable propositions: [0.450s CPU, 0.458s wall-clock]
Reordering and filtering variables...
48 of 48 variables necessary.
36 of 48 mutex groups necessary.
2080 of 2080 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.220s CPU, 0.227s wall-clock]
Translator variables: 48
Translator derived variables: 0
Translator facts: 404
Translator goal facts: 7
Translator mutex groups: 36
Translator total mutex groups size: 496
Translator operators: 2080
Translator axioms: 0
Translator task size: 19515
Translator peak memory: 45400 KB
Writing output... [0.290s CPU, 0.318s wall-clock]
Done! [3.410s CPU, 3.458s wall-clock]
planner.py version 0.0.1
Time: 6.76s
Memory: 384MB
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.03s
Memory: 384MB (+0MB)
UNSAT
Iteration Time: 0.03s
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: 3.87s
Memory: 756MB (+372MB)
Unblocking actions...
Solving...
Solving Time: 0.13s
Memory: 761MB (+5MB)
UNSAT
Iteration Time: 4.43s
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: 3.59s
Memory: 893MB (+132MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("lift","hoist3","crate9","crate2","distributor0")),1) occurs(action(("lift","hoist1","crate8","pallet1","depot1")),1) occurs(action(("lift","hoist0","crate4","pallet0","depot0")),1) occurs(action(("drive","truck1","depot2","distributor0")),1) occurs(action(("lift","hoist5","crate3","pallet6","distributor2")),1) occurs(action(("drive","truck0","depot1","distributor1")),1) occurs(action(("lift","hoist4","crate7","crate6","distributor1")),1) occurs(action(("load","hoist3","crate9","truck1","distributor0")),2) occurs(action(("load","hoist4","crate7","truck0","distributor1")),2) occurs(action(("drive","truck0","distributor1","depot1")),2) occurs(action(("drive","truck1","distributor0","depot2")),2) occurs(action(("unload","hoist2","crate9","truck1","depot2")),3) occurs(action(("lift","hoist3","crate2","pallet3","distributor0")),3) occurs(action(("drive","truck0","depot1","distributor1")),3) occurs(action(("drop","hoist0","crate4","pallet0","depot0")),3) occurs(action(("lift","hoist4","crate6","pallet4","distributor1")),3) occurs(action(("load","hoist1","crate8","truck0","depot1")),3) occurs(action(("drive","truck1","depot2","depot0")),4) occurs(action(("load","hoist2","crate9","truck1","depot2")),4) occurs(action(("load","hoist4","crate6","truck0","distributor1")),4) occurs(action(("lift","hoist0","crate5","crate1","depot0")),4) occurs(action(("drive","truck0","distributor1","depot1")),4) occurs(action(("unload","hoist1","crate6","truck0","depot1")),5) occurs(action(("lift","hoist4","crate0","pallet8","distributor1")),5) occurs(action(("drive","truck0","depot1","depot2")),5) occurs(action(("load","hoist0","crate5","truck1","depot0")),5) occurs(action(("drive","truck1","depot0","distributor2")),5) occurs(action(("drop","hoist5","crate3","pallet6","distributor2")),5) occurs(action(("drop","hoist1","crate6","pallet1","depot1")),6) occurs(action(("unload","hoist5","crate5","truck1","distributor2")),6) occurs(action(("drive","truck1","distributor2","depot0")),6) occurs(action(("lift","hoist0","crate1","pallet9","depot0")),6) occurs(action(("drop","hoist4","crate0","pallet4","distributor1")),6) occurs(action(("unload","hoist2","crate8","truck0","depot2")),6) occurs(action(("drive","truck0","depot2","depot1")),6) occurs(action(("drop","hoist5","crate5","pallet5","distributor2")),7) occurs(action(("unload","hoist1","crate7","truck0","depot1")),7) occurs(action(("drive","truck0","depot1","distributor1")),7) occurs(action(("load","hoist0","crate1","truck1","depot0")),7) occurs(action(("drive","truck1","depot0","distributor1")),7) occurs(action(("drop","hoist3","crate2","pallet3","distributor0")),7) occurs(action(("drop","hoist1","crate7","crate6","depot1")),8) occurs(action(("unload","hoist4","crate1","truck1","distributor1")),8) occurs(action(("lift","hoist0","crate4","pallet0","depot0")),8) occurs(action(("lift","hoist3","crate2","pallet3","distributor0")),8) occurs(action(("lift","hoist5","crate3","pallet6","distributor2")),8) occurs(action(("drive","truck1","distributor1","depot1")),8) occurs(action(("drop","hoist4","crate1","pallet8","distributor1")),9) occurs(action(("unload","hoist1","crate9","truck1","depot1")),9) occurs(action(("drive","truck1","depot1","distributor0")),9) occurs(action(("drop","hoist1","crate9","crate7","depot1")),10) occurs(action(("drive","truck0","distributor1","depot2")),10) occurs(action(("drop","hoist2","crate8","pallet2","depot2")),10) occurs(action(("drop","hoist3","crate2","pallet3","distributor0")),10) occurs(action(("drop","hoist0","crate4","pallet0","depot0")),10) occurs(action(("drop","hoist5","crate3","pallet6","distributor2")),10)
Solving Time: 0.21s
Memory: 900MB (+7MB)
SAT
SATISFIABLE
Models : 1+
Calls : 3
Time : 15.642s (Solving: 0.06s 1st Model: 0.06s Unsat: 0.00s)
CPU Time : 15.550s
Choices : 229
Conflicts : 39 (Analyzed: 38)
Restarts : 0
Model-Level : 105.0
Problems : 3 (Average Length: 7.00 Splits: 0)
Lemmas : 38 (Deleted: 0)
Binary : 3 (Ratio: 7.89%)
Ternary : 2 (Ratio: 5.26%)
Conflict : 38 (Average Length: 47.2 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 38 (Average: 3.92 Max: 39 Sum: 149)
Executed : 36 (Average: 3.58 Max: 39 Sum: 136 Ratio: 91.28%)
Bounded : 2 (Average: 6.50 Max: 12 Sum: 13 Ratio: 8.72%)
Rules : 3032292
Atoms : 3032292
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 55458 (Eliminated: 0 Frozen: 49468)
Constraints : 187028 (Binary: 97.0% Ternary: 1.5% Other: 1.4%)
Memory Peak : 925MB
Max. Length : 10 steps
Sol. Length : 10 steps