tplp-planning-benchmark/fd-pb-e2/ipc-1998_mystery-round-1-strips_20.out

425 lines
15 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.027s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.007s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.030s CPU, 0.029s wall-clock]
Preparing model... [0.020s CPU, 0.022s wall-clock]
Generated 42 rules.
Computing model... [0.930s CPU, 0.931s wall-clock]
7768 relevant atoms
4174 auxiliary atoms
11942 final queue length
25710 total queue pushes
Completing instantiation... [2.850s CPU, 2.850s wall-clock]
Instantiating: [3.850s CPU, 3.851s wall-clock]
Computing fact groups...
Finding invariants...
12 initial candidates
Finding invariants: [0.060s CPU, 0.064s wall-clock]
Checking invariant weight... [0.010s CPU, 0.002s wall-clock]
Instantiating groups... [0.030s CPU, 0.038s wall-clock]
Collecting mutex groups... [0.010s CPU, 0.003s wall-clock]
Choosing groups...
2 uncovered facts
Choosing groups: [0.010s CPU, 0.009s wall-clock]
Building translation key... [0.000s CPU, 0.006s wall-clock]
Computing fact groups: [0.140s CPU, 0.145s wall-clock]
Building STRIPS to SAS dictionary... [0.010s CPU, 0.002s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.005s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.003s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.120s CPU, 0.110s wall-clock]
Translating task: [2.110s CPU, 2.109s 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.130s CPU, 1.125s 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.330s CPU, 0.325s 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: 63180 KB
Writing output... [0.700s CPU, 0.765s wall-clock]
Done! [8.380s CPU, 8.452s wall-clock]
planner.py version 0.0.1
Time: 38.11s
Memory: 1983MB
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.16s
Memory: 1983MB (+0MB)
UNSAT
Iteration Time: 0.17s
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
Expected Memory: 1983MB
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 32.47s
Memory: 4562MB (+2579MB)
Unblocking actions...
Solving...
Solving Time: 11.35s
Memory: 4776MB (+214MB)
UNKNOWN
Iteration Time: 54.02s
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
Expected Memory: 7569.0MB
Skipping: not enough memory for grounding...
Iteration Time: 0.00s
Iteration 4
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 5
Expected Memory: 10362.0MB
Skipping: not enough memory for grounding...
Iteration Time: 0.00s
Iteration 5
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 5
Expected Memory: 13155.0MB
Skipping: not enough memory for grounding...
Iteration Time: 0.00s
Iteration 6
Queue: [(5,25,0,True), (6,30,0,True)]
Grounded Until: 5
Expected Memory: 15948.0MB
Skipping: not enough memory for grounding...
Iteration Time: 0.00s
Iteration 7
Queue: [(6,30,0,True)]
Grounded Until: 5
Expected Memory: 18741.0MB
Skipping: not enough memory for grounding...
Iteration Time: 0.00s
Iteration 8
Queue: [(1,5,1,True), (2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 5
Solving...
Solving Time: 12.18s
Memory: 4776MB (+0MB)
UNKNOWN
Iteration Time: 12.18s
Iteration 9
Queue: [(2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 5
Expected Memory: 7569.0MB
Skipping: not enough memory for grounding...
Iteration Time: 0.00s
Iteration 10
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 5
Expected Memory: 10362.0MB
Skipping: not enough memory for grounding...
Iteration Time: 0.00s
Iteration 11
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 5
Expected Memory: 13155.0MB
Skipping: not enough memory for grounding...
Iteration Time: 0.00s
Iteration 12
Queue: [(5,25,0,True), (6,30,0,True)]
Grounded Until: 5
Expected Memory: 15948.0MB
Skipping: not enough memory for grounding...
Iteration Time: 0.00s
Iteration 13
Queue: [(6,30,0,True)]
Grounded Until: 5
Expected Memory: 18741.0MB
Skipping: not enough memory for grounding...
Iteration Time: 0.00s
Iteration 14
Queue: [(1,5,2,True), (2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 5
Solving...
Solving Time: 13.88s
Memory: 4776MB (+0MB)
UNKNOWN
Iteration Time: 13.88s
Iteration 15
Queue: [(2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 5
Expected Memory: 7569.0MB
Skipping: not enough memory for grounding...
Iteration Time: 0.00s
Iteration 16
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 5
Expected Memory: 10362.0MB
Skipping: not enough memory for grounding...
Iteration Time: 0.00s
Iteration 17
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 5
Expected Memory: 13155.0MB
Skipping: not enough memory for grounding...
Iteration Time: 0.00s
Iteration 18
Queue: [(5,25,0,True), (6,30,0,True)]
Grounded Until: 5
Expected Memory: 15948.0MB
Skipping: not enough memory for grounding...
Iteration Time: 0.00s
Iteration 19
Queue: [(6,30,0,True)]
Grounded Until: 5
Expected Memory: 18741.0MB
Skipping: not enough memory for grounding...
Iteration Time: 0.00s
Iteration 20
Queue: [(1,5,3,True), (2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 5
Solving...
Solving Time: 13.30s
Memory: 4776MB (+0MB)
UNKNOWN
Iteration Time: 13.30s
Iteration 21
Queue: [(2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 5
Expected Memory: 7569.0MB
Skipping: not enough memory for grounding...
Iteration Time: 0.00s
Iteration 22
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 5
Expected Memory: 10362.0MB
Skipping: not enough memory for grounding...
Iteration Time: 0.00s
Iteration 23
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 5
Expected Memory: 13155.0MB
Skipping: not enough memory for grounding...
Iteration Time: 0.00s
Iteration 24
Queue: [(5,25,0,True), (6,30,0,True)]
Grounded Until: 5
Expected Memory: 15948.0MB
Skipping: not enough memory for grounding...
Iteration Time: 0.00s
Iteration 25
Queue: [(6,30,0,True)]
Grounded Until: 5
Expected Memory: 18741.0MB
Skipping: not enough memory for grounding...
Iteration Time: 0.00s
Iteration 26
Queue: [(1,5,4,True), (2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 5
Solving...
Solving Time: 13.51s
Memory: 4776MB (+0MB)
UNKNOWN
Iteration Time: 13.51s
Iteration 27
Queue: [(2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 5
Expected Memory: 7569.0MB
Skipping: not enough memory for grounding...
Iteration Time: 0.00s
Iteration 28
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 5
Expected Memory: 10362.0MB
Skipping: not enough memory for grounding...
Iteration Time: 0.00s
Iteration 29
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 5
Expected Memory: 13155.0MB
Skipping: not enough memory for grounding...
Iteration Time: 0.00s
Iteration 30
Queue: [(5,25,0,True), (6,30,0,True)]
Grounded Until: 5
Expected Memory: 15948.0MB
Skipping: not enough memory for grounding...
Iteration Time: 0.00s
Iteration 31
Queue: [(6,30,0,True)]
Grounded Until: 5
Expected Memory: 18741.0MB
Skipping: not enough memory for grounding...
Iteration Time: 0.00s
Iteration 32
Queue: [(1,5,5,True), (2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 5
Solving...
Solving Time: 14.45s
Memory: 4776MB (+0MB)
UNKNOWN
Iteration Time: 14.45s
Iteration 33
Queue: [(2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 5
Expected Memory: 7569.0MB
Skipping: not enough memory for grounding...
Iteration Time: 0.00s
Iteration 34
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 5
Expected Memory: 10362.0MB
Skipping: not enough memory for grounding...
Iteration Time: 0.00s
Iteration 35
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 5
Expected Memory: 13155.0MB
Skipping: not enough memory for grounding...
Iteration Time: 0.00s
Iteration 36
Queue: [(5,25,0,True), (6,30,0,True)]
Grounded Until: 5
Expected Memory: 15948.0MB
Skipping: not enough memory for grounding...
Iteration Time: 0.00s
Iteration 37
Queue: [(6,30,0,True)]
Grounded Until: 5
Expected Memory: 18741.0MB
Skipping: not enough memory for grounding...
Iteration Time: 0.00s
Iteration 38
Queue: [(1,5,6,True), (2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 5
Solving...
Answer: 1
occurs(action(("overcome","laceration","achievement","cherry","neptune","venus")),1) occurs(action(("feast","achievement","cherry","pepper","bosnia","goias")),1) occurs(action(("overcome","abrasion","intoxication","wonderbread","neptune","venus")),1) occurs(action(("overcome","dread","triumph","yogurt","neptune","venus")),1) occurs(action(("feast","aesthetics","muffin","sweetroll","goias","arizona")),1) occurs(action(("feast","curiosity","cod","marzipan","bosnia","goias")),1) occurs(action(("feast","empathy","pork","cod","guanabara","quebec")),1) occurs(action(("feast","expectation","orange","scallion","guanabara","quebec")),1) occurs(action(("feast","intoxication","wonderbread","yogurt","moravia","bosnia")),1) occurs(action(("feast","love","mutton","pork","guanabara","quebec")),1) occurs(action(("feast","satisfaction","sweetroll","muffin","bosnia","goias")),1) occurs(action(("feast","triumph","yogurt","tuna","goias","arizona")),1) occurs(action(("feast","understanding","marzipan","cherry","kentucky","moravia")),1) occurs(action(("succumb","dread","triumph","tuna","neptune","venus")),2) occurs(action(("feast","curiosity","marzipan","orange","alsace","kentucky")),2) occurs(action(("feast","empathy","cod","marzipan","moravia","bosnia")),2) occurs(action(("feast","intoxication","yogurt","tuna","bosnia","goias")),2) occurs(action(("feast","triumph","tuna","cod","goias","arizona")),2) occurs(action(("feast","understanding","cherry","turkey","moravia","bosnia")),2) occurs(action(("feast","satisfaction","muffin","sweetroll","bosnia","goias")),2) occurs(action(("feast","aesthetics","sweetroll","muffin","moravia","bosnia")),2) occurs(action(("feast","achievement","pepper","cherry","surrey","bavaria")),2) occurs(action(("overcome","dread","intoxication","tuna","saturn","neptune")),3) occurs(action(("overcome","grief","understanding","turkey","saturn","neptune")),3) occurs(action(("succumb","laceration","achievement","turkey","neptune","venus")),3) occurs(action(("feast","achievement","cherry","turkey","kentucky","moravia")),3) occurs(action(("feast","aesthetics","muffin","yogurt","moravia","bosnia")),3) occurs(action(("feast","curiosity","orange","scallion","manitoba","guanabara")),3) occurs(action(("feast","empathy","marzipan","cherry","quebec","alsace")),3) occurs(action(("feast","intoxication","tuna","turkey","bosnia","goias")),3) occurs(action(("feast","love","pork","cod","manitoba","guanabara")),3) occurs(action(("feast","satisfaction","sweetroll","muffin","kentucky","moravia")),3) occurs(action(("feast","triumph","cod","tuna","kentucky","moravia")),3) occurs(action(("feast","understanding","turkey","cherry","quebec","alsace")),3) occurs(action(("feast","expectation","scallion","orange","oregon","surrey")),3) occurs(action(("feast","aesthetics","yogurt","tuna","moravia","bosnia")),4) occurs(action(("feast","curiosity","scallion","orange","arizona","oregon")),4) occurs(action(("feast","empathy","cherry","marzipan","alsace","kentucky")),4) occurs(action(("feast","intoxication","turkey","guava","guanabara","quebec")),4) occurs(action(("feast","love","cod","pork","alsace","kentucky")),4) occurs(action(("feast","triumph","tuna","cod","moravia","bosnia")),4) occurs(action(("succumb","abrasion","intoxication","pepper","saturn","neptune")),5) occurs(action(("feast","intoxication","guava","pepper","bosnia","goias")),5) occurs(action(("feast","understanding","cherry","pepper","quebec","alsace")),5) occurs(action(("feast","achievement","turkey","rice","manitoba","guanabara")),5) occurs(action(("feast","aesthetics","tuna","cod","kentucky","moravia")),5) occurs(action(("feast","empathy","marzipan","cod","guanabara","quebec")),5) occurs(action(("feast","satisfaction","muffin","yogurt","kentucky","moravia")),5) occurs(action(("feast","triumph","cod","tuna","quebec","alsace")),5)
Solving Time: 7.59s
Memory: 4776MB (+0MB)
SAT
SATISFIABLE
Models : 1+
Calls : 8
Time : 167.248s (Solving: 83.96s 1st Model: 7.45s Unsat: 0.00s)
CPU Time : 167.204s
Choices : 203540
Conflicts : 56913 (Analyzed: 56913)
Restarts : 649 (Average: 87.69 Last: 153)
Model-Level : 1715.0
Problems : 8 (Average Length: 6.38 Splits: 0)
Lemmas : 63361 (Deleted: 34185)
Binary : 14269 (Ratio: 22.52%)
Ternary : 1924 (Ratio: 3.04%)
Conflict : 56913 (Average Length: 55.1 Ratio: 89.82%)
Loop : 6448 (Average Length: 63.8 Ratio: 10.18%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 56913 (Average: 3.85 Max: 1520 Sum: 219085)
Executed : 54170 (Average: 3.52 Max: 1520 Sum: 200508 Ratio: 91.52%)
Bounded : 2743 (Average: 6.77 Max: 7 Sum: 18577 Ratio: 8.48%)
Rules : 15675842
Atoms : 15675842
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 214065 (Eliminated: 0 Frozen: 207711)
Constraints : 259842 (Binary: 88.1% Ternary: 6.9% Other: 4.9%)
Memory Peak : 4875MB
Max. Length : 5 steps
Sol. Length : 5 steps