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

164 lines
7.2 KiB
Plaintext
Raw Normal View History

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-13.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-13.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.009s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.030s CPU, 0.025s wall-clock]
Preparing model... [0.010s CPU, 0.018s wall-clock]
Generated 43 rules.
Computing model... [0.110s CPU, 0.111s wall-clock]
588 relevant atoms
824 auxiliary atoms
1412 final queue length
1983 total queue pushes
Completing instantiation... [0.110s CPU, 0.106s wall-clock]
Instantiating: [0.270s CPU, 0.270s wall-clock]
Computing fact groups...
Finding invariants...
16 initial candidates
Finding invariants: [0.030s CPU, 0.027s wall-clock]
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
Instantiating groups... [0.000s CPU, 0.004s wall-clock]
Collecting mutex groups... [0.010s CPU, 0.001s wall-clock]
Choosing groups...
51 uncovered facts
Choosing groups: [0.000s CPU, 0.002s wall-clock]
Building translation key... [0.010s CPU, 0.003s wall-clock]
Computing fact groups: [0.050s CPU, 0.044s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.001s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.004s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.010s CPU, 0.006s wall-clock]
Translating task: [0.120s CPU, 0.118s wall-clock]
400 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
36 propositions removed
Detecting unreachable propositions: [0.060s CPU, 0.064s wall-clock]
Reordering and filtering variables...
27 of 42 variables necessary.
1 of 7 mutex groups necessary.
282 of 282 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.040s CPU, 0.030s wall-clock]
Translator variables: 27
Translator derived variables: 0
Translator facts: 138
Translator goal facts: 5
Translator mutex groups: 1
Translator total mutex groups size: 6
Translator operators: 282
Translator axioms: 0
Translator task size: 2199
Translator peak memory: 37836 KB
Writing output... [0.040s CPU, 0.043s wall-clock]
Done! [0.600s CPU, 0.607s wall-clock]
planner.py version 0.0.1
Time: 0.12s
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: 55MB (+1MB)
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: 55MB
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.03s
Memory: 55MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 56MB (+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: 57.0MB
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 0.03s
Memory: 58MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 59MB (+1MB)
UNSAT
Iteration Time: 0.06s
Iteration 4
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 10
Expected Memory: 62.0MB
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time: 0.03s
Memory: 60MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 61MB (+1MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 0.07s
Memory: 61MB (+0MB)
Answer: 1
occurs(action(("move","hoist0","depot0-1-3","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(("go-in","hoist0","loadarea","depot1-2-2")),5) occurs(action(("lift","hoist0","crate4","container-1-0","loadarea","container1")),5) occurs(action(("drop","hoist0","crate4","depot1-2-1","depot1-2-2","depot1")),6) occurs(action(("go-out","hoist0","depot1-2-2","loadarea")),6) occurs(action(("lift","hoist0","crate2","container-0-2","loadarea","container0")),7) occurs(action(("go-in","hoist0","loadarea","depot1-2-2")),7) occurs(action(("drop","hoist0","crate2","depot1-1-2","depot1-2-2","depot1")),8) occurs(action(("go-out","hoist0","depot1-2-2","loadarea")),8) occurs(action(("lift","hoist0","crate3","container-0-3","loadarea","container0")),9) occurs(action(("drop","hoist0","crate3","depot1-2-2","loadarea","depot1")),10) occurs(action(("go-in","hoist0","loadarea","depot0-2-3")),11) occurs(action(("lift","hoist0","crate1","container-0-1","loadarea","container0")),11) occurs(action(("drop","hoist0","crate1","depot0-1-3","depot0-2-3","depot0")),12) occurs(action(("go-out","hoist0","depot0-2-3","loadarea")),12) occurs(action(("lift","hoist0","crate0","container-0-0","loadarea","container0")),13) occurs(action(("drop","hoist0","crate0","depot0-2-3","loadarea","depot0")),14) occurs(action(("go-in","hoist0","loadarea","container-0-0")),14) occurs(action(("go-out","hoist0","container-0-0","loadarea")),15)
SATISFIABLE
Models : 1+
Calls : 4
Time : 0.272s (Solving: 0.01s 1st Model: 0.00s Unsat: 0.01s)
CPU Time : 0.260s
Choices : 683 (Domain: 654)
Conflicts : 266 (Analyzed: 264)
Restarts : 3 (Average: 88.00 Last: 44)
Model-Level : 49.0
Problems : 4 (Average Length: 9.50 Splits: 0)
Lemmas : 264 (Deleted: 0)
Binary : 43 (Ratio: 16.29%)
Ternary : 11 (Ratio: 4.17%)
Conflict : 264 (Average Length: 29.2 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 264 (Average: 2.49 Max: 16 Sum: 658)
Executed : 261 (Average: 2.44 Max: 16 Sum: 645 Ratio: 98.02%)
Bounded : 3 (Average: 4.33 Max: 11 Sum: 13 Ratio: 1.98%)
Rules : 6783
Atoms : 6783
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 7780 (Eliminated: 0 Frozen: 1347)
Constraints : 39716 (Binary: 92.8% Ternary: 5.0% Other: 2.1%)
Memory Peak : 64MB
Max. Length : 15 steps
Sol. Length : 15 steps
Models : 1