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

146 lines
5.4 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-1.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-1.pddl
Parsing...
Parsing: [0.010s CPU, 0.020s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.003s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.028s wall-clock]
Preparing model... [0.010s CPU, 0.010s wall-clock]
Generated 43 rules.
Computing model... [0.010s CPU, 0.011s wall-clock]
56 relevant atoms
63 auxiliary atoms
119 final queue length
128 total queue pushes
Completing instantiation... [0.010s CPU, 0.004s wall-clock]
Instantiating: [0.060s CPU, 0.057s wall-clock]
Computing fact groups...
Finding invariants...
16 initial candidates
Finding invariants: [0.040s CPU, 0.038s wall-clock]
Checking invariant weight... [0.000s CPU, 0.000s wall-clock]
Instantiating groups... [0.000s CPU, 0.001s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
Choosing groups...
7 uncovered facts
Choosing groups: [0.000s CPU, 0.000s wall-clock]
Building translation key... [0.000s CPU, 0.000s 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.000s wall-clock]
Translating task: [0.000s CPU, 0.004s wall-clock]
8 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
6 propositions removed
Detecting unreachable propositions: [0.010s CPU, 0.002s wall-clock]
Reordering and filtering variables...
6 of 7 variables necessary.
1 of 3 mutex groups necessary.
8 of 8 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.000s CPU, 0.002s wall-clock]
Translator variables: 6
Translator derived variables: 0
Translator facts: 14
Translator goal facts: 1
Translator mutex groups: 1
Translator total mutex groups size: 2
Translator operators: 8
Translator axioms: 0
Translator task size: 71
Translator peak memory: 36044 KB
Writing output... [0.000s CPU, 0.004s wall-clock]
Done! [0.120s CPU, 0.132s wall-clock]
planner.py version 0.0.1
Time: 0.01s
Memory: 49MB
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: 50MB (+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: 50MB
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.01s
Memory: 50MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 50MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.01s
Memory: 50MB (+0MB)
Solving...
Solving Time: 0.00s
Memory: 50MB (+0MB)
SAT
Testing...
SERIALIZABLE?
Testing Time: 0.00s
Memory: 50MB (+0MB)
Answer: 2
occurs(action(("go-out","hoist0","depot0-1-1","loadarea")),1) occurs(action(("lift","hoist0","crate0","container-0-0","loadarea","container0")),2) occurs(action(("drop","hoist0","crate0","depot0-1-1","loadarea","depot0")),3) occurs(action(("go-in","hoist0","loadarea","container-0-0")),4) occurs(action(("go-out","hoist0","container-0-0","loadarea")),5)
SATISFIABLE
Models : 1+
Calls : 3
Time : 0.029s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
CPU Time : 0.024s
Choices : 9 (Domain: 7)
Conflicts : 1 (Analyzed: 1)
Restarts : 0
Model-Level : 11.0
Problems : 3 (Average Length: 5.33 Splits: 0)
Lemmas : 1 (Deleted: 0)
Binary : 0 (Ratio: 0.00%)
Ternary : 0 (Ratio: 0.00%)
Conflict : 1 (Average Length: 8.0 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 1 (Average: 1.00 Max: 1 Sum: 1)
Executed : 1 (Average: 1.00 Max: 1 Sum: 1 Ratio: 100.00%)
Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%)
Rules : 417 (Original: 357)
Atoms : 308
Bodies : 119 (Original: 83)
Count : 0 (Original: 15)
Equivalences : 53 (Atom=Atom: 11 Body=Body: 0 Other: 42)
Tight : Yes
Variables : 248 (Eliminated: 0 Frozen: 0)
Constraints : 696 (Binary: 78.4% Ternary: 18.0% Other: 3.6%)
Memory Peak : 50MB
Max. Length : 5 steps
Sol. Length : 5 steps
Models : 2