202 lines
9.0 KiB
Plaintext
202 lines
9.0 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-15.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-15.pddl
|
|
Parsing...
|
|
Parsing: [0.040s CPU, 0.042s wall-clock]
|
|
Normalizing task... [0.000s CPU, 0.003s wall-clock]
|
|
Instantiating...
|
|
Generating Datalog program... [0.010s CPU, 0.007s wall-clock]
|
|
Normalizing Datalog program...
|
|
Normalizing Datalog program: [0.070s CPU, 0.067s wall-clock]
|
|
Preparing model... [0.020s CPU, 0.022s wall-clock]
|
|
Generated 91 rules.
|
|
Computing model... [0.320s CPU, 0.319s wall-clock]
|
|
1355 relevant atoms
|
|
2398 auxiliary atoms
|
|
3753 final queue length
|
|
6576 total queue pushes
|
|
Completing instantiation... [0.480s CPU, 0.479s wall-clock]
|
|
Instantiating: [0.900s CPU, 0.899s wall-clock]
|
|
Computing fact groups...
|
|
Finding invariants...
|
|
18 initial candidates
|
|
Finding invariants: [0.130s CPU, 0.124s 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...
|
|
225 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.150s CPU, 0.147s 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.020s wall-clock]
|
|
Translating task: [0.450s CPU, 0.453s wall-clock]
|
|
1912 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.277s wall-clock]
|
|
Reordering and filtering variables...
|
|
227 of 227 variables necessary.
|
|
0 of 2 mutex groups necessary.
|
|
1012 of 1012 operators necessary.
|
|
0 of 0 axiom rules necessary.
|
|
Reordering and filtering variables: [0.280s CPU, 0.279s wall-clock]
|
|
Translator variables: 227
|
|
Translator derived variables: 0
|
|
Translator facts: 456
|
|
Translator goal facts: 4
|
|
Translator mutex groups: 0
|
|
Translator total mutex groups size: 0
|
|
Translator operators: 1012
|
|
Translator axioms: 0
|
|
Translator task size: 9571
|
|
Translator peak memory: 41676 KB
|
|
Writing output... [0.160s CPU, 0.184s wall-clock]
|
|
Done! [2.290s CPU, 2.310s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 0.41s
|
|
Memory: 75MB
|
|
|
|
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 (+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: 75MB
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
|
Grounding Time: 0.13s
|
|
Memory: 75MB (+0MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.01s
|
|
Memory: 77MB (+2MB)
|
|
UNSAT
|
|
Iteration Time: 0.18s
|
|
|
|
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: 79.0MB
|
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
|
Grounding Time: 0.16s
|
|
Memory: 84MB (+7MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.09s
|
|
Memory: 88MB (+4MB)
|
|
UNSAT
|
|
Iteration Time: 0.31s
|
|
|
|
Iteration 4
|
|
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
|
Grounded Until: 10
|
|
Expected Memory: 99.0MB
|
|
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
|
|
Grounding Time: 0.14s
|
|
Memory: 94MB (+6MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.05s
|
|
Memory: 98MB (+4MB)
|
|
SAT
|
|
Testing...
|
|
NOT SERIALIZABLE
|
|
Testing Time: 0.49s
|
|
Memory: 114MB (+16MB)
|
|
Solving...
|
|
Solving Time: 4.10s
|
|
Memory: 111MB (+-3MB)
|
|
UNKNOWN
|
|
Iteration Time: 4.85s
|
|
|
|
Iteration 5
|
|
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
|
Grounded Until: 15
|
|
Expected Memory: 122.0MB
|
|
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
|
|
Grounding Time: 0.28s
|
|
Memory: 125MB (+14MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 5.04s
|
|
Memory: 146MB (+21MB)
|
|
UNKNOWN
|
|
Iteration Time: 5.40s
|
|
|
|
Iteration 6
|
|
Queue: [(5,25,0,True), (6,30,0,True)]
|
|
Grounded Until: 20
|
|
Expected Memory: 181.0MB
|
|
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
|
|
Grounding Time: 0.24s
|
|
Memory: 148MB (+2MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.09s
|
|
Memory: 153MB (+5MB)
|
|
SAT
|
|
Testing...
|
|
SERIALIZABLE?
|
|
Testing Time: 0.00s
|
|
Memory: 153MB (+0MB)
|
|
Answer: 2
|
|
occurs(action(("pop-start","s13","b6","a1","a3","b7","lco","lco")),1) occurs(action(("push-start","s12","b8","a1","a2","b10","rat-a","rat-a")),1) occurs(action(("pop-end","s13","a1","a3","b12","b7")),2) occurs(action(("push-end","s12","a1","a2","b1","b10")),2) occurs(action(("pop-start","s12","b3","a1","a2","b10","rat-a","rat-a")),3) occurs(action(("pop-start","s13","b4","a1","a3","b6","oca1","lco")),3) occurs(action(("pop-end","s13","a1","a3","b7","b6")),4) occurs(action(("pop-end","s12","a1","a2","b8","b10")),4) occurs(action(("pop-start","s12","b5","a1","a2","b3","rat-a","rat-a")),5) occurs(action(("pop-end","s12","a1","a2","b10","b3")),6) occurs(action(("pop-start","s12","b0","a1","a2","b5","rat-a","rat-a")),7) occurs(action(("pop-end","s12","a1","a2","b3","b5")),8) occurs(action(("push-start","s13","b3","a1","a3","b6","rat-a","lco")),9) occurs(action(("push-end","s13","a1","a3","b4","b6")),10) occurs(action(("push-start","s13","b10","a1","a3","b3","rat-a","rat-a")),11) occurs(action(("push-end","s13","a1","a3","b6","b3")),12) occurs(action(("push-start","s13","b8","a1","a3","b10","rat-a","rat-a")),13) occurs(action(("push-end","s13","a1","a3","b3","b10")),14) occurs(action(("pop-start","s13","b13","a1","a3","b10","rat-a","rat-a")),15) occurs(action(("pop-end","s13","a1","a3","b8","b10")),16) occurs(action(("pop-start","s13","b6","a1","a3","b13","lco","rat-a")),17) occurs(action(("push-start","s12","b8","a1","a2","b5","rat-a","rat-a")),17) occurs(action(("pop-end","s13","a1","a3","b10","b13")),18) occurs(action(("push-end","s12","a1","a2","b0","b5")),18) occurs(action(("pop-start","s13","b4","a1","a3","b6","oca1","lco")),19) occurs(action(("push-start","s12","b10","a1","a2","b8","rat-a","rat-a")),19) occurs(action(("push-end","s12","a1","a2","b5","b8")),20) occurs(action(("pop-end","s13","a1","a3","b13","b6")),20) occurs(action(("push-start","s13","b2","a1","a3","b6","oca1","lco")),21) occurs(action(("push-start","s12","b13","a1","a2","b10","rat-a","rat-a")),21) occurs(action(("push-end","s12","a1","a2","b8","b10")),22) occurs(action(("pop-start","s12","b0","a1","a2","b10","rat-a","rat-a")),23) occurs(action(("pop-end","s12","a1","a2","b13","b10")),24) occurs(action(("pop-start","s12","b5","a1","a2","b0","rat-a","rat-a")),25)
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 7
|
|
Time : 11.291s (Solving: 9.27s 1st Model: 0.11s Unsat: 0.09s)
|
|
CPU Time : 11.272s
|
|
|
|
Choices : 40808 (Domain: 38632)
|
|
Conflicts : 19163 (Analyzed: 19162)
|
|
Restarts : 210 (Average: 91.25 Last: 127)
|
|
Model-Level : 95.5
|
|
Problems : 7 (Average Length: 14.86 Splits: 0)
|
|
Lemmas : 19162 (Deleted: 15771)
|
|
Binary : 83 (Ratio: 0.43%)
|
|
Ternary : 78 (Ratio: 0.41%)
|
|
Conflict : 19162 (Average Length: 763.3 Ratio: 100.00%)
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 19162 (Average: 1.84 Max: 77 Sum: 35287)
|
|
Executed : 19130 (Average: 1.82 Max: 77 Sum: 34789 Ratio: 98.59%)
|
|
Bounded : 32 (Average: 15.56 Max: 22 Sum: 498 Ratio: 1.41%)
|
|
|
|
Rules : 71304 (Original: 68736)
|
|
Atoms : 38964
|
|
Bodies : 19863 (Original: 17396)
|
|
Count : 2212 (Original: 2493)
|
|
Equivalences : 12629 (Atom=Atom: 56 Body=Body: 1 Other: 12572)
|
|
Tight : Yes
|
|
Variables : 64336 (Eliminated: 0 Frozen: 24783)
|
|
Constraints : 407513 (Binary: 92.4% Ternary: 3.0% Other: 4.6%)
|
|
|
|
Memory Peak : 157MB
|
|
Max. Length : 25 steps
|
|
Sol. Length : 25 steps
|
|
Models : 2
|
|
|
|
|