160 lines
6.8 KiB
Plaintext
160 lines
6.8 KiB
Plaintext
INFO Running translator.
|
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/pipesworld-tankage-nontemporal-strips/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/pipesworld-tankage-nontemporal-strips/instances/instance-2.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-tankage-nontemporal-strips/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/pipesworld-tankage-nontemporal-strips/instances/instance-2.pddl
|
|
Parsing...
|
|
Parsing: [0.050s CPU, 0.051s wall-clock]
|
|
Normalizing task... [0.000s CPU, 0.003s wall-clock]
|
|
Instantiating...
|
|
Generating Datalog program... [0.010s CPU, 0.009s wall-clock]
|
|
Normalizing Datalog program...
|
|
Normalizing Datalog program: [0.090s CPU, 0.092s wall-clock]
|
|
Preparing model... [0.030s CPU, 0.026s wall-clock]
|
|
Generated 126 rules.
|
|
Computing model... [0.150s CPU, 0.145s wall-clock]
|
|
342 relevant atoms
|
|
1364 auxiliary atoms
|
|
1706 final queue length
|
|
2297 total queue pushes
|
|
Completing instantiation... [0.110s CPU, 0.106s wall-clock]
|
|
Instantiating: [0.390s CPU, 0.382s wall-clock]
|
|
Computing fact groups...
|
|
Finding invariants...
|
|
22 initial candidates
|
|
Finding invariants: [0.230s CPU, 0.235s wall-clock]
|
|
Checking invariant weight... [0.010s CPU, 0.002s wall-clock]
|
|
Instantiating groups... [0.000s CPU, 0.008s wall-clock]
|
|
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
|
|
Choosing groups...
|
|
12 uncovered facts
|
|
Choosing groups: [0.010s CPU, 0.002s wall-clock]
|
|
Building translation key... [0.000s CPU, 0.001s wall-clock]
|
|
Computing fact groups: [0.250s CPU, 0.252s wall-clock]
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
|
|
Building dictionary for full mutex groups... [0.000s CPU, 0.001s 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.004s wall-clock]
|
|
Translating task: [0.070s CPU, 0.065s wall-clock]
|
|
104 effect conditions simplified
|
|
0 implied preconditions added
|
|
Detecting unreachable propositions...
|
|
0 operators removed
|
|
0 axioms removed
|
|
25 propositions removed
|
|
Detecting unreachable propositions: [0.030s CPU, 0.034s wall-clock]
|
|
Reordering and filtering variables...
|
|
23 of 35 variables necessary.
|
|
6 of 23 mutex groups necessary.
|
|
104 of 104 operators necessary.
|
|
0 of 0 axiom rules necessary.
|
|
Reordering and filtering variables: [0.030s CPU, 0.026s wall-clock]
|
|
Translator variables: 23
|
|
Translator derived variables: 0
|
|
Translator facts: 66
|
|
Translator goal facts: 4
|
|
Translator mutex groups: 6
|
|
Translator total mutex groups size: 30
|
|
Translator operators: 104
|
|
Translator axioms: 0
|
|
Translator task size: 1163
|
|
Translator peak memory: 37324 KB
|
|
Writing output... [0.020s CPU, 0.022s wall-clock]
|
|
Done! [0.840s CPU, 0.842s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 0.07s
|
|
Memory: 52MB
|
|
|
|
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: 52MB (+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: 52MB
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
|
Grounding Time: 0.02s
|
|
Memory: 52MB (+0MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 53MB (+1MB)
|
|
UNSAT
|
|
Iteration Time: 0.03s
|
|
|
|
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: 54.0MB
|
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
|
Grounding Time: 0.02s
|
|
Memory: 54MB (+1MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 54MB (+0MB)
|
|
SAT
|
|
Testing...
|
|
NOT SERIALIZABLE
|
|
Testing Time: 0.06s
|
|
Memory: 56MB (+2MB)
|
|
Solving...
|
|
Solving Time: 0.31s
|
|
Memory: 56MB (+0MB)
|
|
SAT
|
|
Testing...
|
|
SERIALIZABLE?
|
|
Testing Time: 0.00s
|
|
Memory: 56MB (+0MB)
|
|
Answer: 2
|
|
occurs(action(("push-unitarypipe","s12","b0","a1","a2","b4","oc1b","lco","ta1-1-oc1b","ta2-1-lco")),1) occurs(action(("pop-unitarypipe","s13","b1","a1","a3","b5","lco","oca1","ta1-1-oca1","ta3-1-lco")),1) occurs(action(("push-unitarypipe","s12","b5","a1","a2","b0","oca1","oc1b","ta1-1-oca1","ta2-1-oc1b")),2) occurs(action(("push-unitarypipe","s12","b2","a1","a2","b5","gasoleo","oca1","ta1-1-gasoleo","ta2-1-oca1")),3) occurs(action(("pop-unitarypipe","s12","b4","a1","a2","b2","lco","gasoleo","ta1-1-gasoleo","ta2-1-lco")),4) occurs(action(("push-unitarypipe","s12","b3","a1","a2","b4","rat-a","lco","ta1-1-rat-a","ta2-1-lco")),5) occurs(action(("push-unitarypipe","s12","b2","a1","a2","b3","gasoleo","rat-a","ta1-1-gasoleo","ta2-1-rat-a")),6) occurs(action(("pop-unitarypipe","s12","b4","a1","a2","b2","lco","gasoleo","ta1-1-gasoleo","ta2-1-lco")),7) occurs(action(("pop-unitarypipe","s12","b3","a1","a2","b4","rat-a","lco","ta1-1-lco","ta2-1-rat-a")),8) occurs(action(("push-unitarypipe","s13","b2","a1","a3","b1","gasoleo","lco","ta1-1-gasoleo","ta3-1-lco")),8) occurs(action(("push-unitarypipe","s13","b4","a1","a3","b2","lco","gasoleo","ta1-1-lco","ta3-1-gasoleo")),9) occurs(action(("pop-unitarypipe","s13","b1","a1","a3","b4","lco","lco","ta1-1-lco","ta3-1-lco")),10)
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 4
|
|
Time : 0.458s (Solving: 0.32s 1st Model: 0.31s Unsat: 0.00s)
|
|
CPU Time : 0.452s
|
|
|
|
Choices : 7138 (Domain: 7138)
|
|
Conflicts : 4336 (Analyzed: 4335)
|
|
Restarts : 49 (Average: 88.47 Last: 88)
|
|
Model-Level : 33.0
|
|
Problems : 4 (Average Length: 8.25 Splits: 0)
|
|
Lemmas : 4335 (Deleted: 2563)
|
|
Binary : 26 (Ratio: 0.60%)
|
|
Ternary : 24 (Ratio: 0.55%)
|
|
Conflict : 4335 (Average Length: 99.7 Ratio: 100.00%)
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 4335 (Average: 1.54 Max: 32 Sum: 6670)
|
|
Executed : 4322 (Average: 1.52 Max: 32 Sum: 6579 Ratio: 98.64%)
|
|
Bounded : 13 (Average: 7.00 Max: 12 Sum: 91 Ratio: 1.36%)
|
|
|
|
Rules : 7668 (Original: 7410)
|
|
Atoms : 4340
|
|
Bodies : 1459 (Original: 1219)
|
|
Count : 173 (Original: 202)
|
|
Equivalences : 1003 (Atom=Atom: 21 Body=Body: 0 Other: 982)
|
|
Tight : Yes
|
|
Variables : 3021 (Eliminated: 0 Frozen: 939)
|
|
Constraints : 18964 (Binary: 90.7% Ternary: 4.5% Other: 4.8%)
|
|
|
|
Memory Peak : 56MB
|
|
Max. Length : 10 steps
|
|
Sol. Length : 10 steps
|
|
Models : 2
|
|
|
|
|