INFO Running translator. INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/pathways-propositional-strips/domains/domain-4.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/pathways-propositional-strips/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-2006/domains/pathways-propositional-strips/domains/domain-4.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/pathways-propositional-strips/instances/instance-4.pddl Parsing... Parsing: [0.150s CPU, 0.149s wall-clock] Normalizing task... [0.020s CPU, 0.021s wall-clock] Instantiating... Generating Datalog program... [0.020s CPU, 0.013s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.030s CPU, 0.039s wall-clock] Preparing model... [0.030s CPU, 0.026s wall-clock] Generated 373 rules. Computing model... [0.010s CPU, 0.014s wall-clock] 274 relevant atoms 0 auxiliary atoms 274 final queue length 397 total queue pushes Completing instantiation... [0.030s CPU, 0.028s wall-clock] Instantiating: [0.120s CPU, 0.122s wall-clock] Computing fact groups... Finding invariants... 119 initial candidates Finding invariants: [21.690s CPU, 21.681s wall-clock] Checking invariant weight... [0.110s CPU, 0.110s wall-clock] Instantiating groups... [0.000s CPU, 0.001s wall-clock] Collecting mutex groups... [0.010s CPU, 0.001s wall-clock] Choosing groups... 71 uncovered facts Choosing groups: [0.000s CPU, 0.002s wall-clock] Building translation key... [0.000s CPU, 0.003s wall-clock] Computing fact groups: [21.810s CPU, 21.807s wall-clock] Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock] Building dictionary for full mutex groups... [0.000s CPU, 0.001s wall-clock] Building mutex information... Building mutex information: [0.010s CPU, 0.001s 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.038s wall-clock] 68 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 23 propositions removed Detecting unreachable propositions: [0.030s CPU, 0.027s wall-clock] Reordering and filtering variables... 67 of 94 variables necessary. 0 of 25 mutex groups necessary. 142 of 153 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.020s CPU, 0.014s wall-clock] Translator variables: 67 Translator derived variables: 0 Translator facts: 136 Translator goal facts: 4 Translator mutex groups: 0 Translator total mutex groups size: 0 Translator operators: 142 Translator axioms: 0 Translator task size: 844 Translator peak memory: 43524 KB Writing output... [0.010s CPU, 0.020s wall-clock] Done! [22.200s CPU, 22.203s 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 Expected Memory: 50MB Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])] Grounding Time: 0.01s Memory: 52MB (+2MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 52MB (+0MB) UNSAT Iteration Time: 0.02s 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 Expected Memory: 54.0MB Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])] Grounding Time: 0.01s Memory: 53MB (+1MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 53MB (+0MB) SAT Testing... NOT SERIALIZABLE Testing Time: 0.02s Memory: 53MB (+0MB) Solving... Solving Time: 0.00s Memory: 54MB (+1MB) SAT Testing... SERIALIZABLE? Testing Time: 0.00s Memory: 54MB (+0MB) Answer: 2 occurs(action("choose_gp_l1_l0"),1) occurs(action("initialize_gp"),2) occurs(action("choose_sp1_l2_l1"),2) occurs(action("initialize_sp1"),3) occurs(action("associate_sp1_gp_sp1-gp"),4) occurs(action("synthesize_sp1-gp_pol"),5) occurs(action("synthesize_sp1-gp_cycep1"),5) occurs(action("synthesize_sp1-gp_p107"),5) occurs(action("initialize_gp"),5) occurs(action("synthesize_sp1-gp_p107p1"),5) occurs(action("initialize_sp1"),5) occurs(action("dummy-action-1-2"),6) occurs(action("dummy-action-4-2"),6) occurs(action("dummy-action-2-2"),6) occurs(action("associate_sp1_p107p1_sp1-p107p1"),6) occurs(action("associate_sp1-p107p1_gp_sp1-p107p1-gp"),7) occurs(action("dummy-action-3-2"),8) occurs(action("dummy-action-2-2"),9) occurs(action("initialize_gp"),10) occurs(action("synthesize_sp1-gp_cyca"),10) occurs(action("initialize_sp1"),10) SATISFIABLE Models : 1+ Calls : 4 Time : 0.082s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s) CPU Time : 0.076s Choices : 276 (Domain: 167) Conflicts : 1 (Analyzed: 1) Restarts : 0 Model-Level : 147.5 Problems : 4 (Average Length: 8.25 Splits: 0) Lemmas : 1 (Deleted: 0) Binary : 0 (Ratio: 0.00%) Ternary : 0 (Ratio: 0.00%) Conflict : 1 (Average Length: 1.0 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 1 (Average: 17.00 Max: 17 Sum: 17) Executed : 0 (Average: 5.00 Max: 5 Sum: 5 Ratio: 29.41%) Bounded : 1 (Average: 12.00 Max: 12 Sum: 12 Ratio: 70.59%) Rules : 5234 (Original: 4941) Atoms : 3699 Bodies : 1768 (Original: 1474) Count : 10 (Original: 131) Equivalences : 959 (Atom=Atom: 100 Body=Body: 0 Other: 859) Tight : Yes Variables : 3794 (Eliminated: 0 Frozen: 500) Constraints : 11588 (Binary: 84.5% Ternary: 12.5% Other: 3.0%) Memory Peak : 54MB Max. Length : 10 steps Sol. Length : 10 steps Models : 2