160 lines
7.0 KiB
Plaintext
160 lines
7.0 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-3.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-3.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.030s CPU, 0.035s wall-clock]
|
||
|
|
Normalizing task... [0.010s CPU, 0.003s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.000s CPU, 0.008s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.070s CPU, 0.076s wall-clock]
|
||
|
|
Preparing model... [0.030s CPU, 0.025s wall-clock]
|
||
|
|
Generated 126 rules.
|
||
|
|
Computing model... [0.350s CPU, 0.348s wall-clock]
|
||
|
|
1044 relevant atoms
|
||
|
|
2478 auxiliary atoms
|
||
|
|
3522 final queue length
|
||
|
|
7315 total queue pushes
|
||
|
|
Completing instantiation... [0.600s CPU, 0.601s wall-clock]
|
||
|
|
Instantiating: [1.050s CPU, 1.064s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
22 initial candidates
|
||
|
|
Finding invariants: [0.270s CPU, 0.271s wall-clock]
|
||
|
|
Checking invariant weight... [0.010s CPU, 0.003s wall-clock]
|
||
|
|
Instantiating groups... [0.010s CPU, 0.014s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
16 uncovered facts
|
||
|
|
Choosing groups: [0.010s CPU, 0.002s wall-clock]
|
||
|
|
Building translation key... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Computing fact groups: [0.300s CPU, 0.298s 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.010s CPU, 0.001s wall-clock]
|
||
|
|
Translating task...
|
||
|
|
Processing axioms...
|
||
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Processing axioms: [0.020s CPU, 0.021s wall-clock]
|
||
|
|
Translating task: [0.400s CPU, 0.403s wall-clock]
|
||
|
|
656 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
31 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.240s CPU, 0.237s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
31 of 47 variables necessary.
|
||
|
|
8 of 31 mutex groups necessary.
|
||
|
|
656 of 656 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.110s CPU, 0.115s wall-clock]
|
||
|
|
Translator variables: 31
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 90
|
||
|
|
Translator goal facts: 3
|
||
|
|
Translator mutex groups: 8
|
||
|
|
Translator total mutex groups size: 40
|
||
|
|
Translator operators: 656
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 6724
|
||
|
|
Translator peak memory: 41676 KB
|
||
|
|
Writing output... [0.100s CPU, 0.115s wall-clock]
|
||
|
|
Done! [2.270s CPU, 2.290s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.34s
|
||
|
|
Memory: 71MB
|
||
|
|
|
||
|
|
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: 71MB (+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: 71MB
|
||
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||
|
|
Grounding Time: 0.08s
|
||
|
|
Memory: 71MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 72MB (+1MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.11s
|
||
|
|
|
||
|
|
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.08s
|
||
|
|
Memory: 72MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.01s
|
||
|
|
Memory: 73MB (+1MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
NOT SERIALIZABLE
|
||
|
|
Testing Time: 0.33s
|
||
|
|
Memory: 88MB (+15MB)
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.01s
|
||
|
|
Memory: 88MB (+0MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
SERIALIZABLE?
|
||
|
|
Testing Time: 0.00s
|
||
|
|
Memory: 88MB (+0MB)
|
||
|
|
Answer: 2
|
||
|
|
occurs(action(("push-unitarypipe","s12","b0","a1","a2","b5","rat-a","gasoleo","ta1-1-rat-a","ta2-2-gasoleo")),1) occurs(action(("pop-unitarypipe","s13","b6","a1","a3","b2","lco","rat-a","ta1-2-rat-a","ta3-1-lco")),1) occurs(action(("pop-unitarypipe","s13","b1","a1","a3","b6","gasoleo","lco","ta1-1-lco","ta3-1-gasoleo")),2) occurs(action(("push-unitarypipe","s12","b6","a1","a2","b0","lco","rat-a","ta1-1-lco","ta2-1-rat-a")),3) occurs(action(("push-unitarypipe","s12","b2","a1","a2","b6","rat-a","lco","ta1-2-rat-a","ta2-1-lco")),4) occurs(action(("pop-unitarypipe","s12","b0","a1","a2","b2","rat-a","rat-a","ta1-2-rat-a","ta2-1-rat-a")),5) occurs(action(("pop-unitarypipe","s12","b5","a1","a2","b0","gasoleo","rat-a","ta1-1-rat-a","ta2-2-gasoleo")),6) occurs(action(("push-unitarypipe","s13","b2","a1","a3","b1","rat-a","gasoleo","ta1-2-rat-a","ta3-1-gasoleo")),6) occurs(action(("push-unitarypipe","s13","b0","a1","a3","b2","rat-a","rat-a","ta1-1-rat-a","ta3-2-rat-a")),7) occurs(action(("pop-unitarypipe","s12","b4","a1","a2","b5","gasoleo","gasoleo","ta1-1-gasoleo","ta2-1-gasoleo")),7) occurs(action(("push-unitarypipe","s13","b5","a1","a3","b0","gasoleo","rat-a","ta1-1-gasoleo","ta3-1-rat-a")),8) occurs(action(("pop-unitarypipe","s13","b1","a1","a3","b5","gasoleo","gasoleo","ta1-2-gasoleo","ta3-1-gasoleo")),9) occurs(action(("pop-unitarypipe","s13","b2","a1","a3","b1","rat-a","gasoleo","ta1-1-gasoleo","ta3-1-rat-a")),10)
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 4
|
||
|
|
Time : 0.686s (Solving: 0.01s 1st Model: 0.00s Unsat: 0.00s)
|
||
|
|
CPU Time : 0.656s
|
||
|
|
|
||
|
|
Choices : 221 (Domain: 196)
|
||
|
|
Conflicts : 68 (Analyzed: 67)
|
||
|
|
Restarts : 0
|
||
|
|
Model-Level : 62.0
|
||
|
|
Problems : 4 (Average Length: 8.25 Splits: 0)
|
||
|
|
Lemmas : 67 (Deleted: 0)
|
||
|
|
Binary : 5 (Ratio: 7.46%)
|
||
|
|
Ternary : 0 (Ratio: 0.00%)
|
||
|
|
Conflict : 67 (Average Length: 43.8 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 67 (Average: 1.82 Max: 7 Sum: 122)
|
||
|
|
Executed : 66 (Average: 1.81 Max: 7 Sum: 121 Ratio: 99.18%)
|
||
|
|
Bounded : 1 (Average: 1.00 Max: 1 Sum: 1 Ratio: 0.82%)
|
||
|
|
|
||
|
|
Rules : 43269 (Original: 43234)
|
||
|
|
Atoms : 22871
|
||
|
|
Bodies : 5724 (Original: 5703)
|
||
|
|
Count : 273 (Original: 281)
|
||
|
|
Equivalences : 5425 (Atom=Atom: 20 Body=Body: 0 Other: 5405)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 8532 (Eliminated: 0 Frozen: 5518)
|
||
|
|
Constraints : 105338 (Binary: 97.9% Ternary: 0.8% Other: 1.4%)
|
||
|
|
|
||
|
|
Memory Peak : 88MB
|
||
|
|
Max. Length : 10 steps
|
||
|
|
Sol. Length : 10 steps
|
||
|
|
Models : 2
|
||
|
|
|
||
|
|
|