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-no-tankage-nontemporal-strips/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/pipesworld-no-tankage-nontemporal-strips/instances/instance-4.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-4.pddl
|
|
Parsing...
|
|
Parsing: [0.030s CPU, 0.030s wall-clock]
|
|
Normalizing task... [0.000s CPU, 0.002s wall-clock]
|
|
Instantiating...
|
|
Generating Datalog program... [0.010s CPU, 0.006s wall-clock]
|
|
Normalizing Datalog program...
|
|
Normalizing Datalog program: [0.050s CPU, 0.053s wall-clock]
|
|
Preparing model... [0.020s CPU, 0.018s wall-clock]
|
|
Generated 91 rules.
|
|
Computing model... [0.100s CPU, 0.104s wall-clock]
|
|
370 relevant atoms
|
|
864 auxiliary atoms
|
|
1234 final queue length
|
|
1860 total queue pushes
|
|
Completing instantiation... [0.110s CPU, 0.110s wall-clock]
|
|
Instantiating: [0.290s CPU, 0.293s wall-clock]
|
|
Computing fact groups...
|
|
Finding invariants...
|
|
18 initial candidates
|
|
Finding invariants: [0.100s CPU, 0.094s 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...
|
|
56 uncovered facts
|
|
Choosing groups: [0.000s CPU, 0.000s wall-clock]
|
|
Building translation key... [0.000s CPU, 0.002s wall-clock]
|
|
Computing fact groups: [0.100s CPU, 0.100s wall-clock]
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
|
|
Building dictionary for full mutex groups... [0.000s CPU, 0.000s wall-clock]
|
|
Building mutex information...
|
|
Building mutex information: [0.010s CPU, 0.000s wall-clock]
|
|
Translating task...
|
|
Processing axioms...
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
|
Processing axioms: [0.000s CPU, 0.004s wall-clock]
|
|
Translating task: [0.100s CPU, 0.103s wall-clock]
|
|
608 effect conditions simplified
|
|
0 implied preconditions added
|
|
Detecting unreachable propositions...
|
|
0 operators removed
|
|
0 axioms removed
|
|
8 propositions removed
|
|
Detecting unreachable propositions: [0.060s CPU, 0.058s wall-clock]
|
|
Reordering and filtering variables...
|
|
56 of 56 variables necessary.
|
|
0 of 0 mutex groups necessary.
|
|
224 of 224 operators necessary.
|
|
0 of 0 axiom rules necessary.
|
|
Reordering and filtering variables: [0.060s CPU, 0.058s wall-clock]
|
|
Translator variables: 56
|
|
Translator derived variables: 0
|
|
Translator facts: 112
|
|
Translator goal facts: 5
|
|
Translator mutex groups: 0
|
|
Translator total mutex groups size: 0
|
|
Translator operators: 224
|
|
Translator axioms: 0
|
|
Translator task size: 2093
|
|
Translator peak memory: 37580 KB
|
|
Writing output... [0.040s CPU, 0.047s wall-clock]
|
|
Done! [0.690s CPU, 0.698s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 0.09s
|
|
Memory: 55MB
|
|
|
|
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: 55MB (+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: 55MB
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
|
Grounding Time: 0.03s
|
|
Memory: 55MB (+0MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 56MB (+1MB)
|
|
SAT
|
|
Testing...
|
|
NOT SERIALIZABLE
|
|
Testing Time: 0.08s
|
|
Memory: 59MB (+3MB)
|
|
Solving...
|
|
Solving Time: 0.01s
|
|
Memory: 59MB (+0MB)
|
|
UNSAT
|
|
Iteration Time: 0.14s
|
|
|
|
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: 60.0MB
|
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
|
Grounding Time: 0.06s
|
|
Memory: 59MB (+0MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.01s
|
|
Memory: 61MB (+2MB)
|
|
SAT
|
|
Testing...
|
|
SERIALIZABLE?
|
|
Testing Time: 0.00s
|
|
Memory: 61MB (+0MB)
|
|
Answer: 2
|
|
occurs(action(("push-unitarypipe","s12","b3","a1","a2","b5","oca1","gasoleo")),1) occurs(action(("pop-unitarypipe","s13","b1","a1","a3","b2","gasoleo","rat-a")),1) occurs(action(("pop-unitarypipe","s13","b6","a1","a3","b1","lco","gasoleo")),2) occurs(action(("push-unitarypipe","s12","b7","a1","a2","b3","oca1","oca1")),2) occurs(action(("push-unitarypipe","s13","b2","a1","a3","b6","rat-a","lco")),3) occurs(action(("pop-unitarypipe","s12","b4","a1","a2","b7","gasoleo","oca1")),3) occurs(action(("push-unitarypipe","s13","b0","a1","a3","b2","rat-a","rat-a")),4) occurs(action(("pop-unitarypipe","s12","b3","a1","a2","b4","oca1","gasoleo")),4) occurs(action(("pop-unitarypipe","s13","b6","a1","a3","b0","lco","rat-a")),5) occurs(action(("pop-unitarypipe","s13","b2","a1","a3","b6","rat-a","lco")),6) occurs(action(("push-unitarypipe","s13","b0","a1","a3","b2","rat-a","rat-a")),7) occurs(action(("push-unitarypipe","s12","b6","a1","a2","b3","lco","oca1")),7) occurs(action(("push-unitarypipe","s12","b7","a1","a2","b6","oca1","lco")),8) occurs(action(("push-unitarypipe","s13","b4","a1","a3","b0","gasoleo","rat-a")),8) occurs(action(("pop-unitarypipe","s12","b3","a1","a2","b7","oca1","oca1")),9) occurs(action(("push-unitarypipe","s13","b7","a1","a3","b4","oca1","gasoleo")),10)
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 4
|
|
Time : 0.242s (Solving: 0.01s 1st Model: 0.01s Unsat: 0.01s)
|
|
CPU Time : 0.232s
|
|
|
|
Choices : 814 (Domain: 695)
|
|
Conflicts : 268 (Analyzed: 267)
|
|
Restarts : 2 (Average: 133.50 Last: 33)
|
|
Model-Level : 57.5
|
|
Problems : 4 (Average Length: 7.00 Splits: 0)
|
|
Lemmas : 267 (Deleted: 0)
|
|
Binary : 15 (Ratio: 5.62%)
|
|
Ternary : 18 (Ratio: 6.74%)
|
|
Conflict : 267 (Average Length: 39.1 Ratio: 100.00%)
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 267 (Average: 2.79 Max: 46 Sum: 744)
|
|
Executed : 262 (Average: 2.66 Max: 46 Sum: 710 Ratio: 95.43%)
|
|
Bounded : 5 (Average: 6.80 Max: 12 Sum: 34 Ratio: 4.57%)
|
|
|
|
Rules : 8951 (Original: 8797)
|
|
Atoms : 7614
|
|
Bodies : 1317 (Original: 1215)
|
|
Count : 184 (Original: 207)
|
|
Equivalences : 852 (Atom=Atom: 17 Body=Body: 0 Other: 835)
|
|
Tight : Yes
|
|
Variables : 5643 (Eliminated: 0 Frozen: 2201)
|
|
Constraints : 32431 (Binary: 91.4% Ternary: 3.2% Other: 5.4%)
|
|
|
|
Memory Peak : 61MB
|
|
Max. Length : 10 steps
|
|
Sol. Length : 10 steps
|
|
Models : 2
|
|
|
|
|