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

158 lines
7.4 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.030s CPU, 0.031s wall-clock]
Normalizing task... [0.010s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.010s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.030s CPU, 0.031s wall-clock]
Preparing model... [0.030s CPU, 0.030s wall-clock]
Generated 42 rules.
Computing model... [4.000s CPU, 3.997s wall-clock]
38374 relevant atoms
11225 auxiliary atoms
49599 final queue length
121803 total queue pushes
Completing instantiation... [16.040s CPU, 16.041s wall-clock]
Instantiating: [20.160s CPU, 20.156s wall-clock]
Computing fact groups...
Finding invariants...
12 initial candidates
Finding invariants: [0.240s CPU, 0.244s wall-clock]
Checking invariant weight... [0.010s CPU, 0.005s wall-clock]
Instantiating groups... [0.120s CPU, 0.127s wall-clock]
Collecting mutex groups... [0.010s CPU, 0.009s wall-clock]
Choosing groups...
2 uncovered facts
Choosing groups: [0.020s CPU, 0.025s wall-clock]
Building translation key... [0.010s CPU, 0.016s wall-clock]
Computing fact groups: [0.490s CPU, 0.496s wall-clock]
Building STRIPS to SAS dictionary... [0.010s CPU, 0.008s wall-clock]
Building dictionary for full mutex groups... [0.010s 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.600s CPU, 0.607s wall-clock]
Translating task: [11.840s CPU, 11.831s 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.950s CPU, 5.954s 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.731s 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: 180952 KB
Writing output... [3.740s CPU, 4.081s wall-clock]
Done! [44.470s CPU, 44.796s wall-clock]
planner.py version 0.0.1
Time: 9.61s
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.43s
Memory: 632MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 1.00s
Memory: 659MB (+27MB)
UNSAT
Iteration Time: 6.79s
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.24s
Memory: 798MB (+84MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 7.51s
Memory: 1155MB (+357MB)
Solving...
Solving Time: 0.39s
Memory: 1155MB (+0MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 7.20s
Memory: 1151MB (+-4MB)
Answer: 2
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(("overcome","jealousy-16","aesthetics","kale","mars","neptune")),2) occurs(action(("feast","aesthetics","kale","arugula","moravia","quebec")),2) occurs(action(("feast","intoxication","pepper","grapefruit","moravia","quebec")),2) occurs(action(("overcome","laceration-27","intoxication","grapefruit","mars","neptune")),3) occurs(action(("feast","aesthetics","arugula","beef","surrey","moravia")),3) occurs(action(("feast","aesthetics","beef","snickers","surrey","moravia")),4) occurs(action(("overcome","hangover-29","intoxication","grapefruit","mercury","mars")),5) occurs(action(("overcome","hangover-6","satisfaction","ham","mars","neptune")),5) occurs(action(("feast","aesthetics","snickers","lamb","oregon","alsace")),5) occurs(action(("feast","stimulation","melon","potato","oregon","alsace")),5) occurs(action(("feast","aesthetics","lamb","tofu","surrey","moravia")),6) occurs(action(("overcome","abrasion-5","satisfaction","ham","mercury","mars")),6) occurs(action(("feast","stimulation","potato","snickers","moravia","quebec")),6) occurs(action(("succumb","jealousy-16","aesthetics","tofu","mars","neptune")),7) occurs(action(("feast","stimulation","snickers","potato","quebec","oregon")),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)
SATISFIABLE
Models : 1+
Calls : 4
Time : 22.301s (Solving: 0.43s 1st Model: 0.36s Unsat: 0.01s)
CPU Time : 21.976s
Choices : 7836 (Domain: 2108)
Conflicts : 521 (Analyzed: 520)
Restarts : 5 (Average: 104.00 Last: 59)
Model-Level : 2348.5
Problems : 4 (Average Length: 8.25 Splits: 0)
Lemmas : 520 (Deleted: 0)
Binary : 62 (Ratio: 11.92%)
Ternary : 14 (Ratio: 2.69%)
Conflict : 520 (Average Length: 259.6 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 520 (Average: 6.25 Max: 1360 Sum: 3250)
Executed : 508 (Average: 6.01 Max: 1360 Sum: 3126 Ratio: 96.18%)
Bounded : 12 (Average: 10.33 Max: 12 Sum: 124 Ratio: 3.82%)
Rules : 664705
Atoms : 664703
Bodies : 13 (Original: 12)
Count : 2
Equivalences : 30 (Atom=Atom: 10 Body=Body: 0 Other: 20)
Tight : Yes
Variables : 352221 (Eliminated: 0 Frozen: 56225)
Constraints : 1906246 (Binary: 99.0% Ternary: 0.5% Other: 0.5%)
Memory Peak : 1231MB
Max. Length : 10 steps
Sol. Length : 10 steps
Models : 2