145 lines
6.5 KiB
Plaintext
145 lines
6.5 KiB
Plaintext
|
INFO Running translator.
|
||
|
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-prime-round-1-strips/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-prime-round-1-strips/instances/instance-12.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-1998/domains/mystery-prime-round-1-strips/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-prime-round-1-strips/instances/instance-12.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.020s CPU, 0.022s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.010s CPU, 0.005s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.030s CPU, 0.036s wall-clock]
|
||
|
|
Preparing model... [0.020s CPU, 0.016s wall-clock]
|
||
|
|
Generated 55 rules.
|
||
|
|
Computing model... [0.360s CPU, 0.369s wall-clock]
|
||
|
|
3024 relevant atoms
|
||
|
|
1080 auxiliary atoms
|
||
|
|
4104 final queue length
|
||
|
|
9555 total queue pushes
|
||
|
|
Completing instantiation... [0.990s CPU, 0.980s wall-clock]
|
||
|
|
Instantiating: [1.410s CPU, 1.411s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
12 initial candidates
|
||
|
|
Finding invariants: [0.050s CPU, 0.048s wall-clock]
|
||
|
|
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Instantiating groups... [0.010s CPU, 0.009s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
0 uncovered facts
|
||
|
|
Choosing groups: [0.000s CPU, 0.003s wall-clock]
|
||
|
|
Building translation key... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Computing fact groups: [0.070s CPU, 0.068s 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.040s CPU, 0.036s wall-clock]
|
||
|
|
Translating task: [0.680s CPU, 0.683s wall-clock]
|
||
|
|
0 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
19 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.350s CPU, 0.346s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
19 of 19 variables necessary.
|
||
|
|
0 of 19 mutex groups necessary.
|
||
|
|
2544 of 2544 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.110s CPU, 0.107s wall-clock]
|
||
|
|
Translator variables: 19
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 136
|
||
|
|
Translator goal facts: 1
|
||
|
|
Translator mutex groups: 0
|
||
|
|
Translator total mutex groups size: 0
|
||
|
|
Translator operators: 2544
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 13260
|
||
|
|
Translator peak memory: 45516 KB
|
||
|
|
Writing output... [0.230s CPU, 0.263s wall-clock]
|
||
|
|
Done! [2.900s CPU, 2.937s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.60s
|
||
|
|
Memory: 89MB
|
||
|
|
|
||
|
|
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: 90MB (+1MB)
|
||
|
|
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
|
||
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||
|
|
Grounding Time: 0.16s
|
||
|
|
Memory: 90MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.01s
|
||
|
|
Memory: 92MB (+2MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
NOT SERIALIZABLE
|
||
|
|
Testing Time: 0.53s
|
||
|
|
Memory: 114MB (+22MB)
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.01s
|
||
|
|
Memory: 114MB (+0MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
SERIALIZABLE?
|
||
|
|
Testing Time: 0.00s
|
||
|
|
Memory: 114MB (+0MB)
|
||
|
|
Answer: 2
|
||
|
|
occurs(action(("overcome","anger","rest","arugula","pluto","jupiter")),1) occurs(action(("feast","love","hotdog","lettuce","kentucky","pennsylvania")),1) occurs(action(("drink","broccoli","pork","quebec","pennsylvania","kentucky","pennsylvania","quebec")),1) occurs(action(("drink","wurst","arugula","goias","guanabara","surrey","kentucky","pennsylvania")),1) occurs(action(("drink","turkey","lettuce","arizona","quebec","pennsylvania","surrey","guanabara")),1) occurs(action(("feast","excitement","broccoli","turkey","kentucky","pennsylvania")),2) occurs(action(("feast","love","lettuce","arugula","surrey","guanabara")),2) occurs(action(("feast","rest","arugula","wurst","kentucky","pennsylvania")),2) occurs(action(("drink","wurst","hotdog","guanabara","surrey","arizona","kentucky","pennsylvania")),2) occurs(action(("drink","turkey","kale","quebec","pennsylvania","kentucky","pennsylvania","quebec")),2) occurs(action(("feast","excitement","turkey","hotdog","kentucky","pennsylvania")),3) occurs(action(("feast","intoxication","lettuce","arugula","arizona","surrey")),3) occurs(action(("feast","rest","wurst","pork","arizona","surrey")),3) occurs(action(("feast","excitement","hotdog","kale","kentucky","pennsylvania")),4) occurs(action(("feast","rest","pork","kale","pennsylvania","quebec")),4) occurs(action(("succumb","anger","rest","kale","pluto","jupiter")),5)
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 3
|
||
|
|
Time : 0.985s (Solving: 0.01s 1st Model: 0.00s Unsat: 0.00s)
|
||
|
|
CPU Time : 0.948s
|
||
|
|
|
||
|
|
Choices : 270 (Domain: 182)
|
||
|
|
Conflicts : 32 (Analyzed: 32)
|
||
|
|
Restarts : 0
|
||
|
|
Model-Level : 81.5
|
||
|
|
Problems : 3 (Average Length: 5.33 Splits: 0)
|
||
|
|
Lemmas : 32 (Deleted: 0)
|
||
|
|
Binary : 8 (Ratio: 25.00%)
|
||
|
|
Ternary : 4 (Ratio: 12.50%)
|
||
|
|
Conflict : 32 (Average Length: 4.6 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 32 (Average: 4.44 Max: 33 Sum: 142)
|
||
|
|
Executed : 29 (Average: 3.78 Max: 33 Sum: 121 Ratio: 85.21%)
|
||
|
|
Bounded : 3 (Average: 7.00 Max: 7 Sum: 21 Ratio: 14.79%)
|
||
|
|
|
||
|
|
Rules : 58524 (Original: 58496)
|
||
|
|
Atoms : 47407
|
||
|
|
Bodies : 6193 (Original: 6167)
|
||
|
|
Count : 76 (Original: 84)
|
||
|
|
Equivalences : 5219 (Atom=Atom: 9 Body=Body: 0 Other: 5210)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 11759 (Eliminated: 0 Frozen: 5705)
|
||
|
|
Constraints : 54368 (Binary: 97.8% Ternary: 0.9% Other: 1.3%)
|
||
|
|
|
||
|
|
Memory Peak : 114MB
|
||
|
|
Max. Length : 5 steps
|
||
|
|
Sol. Length : 5 steps
|
||
|
|
Models : 2
|
||
|
|
|
||
|
|
|