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-3.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-3.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.020s CPU, 0.016s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.000s CPU, 0.005s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.020s CPU, 0.019s wall-clock]
|
||
|
|
Preparing model... [0.010s CPU, 0.011s wall-clock]
|
||
|
|
Generated 43 rules.
|
||
|
|
Computing model... [0.090s CPU, 0.080s wall-clock]
|
||
|
|
582 relevant atoms
|
||
|
|
540 auxiliary atoms
|
||
|
|
1122 final queue length
|
||
|
|
1976 total queue pushes
|
||
|
|
Completing instantiation... [0.130s CPU, 0.131s wall-clock]
|
||
|
|
Instantiating: [0.250s CPU, 0.247s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
16 initial candidates
|
||
|
|
Finding invariants: [0.050s CPU, 0.044s wall-clock]
|
||
|
|
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Instantiating groups... [0.020s CPU, 0.018s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
18 uncovered facts
|
||
|
|
Choosing groups: [0.000s CPU, 0.005s wall-clock]
|
||
|
|
Building translation key... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Computing fact groups: [0.080s CPU, 0.079s 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.010s CPU, 0.003s wall-clock]
|
||
|
|
Translating task...
|
||
|
|
Processing axioms...
|
||
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Processing axioms: [0.000s CPU, 0.007s wall-clock]
|
||
|
|
Translating task: [0.140s CPU, 0.142s wall-clock]
|
||
|
|
432 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
26 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.070s CPU, 0.071s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
26 of 26 variables necessary.
|
||
|
|
18 of 26 mutex groups necessary.
|
||
|
|
336 of 336 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.040s CPU, 0.040s wall-clock]
|
||
|
|
Translator variables: 26
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 132
|
||
|
|
Translator goal facts: 6
|
||
|
|
Translator mutex groups: 18
|
||
|
|
Translator total mutex groups size: 156
|
||
|
|
Translator operators: 336
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 3146
|
||
|
|
Translator peak memory: 34904 KB
|
||
|
|
Writing output... [0.040s CPU, 0.054s wall-clock]
|
||
|
|
Done! [0.660s CPU, 0.665s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.15s
|
||
|
|
Memory: 52MB
|
||
|
|
|
||
|
|
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: 52MB (+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.04s
|
||
|
|
Memory: 53MB (+1MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 53MB (+0MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.06s
|
||
|
|
|
||
|
|
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.04s
|
||
|
|
Memory: 56MB (+3MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Answer: 1
|
||
|
|
occurs(action(("lift","hoist2","crate5","crate2","distributor1")),1) occurs(action(("lift","hoist1","crate4","crate3","distributor0")),1) occurs(action(("drive","truck0","depot0","distributor0")),1) occurs(action(("drive","truck1","distributor0","distributor1")),1) occurs(action(("lift","hoist0","crate1","pallet0","depot0")),2) occurs(action(("load","hoist2","crate5","truck1","distributor1")),2) occurs(action(("load","hoist1","crate4","truck0","distributor0")),2) occurs(action(("drive","truck0","distributor0","depot0")),2) occurs(action(("drive","truck1","distributor1","distributor0")),2) occurs(action(("lift","hoist1","crate3","crate0","distributor0")),3) occurs(action(("lift","hoist2","crate2","pallet2","distributor1")),3) occurs(action(("load","hoist0","crate1","truck0","depot0")),3) occurs(action(("drive","truck0","depot0","distributor0")),3) occurs(action(("drive","truck1","distributor0","distributor1")),3) occurs(action(("load","hoist1","crate3","truck0","distributor0")),4) occurs(action(("load","hoist2","crate2","truck1","distributor1")),4) occurs(action(("drive","truck1","distributor1","depot0")),4) occurs(action(("drive","truck0","distributor0","distributor1")),4) occurs(action(("lift","hoist1","crate0","pallet1","distributor0")),5) occurs(action(("unload","hoist0","crate2","truck1","depot0")),5) occurs(action(("unload","hoist2","crate1","truck0","distributor1")),5) occurs(action(("drive","truck0","distributor1","depot0")),5) occurs(action(("drive","truck1","depot0","distributor0")),5) occurs(action(("drop","hoist2","crate1","pallet2","distributor1")),6) occurs(action(("load","hoist0","crate2","truck0","depot0")),6) occurs(action(("load","hoist1","crate0","truck1","distributor0")),6) occurs(action(("drive","truck1","distributor0","distributor1")),6) occurs(action(("unload","hoist0","crate2","truck0","depot0")),7) occurs(action(("unload","hoist2","crate0","truck1","distributor1")),7) occurs(action(("drive","truck0","depot0","distributor0")),7) occurs(action(("drive","truck1","distributor1","distributor0")),7) occurs(action(("drop","hoist0","crate2","pallet0","depot0")),8) occurs(action(("drop","hoist2","crate0","crate1","distributor1")),8) occurs(action(("unload","hoist1","crate4","truck0","distributor0")),8) occurs(action(("drive","truck1","distributor0","distributor1")),8) occurs(action(("drive","truck0","distributor0","depot0")),8) occurs(action(("unload","hoist2","crate5","truck1","distributor1")),9) occurs(action(("unload","hoist0","crate3","truck0","depot0")),9) occurs(action(("drive","truck0","depot0","distributor1")),9) occurs(action(("drop","hoist2","crate5","crate0","distributor1")),10) occurs(action(("drop","hoist1","crate4","pallet1","distributor0")),10) occurs(action(("drop","hoist0","crate3","crate2","depot0")),10) occurs(action(("drive","truck1","distributor1","distributor0")),10)
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 57MB (+1MB)
|
||
|
|
SAT
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 3
|
||
|
|
Time : 0.281s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
|
||
|
|
CPU Time : 0.250s
|
||
|
|
|
||
|
|
Choices : 92
|
||
|
|
Conflicts : 21 (Analyzed: 20)
|
||
|
|
Restarts : 0
|
||
|
|
Model-Level : 40.0
|
||
|
|
Problems : 3 (Average Length: 7.00 Splits: 0)
|
||
|
|
Lemmas : 20 (Deleted: 0)
|
||
|
|
Binary : 2 (Ratio: 10.00%)
|
||
|
|
Ternary : 4 (Ratio: 20.00%)
|
||
|
|
Conflict : 20 (Average Length: 6.0 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 20 (Average: 5.10 Max: 23 Sum: 102)
|
||
|
|
Executed : 15 (Average: 3.20 Max: 23 Sum: 64 Ratio: 62.75%)
|
||
|
|
Bounded : 5 (Average: 7.60 Max: 12 Sum: 38 Ratio: 37.25%)
|
||
|
|
|
||
|
|
Rules : 9341
|
||
|
|
Atoms : 9341
|
||
|
|
Bodies : 1 (Original: 0)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 5616 (Eliminated: 0 Frozen: 1046)
|
||
|
|
Constraints : 30027 (Binary: 93.2% Ternary: 3.5% Other: 3.3%)
|
||
|
|
|
||
|
|
Memory Peak : 57MB
|
||
|
|
Max. Length : 10 steps
|
||
|
|
Sol. Length : 10 steps
|
||
|
|
|
||
|
|
|