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-9.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-9.pddl Parsing... Parsing: [0.030s CPU, 0.019s wall-clock] Normalizing task... [0.000s CPU, 0.001s wall-clock] Instantiating... Generating Datalog program... [0.000s CPU, 0.006s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.020s CPU, 0.017s wall-clock] Preparing model... [0.020s CPU, 0.014s wall-clock] Generated 35 rules. Computing model... [0.080s CPU, 0.080s wall-clock] 596 relevant atoms 404 auxiliary atoms 1000 final queue length 1334 total queue pushes Completing instantiation... [0.060s CPU, 0.070s wall-clock] Instantiating: [0.180s CPU, 0.188s wall-clock] Computing fact groups... Finding invariants... 11 initial candidates Finding invariants: [0.020s CPU, 0.019s wall-clock] Checking invariant weight... [0.010s CPU, 0.001s wall-clock] Instantiating groups... [0.010s CPU, 0.009s wall-clock] Collecting mutex groups... [0.000s CPU, 0.001s wall-clock] Choosing groups... 3 uncovered facts Choosing groups: [0.000s CPU, 0.002s wall-clock] Building translation key... [0.000s CPU, 0.001s wall-clock] Computing fact groups: [0.040s CPU, 0.036s 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.001s wall-clock] Translating task... Processing axioms... Simplifying axioms... [0.000s CPU, 0.000s wall-clock] Processing axioms: [0.010s CPU, 0.004s wall-clock] Translating task: [0.080s CPU, 0.074s wall-clock] 30 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 11 propositions removed Detecting unreachable propositions: [0.040s CPU, 0.042s wall-clock] Reordering and filtering variables... 14 of 14 variables necessary. 3 of 14 mutex groups necessary. 384 of 384 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.010s CPU, 0.011s wall-clock] Translator variables: 14 Translator derived variables: 0 Translator facts: 97 Translator goal facts: 10 Translator mutex groups: 3 Translator total mutex groups size: 9 Translator operators: 384 Translator axioms: 0 Translator task size: 1708 Translator peak memory: 34136 KB Writing output... [0.030s CPU, 0.036s wall-clock] Done! [0.420s CPU, 0.413s wall-clock] planner.py version 0.0.1 Time: 0.17s Memory: 54MB 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: 54MB (+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.04s Memory: 58MB (+4MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 59MB (+1MB) UNSAT Iteration Time: 0.05s 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 Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])] Grounding Time: 0.04s Memory: 62MB (+3MB) Unblocking actions... Solving... Answer: 1 occurs(action(("walk","driver1","s4","p3-4")),1) occurs(action(("walk","driver2","s1","p0-1")),1) occurs(action(("walk","driver1","p3-4","s3")),2) occurs(action(("walk","driver2","p0-1","s0")),2) occurs(action(("board-truck","driver1","truck3","s3")),3) occurs(action(("board-truck","driver2","truck2","s0")),3) occurs(action(("load-truck","package3","truck3","s3")),4) occurs(action(("drive-truck","truck2","s0","s2","driver2")),4) occurs(action(("drive-truck","truck3","s3","s0","driver1")),4) occurs(action(("drive-truck","truck3","s0","s1","driver1")),5) occurs(action(("disembark-truck","driver2","truck2","s2")),5) occurs(action(("unload-truck","package3","truck3","s1")),6) occurs(action(("load-truck","package2","truck3","s1")),6) occurs(action(("drive-truck","truck3","s1","s2","driver1")),6) occurs(action(("board-truck","driver2","truck1","s2")),6) occurs(action(("drive-truck","truck1","s2","s3","driver2")),7) occurs(action(("disembark-truck","driver1","truck3","s2")),7) occurs(action(("unload-truck","package2","truck3","s2")),8) occurs(action(("board-truck","driver1","truck2","s2")),8) occurs(action(("disembark-truck","driver2","truck1","s3")),8) occurs(action(("drive-truck","truck2","s2","s3","driver1")),9) occurs(action(("load-truck","package1","truck2","s2")),9) occurs(action(("load-truck","package2","truck3","s2")),9) occurs(action(("walk","driver2","s3","p3-4")),9) occurs(action(("unload-truck","package1","truck2","s3")),10) occurs(action(("unload-truck","package2","truck3","s2")),10) occurs(action(("walk","driver2","p3-4","s4")),10) occurs(action(("disembark-truck","driver1","truck2","s3")),10) Solving Time: 0.02s Memory: 62MB (+0MB) SAT SATISFIABLE Models : 1+ Calls : 3 Time : 0.308s (Solving: 0.02s 1st Model: 0.02s Unsat: 0.00s) CPU Time : 0.300s Choices : 1469 Conflicts : 676 (Analyzed: 676) Restarts : 7 (Average: 96.57 Last: 22) Model-Level : 37.0 Problems : 3 (Average Length: 7.00 Splits: 0) Lemmas : 676 (Deleted: 0) Binary : 73 (Ratio: 10.80%) Ternary : 50 (Ratio: 7.40%) Conflict : 676 (Average Length: 15.0 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 676 (Average: 2.14 Max: 33 Sum: 1444) Executed : 670 (Average: 2.09 Max: 33 Sum: 1416 Ratio: 98.06%) Bounded : 6 (Average: 4.67 Max: 12 Sum: 28 Ratio: 1.94%) Rules : 62281 Atoms : 62281 Bodies : 1 (Original: 0) Tight : Yes Variables : 7065 (Eliminated: 0 Frozen: 4202) Constraints : 13463 (Binary: 91.7% Ternary: 5.1% Other: 3.2%) Memory Peak : 63MB Max. Length : 10 steps Sol. Length : 10 steps