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

256 lines
11 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-22.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-22.pddl
Parsing...
Parsing: [0.040s CPU, 0.033s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.006s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.060s CPU, 0.057s wall-clock]
Preparing model... [0.020s CPU, 0.020s wall-clock]
Generated 91 rules.
Computing model... [0.360s CPU, 0.368s wall-clock]
1625 relevant atoms
2792 auxiliary atoms
4417 final queue length
7962 total queue pushes
Completing instantiation... [0.610s CPU, 0.605s wall-clock]
Instantiating: [1.050s CPU, 1.061s wall-clock]
Computing fact groups...
Finding invariants...
18 initial candidates
Finding invariants: [0.130s CPU, 0.122s 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...
246 uncovered facts
Choosing groups: [0.000s CPU, 0.000s wall-clock]
Building translation key... [0.010s CPU, 0.009s wall-clock]
Computing fact groups: [0.150s CPU, 0.149s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s wall-clock]
Building dictionary for full mutex groups... [0.010s CPU, 0.002s 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.024s wall-clock]
Translating task: [0.590s CPU, 0.595s wall-clock]
2628 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
6 propositions removed
Detecting unreachable propositions: [0.320s CPU, 0.316s wall-clock]
Reordering and filtering variables...
248 of 248 variables necessary.
0 of 2 mutex groups necessary.
1260 of 1260 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.360s CPU, 0.363s wall-clock]
Translator variables: 248
Translator derived variables: 0
Translator facts: 498
Translator goal facts: 4
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 1260
Translator axioms: 0
Translator task size: 11826
Translator peak memory: 43212 KB
Writing output... [0.210s CPU, 0.229s wall-clock]
Done! [2.760s CPU, 2.780s wall-clock]
planner.py version 0.0.1
Time: 0.49s
Memory: 82MB
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: 82MB (+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: 82MB
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.16s
Memory: 82MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 83MB (+1MB)
UNSAT
Iteration Time: 0.23s
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: 84.0MB
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 0.19s
Memory: 92MB (+9MB)
Unblocking actions...
Solving...
Solving Time: 0.02s
Memory: 97MB (+5MB)
UNSAT
Iteration Time: 0.29s
Iteration 4
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 10
Expected Memory: 111.0MB
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time: 0.22s
Memory: 106MB (+9MB)
Unblocking actions...
Solving...
Solving Time: 0.30s
Memory: 111MB (+5MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.62s
Memory: 132MB (+21MB)
Solving...
Solving Time: 3.83s
Memory: 128MB (+-4MB)
UNKNOWN
Iteration Time: 5.05s
Iteration 5
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 15
Expected Memory: 142.0MB
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
Grounding Time: 0.30s
Memory: 135MB (+7MB)
Unblocking actions...
Solving...
Solving Time: 4.14s
Memory: 150MB (+15MB)
UNKNOWN
Iteration Time: 4.55s
Iteration 6
Queue: [(5,25,0,True), (6,30,0,True)]
Grounded Until: 20
Expected Memory: 172.0MB
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
Grounding Time: 0.32s
Memory: 154MB (+4MB)
Unblocking actions...
Solving...
Solving Time: 5.28s
Memory: 172MB (+18MB)
UNKNOWN
Iteration Time: 5.71s
Iteration 7
Queue: [(6,30,0,True)]
Grounded Until: 25
Expected Memory: 194.0MB
Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])]
Grounding Time: 0.32s
Memory: 178MB (+6MB)
Unblocking actions...
Solving...
Solving Time: 6.07s
Memory: 196MB (+18MB)
UNKNOWN
Iteration Time: 6.52s
Iteration 8
Queue: [(3,15,1,True), (4,20,1,True), (5,25,1,True), (6,30,1,True), (7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True)]
Grounded Until: 30
Blocking actions...
Solving...
Solving Time: 3.10s
Memory: 196MB (+0MB)
UNSAT
Iteration Time: 3.12s
Iteration 9
Queue: [(4,20,1,True), (5,25,1,True), (6,30,1,True), (7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True)]
Grounded Until: 30
Unblocking actions...
Solving...
Solving Time: 4.39s
Memory: 196MB (+0MB)
UNKNOWN
Iteration Time: 4.40s
Iteration 10
Queue: [(5,25,1,True), (6,30,1,True), (7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True)]
Grounded Until: 30
Unblocking actions...
Solving...
Solving Time: 4.99s
Memory: 196MB (+0MB)
UNKNOWN
Iteration Time: 5.00s
Iteration 11
Queue: [(6,30,1,True), (7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True)]
Grounded Until: 30
Unblocking actions...
Solving...
Solving Time: 0.64s
Memory: 196MB (+0MB)
SAT
Testing...
SERIALIZABLE?
Testing Time: 0.00s
Memory: 196MB (+0MB)
Answer: 2
occurs(action(("pop-unitarypipe","s34","b3","a3","a4","b4","gasoleo","rat-a")),1) occurs(action(("push-start","s12","b1","a1","a2","b5","gasoleo","oc1b")),1) occurs(action(("pop-unitarypipe","s34","b8","a3","a4","b3","oca1","gasoleo")),2) occurs(action(("pop-start","s13","b4","a1","a3","b9","rat-a","gasoleo")),2) occurs(action(("push-end","s12","a1","a2","b0","b5")),2) occurs(action(("push-start","s12","b6","a1","a2","b1","rat-a","gasoleo")),3) occurs(action(("pop-end","s13","a1","a3","b7","b9")),3) occurs(action(("pop-start","s13","b3","a1","a3","b4","gasoleo","rat-a")),4) occurs(action(("push-end","s12","a1","a2","b5","b1")),4) occurs(action(("push-start","s12","b7","a1","a2","b6","lco","rat-a")),5) occurs(action(("pop-end","s13","a1","a3","b9","b4")),5) occurs(action(("push-end","s12","a1","a2","b1","b6")),6) occurs(action(("push-start","s12","b9","a1","a2","b7","gasoleo","lco")),7) occurs(action(("push-end","s12","a1","a2","b6","b7")),8) occurs(action(("pop-start","s12","b11","a1","a2","b7","gasoleo","lco")),9) occurs(action(("pop-end","s12","a1","a2","b9","b7")),10) occurs(action(("push-start","s13","b9","a1","a3","b4","gasoleo","rat-a")),11) occurs(action(("pop-start","s12","b2","a1","a2","b11","rat-a","gasoleo")),11) occurs(action(("push-end","s13","a1","a3","b3","b4")),12) occurs(action(("pop-end","s12","a1","a2","b7","b11")),12) occurs(action(("pop-start","s12","b0","a1","a2","b2","lco","rat-a")),13) occurs(action(("pop-end","s12","a1","a2","b11","b2")),14) occurs(action(("pop-start","s12","b5","a1","a2","b0","oc1b","lco")),15) occurs(action(("pop-end","s12","a1","a2","b2","b0")),16) occurs(action(("push-start","s13","b2","a1","a3","b9","rat-a","gasoleo")),17) occurs(action(("pop-start","s12","b1","a1","a2","b5","gasoleo","oc1b")),17) occurs(action(("push-end","s13","a1","a3","b4","b9")),18) occurs(action(("pop-end","s12","a1","a2","b0","b5")),18) occurs(action(("push-start","s13","b0","a1","a3","b2","lco","rat-a")),19) occurs(action(("push-end","s13","a1","a3","b9","b2")),20) occurs(action(("push-start","s13","b7","a1","a3","b0","lco","lco")),21) occurs(action(("push-unitarypipe","s34","b9","a3","a4","b8","gasoleo","oca1")),21) occurs(action(("push-end","s13","a1","a3","b2","b0")),22) occurs(action(("push-unitarypipe","s34","b2","a3","a4","b9","rat-a","gasoleo")),23) occurs(action(("push-unitarypipe","s34","b4","a3","a4","b2","rat-a","rat-a")),24) occurs(action(("pop-unitarypipe","s34","b9","a3","a4","b4","gasoleo","rat-a")),25) occurs(action(("pop-unitarypipe","s34","b10","a3","a4","b9","oc1b","gasoleo")),26) occurs(action(("pop-start","s13","b4","a1","a3","b0","rat-a","lco")),27) occurs(action(("pop-end","s13","a1","a3","b7","b0")),28) occurs(action(("pop-unitarypipe","s34","b8","a3","a4","b10","oca1","oc1b")),29) occurs(action(("push-unitarypipe","s34","b9","a3","a4","b8","gasoleo","oca1")),30)
SATISFIABLE
Models : 1+
Calls : 12
Time : 35.616s (Solving: 32.54s 1st Model: 0.90s Unsat: 3.09s)
CPU Time : 35.604s
Choices : 159220 (Domain: 153351)
Conflicts : 65770 (Analyzed: 65768)
Restarts : 714 (Average: 92.11 Last: 110)
Model-Level : 127.0
Problems : 12 (Average Length: 22.00 Splits: 0)
Lemmas : 65768 (Deleted: 59751)
Binary : 276 (Ratio: 0.42%)
Ternary : 204 (Ratio: 0.31%)
Conflict : 65768 (Average Length: 677.2 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 65768 (Average: 2.04 Max: 140 Sum: 134440)
Executed : 65643 (Average: 2.01 Max: 140 Sum: 132211 Ratio: 98.34%)
Bounded : 125 (Average: 17.83 Max: 32 Sum: 2229 Ratio: 1.66%)
Rules : 81376 (Original: 78147)
Atoms : 47145
Bodies : 21985 (Original: 18905)
Count : 2226 (Original: 2559)
Equivalences : 13831 (Atom=Atom: 77 Body=Body: 0 Other: 13754)
Tight : Yes
Variables : 88310 (Eliminated: 0 Frozen: 36173)
Constraints : 587783 (Binary: 93.2% Ternary: 2.7% Other: 4.1%)
Memory Peak : 196MB
Max. Length : 30 steps
Sol. Length : 30 steps
Models : 2