INFO Running translator. INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/instances/instance-3.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-2002/domains/driverlog-strips-automatic/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/instances/instance-3.pddl Parsing... Parsing: [0.020s CPU, 0.018s wall-clock] Normalizing task... [0.000s CPU, 0.001s wall-clock] Instantiating... Generating Datalog program... [0.010s CPU, 0.004s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.010s CPU, 0.021s wall-clock] Preparing model... [0.020s CPU, 0.011s wall-clock] Generated 35 rules. Computing model... [0.040s CPU, 0.039s wall-clock] 233 relevant atoms 180 auxiliary atoms 413 final queue length 511 total queue pushes Completing instantiation... [0.020s CPU, 0.028s wall-clock] Instantiating: [0.100s CPU, 0.104s wall-clock] Computing fact groups... Finding invariants... 11 initial candidates Finding invariants: [0.020s CPU, 0.020s wall-clock] Checking invariant weight... [0.000s CPU, 0.001s wall-clock] Instantiating groups... [0.010s CPU, 0.005s wall-clock] Collecting mutex groups... [0.000s CPU, 0.000s wall-clock] Choosing groups... 2 uncovered facts Choosing groups: [0.000s CPU, 0.001s wall-clock] Building translation key... [0.000s CPU, 0.001s wall-clock] Computing fact groups: [0.030s CPU, 0.030s 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.002s wall-clock] Translating task: [0.030s CPU, 0.026s wall-clock] 12 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 8 propositions removed Detecting unreachable propositions: [0.010s CPU, 0.014s wall-clock] Reordering and filtering variables... 9 of 10 variables necessary. 2 of 10 mutex groups necessary. 108 of 120 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.010s CPU, 0.005s wall-clock] Translator variables: 9 Translator derived variables: 0 Translator facts: 41 Translator goal facts: 6 Translator mutex groups: 2 Translator total mutex groups size: 6 Translator operators: 108 Translator axioms: 0 Translator task size: 506 Translator peak memory: 36556 KB Writing output... [0.010s CPU, 0.013s wall-clock] Done! [0.210s CPU, 0.215s wall-clock] planner.py version 0.0.1 Time: 0.03s 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.02s Memory: 51MB (+0MB) Answer: 1 occurs(action(("load-truck","package3","truck1","s1")),1) occurs(action(("walk","driver2","s0","p2-0")),1) occurs(action(("board-truck","driver1","truck1","s1")),1) occurs(action(("walk","driver2","p2-0","s2")),2) occurs(action(("drive-truck","truck1","s1","s0","driver1")),2) occurs(action(("load-truck","package1","truck1","s0")),3) occurs(action(("load-truck","package2","truck1","s0")),3) occurs(action(("drive-truck","truck1","s0","s2","driver1")),3) occurs(action(("unload-truck","package3","truck1","s2")),4) occurs(action(("drive-truck","truck1","s2","s1","driver1")),4) occurs(action(("unload-truck","package1","truck1","s1")),5) occurs(action(("unload-truck","package2","truck1","s1")),5) SATISFIABLE Models : 1+ Calls : 2 Time : 0.044s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s) CPU Time : 0.040s Choices : 14 (Domain: 13) Conflicts : 2 (Analyzed: 2) Restarts : 0 Model-Level : 19.0 Problems : 2 (Average Length: 4.50 Splits: 0) Lemmas : 2 (Deleted: 0) Binary : 0 (Ratio: 0.00%) Ternary : 0 (Ratio: 0.00%) Conflict : 2 (Average Length: 4.0 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 2 (Average: 1.00 Max: 1 Sum: 2) Executed : 2 (Average: 1.00 Max: 1 Sum: 2 Ratio: 100.00%) Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%) Rules : 1682 Atoms : 1682 Bodies : 1 (Original: 0) Tight : Yes Variables : 858 (Eliminated: 0 Frozen: 71) Constraints : 1881 (Binary: 88.5% Ternary: 7.4% Other: 4.1%) Memory Peak : 51MB Max. Length : 5 steps Sol. Length : 5 steps Models : 1