160 lines
6.3 KiB
Plaintext
160 lines
6.3 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-6.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-6.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.010s CPU, 0.019s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.010s CPU, 0.005s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.020s CPU, 0.023s wall-clock]
|
||
|
|
Preparing model... [0.010s CPU, 0.011s wall-clock]
|
||
|
|
Generated 43 rules.
|
||
|
|
Computing model... [0.060s CPU, 0.056s wall-clock]
|
||
|
|
307 relevant atoms
|
||
|
|
357 auxiliary atoms
|
||
|
|
664 final queue length
|
||
|
|
1028 total queue pushes
|
||
|
|
Completing instantiation... [0.060s CPU, 0.065s wall-clock]
|
||
|
|
Instantiating: [0.160s CPU, 0.162s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
16 initial candidates
|
||
|
|
Finding invariants: [0.040s CPU, 0.037s wall-clock]
|
||
|
|
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Instantiating groups... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Collecting mutex groups... [0.010s CPU, 0.000s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
19 uncovered facts
|
||
|
|
Choosing groups: [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Building translation key... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Computing fact groups: [0.050s CPU, 0.044s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Building dictionary for full mutex groups... [0.000s CPU, 0.000s 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.010s CPU, 0.003s wall-clock]
|
||
|
|
Translating task: [0.070s CPU, 0.069s wall-clock]
|
||
|
|
231 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
17 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.040s CPU, 0.038s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
16 of 18 variables necessary.
|
||
|
|
3 of 8 mutex groups necessary.
|
||
|
|
174 of 174 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.020s CPU, 0.017s wall-clock]
|
||
|
|
Translator variables: 16
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 61
|
||
|
|
Translator goal facts: 2
|
||
|
|
Translator mutex groups: 3
|
||
|
|
Translator total mutex groups size: 9
|
||
|
|
Translator operators: 174
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 1345
|
||
|
|
Translator peak memory: 37068 KB
|
||
|
|
Writing output... [0.030s CPU, 0.028s wall-clock]
|
||
|
|
Done! [0.380s CPU, 0.384s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.08s
|
||
|
|
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
|
||
|
|
Expected Memory: 52MB
|
||
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||
|
|
Grounding Time: 0.02s
|
||
|
|
Memory: 53MB (+1MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 53MB (+0MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
NOT SERIALIZABLE
|
||
|
|
Testing Time: 0.05s
|
||
|
|
Memory: 55MB (+2MB)
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 55MB (+0MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.09s
|
||
|
|
|
||
|
|
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: 56.0MB
|
||
|
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
||
|
|
Grounding Time: 0.03s
|
||
|
|
Memory: 55MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.01s
|
||
|
|
Memory: 56MB (+1MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
SERIALIZABLE?
|
||
|
|
Testing Time: 0.00s
|
||
|
|
Memory: 56MB (+0MB)
|
||
|
|
Answer: 2
|
||
|
|
occurs(action(("move","hoist0","depot0-1-1","depot0-2-1")),1) occurs(action(("go-out","hoist0","depot0-2-1","loadarea")),2) occurs(action(("move","hoist1","depot0-1-2","depot0-1-1")),2) occurs(action(("lift","hoist0","crate1","container-0-1","loadarea","container0")),3) occurs(action(("move","hoist2","depot0-2-2","depot0-1-2")),3) occurs(action(("go-in","hoist0","loadarea","depot0-2-1")),4) occurs(action(("drop","hoist0","crate1","depot0-2-2","depot0-2-1","depot0")),5) occurs(action(("go-out","hoist0","depot0-2-1","loadarea")),6) occurs(action(("lift","hoist0","crate0","container-0-0","loadarea","container0")),7) occurs(action(("drop","hoist0","crate0","depot0-2-1","loadarea","depot0")),8) occurs(action(("go-in","hoist0","loadarea","container-0-1")),9) occurs(action(("go-out","hoist0","container-0-1","loadarea")),10)
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 4
|
||
|
|
Time : 0.169s (Solving: 0.01s 1st Model: 0.01s Unsat: 0.00s)
|
||
|
|
CPU Time : 0.168s
|
||
|
|
|
||
|
|
Choices : 221 (Domain: 182)
|
||
|
|
Conflicts : 107 (Analyzed: 106)
|
||
|
|
Restarts : 1 (Average: 106.00 Last: 19)
|
||
|
|
Model-Level : 23.5
|
||
|
|
Problems : 4 (Average Length: 7.00 Splits: 0)
|
||
|
|
Lemmas : 106 (Deleted: 0)
|
||
|
|
Binary : 9 (Ratio: 8.49%)
|
||
|
|
Ternary : 11 (Ratio: 10.38%)
|
||
|
|
Conflict : 106 (Average Length: 23.6 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 106 (Average: 1.95 Max: 25 Sum: 207)
|
||
|
|
Executed : 103 (Average: 1.77 Max: 25 Sum: 188 Ratio: 90.82%)
|
||
|
|
Bounded : 3 (Average: 6.33 Max: 11 Sum: 19 Ratio: 9.18%)
|
||
|
|
|
||
|
|
Rules : 5341 (Original: 5307)
|
||
|
|
Atoms : 4643
|
||
|
|
Bodies : 584 (Original: 551)
|
||
|
|
Count : 34 (Original: 39)
|
||
|
|
Equivalences : 334 (Atom=Atom: 10 Body=Body: 0 Other: 324)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 3112 (Eliminated: 0 Frozen: 1586)
|
||
|
|
Constraints : 17949 (Binary: 93.4% Ternary: 3.2% Other: 3.4%)
|
||
|
|
|
||
|
|
Memory Peak : 56MB
|
||
|
|
Max. Length : 10 steps
|
||
|
|
Sol. Length : 10 steps
|
||
|
|
Models : 2
|
||
|
|
|
||
|
|
|