tplp-planning-benchmark/gc-ta1-tt0/ipc-1998_mystery-round-1-strips_13.out

174 lines
7.5 KiB
Plaintext

INFO Running translator.
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-round-1-strips/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-round-1-strips/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-1998/domains/mystery-round-1-strips/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-round-1-strips/instances/instance-13.pddl
Parsing...
Parsing: [0.030s CPU, 0.037s wall-clock]
Normalizing task... [0.010s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.012s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.030s CPU, 0.035s wall-clock]
Preparing model... [0.040s CPU, 0.036s wall-clock]
Generated 42 rules.
Computing model... [2.220s CPU, 2.216s wall-clock]
19584 relevant atoms
7514 auxiliary atoms
27098 final queue length
61437 total queue pushes
Completing instantiation... [7.740s CPU, 7.739s wall-clock]
Instantiating: [10.060s CPU, 10.065s wall-clock]
Computing fact groups...
Finding invariants...
12 initial candidates
Finding invariants: [0.140s CPU, 0.131s wall-clock]
Checking invariant weight... [0.000s CPU, 0.005s wall-clock]
Instantiating groups... [0.140s CPU, 0.144s wall-clock]
Collecting mutex groups... [0.010s CPU, 0.010s wall-clock]
Choosing groups...
6 uncovered facts
Choosing groups: [0.020s CPU, 0.027s wall-clock]
Building translation key... [0.020s CPU, 0.017s wall-clock]
Computing fact groups: [0.420s CPU, 0.410s wall-clock]
Building STRIPS to SAS dictionary... [0.010s CPU, 0.011s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.006s wall-clock]
Building mutex information...
Building mutex information: [0.010s CPU, 0.009s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.300s CPU, 0.296s wall-clock]
Translating task: [5.570s CPU, 5.569s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
88 propositions removed
Detecting unreachable propositions: [2.900s CPU, 2.892s wall-clock]
Reordering and filtering variables...
76 of 76 variables necessary.
0 of 76 mutex groups necessary.
17845 of 17845 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.850s CPU, 0.852s wall-clock]
Translator variables: 76
Translator derived variables: 0
Translator facts: 1427
Translator goal facts: 2
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 17845
Translator axioms: 0
Translator task size: 108118
Translator peak memory: 107160 KB
Writing output... [1.830s CPU, 2.005s wall-clock]
Done! [21.930s CPU, 22.100s wall-clock]
planner.py version 0.0.1
Time: 4.86s
Memory: 358MB
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.02s
Memory: 358MB (+0MB)
UNSAT
Iteration Time: 0.02s
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: 1.62s
Memory: 358MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.29s
Memory: 375MB (+17MB)
UNSAT
Iteration Time: 2.86s
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: 1.42s
Memory: 382MB (+7MB)
Unblocking actions...
Solving...
Solving Time: 0.16s
Memory: 438MB (+56MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 4.22s
Memory: 628MB (+190MB)
Solving...
Solving Time: 0.13s
Memory: 605MB (+-23MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 3.99s
Memory: 641MB (+36MB)
Solving...
Solving Time: 0.13s
Memory: 641MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 3.89s
Memory: 644MB (+3MB)
Solving...
Solving Time: 0.13s
Memory: 644MB (+0MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 3.70s
Memory: 647MB (+3MB)
Answer: 4
occurs(action(("overcome","prostatitis-13","curiosity","ham","neptune","vulcan")),1) occurs(action(("feast","love","baguette","lemon","alsace","bavaria")),1) occurs(action(("feast","achievement","turkey","onion","alsace","bavaria")),1) occurs(action(("feast","aesthetics","hamburger","scallion","alsace","bavaria")),1) occurs(action(("feast","entertainment","mutton","scallop","bavaria","quebec")),1) occurs(action(("feast","intoxication","yogurt","scallop","oregon","alsace")),1) occurs(action(("feast","satisfaction","rice","lettuce","bavaria","quebec")),1) occurs(action(("overcome","laceration-20","love","lemon","vulcan","venus")),2) occurs(action(("feast","aesthetics","scallion","flounder","oregon","alsace")),2) occurs(action(("feast","love","lemon","onion","bavaria","quebec")),2) occurs(action(("feast","aesthetics","flounder","lemon","bavaria","quebec")),3) occurs(action(("feast","love","onion","turkey","oregon","alsace")),3) occurs(action(("overcome","prostatitis-18","aesthetics","lemon","mars","neptune")),4) occurs(action(("feast","love","turkey","potato","oregon","alsace")),4) occurs(action(("feast","aesthetics","lemon","baguette","alsace","bavaria")),5) occurs(action(("feast","love","potato","muffin","oregon","alsace")),5) occurs(action(("feast","aesthetics","baguette","lobster","oregon","alsace")),6) occurs(action(("feast","love","muffin","ham","alsace","bavaria")),6) occurs(action(("succumb","prostatitis-18","aesthetics","lobster","mars","neptune")),7) occurs(action(("succumb","laceration-20","love","ham","vulcan","venus")),7) occurs(action(("feast","satisfaction","lettuce","rice","oregon","alsace")),8) occurs(action(("feast","satisfaction","rice","marzipan","alsace","bavaria")),9) occurs(action(("feast","aesthetics","lobster","marzipan","oregon","alsace")),10)
SATISFIABLE
Models : 1+
Calls : 6
Time : 11.780s (Solving: 0.22s 1st Model: 0.17s Unsat: 0.00s)
CPU Time : 11.492s
Choices : 11106 (Domain: 1075)
Conflicts : 118 (Analyzed: 117)
Restarts : 0
Model-Level : 2161.5
Problems : 6 (Average Length: 9.50 Splits: 0)
Lemmas : 117 (Deleted: 0)
Binary : 32 (Ratio: 27.35%)
Ternary : 6 (Ratio: 5.13%)
Conflict : 117 (Average Length: 659.5 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 117 (Average: 21.56 Max: 1934 Sum: 2522)
Executed : 115 (Average: 21.44 Max: 1934 Sum: 2508 Ratio: 99.44%)
Bounded : 2 (Average: 7.00 Max: 7 Sum: 14 Ratio: 0.56%)
Rules : 507731 (Original: 507239)
Atoms : 363024
Bodies : 97018 (Original: 96603)
Count : 324 (Original: 381)
Equivalences : 49031 (Atom=Atom: 58 Body=Body: 0 Other: 48973)
Tight : Yes
Variables : 186596 (Eliminated: 0 Frozen: 60820)
Constraints : 1078744 (Binary: 98.1% Ternary: 0.9% Other: 1.0%)
Memory Peak : 647MB
Max. Length : 10 steps
Sol. Length : 10 steps
Models : 4