INFO Running translator. INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/zenotravel-strips-automatic/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/zenotravel-strips-automatic/instances/instance-4.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/zenotravel-strips-automatic/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/zenotravel-strips-automatic/instances/instance-4.pddl Parsing... Parsing: [0.010s CPU, 0.014s wall-clock] Normalizing task... [0.000s CPU, 0.001s wall-clock] Instantiating... Generating Datalog program... [0.000s CPU, 0.004s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.020s CPU, 0.020s wall-clock] Preparing model... [0.010s CPU, 0.009s wall-clock] Generated 40 rules. Computing model... [0.060s CPU, 0.060s wall-clock] 397 relevant atoms 323 auxiliary atoms 720 final queue length 1176 total queue pushes Completing instantiation... [0.090s CPU, 0.081s wall-clock] Instantiating: [0.180s CPU, 0.175s wall-clock] Computing fact groups... Finding invariants... 9 initial candidates Finding invariants: [0.010s CPU, 0.016s wall-clock] Checking invariant weight... [0.000s CPU, 0.001s wall-clock] Instantiating groups... [0.010s CPU, 0.004s 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.001s wall-clock] Computing fact groups: [0.020s CPU, 0.024s 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.004s wall-clock] Translating task: [0.070s CPU, 0.068s 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.030s CPU, 0.037s wall-clock] Reordering and filtering variables... 8 of 9 variables necessary. 0 of 9 mutex groups necessary. 282 of 294 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.020s CPU, 0.010s wall-clock] Translator variables: 8 Translator derived variables: 0 Translator facts: 40 Translator goal facts: 5 Translator mutex groups: 0 Translator total mutex groups size: 0 Translator operators: 282 Translator axioms: 0 Translator task size: 1313 Translator peak memory: 37068 KB Writing output... [0.020s CPU, 0.028s wall-clock] Done! [0.350s CPU, 0.361s wall-clock] planner.py version 0.0.1 Time: 0.09s Memory: 52MB 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: 52MB (+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.02s Memory: 52MB (+0MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 53MB (+1MB) SAT Testing... SERIALIZABLE Testing Time: 0.05s Memory: 55MB (+2MB) Answer: 1 occurs(action(("zoom","plane1","city2","city1","fl5","fl4","fl3")),1) occurs(action(("refuel","plane2","city2","fl0","fl1")),1) occurs(action(("board","person2","plane1","city1")),2) occurs(action(("zoom","plane1","city1","city2","fl3","fl2","fl1")),2) occurs(action(("fly","plane2","city2","city0","fl1","fl0")),2) occurs(action(("debark","person2","plane1","city2")),3) occurs(action(("fly","plane1","city2","city0","fl1","fl0")),3) occurs(action(("board","person4","plane2","city0")),3) occurs(action(("refuel","plane2","city0","fl0","fl1")),3) occurs(action(("fly","plane2","city0","city1","fl1","fl0")),4) occurs(action(("debark","person4","plane2","city1")),5) SATISFIABLE Models : 1+ Calls : 2 Time : 0.123s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s) CPU Time : 0.116s Choices : 21 (Domain: 14) Conflicts : 3 (Analyzed: 3) Restarts : 0 Model-Level : 21.0 Problems : 2 (Average Length: 4.50 Splits: 0) Lemmas : 3 (Deleted: 0) Binary : 0 (Ratio: 0.00%) Ternary : 0 (Ratio: 0.00%) Conflict : 3 (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 : 3 (Average: 4.67 Max: 12 Sum: 14) Executed : 2 (Average: 2.33 Max: 12 Sum: 7 Ratio: 50.00%) Bounded : 1 (Average: 7.00 Max: 7 Sum: 7 Ratio: 50.00%) Rules : 4226 Atoms : 4226 Bodies : 1 (Original: 0) Tight : Yes Variables : 1362 (Eliminated: 0 Frozen: 60) Constraints : 5046 (Binary: 95.9% Ternary: 2.1% Other: 2.0%) Memory Peak : 55MB Max. Length : 5 steps Sol. Length : 5 steps Models : 1