INFO Running translator. INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/tpp-propositional/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/tpp-propositional/instances/instance-2.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-2006/domains/tpp-propositional/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/tpp-propositional/instances/instance-2.pddl Parsing... Parsing: [0.010s CPU, 0.022s wall-clock] Normalizing task... [0.010s CPU, 0.002s wall-clock] Instantiating... Generating Datalog program... [0.000s CPU, 0.004s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.040s CPU, 0.043s wall-clock] Preparing model... [0.010s CPU, 0.013s wall-clock] Generated 45 rules. Computing model... [0.020s CPU, 0.015s wall-clock] 56 relevant atoms 83 auxiliary atoms 139 final queue length 144 total queue pushes Completing instantiation... [0.010s CPU, 0.005s wall-clock] Instantiating: [0.080s CPU, 0.081s wall-clock] Computing fact groups... Finding invariants... 18 initial candidates Finding invariants: [0.050s CPU, 0.054s wall-clock] Checking invariant weight... [0.000s CPU, 0.001s wall-clock] Instantiating groups... [0.000s CPU, 0.001s wall-clock] Collecting mutex groups... [0.000s CPU, 0.000s wall-clock] Choosing groups... 0 uncovered facts Choosing groups: [0.000s CPU, 0.001s wall-clock] Building translation key... [0.000s CPU, 0.000s wall-clock] Computing fact groups: [0.050s CPU, 0.058s 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.000s wall-clock] Translating task: [0.000s CPU, 0.003s wall-clock] 0 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 9 propositions removed Detecting unreachable propositions: [0.000s CPU, 0.002s wall-clock] Reordering and filtering variables... 9 of 9 variables necessary. 0 of 9 mutex groups necessary. 8 of 8 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.000s CPU, 0.002s wall-clock] Translator variables: 9 Translator derived variables: 0 Translator facts: 18 Translator goal facts: 2 Translator mutex groups: 0 Translator total mutex groups size: 0 Translator operators: 8 Translator axioms: 0 Translator task size: 71 Translator peak memory: 36044 KB Writing output... [0.000s CPU, 0.004s wall-clock] Done! [0.160s CPU, 0.177s wall-clock] planner.py version 0.0.1 Time: 0.02s Memory: 49MB 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 (+1MB) 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 Expected Memory: 50MB Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])] Grounding Time: 0.01s Memory: 50MB (+0MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 50MB (+0MB) SAT Testing... SERIALIZABLE Testing Time: 0.01s Memory: 50MB (+0MB) Answer: 1 occurs(action(("drive","truck1","depot1","market1")),1) occurs(action(("buy","truck1","goods1","market1","level0","level1","level0","level1")),2) occurs(action(("buy","truck1","goods2","market1","level0","level1","level0","level1")),2) occurs(action(("load","goods1","truck1","market1","level0","level1","level0","level1")),3) occurs(action(("load","goods2","truck1","market1","level0","level1","level0","level1")),3) occurs(action(("drive","truck1","market1","depot1")),3) occurs(action(("unload","goods1","truck1","depot1","level0","level1","level0","level1")),4) occurs(action(("unload","goods2","truck1","depot1","level0","level1","level0","level1")),4) occurs(action(("drive","truck1","depot1","market1")),5) SATISFIABLE Models : 1+ Calls : 2 Time : 0.035s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s) CPU Time : 0.032s Choices : 3 (Domain: 3) Conflicts : 0 (Analyzed: 0) Restarts : 0 Model-Level : 10.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 : 248 Atoms : 248 Bodies : 1 (Original: 0) Tight : Yes Variables : 170 (Eliminated: 0 Frozen: 0) Constraints : 278 (Binary: 85.6% Ternary: 12.9% Other: 1.4%) Memory Peak : 50MB Max. Length : 5 steps Sol. Length : 5 steps Models : 1