INFO Running translator. INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/movie-round-1-strips/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/movie-round-1-strips/instances/instance-28.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/movie-round-1-strips/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/movie-round-1-strips/instances/instance-28.pddl Parsing... Parsing: [0.020s CPU, 0.022s wall-clock] Normalizing task... [0.000s CPU, 0.001s wall-clock] Instantiating... Generating Datalog program... [0.010s CPU, 0.013s wall-clock] Normalizing Datalog program... Trivial rules: Converted to facts. Normalizing Datalog program: [0.010s CPU, 0.007s wall-clock] Preparing model... [0.020s CPU, 0.026s wall-clock] Generated 16 rules. Computing model... [0.040s CPU, 0.044s wall-clock] 651 relevant atoms 0 auxiliary atoms 651 final queue length 806 total queue pushes Completing instantiation... [0.010s CPU, 0.017s wall-clock] Instantiating: [0.100s CPU, 0.109s wall-clock] Computing fact groups... Finding invariants... 7 initial candidates Finding invariants: [0.000s CPU, 0.002s wall-clock] Checking invariant weight... [0.010s CPU, 0.001s wall-clock] Instantiating groups... [0.000s CPU, 0.000s wall-clock] Collecting mutex groups... [0.000s CPU, 0.000s wall-clock] Choosing groups... 7 uncovered facts Choosing groups: [0.000s CPU, 0.000s wall-clock] Building translation key... [0.000s CPU, 0.000s wall-clock] Computing fact groups: [0.010s CPU, 0.004s wall-clock] Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock] Building dictionary for full mutex groups... [0.000s CPU, 0.000s wall-clock] Building mutex information... Building mutex information: [0.000s CPU, 0.000s wall-clock] Translating task... Processing axioms... Simplifying axioms... [0.000s CPU, 0.000s wall-clock] Processing axioms: [0.000s CPU, 0.001s wall-clock] Translating task: [0.010s CPU, 0.017s wall-clock] 1 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 0 propositions removed Detecting unreachable propositions: [0.020s CPU, 0.018s wall-clock] Reordering and filtering variables... 7 of 7 variables necessary. 0 of 0 mutex groups necessary. 162 of 162 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.000s CPU, 0.004s wall-clock] Translator variables: 7 Translator derived variables: 0 Translator facts: 14 Translator goal facts: 7 Translator mutex groups: 0 Translator total mutex groups size: 0 Translator operators: 162 Translator axioms: 0 Translator task size: 353 Translator peak memory: 36556 KB Writing output... [0.010s CPU, 0.015s wall-clock] Done! [0.180s CPU, 0.191s wall-clock] planner.py version 0.0.1 Time: 0.02s Memory: 50MB 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.00s Memory: 50MB (+0MB) UNSAT Iteration Time: 0.00s 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.01s Memory: 51MB (+1MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 51MB (+0MB) SAT Testing... SERIALIZABLE Testing Time: 0.01s Memory: 51MB (+0MB) Answer: 1 occurs(action(("get-cheese","z18")),1) occurs(action(("get-chips","c10")),1) occurs(action(("get-crackers","k10")),1) occurs(action(("get-dip","d1")),1) occurs(action(("get-pop","p10")),1) occurs(action("rewind-movie"),1) occurs(action("reset-counter"),2) occurs(action("reset-counter"),3) occurs(action("reset-counter"),4) occurs(action("reset-counter"),5) SATISFIABLE Models : 1+ Calls : 2 Time : 0.039s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s) CPU Time : 0.036s Choices : 201 (Domain: 26) Conflicts : 0 (Analyzed: 0) Restarts : 0 Model-Level : 208.0 Problems : 2 (Average Length: 4.50 Splits: 0) Lemmas : 0 (Deleted: 0) Binary : 0 (Ratio: 0.00%) Ternary : 0 (Ratio: 0.00%) Conflict : 0 (Average Length: 0.0 Ratio: 0.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 0 (Average: 0.00 Max: 0 Sum: 0) Executed : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%) Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 100.00%) Rules : 1546 Atoms : 1546 Bodies : 1 (Original: 0) Tight : Yes Variables : 951 (Eliminated: 0 Frozen: 0) Constraints : 3410 (Binary: 98.2% Ternary: 0.9% Other: 0.9%) Memory Peak : 51MB Max. Length : 5 steps Sol. Length : 5 steps Models : 1