169 lines
11 KiB
Plaintext
169 lines
11 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-15.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-15.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.030s CPU, 0.029s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.010s CPU, 0.012s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.020s CPU, 0.022s wall-clock]
|
||
|
|
Preparing model... [0.020s CPU, 0.022s wall-clock]
|
||
|
|
Generated 43 rules.
|
||
|
|
Computing model... [0.720s CPU, 0.716s wall-clock]
|
||
|
|
5008 relevant atoms
|
||
|
|
3903 auxiliary atoms
|
||
|
|
8911 final queue length
|
||
|
|
19443 total queue pushes
|
||
|
|
Completing instantiation... [1.800s CPU, 1.796s wall-clock]
|
||
|
|
Instantiating: [2.570s CPU, 2.576s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
16 initial candidates
|
||
|
|
Finding invariants: [0.070s CPU, 0.063s wall-clock]
|
||
|
|
Checking invariant weight... [0.010s CPU, 0.006s wall-clock]
|
||
|
|
Instantiating groups... [0.110s CPU, 0.115s wall-clock]
|
||
|
|
Collecting mutex groups... [0.010s CPU, 0.004s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
47 uncovered facts
|
||
|
|
Choosing groups: [0.020s CPU, 0.027s wall-clock]
|
||
|
|
Building translation key... [0.010s CPU, 0.009s wall-clock]
|
||
|
|
Computing fact groups: [0.270s CPU, 0.267s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.010s CPU, 0.004s wall-clock]
|
||
|
|
Building dictionary for full mutex groups... [0.010s CPU, 0.012s wall-clock]
|
||
|
|
Building mutex information...
|
||
|
|
Building mutex information: [0.010s CPU, 0.015s wall-clock]
|
||
|
|
Translating task...
|
||
|
|
Processing axioms...
|
||
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Processing axioms: [0.100s CPU, 0.094s wall-clock]
|
||
|
|
Translating task: [2.040s CPU, 2.030s wall-clock]
|
||
|
|
5910 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
64 propositions removed
|
||
|
|
Detecting unreachable propositions: [1.080s CPU, 1.088s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
63 of 63 variables necessary.
|
||
|
|
46 of 63 mutex groups necessary.
|
||
|
|
3990 of 3990 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.500s CPU, 0.491s wall-clock]
|
||
|
|
Translator variables: 63
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 659
|
||
|
|
Translator goal facts: 15
|
||
|
|
Translator mutex groups: 46
|
||
|
|
Translator total mutex groups size: 811
|
||
|
|
Translator operators: 3990
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 37848
|
||
|
|
Translator peak memory: 59596 KB
|
||
|
|
Writing output... [0.620s CPU, 0.678s wall-clock]
|
||
|
|
Done! [7.220s CPU, 7.272s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 1.49s
|
||
|
|
Memory: 147MB
|
||
|
|
|
||
|
|
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.01s
|
||
|
|
Memory: 148MB (+1MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.01s
|
||
|
|
|
||
|
|
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.51s
|
||
|
|
Memory: 148MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.03s
|
||
|
|
Memory: 152MB (+4MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.76s
|
||
|
|
|
||
|
|
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.59s
|
||
|
|
Memory: 171MB (+19MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.02s
|
||
|
|
Memory: 181MB (+10MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.83s
|
||
|
|
|
||
|
|
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.54s
|
||
|
|
Memory: 197MB (+16MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.04s
|
||
|
|
Memory: 212MB (+15MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.81s
|
||
|
|
|
||
|
|
Iteration 5
|
||
|
|
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 15
|
||
|
|
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
|
||
|
|
Grounding Time: 0.56s
|
||
|
|
Memory: 231MB (+19MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Answer: 1
|
||
|
|
occurs(action(("lift","hoist3","crate9","pallet7","distributor0")),1) occurs(action(("lift","hoist2","crate13","crate3","depot2")),1) occurs(action(("lift","hoist4","crate12","crate10","distributor1")),1) occurs(action(("lift","hoist5","crate11","crate5","distributor2")),1) occurs(action(("drive","truck0","distributor1","depot1")),1) occurs(action(("drive","truck1","distributor2","distributor1")),1) occurs(action(("lift","hoist1","crate7","crate6","depot1")),1) occurs(action(("load","hoist1","crate7","truck0","depot1")),2) occurs(action(("drop","hoist2","crate13","pallet2","depot2")),2) occurs(action(("load","hoist4","crate12","truck1","distributor1")),2) occurs(action(("drive","truck1","distributor1","depot1")),2) occurs(action(("drive","truck0","depot1","distributor1")),2) occurs(action(("lift","hoist1","crate4","pallet6","depot1")),3) occurs(action(("lift","hoist4","crate10","crate1","distributor1")),3) occurs(action(("lift","hoist2","crate3","crate2","depot2")),3) occurs(action(("load","hoist1","crate4","truck1","depot1")),4) occurs(action(("load","hoist4","crate10","truck0","distributor1")),4) occurs(action(("drive","truck1","depot1","distributor1")),4) occurs(action(("lift","hoist4","crate1","pallet4","distributor1")),5) occurs(action(("lift","hoist1","crate6","pallet1","depot1")),5) occurs(action(("drop","hoist1","crate6","pallet6","depot1")),6) occurs(action(("load","hoist4","crate1","truck1","distributor1")),6) occurs(action(("unload","hoist4","crate7","truck0","distributor1")),7) occurs(action(("drive","truck0","distributor1","distributor0")),7) occurs(action(("drop","hoist4","crate7","pallet4","distributor1")),8) occurs(action(("load","hoist3","crate9","truck0","distributor0")),8) occurs(action(("drive","truck0","distributor0","distributor1")),8) occurs(action(("lift","hoist3","crate8","pallet3","distributor0")),9) occurs(action(("unload","hoist4","crate4","truck1","distributor1")),9) occurs(action(("drive","truck1","distributor1","distributor2")),9) occurs(action(("drop","hoist3","crate8","pallet7","distributor0")),10) occurs(action(("drop","hoist4","crate4","crate7","distributor1")),10) occurs(action(("load","hoist5","crate11","truck1","distributor2")),10) occurs(action(("drive","truck1","distributor2","distributor1")),10) occurs(action(("unload","hoist4","crate9","truck0","distributor1")),11) occurs(action(("lift","hoist5","crate5","crate0","distributor2")),11) occurs(action(("drop","hoist4","crate9","crate4","distributor1")),12) occurs(action(("unload","hoist4","crate11","truck1","distributor1")),13) occurs(action(("drive","truck1","distributor1","distributor2")),13) occurs(action(("drop","hoist4","crate11","crate9","distributor1")),14) occurs(action(("load","hoist5","crate5","truck1","distributor2")),14) occurs(action(("drive","truck1","distributor2","depot2")),14) occurs(action(("lift","hoist5","crate0","pallet5","distributor2")),15) occurs(action(("unload","hoist4","crate10","truck0","distributor1")),15) occurs(action(("load","hoist2","crate3","truck1","depot2")),15) occurs(action(("drive","truck1","depot2","depot1")),15) occurs(action(("drive","truck0","distributor1","distributor2")),15) occurs(action(("drop","hoist4","crate10","crate11","distributor1")),16) occurs(action(("unload","hoist1","crate3","truck1","depot1")),16) occurs(action(("lift","hoist2","crate2","pallet8","depot2")),16) occurs(action(("drive","truck0","distributor2","distributor0")),16) occurs(action(("load","hoist5","crate0","truck0","distributor2")),16) occurs(action(("drive","truck1","depot1","distributor2")),16) occurs(action(("drop","hoist1","crate3","pallet1","depot1")),17) occurs(action(("unload","hoist5","crate5","truck1","distributor2")),17) occurs(action(("unload","hoist3","crate0","truck0","distributor0")),17) occurs(action(("drive","truck0","distributor0","depot2")),17) occurs(action(("drive","truck1","distributor2","distributor1")),17) occurs(action(("drop","hoist5","crate5","pallet5","distributor2")),18) occurs(action(("drop","hoist3","crate0","crate8","distributor0")),18) occurs(action(("unload","hoist4","crate1","truck
|
||
|
|
Solving Time: 0.15s
|
||
|
|
Memory: 238MB (+7MB)
|
||
|
|
SAT
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 5
|
||
|
|
Time : 4.957s (Solving: 0.13s 1st Model: 0.11s Unsat: 0.01s)
|
||
|
|
CPU Time : 4.848s
|
||
|
|
|
||
|
|
Choices : 2536 (Domain: 2526)
|
||
|
|
Conflicts : 236 (Analyzed: 234)
|
||
|
|
Restarts : 2 (Average: 117.00 Last: 69)
|
||
|
|
Model-Level : 508.0
|
||
|
|
Problems : 5 (Average Length: 12.00 Splits: 0)
|
||
|
|
Lemmas : 234 (Deleted: 0)
|
||
|
|
Binary : 1 (Ratio: 0.43%)
|
||
|
|
Ternary : 5 (Ratio: 2.14%)
|
||
|
|
Conflict : 234 (Average Length: 726.8 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 234 (Average: 7.81 Max: 369 Sum: 1828)
|
||
|
|
Executed : 224 (Average: 7.13 Max: 369 Sum: 1669 Ratio: 91.30%)
|
||
|
|
Bounded : 10 (Average: 15.90 Max: 22 Sum: 159 Ratio: 8.70%)
|
||
|
|
|
||
|
|
Rules : 111525
|
||
|
|
Atoms : 111525
|
||
|
|
Bodies : 1 (Original: 0)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 99308 (Eliminated: 0 Frozen: 12090)
|
||
|
|
Constraints : 922713 (Binary: 97.7% Ternary: 1.2% Other: 1.1%)
|
||
|
|
|
||
|
|
Memory Peak : 247MB
|
||
|
|
Max. Length : 20 steps
|
||
|
|
Sol. Length : 20 steps
|
||
|
|
|
||
|
|
|