tplp-planning-benchmark/gc-ta1-tt1/ipc-2004_pipesworld-no-tankage-nontemporal-strips_13.out

174 lines
7.7 KiB
Plaintext
Raw Normal View History

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-13.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-13.pddl
Parsing...
Parsing: [0.030s CPU, 0.037s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.006s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.060s CPU, 0.061s wall-clock]
Preparing model... [0.020s CPU, 0.020s wall-clock]
Generated 91 rules.
Computing model... [0.290s CPU, 0.294s wall-clock]
1310 relevant atoms
2244 auxiliary atoms
3554 final queue length
6332 total queue pushes
Completing instantiation... [0.460s CPU, 0.470s wall-clock]
Instantiating: [0.860s CPU, 0.856s wall-clock]
Computing fact groups...
Finding invariants...
18 initial candidates
Finding invariants: [0.110s CPU, 0.117s wall-clock]
Checking invariant weight... [0.000s CPU, 0.000s wall-clock]
Instantiating groups... [0.000s CPU, 0.000s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
Choosing groups...
208 uncovered facts
Choosing groups: [0.000s CPU, 0.000s wall-clock]
Building translation key... [0.010s CPU, 0.008s wall-clock]
Computing fact groups: [0.140s CPU, 0.140s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.005s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.001s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.002s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.020s CPU, 0.020s wall-clock]
Translating task: [0.440s CPU, 0.443s wall-clock]
1888 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
2 propositions removed
Detecting unreachable propositions: [0.280s CPU, 0.271s wall-clock]
Reordering and filtering variables...
210 of 210 variables necessary.
0 of 2 mutex groups necessary.
992 of 992 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.260s CPU, 0.267s wall-clock]
Translator variables: 210
Translator derived variables: 0
Translator facts: 422
Translator goal facts: 3
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 992
Translator axioms: 0
Translator task size: 9371
Translator peak memory: 41676 KB
Writing output... [0.170s CPU, 0.179s wall-clock]
Done! [2.200s CPU, 2.222s wall-clock]
planner.py version 0.0.1
Time: 0.41s
Memory: 74MB
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: 75MB (+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
Expected Memory: 75MB
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.12s
Memory: 75MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 76MB (+1MB)
UNSAT
Iteration Time: 0.17s
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: 77.0MB
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 0.15s
Memory: 84MB (+8MB)
Unblocking actions...
Solving...
Solving Time: 0.04s
Memory: 88MB (+4MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.43s
Memory: 103MB (+15MB)
Solving...
Solving Time: 0.20s
Memory: 100MB (+-3MB)
UNSAT
Iteration Time: 0.89s
Iteration 4
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 10
Expected Memory: 112.0MB
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time: 0.23s
Memory: 102MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 2.34s
Memory: 111MB (+9MB)
SAT
Testing...
SERIALIZABLE?
Testing Time: 0.00s
Memory: 111MB (+0MB)
Answer: 2
occurs(action(("pop-start","s13","b8","a1","a3","b3","lco","lco")),1) occurs(action(("push-start","s12","b1","a1","a2","b6","oc1b","oca1")),1) occurs(action(("push-end","s12","a1","a2","b11","b6")),2) occurs(action(("pop-end","s13","a1","a3","b9","b3")),2) occurs(action(("pop-start","s13","b10","a1","a3","b8","oca1","lco")),3) occurs(action(("push-start","s12","b7","a1","a2","b1","oca1","oc1b")),3) occurs(action(("push-end","s12","a1","a2","b6","b1")),4) occurs(action(("pop-end","s13","a1","a3","b3","b8")),4) occurs(action(("push-start","s13","b9","a1","a3","b8","lco","lco")),5) occurs(action(("push-start","s12","b3","a1","a2","b7","lco","oca1")),5) occurs(action(("push-end","s12","a1","a2","b1","b7")),6) occurs(action(("push-end","s13","a1","a3","b10","b8")),6) occurs(action(("pop-start","s12","b5","a1","a2","b7","gasoleo","oca1")),7) occurs(action(("push-start","s13","b4","a1","a3","b9","oca1","lco")),7) occurs(action(("push-end","s13","a1","a3","b8","b9")),8) occurs(action(("pop-end","s12","a1","a2","b3","b7")),8) occurs(action(("pop-start","s12","b11","a1","a2","b5","lco","gasoleo")),9) occurs(action(("push-start","s13","b3","a1","a3","b4","lco","oca1")),9) occurs(action(("push-end","s13","a1","a3","b9","b4")),10) occurs(action(("pop-end","s12","a1","a2","b7","b5")),10) occurs(action(("pop-start","s12","b6","a1","a2","b11","oca1","lco")),11) occurs(action(("pop-end","s12","a1","a2","b5","b11")),12) occurs(action(("pop-start","s13","b10","a1","a3","b4","oca1","oca1")),12) occurs(action(("push-start","s12","b7","a1","a2","b11","oca1","lco")),13) occurs(action(("pop-end","s13","a1","a3","b3","b4")),13) occurs(action(("pop-start","s13","b8","a1","a3","b10","lco","oca1")),14) occurs(action(("pop-end","s13","a1","a3","b4","b10")),15)
SATISFIABLE
Models : 1+
Calls : 5
Time : 3.828s (Solving: 2.55s 1st Model: 2.36s Unsat: 0.18s)
CPU Time : 3.804s
Choices : 13772 (Domain: 11915)
Conflicts : 7534 (Analyzed: 7532)
Restarts : 81 (Average: 92.99 Last: 65)
Model-Level : 60.0
Problems : 5 (Average Length: 10.00 Splits: 0)
Lemmas : 7532 (Deleted: 4966)
Binary : 151 (Ratio: 2.00%)
Ternary : 97 (Ratio: 1.29%)
Conflict : 7532 (Average Length: 238.5 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 7532 (Average: 1.72 Max: 48 Sum: 12992)
Executed : 7476 (Average: 1.63 Max: 48 Sum: 12246 Ratio: 94.26%)
Bounded : 56 (Average: 13.32 Max: 17 Sum: 746 Ratio: 5.74%)
Rules : 54144 (Original: 51756)
Atoms : 35672
Bodies : 12088 (Original: 9739)
Count : 1106 (Original: 1369)
Equivalences : 6874 (Atom=Atom: 45 Body=Body: 2 Other: 6827)
Tight : Yes
Variables : 36525 (Eliminated: 0 Frozen: 12685)
Constraints : 211792 (Binary: 92.3% Ternary: 3.4% Other: 4.3%)
Memory Peak : 111MB
Max. Length : 15 steps
Sol. Length : 15 steps
Models : 2