tplp-planning-benchmark/gc-ta1-tt1/ipc-1998_mystery-prime-round-1-strips_5.out

158 lines
7.9 KiB
Plaintext
Raw Normal View History

INFO Running translator.
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-prime-round-1-strips/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-prime-round-1-strips/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-1998/domains/mystery-prime-round-1-strips/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-prime-round-1-strips/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.039s wall-clock]
Preparing model... [0.020s CPU, 0.019s wall-clock]
Generated 55 rules.
Computing model... [0.480s CPU, 0.474s wall-clock]
3870 relevant atoms
1708 auxiliary atoms
5578 final queue length
12309 total queue pushes
Completing instantiation... [1.380s CPU, 1.380s wall-clock]
Instantiating: [1.920s CPU, 1.925s wall-clock]
Computing fact groups...
Finding invariants...
12 initial candidates
Finding invariants: [0.050s CPU, 0.050s wall-clock]
Checking invariant weight... [0.010s CPU, 0.002s wall-clock]
Instantiating groups... [0.020s CPU, 0.023s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
Choosing groups...
0 uncovered facts
Choosing groups: [0.010s CPU, 0.006s wall-clock]
Building translation key... [0.000s CPU, 0.003s wall-clock]
Computing fact groups: [0.100s CPU, 0.095s 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.002s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.060s CPU, 0.057s wall-clock]
Translating task: [1.020s CPU, 1.006s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
31 propositions removed
Detecting unreachable propositions: [0.550s CPU, 0.553s wall-clock]
Reordering and filtering variables...
31 of 31 variables necessary.
0 of 31 mutex groups necessary.
3432 of 3432 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.160s CPU, 0.165s wall-clock]
Translator variables: 31
Translator derived variables: 0
Translator facts: 260
Translator goal facts: 2
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 3432
Translator axioms: 0
Translator task size: 20333
Translator peak memory: 49612 KB
Writing output... [0.340s CPU, 0.380s wall-clock]
Done! [4.160s CPU, 4.202s wall-clock]
planner.py version 0.0.1
Time: 0.84s
Memory: 107MB
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: 108MB (+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
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.23s
Memory: 108MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.02s
Memory: 111MB (+3MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.78s
Memory: 140MB (+29MB)
Solving...
Solving Time: 0.01s
Memory: 140MB (+0MB)
UNSAT
Iteration Time: 1.18s
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
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 0.45s
Memory: 140MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.08s
Memory: 143MB (+3MB)
SAT
Testing...
SERIALIZABLE?
Testing Time: 0.00s
Memory: 143MB (+0MB)
Answer: 2
occurs(action(("overcome","grief","satisfaction","broccoli","mercury","earth")),1) occurs(action(("feast","excitement","turkey","chocolate","alsace","kentucky")),1) occurs(action(("drink","broccoli","cherry","arizona","goias","kentucky","kentucky","goias")),1) occurs(action(("drink","chocolate","shrimp","goias","kentucky","alsace","kentucky","goias")),1) occurs(action(("drink","tuna","sweetroll","arizona","goias","kentucky","alsace","kentucky")),1) occurs(action(("feast","lubricity","sweetroll","scallop","alsace","kentucky")),2) occurs(action(("drink","tuna","cherry","goias","kentucky","alsace","goias","arizona")),2) occurs(action(("feast","satisfaction","broccoli","chocolate","kentucky","goias")),2) occurs(action(("drink","shrimp","chocolate","goias","kentucky","alsace","kentucky","goias")),2) occurs(action(("overcome","loneliness","lubricity","scallop","mercury","earth")),3) occurs(action(("feast","satisfaction","chocolate","shrimp","kentucky","goias")),3) occurs(action(("feast","intoxication","tuna","broccoli","alsace","kentucky")),3) occurs(action(("drink","cherry","scallop","arizona","goias","kentucky","alsace","kentucky")),3) occurs(action(("succumb","grief","satisfaction","shrimp","mercury","earth")),4) occurs(action(("drink","cherry","sweetroll","goias","kentucky","alsace","alsace","kentucky")),4) occurs(action(("feast","lubricity","scallop","sweetroll","alsace","kentucky")),4) occurs(action(("feast","lubricity","sweetroll","shrimp","alsace","kentucky")),5) occurs(action(("feast","intoxication","broccoli","chocolate","alsace","kentucky")),5) occurs(action(("feast","satisfaction","shrimp","cherry","alsace","kentucky")),5) occurs(action(("succumb","loneliness","lubricity","shrimp","mercury","earth")),6) occurs(action(("feast","intoxication","chocolate","shrimp","alsace","kentucky")),6) occurs(action(("feast","satisfaction","cherry","scallop","alsace","kentucky")),6) occurs(action(("overcome","jealousy","intoxication","shrimp","mercury","earth")),7) occurs(action(("overcome","dread","satisfaction","scallop","mercury","earth")),7) occurs(action(("overcome","angina","intoxication","shrimp","uranus","mercury")),8) occurs(action(("succumb","dread","satisfaction","scallop","mercury","earth")),8) occurs(action(("overcome","dread","satisfaction","scallop","mercury","earth")),9) occurs(action(("succumb","angina","intoxication","shrimp","uranus","mercury")),10)
SATISFIABLE
Models : 1+
Calls : 4
Time : 2.073s (Solving: 0.07s 1st Model: 0.06s Unsat: 0.00s)
CPU Time : 2.036s
Choices : 1324 (Domain: 1076)
Conflicts : 260 (Analyzed: 259)
Restarts : 1 (Average: 259.00 Last: 72)
Model-Level : 88.5
Problems : 4 (Average Length: 7.00 Splits: 0)
Lemmas : 259 (Deleted: 0)
Binary : 19 (Ratio: 7.34%)
Ternary : 9 (Ratio: 3.47%)
Conflict : 259 (Average Length: 136.2 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 259 (Average: 4.41 Max: 51 Sum: 1142)
Executed : 255 (Average: 4.29 Max: 51 Sum: 1110 Ratio: 97.20%)
Bounded : 4 (Average: 8.00 Max: 12 Sum: 32 Ratio: 2.80%)
Rules : 82766 (Original: 82700)
Atoms : 69057
Bodies : 8938 (Original: 8872)
Count : 109 (Original: 119)
Equivalences : 5236 (Atom=Atom: 16 Body=Body: 0 Other: 5220)
Tight : Yes
Variables : 36774 (Eliminated: 0 Frozen: 24370)
Constraints : 263824 (Binary: 98.2% Ternary: 0.7% Other: 1.1%)
Memory Peak : 143MB
Max. Length : 10 steps
Sol. Length : 10 steps
Models : 2