1
0
tplp-planning-benchmark/fd-pb-e1-sh-h/ipc-1998_mystery-round-1-strips_20.out

143 lines
7.3 KiB
Plaintext
Raw Normal View History

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-20.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-20.pddl
Parsing...
Parsing: [0.020s CPU, 0.017s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.005s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.022s wall-clock]
Preparing model... [0.020s CPU, 0.017s wall-clock]
Generated 42 rules.
Computing model... [0.830s CPU, 0.833s wall-clock]
7768 relevant atoms
4174 auxiliary atoms
11942 final queue length
25710 total queue pushes
Completing instantiation... [2.550s CPU, 2.541s wall-clock]
Instantiating: [3.430s CPU, 3.428s wall-clock]
Computing fact groups...
Finding invariants...
12 initial candidates
Finding invariants: [0.060s CPU, 0.058s wall-clock]
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
Instantiating groups... [0.040s CPU, 0.034s wall-clock]
Collecting mutex groups... [0.010s CPU, 0.003s wall-clock]
Choosing groups...
2 uncovered facts
Choosing groups: [0.010s CPU, 0.008s wall-clock]
Building translation key... [0.000s CPU, 0.005s wall-clock]
Computing fact groups: [0.130s CPU, 0.130s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s wall-clock]
Building dictionary for full mutex groups... [0.010s CPU, 0.005s 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.100s CPU, 0.098s wall-clock]
Translating task: [1.870s CPU, 1.870s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
46 propositions removed
Detecting unreachable propositions: [1.010s CPU, 1.012s wall-clock]
Reordering and filtering variables...
42 of 42 variables necessary.
0 of 42 mutex groups necessary.
7094 of 7094 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.290s CPU, 0.288s wall-clock]
Translator variables: 42
Translator derived variables: 0
Translator facts: 462
Translator goal facts: 1
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 7094
Translator axioms: 0
Translator task size: 40295
Translator peak memory: 59992 KB
Writing output... [0.640s CPU, 0.705s wall-clock]
Done! [7.490s CPU, 7.546s wall-clock]
planner.py version 0.0.1
Time: 1.48s
Memory: 153MB
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.01s
Memory: 153MB (+0MB)
UNSAT
Iteration Time: 0.01s
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.75s
Memory: 153MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.08s
Memory: 159MB (+6MB)
UNSAT
Iteration Time: 1.16s
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.86s
Memory: 188MB (+29MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("overcome","abrasion","intoxication","wonderbread","neptune","venus")),1) occurs(action(("feast","achievement","cherry","turkey","bosnia","goias")),1) occurs(action(("feast","aesthetics","muffin","sweetroll","goias","arizona")),1) occurs(action(("feast","curiosity","cod","tuna","bosnia","goias")),1) occurs(action(("feast","empathy","pork","sweetroll","guanabara","quebec")),1) occurs(action(("feast","expectation","orange","marzipan","guanabara","quebec")),1) occurs(action(("feast","love","mutton","wonderbread","guanabara","quebec")),1) occurs(action(("feast","satisfaction","sweetroll","tuna","bosnia","goias")),1) occurs(action(("feast","triumph","yogurt","muffin","goias","arizona")),1) occurs(action(("feast","understanding","marzipan","cherry","kentucky","moravia")),1) occurs(action(("feast","empathy","sweetroll","muffin","moravia","bosnia")),2) occurs(action(("feast","expectation","marzipan","cherry","alsace","kentucky")),2) occurs(action(("feast","intoxication","wonderbread","yogurt","moravia","bosnia")),2) occurs(action(("feast","understanding","cherry","turkey","moravia","bosnia")),2) occurs(action(("feast","achievement","turkey","cherry","quebec","alsace")),2) occurs(action(("feast","expectation","cherry","pepper","kentucky","moravia")),3) occurs(action(("feast","intoxication","yogurt","tuna","bosnia","goias")),3) occurs(action(("feast","understanding","turkey","tuna","guanabara","quebec")),3) occurs(action(("feast","expectation","pepper","guava","surrey","bavaria")),4) occurs(action(("feast","intoxication","tuna","turkey","goias","arizona")),4) occurs(action(("feast","expectation","guava","turkey","bosnia","goias")),5) occurs(action(("feast","intoxication","turkey","cherry","manitoba","guanabara")),5) occurs(action(("feast","intoxication","cherry","pepper","alsace","kentucky")),6) occurs(action(("feast","understanding","tuna","yogurt","bosnia","goias")),6) occurs(action(("succumb","abrasion","intoxication","pepper","neptune","venus")),7) occurs(action(("feast","intoxication","pepper","guava","oregon","surrey")),8) occurs(action(("feast","achievement","cherry","marzipan","quebec","alsace")),9) occurs(action(("feast","triumph","muffin","sweetroll","bosnia","goias")),10)
Solving Time: 0.23s
Memory: 209MB (+21MB)
SAT
SATISFIABLE
Models : 1+
Calls : 3
Time : 4.205s (Solving: 0.20s 1st Model: 0.19s Unsat: 0.00s)
CPU Time : 4.090s
Choices : 3785 (Domain: 3590)
Conflicts : 995 (Analyzed: 994)
Restarts : 12 (Average: 82.83 Last: 59)
Model-Level : 305.0
Problems : 3 (Average Length: 7.00 Splits: 0)
Lemmas : 994 (Deleted: 0)
Binary : 115 (Ratio: 11.57%)
Ternary : 13 (Ratio: 1.31%)
Conflict : 994 (Average Length: 305.1 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 994 (Average: 3.38 Max: 187 Sum: 3362)
Executed : 981 (Average: 3.26 Max: 187 Sum: 3241 Ratio: 96.40%)
Bounded : 13 (Average: 9.31 Max: 12 Sum: 121 Ratio: 3.60%)
Rules : 138375
Atoms : 138375
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 72714 (Eliminated: 0 Frozen: 66792)
Constraints : 481698 (Binary: 98.4% Ternary: 0.7% Other: 0.9%)
Memory Peak : 209MB
Max. Length : 10 steps
Sol. Length : 10 steps