160 lines
6.4 KiB
Plaintext
160 lines
6.4 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-8.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-8.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.020s CPU, 0.023s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.000s CPU, 0.006s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.030s CPU, 0.026s wall-clock]
|
||
|
|
Preparing model... [0.010s CPU, 0.014s wall-clock]
|
||
|
|
Generated 43 rules.
|
||
|
|
Computing model... [0.080s CPU, 0.083s wall-clock]
|
||
|
|
438 relevant atoms
|
||
|
|
518 auxiliary atoms
|
||
|
|
956 final queue length
|
||
|
|
1520 total queue pushes
|
||
|
|
Completing instantiation... [0.090s CPU, 0.097s wall-clock]
|
||
|
|
Instantiating: [0.220s CPU, 0.228s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
16 initial candidates
|
||
|
|
Finding invariants: [0.030s CPU, 0.028s wall-clock]
|
||
|
|
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Instantiating groups... [0.010s CPU, 0.002s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
26 uncovered facts
|
||
|
|
Choosing groups: [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Building translation key... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Computing fact groups: [0.040s CPU, 0.037s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s 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.005s wall-clock]
|
||
|
|
Translating task: [0.110s CPU, 0.110s wall-clock]
|
||
|
|
360 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
23 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.060s CPU, 0.055s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
19 of 22 variables necessary.
|
||
|
|
2 of 7 mutex groups necessary.
|
||
|
|
260 of 260 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.020s CPU, 0.025s wall-clock]
|
||
|
|
Translator variables: 19
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 81
|
||
|
|
Translator goal facts: 3
|
||
|
|
Translator mutex groups: 2
|
||
|
|
Translator total mutex groups size: 8
|
||
|
|
Translator operators: 260
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 2043
|
||
|
|
Translator peak memory: 37324 KB
|
||
|
|
Writing output... [0.040s CPU, 0.043s wall-clock]
|
||
|
|
Done! [0.520s CPU, 0.529s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.11s
|
||
|
|
Memory: 54MB
|
||
|
|
|
||
|
|
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: 54MB (+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: 54MB
|
||
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||
|
|
Grounding Time: 0.03s
|
||
|
|
Memory: 54MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 55MB (+1MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.04s
|
||
|
|
|
||
|
|
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: 57MB (+2MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 57MB (+0MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
NOT SERIALIZABLE
|
||
|
|
Testing Time: 0.08s
|
||
|
|
Memory: 61MB (+4MB)
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.05s
|
||
|
|
Memory: 60MB (+-1MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
SERIALIZABLE?
|
||
|
|
Testing Time: 0.00s
|
||
|
|
Memory: 60MB (+0MB)
|
||
|
|
Answer: 2
|
||
|
|
occurs(action(("move","hoist1","depot0-1-3","depot0-2-3")),1) occurs(action(("go-out","hoist1","depot0-2-3","loadarea")),2) occurs(action(("lift","hoist1","crate0","container-0-0","loadarea","container0")),3) occurs(action(("go-in","hoist1","loadarea","depot0-2-3")),4) occurs(action(("drop","hoist1","crate0","depot0-1-3","depot0-2-3","depot0")),5) occurs(action(("go-out","hoist1","depot0-2-3","loadarea")),6) occurs(action(("lift","hoist1","crate2","container-0-2","loadarea","container0")),7) occurs(action(("drop","hoist1","crate2","depot0-2-3","loadarea","depot0")),8) occurs(action(("lift","hoist1","crate1","container-0-1","loadarea","container0")),9) occurs(action(("lift","hoist0","crate2","depot0-2-3","depot0-2-2","depot0")),9) occurs(action(("drop","hoist1","crate1","depot0-2-3","loadarea","depot0")),10) occurs(action(("drop","hoist0","crate2","depot0-1-2","depot0-2-2","depot0")),10)
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 4
|
||
|
|
Time : 0.261s (Solving: 0.04s 1st Model: 0.04s Unsat: 0.00s)
|
||
|
|
CPU Time : 0.252s
|
||
|
|
|
||
|
|
Choices : 1351 (Domain: 1257)
|
||
|
|
Conflicts : 629 (Analyzed: 628)
|
||
|
|
Restarts : 7 (Average: 89.71 Last: 64)
|
||
|
|
Model-Level : 46.5
|
||
|
|
Problems : 4 (Average Length: 8.25 Splits: 0)
|
||
|
|
Lemmas : 628 (Deleted: 0)
|
||
|
|
Binary : 31 (Ratio: 4.94%)
|
||
|
|
Ternary : 52 (Ratio: 8.28%)
|
||
|
|
Conflict : 628 (Average Length: 43.9 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 628 (Average: 1.98 Max: 15 Sum: 1246)
|
||
|
|
Executed : 627 (Average: 1.98 Max: 15 Sum: 1245 Ratio: 99.92%)
|
||
|
|
Bounded : 1 (Average: 1.00 Max: 1 Sum: 1 Ratio: 0.08%)
|
||
|
|
|
||
|
|
Rules : 12047 (Original: 12007)
|
||
|
|
Atoms : 7119
|
||
|
|
Bodies : 3534 (Original: 3496)
|
||
|
|
Count : 124 (Original: 132)
|
||
|
|
Equivalences : 1944 (Atom=Atom: 16 Body=Body: 0 Other: 1928)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 4353 (Eliminated: 0 Frozen: 2369)
|
||
|
|
Constraints : 28304 (Binary: 94.5% Ternary: 2.7% Other: 2.8%)
|
||
|
|
|
||
|
|
Memory Peak : 61MB
|
||
|
|
Max. Length : 10 steps
|
||
|
|
Sol. Length : 10 steps
|
||
|
|
Models : 2
|
||
|
|
|
||
|
|
|