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

174 lines
7.4 KiB
Plaintext

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-11.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-11.pddl
Parsing...
Parsing: [0.030s CPU, 0.024s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.004s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.050s CPU, 0.045s wall-clock]
Preparing model... [0.010s CPU, 0.016s wall-clock]
Generated 91 rules.
Computing model... [0.250s CPU, 0.247s wall-clock]
1072 relevant atoms
1856 auxiliary atoms
2928 final queue length
5166 total queue pushes
Completing instantiation... [0.400s CPU, 0.394s wall-clock]
Instantiating: [0.710s CPU, 0.711s wall-clock]
Computing fact groups...
Finding invariants...
18 initial candidates
Finding invariants: [0.110s CPU, 0.105s 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...
170 uncovered facts
Choosing groups: [0.000s CPU, 0.000s wall-clock]
Building translation key... [0.000s CPU, 0.006s wall-clock]
Computing fact groups: [0.120s CPU, 0.123s wall-clock]
Building STRIPS to SAS dictionary... [0.010s CPU, 0.001s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.002s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.001s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.010s CPU, 0.016s wall-clock]
Translating task: [0.370s CPU, 0.376s wall-clock]
1520 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
2 propositions removed
Detecting unreachable propositions: [0.210s CPU, 0.201s wall-clock]
Reordering and filtering variables...
172 of 172 variables necessary.
0 of 2 mutex groups necessary.
800 of 800 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.210s CPU, 0.220s wall-clock]
Translator variables: 172
Translator derived variables: 0
Translator facts: 346
Translator goal facts: 2
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 800
Translator axioms: 0
Translator task size: 7560
Translator peak memory: 40652 KB
Writing output... [0.140s CPU, 0.152s wall-clock]
Done! [1.820s CPU, 1.829s wall-clock]
planner.py version 0.0.1
Time: 0.34s
Memory: 69MB
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: 70MB (+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: 70MB
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.11s
Memory: 70MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 71MB (+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: 72.0MB
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 0.17s
Memory: 76MB (+5MB)
Unblocking actions...
Solving...
Solving Time: 0.04s
Memory: 79MB (+3MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.42s
Memory: 91MB (+12MB)
Solving...
Solving Time: 0.91s
Memory: 90MB (+-1MB)
UNSAT
Iteration Time: 1.59s
Iteration 4
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 10
Expected Memory: 98.0MB
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time: 0.18s
Memory: 95MB (+5MB)
Unblocking actions...
Solving...
Solving Time: 1.27s
Memory: 101MB (+6MB)
SAT
Testing...
SERIALIZABLE?
Testing Time: 0.00s
Memory: 101MB (+0MB)
Answer: 2
occurs(action(("pop-start","s13","b8","a1","a3","b6","gasoleo","gasoleo")),1) occurs(action(("pop-start","s12","b4","a1","a2","b1","gasoleo","rat-a")),1) occurs(action(("pop-end","s13","a1","a3","b7","b6")),2) occurs(action(("pop-end","s12","a1","a2","b9","b1")),2) occurs(action(("push-start","s13","b9","a1","a3","b6","lco","gasoleo")),3) occurs(action(("push-start","s12","b0","a1","a2","b1","gasoleo","rat-a")),3) occurs(action(("push-end","s13","a1","a3","b8","b6")),4) occurs(action(("push-end","s12","a1","a2","b4","b1")),4) occurs(action(("push-start","s13","b7","a1","a3","b9","gasoleo","lco")),5) occurs(action(("push-end","s13","a1","a3","b6","b9")),6) occurs(action(("push-start","s13","b5","a1","a3","b7","gasoleo","gasoleo")),7) occurs(action(("push-end","s13","a1","a3","b9","b7")),8) occurs(action(("pop-start","s13","b8","a1","a3","b7","gasoleo","gasoleo")),9) occurs(action(("pop-end","s13","a1","a3","b5","b7")),10) occurs(action(("push-start","s12","b5","a1","a2","b0","gasoleo","gasoleo")),11) occurs(action(("pop-start","s13","b6","a1","a3","b8","gasoleo","gasoleo")),11) occurs(action(("push-end","s12","a1","a2","b1","b0")),12) occurs(action(("pop-end","s13","a1","a3","b7","b8")),12) occurs(action(("push-start","s12","b7","a1","a2","b5","gasoleo","gasoleo")),13) occurs(action(("push-end","s12","a1","a2","b0","b5")),14) occurs(action(("pop-start","s13","b2","a1","a3","b6","rat-a","gasoleo")),14) occurs(action(("pop-end","s13","a1","a3","b8","b6")),15)
SATISFIABLE
Models : 1+
Calls : 5
Time : 3.314s (Solving: 2.18s 1st Model: 1.29s Unsat: 0.89s)
CPU Time : 3.288s
Choices : 11425 (Domain: 9628)
Conflicts : 7997 (Analyzed: 7995)
Restarts : 91 (Average: 87.86 Last: 25)
Model-Level : 54.0
Problems : 5 (Average Length: 10.00 Splits: 0)
Lemmas : 7995 (Deleted: 4352)
Binary : 95 (Ratio: 1.19%)
Ternary : 58 (Ratio: 0.73%)
Conflict : 7995 (Average Length: 343.5 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 7995 (Average: 1.37 Max: 35 Sum: 10953)
Executed : 7949 (Average: 1.30 Max: 35 Sum: 10425 Ratio: 95.18%)
Bounded : 46 (Average: 11.48 Max: 17 Sum: 528 Ratio: 4.82%)
Rules : 43558 (Original: 41529)
Atoms : 28840
Bodies : 9796 (Original: 7815)
Count : 888 (Original: 1107)
Equivalences : 5484 (Atom=Atom: 48 Body=Body: 1 Other: 5435)
Tight : Yes
Variables : 29822 (Eliminated: 0 Frozen: 10146)
Constraints : 169709 (Binary: 92.1% Ternary: 3.5% Other: 4.4%)
Memory Peak : 101MB
Max. Length : 15 steps
Sol. Length : 15 steps
Models : 2