160 lines
6.9 KiB
Plaintext
160 lines
6.9 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-5.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-5.pddl
|
|
Parsing...
|
|
Parsing: [0.020s CPU, 0.032s wall-clock]
|
|
Normalizing task... [0.010s CPU, 0.002s wall-clock]
|
|
Instantiating...
|
|
Generating Datalog program... [0.000s CPU, 0.006s wall-clock]
|
|
Normalizing Datalog program...
|
|
Normalizing Datalog program: [0.060s CPU, 0.057s wall-clock]
|
|
Preparing model... [0.020s CPU, 0.019s wall-clock]
|
|
Generated 91 rules.
|
|
Computing model... [0.140s CPU, 0.146s wall-clock]
|
|
536 relevant atoms
|
|
1168 auxiliary atoms
|
|
1704 final queue length
|
|
2750 total queue pushes
|
|
Completing instantiation... [0.190s CPU, 0.181s wall-clock]
|
|
Instantiating: [0.410s CPU, 0.412s wall-clock]
|
|
Computing fact groups...
|
|
Finding invariants...
|
|
18 initial candidates
|
|
Finding invariants: [0.100s CPU, 0.104s 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...
|
|
70 uncovered facts
|
|
Choosing groups: [0.000s CPU, 0.000s wall-clock]
|
|
Building translation key... [0.010s CPU, 0.003s wall-clock]
|
|
Computing fact groups: [0.110s CPU, 0.112s 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.006s wall-clock]
|
|
Translating task: [0.170s CPU, 0.168s wall-clock]
|
|
1024 effect conditions simplified
|
|
0 implied preconditions added
|
|
Detecting unreachable propositions...
|
|
0 operators removed
|
|
0 axioms removed
|
|
8 propositions removed
|
|
Detecting unreachable propositions: [0.100s CPU, 0.100s wall-clock]
|
|
Reordering and filtering variables...
|
|
70 of 70 variables necessary.
|
|
0 of 0 mutex groups necessary.
|
|
368 of 368 operators necessary.
|
|
0 of 0 axiom rules necessary.
|
|
Reordering and filtering variables: [0.100s CPU, 0.097s wall-clock]
|
|
Translator variables: 70
|
|
Translator derived variables: 0
|
|
Translator facts: 140
|
|
Translator goal facts: 4
|
|
Translator mutex groups: 0
|
|
Translator total mutex groups size: 0
|
|
Translator operators: 368
|
|
Translator axioms: 0
|
|
Translator task size: 3406
|
|
Translator peak memory: 38348 KB
|
|
Writing output... [0.070s CPU, 0.073s wall-clock]
|
|
Done! [1.000s CPU, 1.005s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 0.18s
|
|
Memory: 59MB
|
|
|
|
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: 59MB (+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: 59MB
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
|
Grounding Time: 0.05s
|
|
Memory: 59MB (+0MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 60MB (+1MB)
|
|
SAT
|
|
Testing...
|
|
NOT SERIALIZABLE
|
|
Testing Time: 0.14s
|
|
Memory: 65MB (+5MB)
|
|
Solving...
|
|
Solving Time: 0.05s
|
|
Memory: 65MB (+0MB)
|
|
UNSAT
|
|
Iteration Time: 0.25s
|
|
|
|
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: 66.0MB
|
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
|
Grounding Time: 0.09s
|
|
Memory: 66MB (+1MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.06s
|
|
Memory: 68MB (+2MB)
|
|
SAT
|
|
Testing...
|
|
SERIALIZABLE?
|
|
Testing Time: 0.00s
|
|
Memory: 68MB (+0MB)
|
|
Answer: 2
|
|
occurs(action(("pop-unitarypipe","s12","b5","a1","a2","b6","gasoleo","rat-a")),1) occurs(action(("pop-unitarypipe","s12","b0","a1","a2","b5","rat-a","gasoleo")),2) occurs(action(("push-unitarypipe","s13","b6","a1","a3","b2","rat-a","gasoleo")),2) occurs(action(("push-unitarypipe","s13","b7","a1","a3","b6","gasoleo","rat-a")),3) occurs(action(("push-unitarypipe","s12","b4","a1","a2","b0","lco","rat-a")),3) occurs(action(("push-unitarypipe","s12","b8","a1","a2","b4","lco","lco")),4) occurs(action(("pop-unitarypipe","s13","b3","a1","a3","b7","oca1","gasoleo")),4) occurs(action(("pop-unitarypipe","s12","b9","a1","a2","b8","oc1b","lco")),5) occurs(action(("pop-unitarypipe","s13","b1","a1","a3","b3","gasoleo","oca1")),5) occurs(action(("pop-unitarypipe","s12","b4","a1","a2","b9","lco","oc1b")),6) occurs(action(("push-unitarypipe","s13","b8","a1","a3","b1","lco","gasoleo")),6) occurs(action(("push-unitarypipe","s12","b7","a1","a2","b4","gasoleo","lco")),7) occurs(action(("push-unitarypipe","s12","b3","a1","a2","b7","oca1","gasoleo")),8) occurs(action(("pop-unitarypipe","s12","b4","a1","a2","b3","lco","oca1")),9) occurs(action(("push-unitarypipe","s13","b3","a1","a3","b8","oca1","lco")),10) occurs(action(("pop-unitarypipe","s12","b0","a1","a2","b4","rat-a","lco")),10)
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 4
|
|
Time : 0.497s (Solving: 0.10s 1st Model: 0.05s Unsat: 0.04s)
|
|
CPU Time : 0.484s
|
|
|
|
Choices : 2492 (Domain: 1799)
|
|
Conflicts : 1380 (Analyzed: 1379)
|
|
Restarts : 14 (Average: 98.50 Last: 68)
|
|
Model-Level : 58.0
|
|
Problems : 4 (Average Length: 7.00 Splits: 0)
|
|
Lemmas : 1379 (Deleted: 0)
|
|
Binary : 39 (Ratio: 2.83%)
|
|
Ternary : 47 (Ratio: 3.41%)
|
|
Conflict : 1379 (Average Length: 63.7 Ratio: 100.00%)
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 1379 (Average: 1.66 Max: 18 Sum: 2287)
|
|
Executed : 1372 (Average: 1.64 Max: 18 Sum: 2262 Ratio: 98.91%)
|
|
Bounded : 7 (Average: 3.57 Max: 7 Sum: 25 Ratio: 1.09%)
|
|
|
|
Rules : 14293 (Original: 14062)
|
|
Atoms : 12147
|
|
Bodies : 1868 (Original: 1731)
|
|
Count : 229 (Original: 257)
|
|
Equivalences : 1263 (Atom=Atom: 12 Body=Body: 0 Other: 1251)
|
|
Tight : Yes
|
|
Variables : 7851 (Eliminated: 0 Frozen: 3409)
|
|
Constraints : 52632 (Binary: 93.3% Ternary: 2.5% Other: 4.2%)
|
|
|
|
Memory Peak : 68MB
|
|
Max. Length : 10 steps
|
|
Sol. Length : 10 steps
|
|
Models : 2
|
|
|
|
|