143 lines
7.9 KiB
Plaintext
143 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-19.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-19.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.010s CPU, 0.017s 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.019s wall-clock]
|
||
|
|
Preparing model... [0.020s CPU, 0.017s wall-clock]
|
||
|
|
Generated 43 rules.
|
||
|
|
Computing model... [0.390s CPU, 0.388s wall-clock]
|
||
|
|
3063 relevant atoms
|
||
|
|
2588 auxiliary atoms
|
||
|
|
5651 final queue length
|
||
|
|
11023 total queue pushes
|
||
|
|
Completing instantiation... [0.850s CPU, 0.857s wall-clock]
|
||
|
|
Instantiating: [1.290s CPU, 1.295s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
16 initial candidates
|
||
|
|
Finding invariants: [0.050s CPU, 0.047s wall-clock]
|
||
|
|
Checking invariant weight... [0.010s CPU, 0.005s wall-clock]
|
||
|
|
Instantiating groups... [0.070s CPU, 0.075s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.003s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
44 uncovered facts
|
||
|
|
Choosing groups: [0.020s CPU, 0.014s wall-clock]
|
||
|
|
Building translation key... [0.000s CPU, 0.005s wall-clock]
|
||
|
|
Computing fact groups: [0.170s CPU, 0.167s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Building dictionary for full mutex groups... [0.010s CPU, 0.005s wall-clock]
|
||
|
|
Building mutex information...
|
||
|
|
Building mutex information: [0.000s CPU, 0.008s wall-clock]
|
||
|
|
Translating task...
|
||
|
|
Processing axioms...
|
||
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Processing axioms: [0.050s CPU, 0.046s wall-clock]
|
||
|
|
Translating task: [0.970s CPU, 0.960s wall-clock]
|
||
|
|
2960 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
56 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.530s CPU, 0.528s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
46 of 46 variables necessary.
|
||
|
|
34 of 46 mutex groups necessary.
|
||
|
|
2352 of 2352 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.210s CPU, 0.216s wall-clock]
|
||
|
|
Translator variables: 46
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 388
|
||
|
|
Translator goal facts: 7
|
||
|
|
Translator mutex groups: 34
|
||
|
|
Translator total mutex groups size: 482
|
||
|
|
Translator operators: 2352
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 19963
|
||
|
|
Translator peak memory: 45912 KB
|
||
|
|
Writing output... [0.310s CPU, 0.339s wall-clock]
|
||
|
|
Done! [3.540s CPU, 3.577s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.68s
|
||
|
|
Memory: 93MB
|
||
|
|
|
||
|
|
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: 93MB (+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.36s
|
||
|
|
Memory: 93MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.02s
|
||
|
|
Memory: 99MB (+6MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.50s
|
||
|
|
|
||
|
|
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.41s
|
||
|
|
Memory: 114MB (+15MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Answer: 1
|
||
|
|
occurs(action(("lift","hoist3","crate7","pallet3","depot3")),1) occurs(action(("lift","hoist4","crate2","pallet4","distributor0")),1) occurs(action(("lift","hoist5","crate5","crate3","distributor1")),1) occurs(action(("lift","hoist6","crate4","pallet8","distributor2")),1) occurs(action(("lift","hoist1","crate1","pallet1","depot1")),1) occurs(action(("lift","hoist0","crate6","pallet0","depot0")),1) occurs(action(("drive","truck1","distributor0","depot1")),1) occurs(action(("drive","truck3","distributor3","depot3")),1) occurs(action(("drive","truck2","depot2","distributor1")),1) occurs(action(("drive","truck0","depot0","distributor2")),1) occurs(action(("load","hoist3","crate7","truck3","depot3")),2) occurs(action(("load","hoist5","crate5","truck2","distributor1")),2) occurs(action(("load","hoist6","crate4","truck0","distributor2")),2) occurs(action(("load","hoist1","crate1","truck1","depot1")),2) occurs(action(("lift","hoist5","crate3","pallet5","distributor1")),3) occurs(action(("drive","truck2","distributor1","depot3")),3) occurs(action(("lift","hoist3","crate0","pallet9","depot3")),3) occurs(action(("drive","truck0","distributor2","distributor1")),3) occurs(action(("drive","truck3","depot3","distributor1")),3) occurs(action(("drive","truck1","depot1","distributor2")),3) occurs(action(("unload","hoist6","crate1","truck1","distributor2")),4) occurs(action(("load","hoist5","crate3","truck0","distributor1")),4) occurs(action(("load","hoist3","crate0","truck2","depot3")),4) occurs(action(("drop","hoist6","crate1","pallet8","distributor2")),5) occurs(action(("unload","hoist5","crate4","truck0","distributor1")),5) occurs(action(("drive","truck1","distributor2","depot0")),5) occurs(action(("drive","truck2","depot3","distributor2")),5) occurs(action(("drop","hoist5","crate4","pallet5","distributor1")),6) occurs(action(("unload","hoist6","crate0","truck2","distributor2")),6) occurs(action(("load","hoist0","crate6","truck1","depot0")),6) occurs(action(("drive","truck0","distributor1","distributor2")),6) occurs(action(("drop","hoist6","crate0","pallet6","distributor2")),7) occurs(action(("unload","hoist5","crate7","truck3","distributor1")),7) occurs(action(("drive","truck2","distributor2","distributor1")),7) occurs(action(("drive","truck1","depot0","distributor0")),7) occurs(action(("drop","hoist5","crate7","crate4","distributor1")),8) occurs(action(("unload","hoist6","crate3","truck0","distributor2")),8) occurs(action(("load","hoist4","crate2","truck1","distributor0")),8) occurs(action(("drop","hoist6","crate3","crate1","distributor2")),9) occurs(action(("unload","hoist4","crate6","truck1","distributor0")),9) occurs(action(("unload","hoist5","crate5","truck2","distributor1")),9) occurs(action(("drop","hoist4","crate6","pallet4","distributor0")),10) occurs(action(("drop","hoist5","crate5","crate7","distributor1")),10)
|
||
|
|
Solving Time: 0.04s
|
||
|
|
Memory: 122MB (+8MB)
|
||
|
|
SAT
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 3
|
||
|
|
Time : 1.805s (Solving: 0.03s 1st Model: 0.02s Unsat: 0.00s)
|
||
|
|
CPU Time : 1.760s
|
||
|
|
|
||
|
|
Choices : 397 (Domain: 390)
|
||
|
|
Conflicts : 48 (Analyzed: 47)
|
||
|
|
Restarts : 0
|
||
|
|
Model-Level : 194.0
|
||
|
|
Problems : 3 (Average Length: 7.00 Splits: 0)
|
||
|
|
Lemmas : 47 (Deleted: 0)
|
||
|
|
Binary : 0 (Ratio: 0.00%)
|
||
|
|
Ternary : 3 (Ratio: 6.38%)
|
||
|
|
Conflict : 47 (Average Length: 733.0 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 47 (Average: 5.60 Max: 93 Sum: 263)
|
||
|
|
Executed : 43 (Average: 4.57 Max: 93 Sum: 215 Ratio: 81.75%)
|
||
|
|
Bounded : 4 (Average: 12.00 Max: 12 Sum: 48 Ratio: 18.25%)
|
||
|
|
|
||
|
|
Rules : 65764
|
||
|
|
Atoms : 65764
|
||
|
|
Bodies : 1 (Original: 0)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 29168 (Eliminated: 0 Frozen: 24491)
|
||
|
|
Constraints : 248336 (Binary: 97.4% Ternary: 1.1% Other: 1.5%)
|
||
|
|
|
||
|
|
Memory Peak : 122MB
|
||
|
|
Max. Length : 10 steps
|
||
|
|
Sol. Length : 10 steps
|
||
|
|
|
||
|
|
|