143 lines
7.6 KiB
Plaintext
143 lines
7.6 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-16.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-16.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.020s CPU, 0.019s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.010s CPU, 0.008s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.020s CPU, 0.021s wall-clock]
|
||
|
|
Preparing model... [0.010s CPU, 0.017s wall-clock]
|
||
|
|
Generated 43 rules.
|
||
|
|
Computing model... [0.240s CPU, 0.243s wall-clock]
|
||
|
|
1885 relevant atoms
|
||
|
|
1124 auxiliary atoms
|
||
|
|
3009 final queue length
|
||
|
|
6391 total queue pushes
|
||
|
|
Completing instantiation... [0.560s CPU, 0.564s wall-clock]
|
||
|
|
Instantiating: [0.850s CPU, 0.856s 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.004s wall-clock]
|
||
|
|
Instantiating groups... [0.060s CPU, 0.056s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
38 uncovered facts
|
||
|
|
Choosing groups: [0.010s CPU, 0.010s wall-clock]
|
||
|
|
Building translation key... [0.000s CPU, 0.004s wall-clock]
|
||
|
|
Computing fact groups: [0.140s CPU, 0.137s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Building dictionary for full mutex groups... [0.010s CPU, 0.004s wall-clock]
|
||
|
|
Building mutex information...
|
||
|
|
Building mutex information: [0.000s CPU, 0.007s wall-clock]
|
||
|
|
Translating task...
|
||
|
|
Processing axioms...
|
||
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Processing axioms: [0.040s CPU, 0.032s wall-clock]
|
||
|
|
Translating task: [0.700s CPU, 0.691s wall-clock]
|
||
|
|
1788 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
48 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.310s CPU, 0.312s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
38 of 38 variables necessary.
|
||
|
|
28 of 38 mutex groups necessary.
|
||
|
|
1404 of 1404 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.150s CPU, 0.148s wall-clock]
|
||
|
|
Translator variables: 38
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 240
|
||
|
|
Translator goal facts: 5
|
||
|
|
Translator mutex groups: 28
|
||
|
|
Translator total mutex groups size: 316
|
||
|
|
Translator operators: 1404
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 12119
|
||
|
|
Translator peak memory: 43980 KB
|
||
|
|
Writing output... [0.200s CPU, 0.219s wall-clock]
|
||
|
|
Done! [2.400s CPU, 2.424s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.46s
|
||
|
|
Memory: 80MB
|
||
|
|
|
||
|
|
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: 80MB (+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.14s
|
||
|
|
Memory: 80MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.01s
|
||
|
|
Memory: 81MB (+1MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.21s
|
||
|
|
|
||
|
|
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.17s
|
||
|
|
Memory: 88MB (+7MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Answer: 1
|
||
|
|
occurs(action(("lift","hoist2","crate4","pallet2","distributor0")),1) occurs(action(("drive","truck0","depot1","distributor0")),1) occurs(action(("drive","truck1","depot1","depot0")),1) occurs(action(("drive","truck2","depot0","depot1")),1) occurs(action(("drive","truck3","distributor1","depot1")),1) occurs(action(("lift","hoist5","crate3","crate1","depot1")),1) occurs(action(("lift","hoist0","crate5","crate2","depot0")),1) occurs(action(("lift","hoist6","crate1","pallet1","depot1")),2) occurs(action(("load","hoist0","crate5","truck1","depot0")),2) occurs(action(("load","hoist2","crate4","truck0","distributor0")),2) occurs(action(("drive","truck0","distributor0","depot0")),2) occurs(action(("load","hoist5","crate3","truck3","depot1")),2) occurs(action(("drive","truck3","depot1","depot0")),2) occurs(action(("lift","hoist0","crate2","pallet0","depot0")),3) occurs(action(("drop","hoist6","crate1","pallet6","depot1")),3) occurs(action(("lift","hoist5","crate0","pallet4","depot1")),3) occurs(action(("load","hoist0","crate2","truck1","depot0")),4) occurs(action(("load","hoist5","crate0","truck2","depot1")),4) occurs(action(("drive","truck2","depot1","distributor1")),4) occurs(action(("drive","truck1","depot0","depot1")),4) occurs(action(("unload","hoist0","crate3","truck3","depot0")),5) occurs(action(("unload","hoist1","crate2","truck1","depot1")),5) occurs(action(("unload","hoist3","crate0","truck2","distributor1")),5) occurs(action(("drive","truck1","depot1","distributor0")),5) occurs(action(("drive","truck3","depot0","distributor0")),5) occurs(action(("drive","truck2","distributor1","depot0")),5) occurs(action(("drop","hoist0","crate3","pallet0","depot0")),6) occurs(action(("drop","hoist1","crate2","pallet1","depot1")),6) occurs(action(("drop","hoist3","crate0","pallet3","distributor1")),6) occurs(action(("unload","hoist2","crate5","truck1","distributor0")),6) occurs(action(("drive","truck1","distributor0","depot0")),6) occurs(action(("drop","hoist2","crate5","pallet2","distributor0")),7) occurs(action(("unload","hoist0","crate4","truck0","depot0")),7) occurs(action(("drive","truck3","distributor0","depot0")),7) occurs(action(("drop","hoist0","crate4","crate3","depot0")),8) occurs(action(("drive","truck0","depot0","distributor0")),9) occurs(action(("drive","truck3","depot0","distributor0")),9) occurs(action(("drive","truck3","distributor0","distributor1")),10) occurs(action(("drive","truck0","distributor0","depot1")),10) occurs(action(("drive","truck1","depot0","depot1")),10)
|
||
|
|
Solving Time: 0.01s
|
||
|
|
Memory: 93MB (+5MB)
|
||
|
|
SAT
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 3
|
||
|
|
Time : 0.931s (Solving: 0.01s 1st Model: 0.00s Unsat: 0.00s)
|
||
|
|
CPU Time : 0.912s
|
||
|
|
|
||
|
|
Choices : 219 (Domain: 206)
|
||
|
|
Conflicts : 10 (Analyzed: 9)
|
||
|
|
Restarts : 0
|
||
|
|
Model-Level : 209.0
|
||
|
|
Problems : 3 (Average Length: 7.00 Splits: 0)
|
||
|
|
Lemmas : 9 (Deleted: 0)
|
||
|
|
Binary : 2 (Ratio: 22.22%)
|
||
|
|
Ternary : 1 (Ratio: 11.11%)
|
||
|
|
Conflict : 9 (Average Length: 3.4 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 9 (Average: 6.44 Max: 19 Sum: 58)
|
||
|
|
Executed : 6 (Average: 2.44 Max: 19 Sum: 22 Ratio: 37.93%)
|
||
|
|
Bounded : 3 (Average: 12.00 Max: 12 Sum: 36 Ratio: 62.07%)
|
||
|
|
|
||
|
|
Rules : 35992
|
||
|
|
Atoms : 35992
|
||
|
|
Bodies : 1 (Original: 0)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 17448 (Eliminated: 0 Frozen: 1895)
|
||
|
|
Constraints : 122671 (Binary: 96.8% Ternary: 1.4% Other: 1.7%)
|
||
|
|
|
||
|
|
Memory Peak : 93MB
|
||
|
|
Max. Length : 10 steps
|
||
|
|
Sol. Length : 10 steps
|
||
|
|
|
||
|
|
|