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

236 lines
10 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-20.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-20.pddl
Parsing...
Parsing: [0.040s CPU, 0.045s wall-clock]
Normalizing task... [0.010s CPU, 0.003s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.009s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.070s CPU, 0.070s wall-clock]
Preparing model... [0.030s CPU, 0.025s wall-clock]
Generated 91 rules.
Computing model... [0.560s CPU, 0.562s wall-clock]
2546 relevant atoms
4016 auxiliary atoms
6562 final queue length
12294 total queue pushes
Completing instantiation... [0.990s CPU, 0.988s wall-clock]
Instantiating: [1.660s CPU, 1.662s wall-clock]
Computing fact groups...
Finding invariants...
18 initial candidates
Finding invariants: [0.140s CPU, 0.140s 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...
380 uncovered facts
Choosing groups: [0.000s CPU, 0.001s wall-clock]
Building translation key... [0.020s CPU, 0.014s wall-clock]
Computing fact groups: [0.180s CPU, 0.184s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.004s wall-clock]
Building dictionary for full mutex groups... [0.010s CPU, 0.003s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.003s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.040s CPU, 0.039s wall-clock]
Translating task: [0.910s CPU, 0.917s wall-clock]
3920 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
2 propositions removed
Detecting unreachable propositions: [0.500s CPU, 0.498s wall-clock]
Reordering and filtering variables...
382 of 382 variables necessary.
0 of 2 mutex groups necessary.
2032 of 2032 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.690s CPU, 0.690s wall-clock]
Translator variables: 382
Translator derived variables: 0
Translator facts: 766
Translator goal facts: 8
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 2032
Translator axioms: 0
Translator task size: 19156
Translator peak memory: 47704 KB
Writing output... [0.340s CPU, 0.362s wall-clock]
Done! [4.380s CPU, 4.409s wall-clock]
planner.py version 0.0.1
Time: 0.83s
Memory: 102MB
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: 102MB (+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: 102MB
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.26s
Memory: 102MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.02s
Memory: 105MB (+3MB)
UNSAT
Iteration Time: 0.40s
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: 108.0MB
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 0.32s
Memory: 118MB (+13MB)
Unblocking actions...
Solving...
Solving Time: 0.07s
Memory: 126MB (+8MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.91s
Memory: 157MB (+31MB)
Solving...
Solving Time: 0.38s
Memory: 153MB (+-4MB)
UNSAT
Iteration Time: 1.83s
Iteration 4
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 10
Expected Memory: 174.0MB
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time: 0.50s
Memory: 153MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 7.56s
Memory: 170MB (+17MB)
UNKNOWN
Iteration Time: 8.23s
Iteration 5
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 15
Expected Memory: 191.0MB
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
Grounding Time: 0.58s
Memory: 190MB (+20MB)
Unblocking actions...
Solving...
Solving Time: 9.08s
Memory: 206MB (+16MB)
UNKNOWN
Iteration Time: 9.86s
Iteration 6
Queue: [(5,25,0,True), (6,30,0,True)]
Grounded Until: 20
Expected Memory: 242.0MB
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
Grounding Time: 0.51s
Memory: 220MB (+14MB)
Unblocking actions...
Solving...
Solving Time: 8.18s
Memory: 238MB (+18MB)
UNKNOWN
Iteration Time: 8.90s
Iteration 7
Queue: [(6,30,0,True)]
Grounded Until: 25
Expected Memory: 274.0MB
Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])]
Grounding Time: 0.52s
Memory: 248MB (+10MB)
Unblocking actions...
Solving...
Solving Time: 9.86s
Memory: 269MB (+21MB)
UNKNOWN
Iteration Time: 10.61s
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: 10.15s
Memory: 269MB (+0MB)
UNKNOWN
Iteration Time: 10.17s
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: 3.30s
Memory: 269MB (+0MB)
SAT
Testing...
SERIALIZABLE?
Testing Time: 0.00s
Memory: 269MB (+0MB)
Answer: 2
occurs(action(("pop-start","s12","b5","a1","a2","b13","gasoleo","oc1b")),1) occurs(action(("pop-start","s13","b6","a1","a3","b8","lco","rat-a")),1) occurs(action(("pop-end","s12","a1","a2","b2","b13")),2) occurs(action(("pop-end","s13","a1","a3","b14","b8")),2) occurs(action(("pop-start","s12","b4","a1","a2","b5","rat-a","gasoleo")),3) occurs(action(("pop-start","s13","b15","a1","a3","b6","oc1b","lco")),3) occurs(action(("pop-end","s12","a1","a2","b13","b5")),4) occurs(action(("pop-end","s13","a1","a3","b8","b6")),4) occurs(action(("pop-start","s12","b16","a1","a2","b4","gasoleo","rat-a")),5) occurs(action(("pop-start","s13","b10","a1","a3","b15","gasoleo","oc1b")),5) occurs(action(("pop-end","s12","a1","a2","b5","b4")),6) occurs(action(("pop-end","s13","a1","a3","b6","b15")),6) occurs(action(("pop-start","s13","b1","a1","a3","b10","rat-a","gasoleo")),7) occurs(action(("push-start","s12","b17","a1","a2","b4","rat-a","rat-a")),7) occurs(action(("pop-end","s13","a1","a3","b15","b10")),8) occurs(action(("push-end","s12","a1","a2","b16","b4")),8) occurs(action(("push-start","s12","b6","a1","a2","b17","lco","rat-a")),9) occurs(action(("push-start","s13","b8","a1","a3","b10","rat-a","gasoleo")),9) occurs(action(("push-end","s12","a1","a2","b4","b17")),10) occurs(action(("push-start","s12","b3","a1","a2","b6","oca1","lco")),11) occurs(action(("push-end","s13","a1","a3","b1","b10")),11) occurs(action(("push-end","s12","a1","a2","b17","b6")),12) occurs(action(("pop-start","s13","b1","a1","a3","b10","rat-a","gasoleo")),13) occurs(action(("push-start","s12","b12","a1","a2","b3","gasoleo","oca1")),13) occurs(action(("push-end","s12","a1","a2","b6","b3")),14) occurs(action(("push-start","s12","b7","a1","a2","b12","lco","gasoleo")),15) occurs(action(("push-end","s12","a1","a2","b3","b12")),16) occurs(action(("pop-end","s13","a1","a3","b8","b10")),16) occurs(action(("push-start","s12","b13","a1","a2","b7","oc1b","lco")),17) occurs(action(("push-end","s12","a1","a2","b12","b7")),18) occurs(action(("push-start","s13","b8","a1","a3","b10","rat-a","gasoleo")),18) occurs(action(("push-start","s12","b9","a1","a2","b13","oca1","oc1b")),19) occurs(action(("push-end","s12","a1","a2","b7","b13")),20)
SATISFIABLE
Models : 1+
Calls : 10
Time : 53.474s (Solving: 48.31s 1st Model: 3.31s Unsat: 0.33s)
CPU Time : 53.452s
Choices : 260316 (Domain: 246024)
Conflicts : 52470 (Analyzed: 52469)
Restarts : 545 (Average: 96.27 Last: 161)
Model-Level : 112.0
Problems : 10 (Average Length: 19.50 Splits: 0)
Lemmas : 52469 (Deleted: 47230)
Binary : 260 (Ratio: 0.50%)
Ternary : 196 (Ratio: 0.37%)
Conflict : 52469 (Average Length: 1033.0 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 52469 (Average: 4.43 Max: 101 Sum: 232688)
Executed : 52408 (Average: 4.42 Max: 101 Sum: 231867 Ratio: 99.65%)
Bounded : 61 (Average: 13.46 Max: 32 Sum: 821 Ratio: 0.35%)
Rules : 107631 (Original: 103094)
Atoms : 71883
Bodies : 22584 (Original: 18079)
Count : 1888 (Original: 2355)
Equivalences : 13114 (Atom=Atom: 99 Body=Body: 0 Other: 13015)
Tight : Yes
Variables : 140106 (Eliminated: 0 Frozen: 60990)
Constraints : 1000615 (Binary: 93.7% Ternary: 2.4% Other: 3.9%)
Memory Peak : 269MB
Max. Length : 30 steps
Sol. Length : 20 steps
Models : 2