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-8.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-8.pddl
|
|
Parsing...
|
|
Parsing: [0.030s CPU, 0.034s 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.057s wall-clock]
|
|
Preparing model... [0.020s CPU, 0.019s wall-clock]
|
|
Generated 91 rules.
|
|
Computing model... [0.190s CPU, 0.188s wall-clock]
|
|
718 relevant atoms
|
|
1480 auxiliary atoms
|
|
2198 final queue length
|
|
3712 total queue pushes
|
|
Completing instantiation... [0.260s CPU, 0.260s wall-clock]
|
|
Instantiating: [0.530s CPU, 0.533s wall-clock]
|
|
Computing fact groups...
|
|
Finding invariants...
|
|
18 initial candidates
|
|
Finding invariants: [0.130s CPU, 0.125s 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...
|
|
84 uncovered facts
|
|
Choosing groups: [0.000s CPU, 0.000s wall-clock]
|
|
Building translation key... [0.000s CPU, 0.003s wall-clock]
|
|
Computing fact groups: [0.130s CPU, 0.134s wall-clock]
|
|
Building STRIPS to SAS dictionary... [0.010s 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.009s wall-clock]
|
|
Translating task: [0.240s CPU, 0.241s wall-clock]
|
|
1488 effect conditions simplified
|
|
0 implied preconditions added
|
|
Detecting unreachable propositions...
|
|
0 operators removed
|
|
0 axioms removed
|
|
8 propositions removed
|
|
Detecting unreachable propositions: [0.140s CPU, 0.141s wall-clock]
|
|
Reordering and filtering variables...
|
|
84 of 84 variables necessary.
|
|
0 of 0 mutex groups necessary.
|
|
528 of 528 operators necessary.
|
|
0 of 0 axiom rules necessary.
|
|
Reordering and filtering variables: [0.140s CPU, 0.142s wall-clock]
|
|
Translator variables: 84
|
|
Translator derived variables: 0
|
|
Translator facts: 168
|
|
Translator goal facts: 7
|
|
Translator mutex groups: 0
|
|
Translator total mutex groups size: 0
|
|
Translator operators: 528
|
|
Translator axioms: 0
|
|
Translator task size: 4867
|
|
Translator peak memory: 39372 KB
|
|
Writing output... [0.100s CPU, 0.106s wall-clock]
|
|
Done! [1.330s CPU, 1.347s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 0.21s
|
|
Memory: 63MB
|
|
|
|
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: 63MB (+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: 63MB
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
|
Grounding Time: 0.07s
|
|
Memory: 63MB (+0MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 64MB (+1MB)
|
|
SAT
|
|
Testing...
|
|
NOT SERIALIZABLE
|
|
Testing Time: 0.20s
|
|
Memory: 72MB (+8MB)
|
|
Solving...
|
|
Solving Time: 0.16s
|
|
Memory: 72MB (+0MB)
|
|
UNSAT
|
|
Iteration Time: 0.46s
|
|
|
|
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: 73.0MB
|
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
|
Grounding Time: 0.12s
|
|
Memory: 72MB (+0MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.01s
|
|
Memory: 74MB (+2MB)
|
|
SAT
|
|
Testing...
|
|
SERIALIZABLE?
|
|
Testing Time: 0.00s
|
|
Memory: 74MB (+0MB)
|
|
Answer: 2
|
|
occurs(action(("pop-unitarypipe","s12","b9","a1","a2","b8","lco","oc1b")),1) occurs(action(("pop-unitarypipe","s13","b11","a1","a3","b1","gasoleo","oc1b")),1) occurs(action(("pop-unitarypipe","s12","b4","a1","a2","b9","lco","lco")),2) occurs(action(("pop-unitarypipe","s13","b3","a1","a3","b11","gasoleo","gasoleo")),2) occurs(action(("pop-unitarypipe","s12","b5","a1","a2","b4","rat-a","lco")),3) occurs(action(("pop-unitarypipe","s13","b7","a1","a3","b3","rat-a","gasoleo")),3) occurs(action(("pop-unitarypipe","s13","b6","a1","a3","b7","lco","rat-a")),4) occurs(action(("pop-unitarypipe","s12","b2","a1","a2","b5","rat-a","rat-a")),4) occurs(action(("push-unitarypipe","s12","b10","a1","a2","b2","gasoleo","rat-a")),5) occurs(action(("push-unitarypipe","s12","b1","a1","a2","b10","oc1b","gasoleo")),6) occurs(action(("push-unitarypipe","s13","b8","a1","a3","b6","oc1b","lco")),6) occurs(action(("push-unitarypipe","s12","b0","a1","a2","b1","lco","oc1b")),7) occurs(action(("pop-unitarypipe","s13","b6","a1","a3","b8","lco","oc1b")),8) occurs(action(("push-unitarypipe","s12","b8","a1","a2","b0","oc1b","lco")),9) occurs(action(("pop-unitarypipe","s12","b10","a1","a2","b8","gasoleo","oc1b")),10)
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 4
|
|
Time : 0.672s (Solving: 0.17s 1st Model: 0.01s Unsat: 0.16s)
|
|
CPU Time : 0.648s
|
|
|
|
Choices : 5897 (Domain: 4927)
|
|
Conflicts : 2496 (Analyzed: 2495)
|
|
Restarts : 27 (Average: 92.41 Last: 20)
|
|
Model-Level : 78.5
|
|
Problems : 4 (Average Length: 7.00 Splits: 0)
|
|
Lemmas : 2495 (Deleted: 947)
|
|
Binary : 48 (Ratio: 1.92%)
|
|
Ternary : 63 (Ratio: 2.53%)
|
|
Conflict : 2495 (Average Length: 48.6 Ratio: 100.00%)
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 2495 (Average: 2.26 Max: 43 Sum: 5643)
|
|
Executed : 2489 (Average: 2.25 Max: 43 Sum: 5619 Ratio: 99.57%)
|
|
Bounded : 6 (Average: 4.00 Max: 7 Sum: 24 Ratio: 0.43%)
|
|
|
|
Rules : 19754 (Original: 19514)
|
|
Atoms : 17166
|
|
Bodies : 2223 (Original: 2073)
|
|
Count : 257 (Original: 287)
|
|
Equivalences : 1537 (Atom=Atom: 18 Body=Body: 0 Other: 1519)
|
|
Tight : Yes
|
|
Variables : 10115 (Eliminated: 0 Frozen: 4542)
|
|
Constraints : 70882 (Binary: 94.3% Ternary: 2.1% Other: 3.6%)
|
|
|
|
Memory Peak : 74MB
|
|
Max. Length : 10 steps
|
|
Sol. Length : 10 steps
|
|
Models : 2
|
|
|
|
|