156 lines
13 KiB
Plaintext
156 lines
13 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-18.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-18.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.030s CPU, 0.024s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.010s CPU, 0.011s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.020s CPU, 0.022s wall-clock]
|
||
|
|
Preparing model... [0.020s CPU, 0.023s wall-clock]
|
||
|
|
Generated 43 rules.
|
||
|
|
Computing model... [0.730s CPU, 0.736s wall-clock]
|
||
|
|
6652 relevant atoms
|
||
|
|
3059 auxiliary atoms
|
||
|
|
9711 final queue length
|
||
|
|
24313 total queue pushes
|
||
|
|
Completing instantiation... [2.140s CPU, 2.140s wall-clock]
|
||
|
|
Instantiating: [2.940s CPU, 2.941s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
16 initial candidates
|
||
|
|
Finding invariants: [0.050s CPU, 0.052s wall-clock]
|
||
|
|
Checking invariant weight... [0.010s CPU, 0.006s wall-clock]
|
||
|
|
Instantiating groups... [0.100s CPU, 0.104s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.004s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
47 uncovered facts
|
||
|
|
Choosing groups: [0.020s CPU, 0.026s wall-clock]
|
||
|
|
Building translation key... [0.010s CPU, 0.008s wall-clock]
|
||
|
|
Computing fact groups: [0.240s CPU, 0.241s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.010s CPU, 0.003s wall-clock]
|
||
|
|
Building dictionary for full mutex groups... [0.000s CPU, 0.009s wall-clock]
|
||
|
|
Building mutex information...
|
||
|
|
Building mutex information: [0.020s CPU, 0.017s wall-clock]
|
||
|
|
Translating task...
|
||
|
|
Processing axioms...
|
||
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Processing axioms: [0.120s CPU, 0.115s wall-clock]
|
||
|
|
Translating task: [2.530s CPU, 2.527s wall-clock]
|
||
|
|
7680 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
66 propositions removed
|
||
|
|
Detecting unreachable propositions: [1.310s CPU, 1.316s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
65 of 65 variables necessary.
|
||
|
|
46 of 65 mutex groups necessary.
|
||
|
|
5568 of 5568 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.560s CPU, 0.560s wall-clock]
|
||
|
|
Translator variables: 65
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 663
|
||
|
|
Translator goal facts: 13
|
||
|
|
Translator mutex groups: 46
|
||
|
|
Translator total mutex groups size: 901
|
||
|
|
Translator operators: 5568
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 50506
|
||
|
|
Translator peak memory: 64088 KB
|
||
|
|
Writing output... [0.770s CPU, 0.835s wall-clock]
|
||
|
|
Done! [8.510s CPU, 8.574s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 1.77s
|
||
|
|
Memory: 169MB
|
||
|
|
|
||
|
|
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: 169MB (+0MB)
|
||
|
|
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: 1.05s
|
||
|
|
Memory: 173MB (+4MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.06s
|
||
|
|
Memory: 184MB (+11MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 1.45s
|
||
|
|
|
||
|
|
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: 1.01s
|
||
|
|
Memory: 211MB (+27MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.13s
|
||
|
|
Memory: 229MB (+18MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 1.47s
|
||
|
|
|
||
|
|
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: 1.22s
|
||
|
|
Memory: 269MB (+40MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Answer: 1
|
||
|
|
occurs(action(("lift","hoist1","crate11","crate1","depot1")),1) occurs(action(("lift","hoist4","crate8","crate6","distributor0")),1) occurs(action(("lift","hoist2","crate14","crate12","distributor0")),1) occurs(action(("lift","hoist7","crate3","pallet6","distributor1")),1) occurs(action(("lift","hoist5","crate13","crate7","depot0")),1) occurs(action(("lift","hoist3","crate10","crate9","distributor1")),1) occurs(action(("drive","truck1","distributor0","distributor1")),1) occurs(action(("lift","hoist6","crate6","pallet5","distributor0")),2) occurs(action(("drop","hoist3","crate10","pallet6","distributor1")),2) occurs(action(("load","hoist5","crate13","truck2","depot0")),2) occurs(action(("load","hoist1","crate11","truck0","depot1")),2) occurs(action(("drive","truck3","depot1","distributor0")),2) occurs(action(("load","hoist7","crate3","truck1","distributor1")),2) occurs(action(("lift","hoist5","crate7","crate4","depot0")),3) occurs(action(("lift","hoist1","crate1","pallet1","depot1")),3) occurs(action(("lift","hoist7","crate10","pallet6","distributor1")),3) occurs(action(("load","hoist6","crate6","truck3","distributor0")),3) occurs(action(("drop","hoist2","crate14","pallet5","distributor0")),3) occurs(action(("drive","truck1","distributor1","depot0")),3) occurs(action(("drive","truck0","depot1","distributor1")),3) occurs(action(("drive","truck2","depot0","distributor1")),3) occurs(action(("lift","hoist0","crate4","crate0","depot0")),4) occurs(action(("unload","hoist3","crate13","truck2","distributor1")),4) occurs(action(("lift","hoist2","crate12","crate2","distributor0")),4) occurs(action(("drop","hoist4","crate8","crate14","distributor0")),4) occurs(action(("load","hoist7","crate10","truck2","distributor1")),4) occurs(action(("drive","truck3","distributor0","distributor1")),4) occurs(action(("load","hoist5","crate7","truck1","depot0")),4) occurs(action(("drive","truck0","distributor1","depot1")),4) occurs(action(("lift","hoist7","crate9","pallet3","distributor1")),5) occurs(action(("lift","hoist6","crate8","crate14","distributor0")),5) occurs(action(("lift","hoist4","crate2","pallet2","distributor0")),5) occurs(action(("load","hoist1","crate1","truck0","depot1")),5) occurs(action(("drive","truck1","depot0","distributor0")),5) occurs(action(("drive","truck2","distributor1","depot0")),5) occurs(action(("drive","truck3","distributor1","depot1")),5) occurs(action(("drop","hoist0","crate4","pallet4","depot0")),6) occurs(action(("drop","hoist3","crate13","pallet3","distributor1")),6) occurs(action(("unload","hoist1","crate6","truck3","depot1")),6) occurs(action(("lift","hoist5","crate0","pallet0","depot0")),6) occurs(action(("load","hoist6","crate8","truck1","distributor0")),6) occurs(action(("load","hoist4","crate2","truck1","distributor0")),6) occurs(action(("load","hoist2","crate12","truck1","distributor0")),6) occurs(action(("drive","truck0","depot1","distributor1")),6) occurs(action(("drive","truck2","depot0","distributor1")),6) occurs(action(("unload","hoist6","crate12","truck1","distributor0")),7) occurs(action(("lift","hoist4","crate14","pallet5","distributor0")),7) occurs(action(("unload","hoist3","crate1","truck0","distributor1")),7) occurs(action(("drop","hoist5","crate0","crate4","depot0")),7) occurs(action(("drop","hoist1","crate6","pallet1","depot1")),7) occurs(action(("drive","truck3","depot1","distributor0")),7) occurs(action(("unload","hoist2","crate7","truck1","distributor0")),7) occurs(action(("drop","hoist3","crate1","crate13","distributor1")),8) occurs(action(("lift","hoist1","crate5","pallet7","depot1")),8) occurs(action(("drop","hoist6","crate12","pallet5","distributor0")),8) occurs(action(("drop","hoist2","crate7","pallet2","distributor0")),8) occurs(action(("drive","truck1","distributor0","depot0")),8) occurs(action(("drive","truck0","distributor1","depot1")),8) occurs(action(("drive","truck3","distributor0","depot1")),8) occurs(action(("unload","hoist0","crate8","truck1","depot0")),9) occurs(action(("lift","hoist5","crate0","crate4","depot0")),9) occurs(action(("lift","hoist2","crate7","pallet2","dist
|
||
|
|
Solving Time: 6.24s
|
||
|
|
Memory: 297MB (+28MB)
|
||
|
|
SAT
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 4
|
||
|
|
Time : 12.675s (Solving: 6.29s 1st Model: 6.19s Unsat: 0.10s)
|
||
|
|
CPU Time : 12.520s
|
||
|
|
|
||
|
|
Choices : 211520
|
||
|
|
Conflicts : 5889 (Analyzed: 5887)
|
||
|
|
Restarts : 56 (Average: 105.12 Last: 76)
|
||
|
|
Model-Level : 1123.0
|
||
|
|
Problems : 4 (Average Length: 9.50 Splits: 0)
|
||
|
|
Lemmas : 5887 (Deleted: 2464)
|
||
|
|
Binary : 185 (Ratio: 3.14%)
|
||
|
|
Ternary : 112 (Ratio: 1.90%)
|
||
|
|
Conflict : 5887 (Average Length: 302.3 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 5887 (Average: 32.93 Max: 4602 Sum: 193837)
|
||
|
|
Executed : 5758 (Average: 32.59 Max: 4602 Sum: 191882 Ratio: 98.99%)
|
||
|
|
Bounded : 129 (Average: 15.16 Max: 17 Sum: 1955 Ratio: 1.01%)
|
||
|
|
|
||
|
|
Rules : 165105
|
||
|
|
Atoms : 165105
|
||
|
|
Bodies : 1 (Original: 0)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 98855 (Eliminated: 0 Frozen: 83130)
|
||
|
|
Constraints : 1052952 (Binary: 98.3% Ternary: 0.8% Other: 0.9%)
|
||
|
|
|
||
|
|
Memory Peak : 297MB
|
||
|
|
Max. Length : 15 steps
|
||
|
|
Sol. Length : 15 steps
|
||
|
|
|
||
|
|
|