INFO Running translator. INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/gripper-round-1-strips/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/gripper-round-1-strips/instances/instance-1.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/gripper-round-1-strips/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/gripper-round-1-strips/instances/instance-1.pddl Parsing... Parsing: [0.010s CPU, 0.011s wall-clock] Normalizing task... [0.000s CPU, 0.001s wall-clock] Instantiating... Generating Datalog program... [0.000s CPU, 0.002s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.010s CPU, 0.013s wall-clock] Preparing model... [0.010s CPU, 0.006s wall-clock] Generated 24 rules. Computing model... [0.010s CPU, 0.014s wall-clock] 81 relevant atoms 60 auxiliary atoms 141 final queue length 180 total queue pushes Completing instantiation... [0.010s CPU, 0.013s wall-clock] Instantiating: [0.040s CPU, 0.049s wall-clock] Computing fact groups... Finding invariants... 10 initial candidates Finding invariants: [0.020s CPU, 0.011s wall-clock] Checking invariant weight... [0.000s CPU, 0.001s wall-clock] Instantiating groups... [0.000s CPU, 0.002s 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.020s CPU, 0.016s 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.013s wall-clock] 0 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 3 propositions removed Detecting unreachable propositions: [0.010s CPU, 0.006s wall-clock] Reordering and filtering variables... 7 of 7 variables necessary. 4 of 7 mutex groups necessary. 34 of 34 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.000s CPU, 0.003s wall-clock] Translator variables: 7 Translator derived variables: 0 Translator facts: 24 Translator goal facts: 4 Translator mutex groups: 4 Translator total mutex groups size: 16 Translator operators: 34 Translator axioms: 0 Translator task size: 233 Translator peak memory: 36044 KB Writing output... [0.010s CPU, 0.007s wall-clock] Done! [0.100s CPU, 0.108s 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 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(("pick","ball4","rooma","left")),1) occurs(action(("pick","ball1","rooma","right")),1) occurs(action(("move","rooma","roomb")),1) occurs(action(("drop","ball4","roomb","left")),2) occurs(action(("drop","ball1","roomb","right")),2) occurs(action(("move","roomb","rooma")),2) occurs(action(("pick","ball3","rooma","left")),3) occurs(action(("pick","ball2","rooma","right")),3) occurs(action(("move","rooma","roomb")),3) occurs(action(("drop","ball3","roomb","left")),4) occurs(action(("drop","ball2","roomb","right")),4) occurs(action(("move","roomb","rooma")),5) SATISFIABLE Models : 1+ Calls : 2 Time : 0.038s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s) CPU Time : 0.032s Choices : 86 (Domain: 86) Conflicts : 46 (Analyzed: 46) Restarts : 0 Model-Level : 18.0 Problems : 2 (Average Length: 4.50 Splits: 0) Lemmas : 46 (Deleted: 0) Binary : 0 (Ratio: 0.00%) Ternary : 0 (Ratio: 0.00%) Conflict : 46 (Average Length: 12.0 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 46 (Average: 1.63 Max: 4 Sum: 75) Executed : 46 (Average: 1.63 Max: 4 Sum: 75 Ratio: 100.00%) Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%) Rules : 734 Atoms : 734 Bodies : 1 (Original: 0) Tight : Yes Variables : 403 (Eliminated: 0 Frozen: 0) Constraints : 1590 (Binary: 87.0% Ternary: 10.8% Other: 2.2%) Memory Peak : 50MB Max. Length : 5 steps Sol. Length : 5 steps Models : 1