1
0
tplp-planning-benchmark/fd-pb-e1-sh-h/ipc-2002_depots-strips-automatic_17.out

143 lines
7.4 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-17.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-17.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.008s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.021s wall-clock]
Preparing model... [0.020s CPU, 0.017s wall-clock]
Generated 43 rules.
Computing model... [0.400s CPU, 0.408s wall-clock]
3667 relevant atoms
1884 auxiliary atoms
5551 final queue length
12993 total queue pushes
Completing instantiation... [1.100s CPU, 1.097s wall-clock]
Instantiating: [1.540s CPU, 1.557s wall-clock]
Computing fact groups...
Finding invariants...
16 initial candidates
Finding invariants: [0.060s CPU, 0.050s wall-clock]
Checking invariant weight... [0.000s CPU, 0.005s wall-clock]
Instantiating groups... [0.070s CPU, 0.070s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.003s wall-clock]
Choosing groups...
42 uncovered facts
Choosing groups: [0.020s CPU, 0.016s wall-clock]
Building translation key... [0.010s CPU, 0.005s wall-clock]
Computing fact groups: [0.180s CPU, 0.170s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.006s wall-clock]
Building mutex information...
Building mutex information: [0.020s CPU, 0.009s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.050s CPU, 0.059s wall-clock]
Translating task: [1.310s CPU, 1.318s wall-clock]
3930 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
56 propositions removed
Detecting unreachable propositions: [0.620s CPU, 0.619s wall-clock]
Reordering and filtering variables...
50 of 50 variables necessary.
36 of 50 mutex groups necessary.
2938 of 2938 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.290s CPU, 0.287s wall-clock]
Translator variables: 50
Translator derived variables: 0
Translator facts: 408
Translator goal facts: 7
Translator mutex groups: 36
Translator total mutex groups size: 556
Translator operators: 2938
Translator axioms: 0
Translator task size: 26125
Translator peak memory: 49496 KB
Writing output... [0.410s CPU, 0.434s wall-clock]
Done! [4.440s CPU, 4.475s wall-clock]
planner.py version 0.0.1
Time: 0.90s
Memory: 109MB
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: 109MB (+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.50s
Memory: 111MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.03s
Memory: 119MB (+8MB)
UNSAT
Iteration Time: 0.69s
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.50s
Memory: 133MB (+14MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("lift","hoist4","crate3","pallet6","depot0")),1) occurs(action(("lift","hoist3","crate7","crate5","distributor1")),1) occurs(action(("lift","hoist1","crate4","pallet1","depot1")),1) occurs(action(("drive","truck1","distributor1","depot1")),1) occurs(action(("drive","truck0","depot1","distributor1")),1) occurs(action(("drive","truck2","depot1","distributor1")),1) occurs(action(("drive","truck3","depot0","distributor1")),1) occurs(action(("lift","hoist7","crate8","crate6","distributor1")),1) occurs(action(("load","hoist7","crate8","truck2","distributor1")),2) occurs(action(("load","hoist3","crate7","truck0","distributor1")),2) occurs(action(("load","hoist1","crate4","truck1","depot1")),2) occurs(action(("lift","hoist3","crate1","pallet5","distributor1")),3) occurs(action(("lift","hoist7","crate6","pallet7","distributor1")),3) occurs(action(("drive","truck0","distributor1","depot0")),3) occurs(action(("drive","truck1","depot1","depot0")),3) occurs(action(("drive","truck2","distributor1","depot0")),3) occurs(action(("drop","hoist3","crate1","pallet7","distributor1")),4) occurs(action(("unload","hoist0","crate8","truck2","depot0")),4) occurs(action(("unload","hoist6","crate4","truck1","depot0")),4) occurs(action(("load","hoist7","crate6","truck3","distributor1")),4) occurs(action(("drop","hoist0","crate8","pallet6","depot0")),5) occurs(action(("drop","hoist6","crate4","pallet0","depot0")),5) occurs(action(("drive","truck1","depot0","depot1")),5) occurs(action(("drive","truck3","distributor1","depot1")),5) occurs(action(("drive","truck2","depot0","depot1")),5) occurs(action(("drop","hoist4","crate3","crate8","depot0")),6) occurs(action(("unload","hoist0","crate7","truck0","depot0")),6) occurs(action(("unload","hoist1","crate6","truck3","depot1")),6) occurs(action(("drop","hoist0","crate7","crate3","depot0")),7) occurs(action(("drop","hoist1","crate6","pallet1","depot1")),7) occurs(action(("drive","truck1","depot1","distributor0")),7) occurs(action(("drive","truck3","depot1","distributor0")),7) occurs(action(("drive","truck0","depot0","depot1")),7) occurs(action(("drive","truck2","depot1","distributor0")),8) occurs(action(("drive","truck1","distributor0","depot1")),9) occurs(action(("drive","truck2","distributor0","depot1")),9) occurs(action(("drive","truck2","depot1","distributor0")),10)
Solving Time: 0.05s
Memory: 143MB (+10MB)
SAT
SATISFIABLE
Models : 1+
Calls : 3
Time : 2.377s (Solving: 0.03s 1st Model: 0.03s Unsat: 0.00s)
CPU Time : 2.300s
Choices : 810 (Domain: 797)
Conflicts : 58 (Analyzed: 57)
Restarts : 0
Model-Level : 205.0
Problems : 3 (Average Length: 7.00 Splits: 0)
Lemmas : 57 (Deleted: 0)
Binary : 24 (Ratio: 42.11%)
Ternary : 4 (Ratio: 7.02%)
Conflict : 57 (Average Length: 7.8 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 57 (Average: 13.14 Max: 96 Sum: 749)
Executed : 46 (Average: 10.82 Max: 96 Sum: 617 Ratio: 82.38%)
Bounded : 11 (Average: 12.00 Max: 12 Sum: 132 Ratio: 17.62%)
Rules : 85544
Atoms : 85544
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 35259 (Eliminated: 0 Frozen: 29011)
Constraints : 317489 (Binary: 97.7% Ternary: 1.1% Other: 1.2%)
Memory Peak : 143MB
Max. Length : 10 steps
Sol. Length : 10 steps