1
0
tplp-planning-benchmark/gc-ta7-tt0/ipc-1998_mystery-round-1-strips_10.out

189 lines
7.9 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-10.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-10.pddl
Parsing...
Parsing: [0.020s CPU, 0.032s wall-clock]
Normalizing task... [0.010s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.015s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.040s CPU, 0.039s wall-clock]
Preparing model... [0.040s CPU, 0.036s wall-clock]
Generated 42 rules.
Computing model... [3.970s CPU, 3.980s wall-clock]
38374 relevant atoms
11225 auxiliary atoms
49599 final queue length
121803 total queue pushes
Completing instantiation... [16.030s CPU, 16.018s wall-clock]
Instantiating: [20.140s CPU, 20.134s wall-clock]
Computing fact groups...
Finding invariants...
12 initial candidates
Finding invariants: [0.240s CPU, 0.243s wall-clock]
Checking invariant weight... [0.000s CPU, 0.004s wall-clock]
Instantiating groups... [0.130s CPU, 0.128s wall-clock]
Collecting mutex groups... [0.010s CPU, 0.009s wall-clock]
Choosing groups...
2 uncovered facts
Choosing groups: [0.020s CPU, 0.026s wall-clock]
Building translation key... [0.010s CPU, 0.016s wall-clock]
Computing fact groups: [0.490s CPU, 0.497s wall-clock]
Building STRIPS to SAS dictionary... [0.010s CPU, 0.007s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.006s wall-clock]
Building mutex information...
Building mutex information: [0.020s CPU, 0.008s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.600s CPU, 0.609s wall-clock]
Translating task: [11.850s CPU, 11.852s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
78 propositions removed
Detecting unreachable propositions: [5.940s CPU, 5.932s wall-clock]
Reordering and filtering variables...
74 of 74 variables necessary.
0 of 74 mutex groups necessary.
36738 of 36738 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [1.730s CPU, 1.730s wall-clock]
Translator variables: 74
Translator derived variables: 0
Translator facts: 1346
Translator goal facts: 1
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 36738
Translator axioms: 0
Translator task size: 220679
Translator peak memory: 180696 KB
Writing output... [3.740s CPU, 4.089s wall-clock]
Done! [44.440s CPU, 44.779s wall-clock]
planner.py version 0.0.1
Time: 9.53s
Memory: 632MB
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.04s
Memory: 632MB (+0MB)
UNSAT
Iteration Time: 0.05s
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: 3.40s
Memory: 632MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.99s
Memory: 659MB (+27MB)
UNSAT
Iteration Time: 6.72s
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: 2.97s
Memory: 714MB (+55MB)
Unblocking actions...
Solving...
Solving Time: 0.25s
Memory: 798MB (+84MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 7.39s
Memory: 1155MB (+357MB)
Solving...
Solving Time: 0.44s
Memory: 1155MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 7.29s
Memory: 1151MB (+-4MB)
Solving...
Solving Time: 0.12s
Memory: 1151MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 7.35s
Memory: 1151MB (+0MB)
Solving...
Solving Time: 0.12s
Memory: 1151MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 7.32s
Memory: 1151MB (+0MB)
Solving...
Solving Time: 0.12s
Memory: 1151MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 7.36s
Memory: 1151MB (+0MB)
Solving...
Solving Time: 0.12s
Memory: 1151MB (+0MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 7.28s
Memory: 1151MB (+0MB)
Answer: 6
occurs(action(("overcome","hangover-29","intoxication","grapefruit","mars","neptune")),1) occurs(action(("overcome","anxiety-12","learning","pepper","mercury","mars")),1) occurs(action(("overcome","anger-7","love","orange","mercury","mars")),1) occurs(action(("overcome","loneliness-1","rest","pork","mercury","mars")),1) occurs(action(("feast","aesthetics","flounder","kale","surrey","moravia")),1) occurs(action(("feast","intoxication","grapefruit","pepper","quebec","oregon")),1) occurs(action(("feast","learning","pepper","grapefruit","quebec","oregon")),1) occurs(action(("feast","love","orange","pork","moravia","quebec")),1) occurs(action(("feast","satisfaction","ham","beef","oregon","alsace")),1) occurs(action(("feast","stimulation","melon","potato","oregon","alsace")),1) occurs(action(("overcome","jealousy-16","aesthetics","kale","mars","neptune")),2) occurs(action(("feast","aesthetics","kale","arugula","moravia","quebec")),2) occurs(action(("feast","stimulation","potato","snickers","moravia","quebec")),2) occurs(action(("feast","intoxication","pepper","grapefruit","moravia","quebec")),2) occurs(action(("feast","aesthetics","arugula","beef","surrey","moravia")),3) occurs(action(("overcome","laceration-27","intoxication","grapefruit","mercury","mars")),4) occurs(action(("feast","aesthetics","beef","snickers","surrey","moravia")),4) occurs(action(("feast","aesthetics","snickers","lamb","oregon","alsace")),5) occurs(action(("feast","aesthetics","lamb","tofu","surrey","moravia")),6) occurs(action(("succumb","jealousy-16","aesthetics","tofu","mars","neptune")),7) occurs(action(("overcome","dread","satisfaction","beef","mars","neptune")),7) occurs(action(("feast","learning","grapefruit","pepper","moravia","quebec")),8) occurs(action(("feast","learning","pepper","cantelope","surrey","moravia")),9) occurs(action(("feast","learning","cantelope","arugula","moravia","quebec")),10) occurs(action(("feast","love","pork","bacon","alsace","kentucky")),10)
SATISFIABLE
Models : 1+
Calls : 8
Time : 22.952s (Solving: 0.75s 1st Model: 0.57s Unsat: 0.01s)
CPU Time : 22.628s
Choices : 22247 (Domain: 3425)
Conflicts : 657 (Analyzed: 656)
Restarts : 7 (Average: 93.71 Last: 44)
Model-Level : 3128.7
Problems : 8 (Average Length: 10.12 Splits: 0)
Lemmas : 656 (Deleted: 0)
Binary : 68 (Ratio: 10.37%)
Ternary : 17 (Ratio: 2.59%)
Conflict : 656 (Average Length: 213.7 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 656 (Average: 5.42 Max: 1183 Sum: 3558)
Executed : 648 (Average: 5.31 Max: 1183 Sum: 3482 Ratio: 97.86%)
Bounded : 8 (Average: 9.50 Max: 12 Sum: 76 Ratio: 2.14%)
Rules : 664771
Atoms : 664764
Bodies : 58 (Original: 57)
Equivalences : 150 (Atom=Atom: 50 Body=Body: 0 Other: 100)
Tight : Yes
Variables : 352221 (Eliminated: 0 Frozen: 11218)
Constraints : 1905496 (Binary: 99.0% Ternary: 0.5% Other: 0.5%)
Memory Peak : 1225MB
Max. Length : 10 steps
Sol. Length : 10 steps
Models : 6