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-5.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-5.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.020s CPU, 0.024s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.010s CPU, 0.006s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.030s CPU, 0.029s wall-clock]
|
||
|
|
Preparing model... [0.010s CPU, 0.013s wall-clock]
|
||
|
|
Generated 43 rules.
|
||
|
|
Computing model... [0.050s CPU, 0.054s wall-clock]
|
||
|
|
236 relevant atoms
|
||
|
|
298 auxiliary atoms
|
||
|
|
534 final queue length
|
||
|
|
772 total queue pushes
|
||
|
|
Completing instantiation... [0.060s CPU, 0.050s wall-clock]
|
||
|
|
Instantiating: [0.160s CPU, 0.154s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
16 initial candidates
|
||
|
|
Finding invariants: [0.030s CPU, 0.035s wall-clock]
|
||
|
|
Checking invariant weight... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Instantiating groups... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Collecting mutex groups... [0.010s CPU, 0.000s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
18 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.040s CPU, 0.041s 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.000s wall-clock]
|
||
|
|
Translating task...
|
||
|
|
Processing axioms...
|
||
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Processing axioms: [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Translating task: [0.050s CPU, 0.049s wall-clock]
|
||
|
|
154 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
16 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.020s CPU, 0.024s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
14 of 16 variables necessary.
|
||
|
|
2 of 6 mutex groups necessary.
|
||
|
|
116 of 116 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.010s CPU, 0.012s wall-clock]
|
||
|
|
Translator variables: 14
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 50
|
||
|
|
Translator goal facts: 2
|
||
|
|
Translator mutex groups: 2
|
||
|
|
Translator total mutex groups size: 6
|
||
|
|
Translator operators: 116
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 910
|
||
|
|
Translator peak memory: 36556 KB
|
||
|
|
Writing output... [0.020s CPU, 0.019s wall-clock]
|
||
|
|
Done! [0.320s CPU, 0.330s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.05s
|
||
|
|
Memory: 51MB
|
||
|
|
|
||
|
|
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: 51MB (+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: 51MB
|
||
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||
|
|
Grounding Time: 0.02s
|
||
|
|
Memory: 52MB (+1MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 52MB (+0MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
NOT SERIALIZABLE
|
||
|
|
Testing Time: 0.04s
|
||
|
|
Memory: 53MB (+1MB)
|
||
|
|
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
|
||
|
|
Expected Memory: 54.0MB
|
||
|
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
||
|
|
Grounding Time: 0.02s
|
||
|
|
Memory: 53MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 54MB (+1MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
SERIALIZABLE?
|
||
|
|
Testing Time: 0.00s
|
||
|
|
Memory: 54MB (+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(("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(("move","hoist1","depot0-1-1","depot0-1-2")),7) occurs(action(("drop","hoist0","crate0","depot0-2-1","loadarea","depot0")),8) occurs(action(("move","hoist1","depot0-1-2","depot0-1-1")),8) occurs(action(("go-in","hoist0","loadarea","container-0-1")),9) occurs(action(("move","hoist1","depot0-1-1","depot0-1-2")),10)
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 4
|
||
|
|
Time : 0.120s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
|
||
|
|
CPU Time : 0.116s
|
||
|
|
|
||
|
|
Choices : 113 (Domain: 93)
|
||
|
|
Conflicts : 51 (Analyzed: 50)
|
||
|
|
Restarts : 0
|
||
|
|
Model-Level : 25.5
|
||
|
|
Problems : 4 (Average Length: 7.00 Splits: 0)
|
||
|
|
Lemmas : 50 (Deleted: 0)
|
||
|
|
Binary : 9 (Ratio: 18.00%)
|
||
|
|
Ternary : 5 (Ratio: 10.00%)
|
||
|
|
Conflict : 50 (Average Length: 18.4 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 50 (Average: 1.64 Max: 5 Sum: 82)
|
||
|
|
Executed : 49 (Average: 1.62 Max: 5 Sum: 81 Ratio: 98.78%)
|
||
|
|
Bounded : 1 (Average: 1.00 Max: 1 Sum: 1 Ratio: 1.22%)
|
||
|
|
|
||
|
|
Rules : 3721 (Original: 3655)
|
||
|
|
Atoms : 3177
|
||
|
|
Bodies : 466 (Original: 416)
|
||
|
|
Count : 27 (Original: 35)
|
||
|
|
Equivalences : 254 (Atom=Atom: 11 Body=Body: 0 Other: 243)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 2365 (Eliminated: 0 Frozen: 1122)
|
||
|
|
Constraints : 12649 (Binary: 92.0% Ternary: 4.1% Other: 4.0%)
|
||
|
|
|
||
|
|
Memory Peak : 54MB
|
||
|
|
Max. Length : 10 steps
|
||
|
|
Sol. Length : 10 steps
|
||
|
|
Models : 2
|
||
|
|
|
||
|
|
|