146 lines
5.7 KiB
Plaintext
146 lines
5.7 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-1.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-1.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.020s CPU, 0.027s wall-clock]
|
||
|
|
Normalizing task... [0.010s CPU, 0.002s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.000s CPU, 0.005s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.050s CPU, 0.052s wall-clock]
|
||
|
|
Preparing model... [0.020s CPU, 0.016s wall-clock]
|
||
|
|
Generated 91 rules.
|
||
|
|
Computing model... [0.070s CPU, 0.072s wall-clock]
|
||
|
|
252 relevant atoms
|
||
|
|
616 auxiliary atoms
|
||
|
|
868 final queue length
|
||
|
|
1218 total queue pushes
|
||
|
|
Completing instantiation... [0.060s CPU, 0.063s wall-clock]
|
||
|
|
Instantiating: [0.210s CPU, 0.210s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
18 initial candidates
|
||
|
|
Finding invariants: [0.120s CPU, 0.120s 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...
|
||
|
|
42 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.120s CPU, 0.125s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Building dictionary for full mutex groups... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Building mutex information...
|
||
|
|
Building mutex information: [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Translating task...
|
||
|
|
Processing axioms...
|
||
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Processing axioms: [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Translating task: [0.060s CPU, 0.057s wall-clock]
|
||
|
|
336 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
8 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.030s CPU, 0.034s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
42 of 42 variables necessary.
|
||
|
|
0 of 0 mutex groups necessary.
|
||
|
|
128 of 128 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.030s CPU, 0.033s wall-clock]
|
||
|
|
Translator variables: 42
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 84
|
||
|
|
Translator goal facts: 2
|
||
|
|
Translator mutex groups: 0
|
||
|
|
Translator total mutex groups size: 0
|
||
|
|
Translator operators: 128
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 1208
|
||
|
|
Translator peak memory: 37068 KB
|
||
|
|
Writing output... [0.020s CPU, 0.029s wall-clock]
|
||
|
|
Done! [0.510s CPU, 0.521s 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: 53MB (+1MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 53MB (+0MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
NOT SERIALIZABLE
|
||
|
|
Testing Time: 0.05s
|
||
|
|
Memory: 55MB (+2MB)
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 55MB (+0MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
SERIALIZABLE?
|
||
|
|
Testing Time: 0.00s
|
||
|
|
Memory: 55MB (+0MB)
|
||
|
|
Answer: 2
|
||
|
|
occurs(action(("pop-unitarypipe","s13","b1","a1","a3","b5","lco","oca1")),1) occurs(action(("push-unitarypipe","s13","b2","a1","a3","b1","gasoleo","lco")),2) occurs(action(("push-unitarypipe","s12","b5","a1","a2","b4","oca1","lco")),2) occurs(action(("push-unitarypipe","s13","b3","a1","a3","b2","rat-a","gasoleo")),3) occurs(action(("push-unitarypipe","s12","b0","a1","a2","b5","oc1b","oca1")),3) occurs(action(("pop-unitarypipe","s13","b1","a1","a3","b3","lco","rat-a")),4) occurs(action(("pop-unitarypipe","s12","b4","a1","a2","b0","lco","oc1b")),5)
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 3
|
||
|
|
Time : 0.124s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
|
||
|
|
CPU Time : 0.116s
|
||
|
|
|
||
|
|
Choices : 53 (Domain: 32)
|
||
|
|
Conflicts : 8 (Analyzed: 8)
|
||
|
|
Restarts : 0
|
||
|
|
Model-Level : 27.5
|
||
|
|
Problems : 3 (Average Length: 5.33 Splits: 0)
|
||
|
|
Lemmas : 8 (Deleted: 0)
|
||
|
|
Binary : 4 (Ratio: 50.00%)
|
||
|
|
Ternary : 0 (Ratio: 0.00%)
|
||
|
|
Conflict : 8 (Average Length: 8.6 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 8 (Average: 1.50 Max: 4 Sum: 12)
|
||
|
|
Executed : 8 (Average: 1.50 Max: 4 Sum: 12 Ratio: 100.00%)
|
||
|
|
Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%)
|
||
|
|
|
||
|
|
Rules : 5372 (Original: 5215)
|
||
|
|
Atoms : 4508
|
||
|
|
Bodies : 925 (Original: 825)
|
||
|
|
Count : 133 (Original: 157)
|
||
|
|
Equivalences : 552 (Atom=Atom: 16 Body=Body: 0 Other: 536)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 1853 (Eliminated: 0 Frozen: 502)
|
||
|
|
Constraints : 7940 (Binary: 87.9% Ternary: 5.4% Other: 6.7%)
|
||
|
|
|
||
|
|
Memory Peak : 55MB
|
||
|
|
Max. Length : 5 steps
|
||
|
|
Sol. Length : 5 steps
|
||
|
|
Models : 2
|
||
|
|
|
||
|
|
|