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-29.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-29.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.030s CPU, 0.026s wall-clock]
Preparing model... [0.010s CPU, 0.013s wall-clock]
Generated 42 rules.
Computing model... [0.180s CPU, 0.182s wall-clock]
1534 relevant atoms
892 auxiliary atoms
2426 final queue length
4719 total queue pushes
Completing instantiation... [0.440s CPU, 0.434s wall-clock]
Instantiating: [0.660s CPU, 0.663s wall-clock]
Computing fact groups...
Finding invariants...
12 initial candidates
Finding invariants: [0.020s CPU, 0.023s wall-clock]
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
Instantiating groups... [0.020s CPU, 0.014s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
Choosing groups...
1 uncovered facts
Choosing groups: [0.000s CPU, 0.003s wall-clock]
Building translation key... [0.000s CPU, 0.002s wall-clock]
Computing fact groups: [0.050s CPU, 0.052s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.001s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.001s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.030s CPU, 0.018s wall-clock]
Translating task: [0.330s CPU, 0.319s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
24 propositions removed
Detecting unreachable propositions: [0.160s CPU, 0.159s wall-clock]
Reordering and filtering variables...
22 of 22 variables necessary.
0 of 22 mutex groups necessary.
1224 of 1224 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.040s CPU, 0.053s wall-clock]
Translator variables: 22
Translator derived variables: 0
Translator facts: 177
Translator goal facts: 2
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 1224
Translator axioms: 0
Translator task size: 7377
Translator peak memory: 37976 KB
Writing output... [0.120s CPU, 0.128s wall-clock]
Done! [1.400s CPU, 1.412s wall-clock]
planner.py version 0.0.1
Time: 3.53s
Memory: 208MB
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: 208MB (+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: 0.43s
Memory: 255MB (+47MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("overcome","hangover","achievement","scallop","neptune","uranus")),1) occurs(action(("feast","achievement","scallop","pork","bavaria","oregon")),2) occurs(action(("feast","excitement","pork","scallop","manitoba","bavaria")),2) occurs(action(("overcome","jealousy","achievement","pork","pluto","neptune")),3) occurs(action(("feast","achievement","pork","broccoli","quebec","manitoba")),3) occurs(action(("feast","excitement","scallop","pork","manitoba","bavaria")),3) occurs(action(("succumb","hangover","achievement","broccoli","pluto","neptune")),4) occurs(action(("feast","achievement","broccoli","shrimp","pennsylvania","alsace")),4) occurs(action(("feast","excitement","pork","pear","alsace","quebec")),4) occurs(action(("succumb","jealousy","achievement","shrimp","neptune","uranus")),5) occurs(action(("feast","achievement","shrimp","popover","oregon","kentucky")),5)
Solving Time: 0.03s
Memory: 259MB (+4MB)
SAT
SATISFIABLE
Models : 1+
Calls : 2
Time : 4.152s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
CPU Time : 4.120s
Choices : 127
Conflicts : 16 (Analyzed: 16)
Restarts : 0
Model-Level : 39.0
Problems : 2 (Average Length: 4.50 Splits: 0)
Lemmas : 16 (Deleted: 0)
Binary : 4 (Ratio: 25.00%)
Ternary : 0 (Ratio: 0.00%)
Conflict : 16 (Average Length: 11.2 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 16 (Average: 6.38 Max: 22 Sum: 102)
Executed : 15 (Average: 5.94 Max: 22 Sum: 95 Ratio: 93.14%)
Bounded : 1 (Average: 7.00 Max: 7 Sum: 7 Ratio: 6.86%)
Rules : 1784186
Atoms : 1784186
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 16004 (Eliminated: 0 Frozen: 14919)
Constraints : 20551 (Binary: 95.8% Ternary: 1.8% Other: 2.3%)
Memory Peak : 259MB
Max. Length : 5 steps
Sol. Length : 5 steps