160 lines
6.5 KiB
Plaintext
160 lines
6.5 KiB
Plaintext
|
INFO Running translator.
|
||
|
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/storage-propositional/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/storage-propositional/instances/instance-9.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-2006/domains/storage-propositional/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/storage-propositional/instances/instance-9.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.020s CPU, 0.017s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.010s CPU, 0.005s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.010s CPU, 0.022s wall-clock]
|
||
|
|
Preparing model... [0.010s CPU, 0.011s wall-clock]
|
||
|
|
Generated 43 rules.
|
||
|
|
Computing model... [0.090s CPU, 0.091s wall-clock]
|
||
|
|
585 relevant atoms
|
||
|
|
612 auxiliary atoms
|
||
|
|
1197 final queue length
|
||
|
|
2058 total queue pushes
|
||
|
|
Completing instantiation... [0.150s CPU, 0.145s wall-clock]
|
||
|
|
Instantiating: [0.270s CPU, 0.276s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
16 initial candidates
|
||
|
|
Finding invariants: [0.030s CPU, 0.031s wall-clock]
|
||
|
|
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Instantiating groups... [0.000s CPU, 0.003s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
27 uncovered facts
|
||
|
|
Choosing groups: [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Building translation key... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Computing fact groups: [0.040s CPU, 0.043s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Building dictionary for full mutex groups... [0.010s CPU, 0.001s wall-clock]
|
||
|
|
Building mutex information...
|
||
|
|
Building mutex information: [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Translating task...
|
||
|
|
Processing axioms...
|
||
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Processing axioms: [0.000s CPU, 0.008s wall-clock]
|
||
|
|
Translating task: [0.160s CPU, 0.160s wall-clock]
|
||
|
|
540 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
24 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.080s CPU, 0.085s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
21 of 24 variables necessary.
|
||
|
|
3 of 9 mutex groups necessary.
|
||
|
|
390 of 390 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.040s CPU, 0.037s wall-clock]
|
||
|
|
Translator variables: 21
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 96
|
||
|
|
Translator goal facts: 3
|
||
|
|
Translator mutex groups: 3
|
||
|
|
Translator total mutex groups size: 12
|
||
|
|
Translator operators: 390
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 3030
|
||
|
|
Translator peak memory: 38092 KB
|
||
|
|
Writing output... [0.060s CPU, 0.061s wall-clock]
|
||
|
|
Done! [0.680s CPU, 0.688s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.13s
|
||
|
|
Memory: 57MB
|
||
|
|
|
||
|
|
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: 57MB (+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
|
||
|
|
Expected Memory: 57MB
|
||
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||
|
|
Grounding Time: 0.04s
|
||
|
|
Memory: 57MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 57MB (+0MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
NOT SERIALIZABLE
|
||
|
|
Testing Time: 0.12s
|
||
|
|
Memory: 62MB (+5MB)
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 62MB (+0MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.17s
|
||
|
|
|
||
|
|
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
|
||
|
|
Expected Memory: 62MB
|
||
|
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
||
|
|
Grounding Time: 0.06s
|
||
|
|
Memory: 62MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.02s
|
||
|
|
Memory: 63MB (+1MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
SERIALIZABLE?
|
||
|
|
Testing Time: 0.00s
|
||
|
|
Memory: 63MB (+0MB)
|
||
|
|
Answer: 2
|
||
|
|
occurs(action(("go-out","hoist0","depot0-2-2","loadarea")),1) occurs(action(("move","hoist1","depot0-1-1","depot0-1-2")),1) occurs(action(("lift","hoist0","crate0","container-0-0","loadarea","container0")),2) occurs(action(("go-in","hoist0","loadarea","depot0-2-2")),3) occurs(action(("drop","hoist0","crate0","depot0-2-1","depot0-2-2","depot0")),4) occurs(action(("go-out","hoist0","depot0-2-2","loadarea")),5) occurs(action(("lift","hoist0","crate2","container-0-2","loadarea","container0")),6) occurs(action(("drop","hoist0","crate2","depot0-2-2","loadarea","depot0")),7) occurs(action(("lift","hoist0","crate1","container-0-1","loadarea","container0")),8) occurs(action(("lift","hoist2","crate2","depot0-2-2","depot0-2-3","depot0")),8) occurs(action(("drop","hoist0","crate1","depot0-2-2","loadarea","depot0")),9) occurs(action(("drop","hoist2","crate2","depot0-1-3","depot0-2-3","depot0")),9) occurs(action(("move","hoist1","depot0-1-2","depot0-1-1")),9) occurs(action(("go-in","hoist0","loadarea","container-0-0")),10)
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 4
|
||
|
|
Time : 0.311s (Solving: 0.03s 1st Model: 0.02s Unsat: 0.00s)
|
||
|
|
CPU Time : 0.292s
|
||
|
|
|
||
|
|
Choices : 1031 (Domain: 895)
|
||
|
|
Conflicts : 334 (Analyzed: 333)
|
||
|
|
Restarts : 2 (Average: 166.50 Last: 181)
|
||
|
|
Model-Level : 46.0
|
||
|
|
Problems : 4 (Average Length: 7.00 Splits: 0)
|
||
|
|
Lemmas : 333 (Deleted: 0)
|
||
|
|
Binary : 15 (Ratio: 4.50%)
|
||
|
|
Ternary : 5 (Ratio: 1.50%)
|
||
|
|
Conflict : 333 (Average Length: 56.3 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 333 (Average: 2.90 Max: 20 Sum: 967)
|
||
|
|
Executed : 329 (Average: 2.86 Max: 20 Sum: 951 Ratio: 98.35%)
|
||
|
|
Bounded : 4 (Average: 4.00 Max: 7 Sum: 16 Ratio: 1.65%)
|
||
|
|
|
||
|
|
Rules : 12460 (Original: 12380)
|
||
|
|
Atoms : 10233
|
||
|
|
Bodies : 1627 (Original: 1558)
|
||
|
|
Count : 53 (Original: 64)
|
||
|
|
Equivalences : 879 (Atom=Atom: 11 Body=Body: 0 Other: 868)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 5875 (Eliminated: 0 Frozen: 3479)
|
||
|
|
Constraints : 43084 (Binary: 95.6% Ternary: 2.2% Other: 2.2%)
|
||
|
|
|
||
|
|
Memory Peak : 63MB
|
||
|
|
Max. Length : 10 steps
|
||
|
|
Sol. Length : 10 steps
|
||
|
|
Models : 2
|
||
|
|
|
||
|
|
|