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

156 lines
7.9 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-4.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-4.pddl
Parsing...
Parsing: [0.020s CPU, 0.019s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.006s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.022s wall-clock]
Preparing model... [0.010s CPU, 0.014s wall-clock]
Generated 43 rules.
Computing model... [0.130s CPU, 0.133s wall-clock]
860 relevant atoms
750 auxiliary atoms
1610 final queue length
3016 total queue pushes
Completing instantiation... [0.210s CPU, 0.207s wall-clock]
Instantiating: [0.380s CPU, 0.385s wall-clock]
Computing fact groups...
Finding invariants...
16 initial candidates
Finding invariants: [0.040s CPU, 0.036s wall-clock]
Checking invariant weight... [0.000s CPU, 0.003s wall-clock]
Instantiating groups... [0.030s CPU, 0.026s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
Choosing groups...
20 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.090s CPU, 0.084s 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.004s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.020s CPU, 0.012s wall-clock]
Translating task: [0.240s CPU, 0.237s wall-clock]
720 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
30 propositions removed
Detecting unreachable propositions: [0.120s CPU, 0.117s wall-clock]
Reordering and filtering variables...
32 of 32 variables necessary.
22 of 32 mutex groups necessary.
540 of 540 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.060s CPU, 0.064s wall-clock]
Translator variables: 32
Translator derived variables: 0
Translator facts: 186
Translator goal facts: 6
Translator mutex groups: 22
Translator total mutex groups size: 222
Translator operators: 540
Translator axioms: 0
Translator task size: 5114
Translator peak memory: 36184 KB
Writing output... [0.080s CPU, 0.087s wall-clock]
Done! [1.000s CPU, 1.013s wall-clock]
planner.py version 0.0.1
Time: 0.21s
Memory: 57MB
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: 57MB (+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.09s
Memory: 58MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 60MB (+2MB)
UNSAT
Iteration Time: 0.11s
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.14s
Memory: 64MB (+4MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 66MB (+2MB)
UNSAT
Iteration Time: 0.18s
Iteration 4
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 10
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time: 0.15s
Memory: 70MB (+4MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("lift","hoist0","crate7","crate4","depot0")),1) occurs(action(("lift","hoist1","crate2","pallet1","distributor0")),1) occurs(action(("drive","truck0","distributor1","depot0")),1) occurs(action(("lift","hoist2","crate6","crate5","distributor1")),1) occurs(action(("load","hoist0","crate7","truck0","depot0")),2) occurs(action(("load","hoist2","crate6","truck1","distributor1")),2) occurs(action(("lift","hoist2","crate5","crate3","distributor1")),3) occurs(action(("lift","hoist0","crate4","crate1","depot0")),3) occurs(action(("drive","truck1","distributor1","distributor0")),3) occurs(action(("load","hoist0","crate4","truck0","depot0")),4) occurs(action(("load","hoist1","crate2","truck1","distributor0")),4) occurs(action(("unload","hoist1","crate6","truck1","distributor0")),5) occurs(action(("lift","hoist0","crate1","crate0","depot0")),5) occurs(action(("drop","hoist1","crate6","pallet1","distributor0")),6) occurs(action(("load","hoist0","crate1","truck0","depot0")),6) occurs(action(("drive","truck1","distributor0","distributor1")),6) occurs(action(("lift","hoist0","crate0","pallet0","depot0")),7) occurs(action(("load","hoist2","crate5","truck1","distributor1")),7) occurs(action(("lift","hoist2","crate3","pallet2","distributor1")),8) occurs(action(("load","hoist0","crate0","truck0","depot0")),8) occurs(action(("unload","hoist0","crate7","truck0","depot0")),9) occurs(action(("load","hoist2","crate3","truck1","distributor1")),9) occurs(action(("drop","hoist0","crate7","pallet0","depot0")),10) occurs(action(("unload","hoist2","crate5","truck1","distributor1")),10) occurs(action(("drop","hoist2","crate5","pallet2","distributor1")),11) occurs(action(("unload","hoist0","crate4","truck0","depot0")),11) occurs(action(("drive","truck1","distributor1","distributor0")),11) occurs(action(("drop","hoist0","crate4","crate7","depot0")),12) occurs(action(("unload","hoist1","crate2","truck1","distributor0")),12) occurs(action(("drop","hoist1","crate2","crate6","distributor0")),13) occurs(action(("unload","hoist0","crate0","truck0","depot0")),13) occurs(action(("drop","hoist0","crate0","crate4","depot0")),14) occurs(action(("unload","hoist1","crate3","truck1","distributor0")),14) occurs(action(("drop","hoist1","crate3","crate2","distributor0")),15) occurs(action(("drive","truck0","depot0","distributor1")),15) occurs(action(("drive","truck1","distributor0","distributor1")),15)
Solving Time: 0.03s
Memory: 71MB (+1MB)
SAT
SATISFIABLE
Models : 1+
Calls : 4
Time : 0.747s (Solving: 0.03s 1st Model: 0.03s Unsat: 0.00s)
CPU Time : 0.730s
Choices : 821 (Domain: 813)
Conflicts : 120 (Analyzed: 118)
Restarts : 1 (Average: 118.00 Last: 20)
Model-Level : 174.0
Problems : 4 (Average Length: 9.50 Splits: 0)
Lemmas : 118 (Deleted: 0)
Binary : 2 (Ratio: 1.69%)
Ternary : 3 (Ratio: 2.54%)
Conflict : 118 (Average Length: 260.7 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 118 (Average: 6.60 Max: 73 Sum: 779)
Executed : 107 (Average: 5.24 Max: 73 Sum: 618 Ratio: 79.33%)
Bounded : 11 (Average: 14.64 Max: 17 Sum: 161 Ratio: 20.67%)
Rules : 16649
Atoms : 16649
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 14281 (Eliminated: 0 Frozen: 9563)
Constraints : 105713 (Binary: 94.5% Ternary: 2.6% Other: 2.9%)
Memory Peak : 72MB
Max. Length : 15 steps
Sol. Length : 15 steps