INFO Running translator.
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/pipesworld-no-tankage-nontemporal-strips/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/pipesworld-no-tankage-nontemporal-strips/instances/instance-29.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-2004/domains/pipesworld-no-tankage-nontemporal-strips/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/pipesworld-no-tankage-nontemporal-strips/instances/instance-29.pddl
Parsing...
Parsing: [0.030s CPU, 0.034s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.007s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.050s CPU, 0.055s wall-clock]
Preparing model... [0.020s CPU, 0.021s wall-clock]
Generated 91 rules.
Computing model... [0.910s CPU, 0.902s wall-clock]
4311 relevant atoms
6432 auxiliary atoms
10743 final queue length
21002 total queue pushes
Completing instantiation... [1.740s CPU, 1.736s wall-clock]
Instantiating: [2.740s CPU, 2.733s wall-clock]
Computing fact groups...
Finding invariants...
18 initial candidates
Finding invariants: [0.140s CPU, 0.142s wall-clock]
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
Instantiating groups... [0.000s CPU, 0.000s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
Choosing groups...
560 uncovered facts
Choosing groups: [0.000s CPU, 0.001s wall-clock]
Building translation key... [0.020s CPU, 0.020s wall-clock]
Computing fact groups: [0.200s CPU, 0.209s wall-clock]
Building STRIPS to SAS dictionary... [0.010s CPU, 0.005s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.004s wall-clock]
Building mutex information...
Building mutex information: [0.010s CPU, 0.004s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.060s CPU, 0.066s wall-clock]
Translating task: [1.690s CPU, 1.690s wall-clock]
7680 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
6 propositions removed
Detecting unreachable propositions: [1.000s CPU, 0.989s wall-clock]
Reordering and filtering variables...
562 of 562 variables necessary.
0 of 2 mutex groups necessary.
3600 of 3600 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [1.340s CPU, 1.344s wall-clock]
Translator variables: 562
Translator derived variables: 0
Translator facts: 1126
Translator goal facts: 6
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 3600
Translator axioms: 0
Translator task size: 33654
Translator peak memory: 57204 KB
Writing output... [0.600s CPU, 0.646s wall-clock]
Done! [7.690s CPU, 7.729s wall-clock]
planner.py version 0.0.1
Time: 1.40s
Memory: 144MB
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: 144MB (+0MB)
UNSAT
Iteration Time: 0.01s
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: 144MB
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.51s
Memory: 144MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.04s
Memory: 150MB (+6MB)
UNSAT
Iteration Time: 0.77s
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: 156.0MB
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 0.61s
Memory: 171MB (+21MB)
Unblocking actions...
Solving...
Solving Time: 0.10s
Memory: 186MB (+15MB)
UNSAT
Iteration Time: 0.98s
Iteration 4
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 10
Expected Memory: 222.0MB
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time: 0.55s
Memory: 203MB (+17MB)
Unblocking actions...
Solving...
Solving Time: 0.10s
Memory: 217MB (+14MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 1.79s
Memory: 217MB (+0MB)
Solving...
Solving Time: 3.81s
Memory: 233MB (+16MB)
SAT
Testing...
SERIALIZABLE?
Testing Time: 0.00s
Memory: 233MB (+0MB)
Answer: 2
occurs(action(("pop-start","s12","b2","a1","a2","b0","rat-a","lco")),1) occurs(action(("pop-start","s13","b16","a1","a3","b4","oca1","lco")),1) occurs(action(("pop-unitarypipe","s34","b13","a3","a4","b19","gasoleo","oca1")),1) occurs(action(("pop-end","s13","a1","a3","b15","b4")),2) occurs(action(("pop-unitarypipe","s34","b5","a3","a4","b13","gasoleo","gasoleo")),2) occurs(action(("pop-end","s12","a1","a2","b8","b0")),2) occurs(action(("pop-start","s12","b7","a1","a2","b2","lco","rat-a")),3) occurs(action(("pop-start","s13","b19","a1","a3","b16","oca1","oca1")),3) occurs(action(("pop-end","s12","a1","a2","b0","b2")),4) occurs(action(("pop-end","s13","a1","a3","b4","b16")),4) occurs(action(("pop-start","s12","b6","a1","a2","b7","oc1b","lco")),5) occurs(action(("pop-start","s13","b13","a1","a3","b19","gasoleo","oca1")),5) occurs(action(("pop-end","s12","a1","a2","b2","b7")),6) occurs(action(("pop-end","s13","a1","a3","b16","b19")),6) occurs(action(("push-start","s13","b0","a1","a3","b19","lco","oca1")),7) occurs(action(("push-start","s12","b16","a1","a2","b7","oca1","lco")),7) occurs(action(("push-unitarypipe","s34","b12","a3","a4","b5","lco","gasoleo")),7) occurs(action(("push-end","s13","a1","a3","b13","b19")),8) occurs(action(("push-end","s12","a1","a2","b6","b7")),8) occurs(action(("push-start","s13","b18","a1","a3","b0","rat-a","lco")),9) occurs(action(("push-start","s12","b11","a1","a2","b16","lco","oca1")),9) occurs(action(("push-end","s13","a1","a3","b19","b0")),10) occurs(action(("push-end","s12","a1","a2","b7","b16")),10) occurs(action(("push-start","s13","b9","a1","a3","b18","rat-a","rat-a")),11) occurs(action(("push-start","s12","b4","a1","a2","b11","lco","lco")),11) occurs(action(("push-end","s12","a1","a2","b16","b11")),12) occurs(action(("push-end","s13","a1","a3","b0","b18")),12) occurs(action(("push-unitarypipe","s34","b0","a3","a4","b12","lco","lco")),13) occurs(action(("push-start","s13","b3","a1","a3","b9","gasoleo","rat-a")),13) occurs(action(("push-start","s12","b10","a1","a2","b4","rat-a","lco")),13) occurs(action(("push-end","s13","a1","a3","b18","b9")),14) occurs(action(("push-unitarypipe","s34","b19","a3","a4","b0","oca1","lco")),14) occurs(action(("push-end","s12","a1","a2","b11","b4")),14) occurs(action(("pop-unitarypipe","s34","b12","a3","a4","b19","lco","oca1")),15)
SATISFIABLE
Models : 1+
Calls : 5
Time : 8.559s (Solving: 3.80s 1st Model: 3.72s Unsat: 0.07s)
CPU Time : 8.496s
Choices : 17434 (Domain: 12741)
Conflicts : 4772 (Analyzed: 4771)
Restarts : 51 (Average: 93.55 Last: 50)
Model-Level : 208.0
Problems : 5 (Average Length: 11.00 Splits: 0)
Lemmas : 4771 (Deleted: 2667)
Binary : 91 (Ratio: 1.91%)
Ternary : 75 (Ratio: 1.57%)
Conflict : 4771 (Average Length: 531.0 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 4771 (Average: 3.37 Max: 116 Sum: 16089)
Executed : 4746 (Average: 3.30 Max: 116 Sum: 15734 Ratio: 97.79%)
Bounded : 25 (Average: 14.20 Max: 17 Sum: 355 Ratio: 2.21%)
Rules : 236259 (Original: 230880)
Atoms : 129631
Bodies : 58988 (Original: 53665)
Count : 5711 (Original: 6289)
Equivalences : 42646 (Atom=Atom: 89 Body=Body: 0 Other: 42557)
Tight : Yes
Variables : 108397 (Eliminated: 0 Frozen: 42273)
Constraints : 724329 (Binary: 94.0% Ternary: 2.6% Other: 3.4%)
Memory Peak : 276MB
Max. Length : 15 steps
Sol. Length : 15 steps
Models : 2