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

174 lines
7.7 KiB
Plaintext
Raw Permalink 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-17.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-17.pddl
Parsing...
Parsing: [0.030s CPU, 0.027s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.005s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.050s CPU, 0.050s wall-clock]
Preparing model... [0.020s CPU, 0.018s wall-clock]
Generated 91 rules.
Computing model... [0.460s CPU, 0.457s wall-clock]
2110 relevant atoms
3400 auxiliary atoms
5510 final queue length
10196 total queue pushes
Completing instantiation... [0.820s CPU, 0.819s wall-clock]
Instantiating: [1.350s CPU, 1.356s wall-clock]
Computing fact groups...
Finding invariants...
18 initial candidates
Finding invariants: [0.120s CPU, 0.119s 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...
320 uncovered facts
Choosing groups: [0.000s CPU, 0.000s wall-clock]
Building translation key... [0.000s CPU, 0.011s wall-clock]
Computing fact groups: [0.150s CPU, 0.154s wall-clock]
Building STRIPS to SAS dictionary... [0.010s CPU, 0.003s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.003s 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.040s CPU, 0.033s wall-clock]
Translating task: [0.750s CPU, 0.750s wall-clock]
3200 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
2 propositions removed
Detecting unreachable propositions: [0.420s CPU, 0.410s wall-clock]
Reordering and filtering variables...
322 of 322 variables necessary.
0 of 2 mutex groups necessary.
1664 of 1664 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.500s CPU, 0.500s wall-clock]
Translator variables: 322
Translator derived variables: 0
Translator facts: 646
Translator goal facts: 5
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 1664
Translator axioms: 0
Translator task size: 15693
Translator peak memory: 45648 KB
Writing output... [0.270s CPU, 0.296s wall-clock]
Done! [3.510s CPU, 3.535s wall-clock]
planner.py version 0.0.1
Time: 0.67s
Memory: 92MB
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: 92MB (+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: 92MB
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.22s
Memory: 92MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.02s
Memory: 95MB (+3MB)
UNSAT
Iteration Time: 0.33s
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: 98.0MB
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 0.23s
Memory: 104MB (+9MB)
Unblocking actions...
Solving...
Solving Time: 0.04s
Memory: 110MB (+6MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.78s
Memory: 135MB (+25MB)
Solving...
Solving Time: 0.47s
Memory: 132MB (+-3MB)
UNSAT
Iteration Time: 1.64s
Iteration 4
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 10
Expected Memory: 147.0MB
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time: 0.39s
Memory: 137MB (+5MB)
Unblocking actions...
Solving...
Solving Time: 0.31s
Memory: 150MB (+13MB)
SAT
Testing...
SERIALIZABLE?
Testing Time: 0.00s
Memory: 150MB (+0MB)
Answer: 2
occurs(action(("pop-start","s12","b8","a1","a2","b15","oc1b","gasoleo")),1) occurs(action(("push-start","s13","b0","a1","a3","b10","oc1b","oca1")),1) occurs(action(("pop-end","s12","a1","a2","b1","b15")),2) occurs(action(("push-end","s13","a1","a3","b3","b10")),2) occurs(action(("push-start","s13","b6","a1","a3","b0","lco","oc1b")),3) occurs(action(("pop-start","s12","b14","a1","a2","b8","oca1","oc1b")),3) occurs(action(("pop-end","s12","a1","a2","b15","b8")),4) occurs(action(("push-end","s13","a1","a3","b10","b0")),4) occurs(action(("pop-start","s12","b13","a1","a2","b14","gasoleo","oca1")),5) occurs(action(("pop-start","s13","b9","a1","a3","b0","oca1","oc1b")),5) occurs(action(("pop-end","s12","a1","a2","b8","b14")),6) occurs(action(("pop-end","s13","a1","a3","b6","b0")),6) occurs(action(("pop-start","s12","b7","a1","a2","b13","oca1","gasoleo")),7) occurs(action(("pop-start","s13","b11","a1","a3","b9","lco","oca1")),7) occurs(action(("pop-end","s12","a1","a2","b14","b13")),8) occurs(action(("pop-end","s13","a1","a3","b0","b9")),8) occurs(action(("push-start","s12","b0","a1","a2","b13","oc1b","gasoleo")),9) occurs(action(("pop-start","s13","b2","a1","a3","b11","lco","lco")),9) occurs(action(("push-end","s12","a1","a2","b7","b13")),10) occurs(action(("push-start","s12","b8","a1","a2","b0","oc1b","oc1b")),11) occurs(action(("pop-end","s13","a1","a3","b9","b11")),11) occurs(action(("push-start","s13","b6","a1","a3","b11","lco","lco")),12) occurs(action(("push-end","s12","a1","a2","b13","b0")),12) occurs(action(("push-start","s12","b9","a1","a2","b8","oca1","oc1b")),13) occurs(action(("push-end","s12","a1","a2","b0","b8")),14) occurs(action(("push-end","s13","a1","a3","b2","b11")),15)
SATISFIABLE
Models : 1+
Calls : 5
Time : 2.909s (Solving: 0.75s 1st Model: 0.31s Unsat: 0.43s)
CPU Time : 2.876s
Choices : 4202 (Domain: 3785)
Conflicts : 1573 (Analyzed: 1571)
Restarts : 16 (Average: 98.19 Last: 66)
Model-Level : 74.0
Problems : 5 (Average Length: 10.00 Splits: 0)
Lemmas : 1571 (Deleted: 0)
Binary : 57 (Ratio: 3.63%)
Ternary : 37 (Ratio: 2.36%)
Conflict : 1571 (Average Length: 294.7 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 1571 (Average: 2.62 Max: 68 Sum: 4109)
Executed : 1549 (Average: 2.47 Max: 68 Sum: 3877 Ratio: 94.35%)
Bounded : 22 (Average: 10.55 Max: 17 Sum: 232 Ratio: 5.65%)
Rules : 88423 (Original: 84901)
Atoms : 59076
Bodies : 18615 (Original: 15135)
Count : 1621 (Original: 1986)
Equivalences : 10990 (Atom=Atom: 111 Body=Body: 0 Other: 10879)
Tight : Yes
Variables : 57200 (Eliminated: 0 Frozen: 20506)
Constraints : 347091 (Binary: 92.8% Ternary: 3.2% Other: 4.0%)
Memory Peak : 150MB
Max. Length : 15 steps
Sol. Length : 15 steps
Models : 2