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

158 lines
7.0 KiB
Plaintext

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-11.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-11.pddl
Parsing...
Parsing: [0.020s CPU, 0.024s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.006s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.040s CPU, 0.041s wall-clock]
Preparing model... [0.020s CPU, 0.017s wall-clock]
Generated 55 rules.
Computing model... [0.250s CPU, 0.252s wall-clock]
1873 relevant atoms
779 auxiliary atoms
2652 final queue length
5811 total queue pushes
Completing instantiation... [0.550s CPU, 0.550s wall-clock]
Instantiating: [0.870s CPU, 0.869s wall-clock]
Computing fact groups...
Finding invariants...
12 initial candidates
Finding invariants: [0.030s CPU, 0.038s wall-clock]
Checking invariant weight... [0.010s CPU, 0.001s wall-clock]
Instantiating groups... [0.000s CPU, 0.009s wall-clock]
Collecting mutex groups... [0.010s CPU, 0.001s wall-clock]
Choosing groups...
0 uncovered facts
Choosing groups: [0.000s CPU, 0.003s wall-clock]
Building translation key... [0.000s CPU, 0.002s wall-clock]
Computing fact groups: [0.060s CPU, 0.060s 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.001s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.020s CPU, 0.022s wall-clock]
Translating task: [0.400s CPU, 0.398s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
18 propositions removed
Detecting unreachable propositions: [0.200s CPU, 0.200s wall-clock]
Reordering and filtering variables...
18 of 18 variables necessary.
0 of 18 mutex groups necessary.
1476 of 1476 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.060s CPU, 0.064s wall-clock]
Translator variables: 18
Translator derived variables: 0
Translator facts: 131
Translator goal facts: 2
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 1476
Translator axioms: 0
Translator task size: 7787
Translator peak memory: 41932 KB
Writing output... [0.140s CPU, 0.153s wall-clock]
Done! [1.780s CPU, 1.793s wall-clock]
planner.py version 0.0.1
Time: 0.36s
Memory: 72MB
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: 73MB (+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.09s
Memory: 73MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 73MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.31s
Memory: 87MB (+14MB)
Solving...
Solving Time: 0.01s
Memory: 87MB (+0MB)
UNSAT
Iteration Time: 0.46s
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.15s
Memory: 87MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 88MB (+1MB)
SAT
Testing...
SERIALIZABLE?
Testing Time: 0.00s
Memory: 88MB (+0MB)
Answer: 2
occurs(action(("overcome","laceration","lubricity","pear","uranus","saturn")),1) occurs(action(("drink","chicken","bacon","kentucky","manitoba","surrey","alsace","quebec")),1) occurs(action(("drink","tomato","shrimp","bosnia","quebec","alsace","manitoba","kentucky")),1) occurs(action(("drink","pear","cherry","bosnia","quebec","alsace","surrey","manitoba")),1) occurs(action(("feast","lubricity","pear","sweetroll","alsace","quebec")),2) occurs(action(("drink","shrimp","chicken","kentucky","manitoba","surrey","manitoba","kentucky")),2) occurs(action(("overcome","loneliness","lubricity","sweetroll","neptune","uranus")),3) occurs(action(("feast","lubricity","sweetroll","tomato","alsace","quebec")),4) occurs(action(("feast","lubricity","tomato","shrimp","alsace","quebec")),5) occurs(action(("succumb","loneliness","lubricity","shrimp","neptune","uranus")),6) occurs(action(("drink","shrimp","cherry","manitoba","surrey","bosnia","manitoba","kentucky")),6) occurs(action(("succumb","laceration","lubricity","shrimp","uranus","saturn")),7) occurs(action(("drink","shrimp","pear","surrey","bosnia","quebec","alsace","quebec")),7) occurs(action(("drink","shrimp","tomato","bosnia","quebec","alsace","alsace","quebec")),8) occurs(action(("drink","pistachio","sweetroll","surrey","bosnia","quebec","alsace","quebec")),8) occurs(action(("drink","pistachio","bacon","bosnia","quebec","alsace","quebec","bosnia")),9) occurs(action(("feast","lubricity","shrimp","chicken","alsace","quebec")),10) occurs(action(("drink","bacon","pear","bosnia","quebec","alsace","quebec","bosnia")),10)
SATISFIABLE
Models : 1+
Calls : 4
Time : 0.790s (Solving: 0.01s 1st Model: 0.01s Unsat: 0.00s)
CPU Time : 0.772s
Choices : 434 (Domain: 342)
Conflicts : 71 (Analyzed: 70)
Restarts : 0
Model-Level : 112.0
Problems : 4 (Average Length: 7.00 Splits: 0)
Lemmas : 70 (Deleted: 0)
Binary : 29 (Ratio: 41.43%)
Ternary : 1 (Ratio: 1.43%)
Conflict : 70 (Average Length: 23.7 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 70 (Average: 3.43 Max: 31 Sum: 240)
Executed : 65 (Average: 3.27 Max: 31 Sum: 229 Ratio: 95.42%)
Bounded : 5 (Average: 2.20 Max: 7 Sum: 11 Ratio: 4.58%)
Rules : 35756 (Original: 35712)
Atoms : 27889
Bodies : 4388 (Original: 4343)
Count : 65 (Original: 69)
Equivalences : 3756 (Atom=Atom: 7 Body=Body: 0 Other: 3749)
Tight : Yes
Variables : 16402 (Eliminated: 0 Frozen: 11923)
Constraints : 117987 (Binary: 97.8% Ternary: 1.3% Other: 0.9%)
Memory Peak : 88MB
Max. Length : 10 steps
Sol. Length : 10 steps
Models : 2