tplp-planning-benchmark/gc-ta1-tt1/ipc-2006_storage-propositional_10.out

164 lines
7.1 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-10.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-10.pddl
Parsing...
Parsing: [0.030s CPU, 0.022s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.007s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.024s wall-clock]
Preparing model... [0.020s CPU, 0.015s wall-clock]
Generated 43 rules.
Computing model... [0.090s CPU, 0.090s wall-clock]
451 relevant atoms
649 auxiliary atoms
1100 final queue length
1586 total queue pushes
Completing instantiation... [0.090s CPU, 0.087s wall-clock]
Instantiating: [0.220s CPU, 0.226s wall-clock]
Computing fact groups...
Finding invariants...
16 initial candidates
Finding invariants: [0.030s CPU, 0.034s wall-clock]
Checking invariant weight... [0.010s 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...
33 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.045s 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.005s wall-clock]
Translating task: [0.090s CPU, 0.098s wall-clock]
325 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
29 propositions removed
Detecting unreachable propositions: [0.060s CPU, 0.051s wall-clock]
Reordering and filtering variables...
22 of 26 variables necessary.
1 of 6 mutex groups necessary.
230 of 230 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.020s CPU, 0.024s wall-clock]
Translator variables: 22
Translator derived variables: 0
Translator facts: 99
Translator goal facts: 4
Translator mutex groups: 1
Translator total mutex groups size: 5
Translator operators: 230
Translator axioms: 0
Translator task size: 1863
Translator peak memory: 37324 KB
Writing output... [0.040s CPU, 0.038s wall-clock]
Done! [0.510s CPU, 0.513s 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: 56MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 56MB (+0MB)
UNSAT
Iteration Time: 0.04s
Iteration 4
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 10
Expected Memory: 57.0MB
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time: 0.03s
Memory: 58MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 59MB (+1MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 0.06s
Memory: 59MB (+0MB)
Answer: 1
occurs(action(("move","hoist0","depot0-1-1","depot0-1-2")),1) occurs(action(("move","hoist0","depot0-1-2","depot0-1-3")),2) occurs(action(("move","hoist0","depot0-1-3","depot0-2-3")),3) occurs(action(("go-out","hoist0","depot0-2-3","loadarea")),4) occurs(action(("lift","hoist0","crate3","container-0-3","loadarea","container0")),5) occurs(action(("go-in","hoist0","loadarea","depot0-2-3")),5) occurs(action(("drop","hoist0","crate3","depot0-2-2","depot0-2-3","depot0")),6) occurs(action(("go-out","hoist0","depot0-2-3","loadarea")),6) occurs(action(("lift","hoist0","crate1","container-0-1","loadarea","container0")),7) occurs(action(("go-in","hoist0","loadarea","depot0-2-3")),7) occurs(action(("drop","hoist0","crate1","depot0-2-4","depot0-2-3","depot0")),8) occurs(action(("go-out","hoist0","depot0-2-3","loadarea")),8) occurs(action(("lift","hoist0","crate0","container-0-0","loadarea","container0")),9) occurs(action(("go-in","hoist0","loadarea","depot0-2-3")),9) occurs(action(("drop","hoist0","crate0","depot0-1-3","depot0-2-3","depot0")),10) occurs(action(("go-out","hoist0","depot0-2-3","loadarea")),10) occurs(action(("lift","hoist0","crate2","container-0-2","loadarea","container0")),11) occurs(action(("drop","hoist0","crate2","depot0-2-3","loadarea","depot0")),12) occurs(action(("go-in","hoist0","loadarea","container-0-2")),12) occurs(action(("go-out","hoist0","container-0-2","loadarea")),13) occurs(action(("go-in","hoist0","loadarea","container-0-3")),14) occurs(action(("go-out","hoist0","container-0-3","loadarea")),15)
SATISFIABLE
Models : 1+
Calls : 4
Time : 0.242s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
CPU Time : 0.232s
Choices : 197 (Domain: 179)
Conflicts : 69 (Analyzed: 68)
Restarts : 0
Model-Level : 52.0
Problems : 4 (Average Length: 9.50 Splits: 0)
Lemmas : 68 (Deleted: 0)
Binary : 17 (Ratio: 25.00%)
Ternary : 6 (Ratio: 8.82%)
Conflict : 68 (Average Length: 30.8 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 68 (Average: 2.40 Max: 8 Sum: 163)
Executed : 67 (Average: 2.38 Max: 8 Sum: 162 Ratio: 99.39%)
Bounded : 1 (Average: 1.00 Max: 1 Sum: 1 Ratio: 0.61%)
Rules : 5731
Atoms : 5731
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 6046 (Eliminated: 0 Frozen: 913)
Constraints : 29914 (Binary: 93.4% Ternary: 4.2% Other: 2.4%)
Memory Peak : 62MB
Max. Length : 15 steps
Sol. Length : 15 steps
Models : 1