143 lines
7.5 KiB
Plaintext
143 lines
7.5 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-14.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-14.pddl
|
|
Parsing...
|
|
Parsing: [0.020s CPU, 0.022s wall-clock]
|
|
Normalizing task... [0.000s CPU, 0.002s wall-clock]
|
|
Instantiating...
|
|
Generating Datalog program... [0.020s CPU, 0.010s wall-clock]
|
|
Normalizing Datalog program...
|
|
Normalizing Datalog program: [0.020s CPU, 0.023s wall-clock]
|
|
Preparing model... [0.020s CPU, 0.019s wall-clock]
|
|
Generated 43 rules.
|
|
Computing model... [0.400s CPU, 0.408s wall-clock]
|
|
2763 relevant atoms
|
|
2328 auxiliary atoms
|
|
5091 final queue length
|
|
10383 total queue pushes
|
|
Completing instantiation... [0.920s CPU, 0.912s wall-clock]
|
|
Instantiating: [1.380s CPU, 1.377s wall-clock]
|
|
Computing fact groups...
|
|
Finding invariants...
|
|
16 initial candidates
|
|
Finding invariants: [0.050s CPU, 0.046s wall-clock]
|
|
Checking invariant weight... [0.000s CPU, 0.006s wall-clock]
|
|
Instantiating groups... [0.080s CPU, 0.078s wall-clock]
|
|
Collecting mutex groups... [0.010s CPU, 0.003s wall-clock]
|
|
Choosing groups...
|
|
42 uncovered facts
|
|
Choosing groups: [0.010s CPU, 0.017s wall-clock]
|
|
Building translation key... [0.000s CPU, 0.006s wall-clock]
|
|
Computing fact groups: [0.180s CPU, 0.180s wall-clock]
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s wall-clock]
|
|
Building dictionary for full mutex groups... [0.010s CPU, 0.006s wall-clock]
|
|
Building mutex information...
|
|
Building mutex information: [0.010s CPU, 0.009s wall-clock]
|
|
Translating task...
|
|
Processing axioms...
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
|
Processing axioms: [0.050s CPU, 0.049s wall-clock]
|
|
Translating task: [1.040s CPU, 1.038s wall-clock]
|
|
3040 effect conditions simplified
|
|
0 implied preconditions added
|
|
Detecting unreachable propositions...
|
|
0 operators removed
|
|
0 axioms removed
|
|
54 propositions removed
|
|
Detecting unreachable propositions: [0.500s CPU, 0.504s wall-clock]
|
|
Reordering and filtering variables...
|
|
48 of 48 variables necessary.
|
|
36 of 48 mutex groups necessary.
|
|
2080 of 2080 operators necessary.
|
|
0 of 0 axiom rules necessary.
|
|
Reordering and filtering variables: [0.250s CPU, 0.250s wall-clock]
|
|
Translator variables: 48
|
|
Translator derived variables: 0
|
|
Translator facts: 404
|
|
Translator goal facts: 7
|
|
Translator mutex groups: 36
|
|
Translator total mutex groups size: 496
|
|
Translator operators: 2080
|
|
Translator axioms: 0
|
|
Translator task size: 19515
|
|
Translator peak memory: 48588 KB
|
|
Writing output... [0.330s CPU, 0.346s wall-clock]
|
|
Done! [3.760s CPU, 3.778s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 0.77s
|
|
Memory: 99MB
|
|
|
|
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: 99MB (+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.24s
|
|
Memory: 99MB (+0MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.01s
|
|
Memory: 100MB (+1MB)
|
|
UNSAT
|
|
Iteration Time: 0.36s
|
|
|
|
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.29s
|
|
Memory: 112MB (+12MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Answer: 1
|
|
occurs(action(("lift","hoist3","crate9","crate2","distributor0")),1) occurs(action(("lift","hoist1","crate8","pallet1","depot1")),1) occurs(action(("drive","truck0","depot1","distributor1")),1) occurs(action(("drive","truck1","depot2","distributor1")),1) occurs(action(("lift","hoist0","crate5","crate1","depot0")),1) occurs(action(("lift","hoist4","crate7","crate6","distributor1")),1) occurs(action(("drive","truck1","distributor1","depot1")),2) occurs(action(("drop","hoist1","crate8","pallet7","depot1")),2) occurs(action(("load","hoist4","crate7","truck1","distributor1")),2) occurs(action(("lift","hoist4","crate6","pallet4","distributor1")),3) occurs(action(("load","hoist4","crate6","truck0","distributor1")),4) occurs(action(("drive","truck0","distributor1","depot1")),4) occurs(action(("unload","hoist1","crate6","truck0","depot1")),5) occurs(action(("lift","hoist4","crate0","pallet8","distributor1")),5) occurs(action(("drive","truck0","depot1","depot0")),5) occurs(action(("drop","hoist1","crate6","pallet1","depot1")),6) occurs(action(("drive","truck0","depot0","distributor0")),6) occurs(action(("load","hoist0","crate5","truck0","depot0")),6) occurs(action(("drop","hoist4","crate0","pallet4","distributor1")),6) occurs(action(("drive","truck1","depot1","depot0")),7) occurs(action(("lift","hoist0","crate1","pallet9","depot0")),7) occurs(action(("unload","hoist1","crate7","truck1","depot1")),7) occurs(action(("load","hoist3","crate9","truck0","distributor0")),7) occurs(action(("drive","truck0","distributor0","distributor2")),7) occurs(action(("drop","hoist1","crate7","crate6","depot1")),8) occurs(action(("unload","hoist5","crate5","truck0","distributor2")),8) occurs(action(("load","hoist0","crate1","truck1","depot0")),8) occurs(action(("drive","truck1","depot0","distributor1")),8) occurs(action(("drive","truck0","distributor2","depot1")),8) occurs(action(("drop","hoist5","crate5","pallet5","distributor2")),9) occurs(action(("unload","hoist1","crate9","truck0","depot1")),9) occurs(action(("unload","hoist4","crate1","truck1","distributor1")),9) occurs(action(("drive","truck1","distributor1","distributor0")),9) occurs(action(("drop","hoist1","crate9","crate7","depot1")),10) occurs(action(("drop","hoist4","crate1","pallet8","distributor1")),10) occurs(action(("drive","truck1","distributor0","depot0")),10) occurs(action(("drive","truck0","depot1","depot2")),10)
|
|
Solving Time: 0.02s
|
|
Memory: 119MB (+7MB)
|
|
SAT
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 3
|
|
Time : 1.602s (Solving: 0.01s 1st Model: 0.01s Unsat: 0.00s)
|
|
CPU Time : 1.540s
|
|
|
|
Choices : 196 (Domain: 185)
|
|
Conflicts : 12 (Analyzed: 11)
|
|
Restarts : 0
|
|
Model-Level : 108.0
|
|
Problems : 3 (Average Length: 7.00 Splits: 0)
|
|
Lemmas : 11 (Deleted: 0)
|
|
Binary : 1 (Ratio: 9.09%)
|
|
Ternary : 0 (Ratio: 0.00%)
|
|
Conflict : 11 (Average Length: 116.5 Ratio: 100.00%)
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 11 (Average: 11.27 Max: 94 Sum: 124)
|
|
Executed : 9 (Average: 9.09 Max: 94 Sum: 100 Ratio: 80.65%)
|
|
Bounded : 2 (Average: 12.00 Max: 12 Sum: 24 Ratio: 19.35%)
|
|
|
|
Rules : 57572
|
|
Atoms : 57572
|
|
Bodies : 1 (Original: 0)
|
|
Tight : Yes
|
|
Variables : 26004 (Eliminated: 0 Frozen: 3560)
|
|
Constraints : 187028 (Binary: 97.0% Ternary: 1.5% Other: 1.4%)
|
|
|
|
Memory Peak : 119MB
|
|
Max. Length : 10 steps
|
|
Sol. Length : 10 steps
|
|
|
|
|