145 lines
6.2 KiB
Plaintext
145 lines
6.2 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-2.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-2.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.020s CPU, 0.029s wall-clock]
|
||
|
|
Normalizing task... [0.010s CPU, 0.002s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.010s CPU, 0.009s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.040s CPU, 0.045s wall-clock]
|
||
|
|
Preparing model... [0.020s CPU, 0.024s wall-clock]
|
||
|
|
Generated 55 rules.
|
||
|
|
Computing model... [0.570s CPU, 0.569s wall-clock]
|
||
|
|
4715 relevant atoms
|
||
|
|
1868 auxiliary atoms
|
||
|
|
6583 final queue length
|
||
|
|
14855 total queue pushes
|
||
|
|
Completing instantiation... [1.670s CPU, 1.671s wall-clock]
|
||
|
|
Instantiating: [2.320s CPU, 2.325s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
12 initial candidates
|
||
|
|
Finding invariants: [0.050s CPU, 0.054s wall-clock]
|
||
|
|
Checking invariant weight... [0.010s CPU, 0.002s wall-clock]
|
||
|
|
Instantiating groups... [0.030s CPU, 0.031s wall-clock]
|
||
|
|
Collecting mutex groups... [0.010s CPU, 0.002s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
0 uncovered facts
|
||
|
|
Choosing groups: [0.000s CPU, 0.006s wall-clock]
|
||
|
|
Building translation key... [0.000s CPU, 0.004s wall-clock]
|
||
|
|
Computing fact groups: [0.110s CPU, 0.112s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s 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.002s wall-clock]
|
||
|
|
Translating task...
|
||
|
|
Processing axioms...
|
||
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Processing axioms: [0.070s CPU, 0.066s wall-clock]
|
||
|
|
Translating task: [1.270s CPU, 1.275s wall-clock]
|
||
|
|
0 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
35 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.600s CPU, 0.594s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
35 of 35 variables necessary.
|
||
|
|
0 of 35 mutex groups necessary.
|
||
|
|
4184 of 4184 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.190s CPU, 0.196s wall-clock]
|
||
|
|
Translator variables: 35
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 299
|
||
|
|
Translator goal facts: 2
|
||
|
|
Translator mutex groups: 0
|
||
|
|
Translator total mutex groups size: 0
|
||
|
|
Translator operators: 4184
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 24616
|
||
|
|
Translator peak memory: 52428 KB
|
||
|
|
Writing output... [0.420s CPU, 0.463s wall-clock]
|
||
|
|
Done! [5.010s CPU, 5.060s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 1.03s
|
||
|
|
Memory: 120MB
|
||
|
|
|
||
|
|
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: 120MB (+0MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.01s
|
||
|
|
|
||
|
|
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.28s
|
||
|
|
Memory: 120MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.02s
|
||
|
|
Memory: 124MB (+4MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
NOT SERIALIZABLE
|
||
|
|
Testing Time: 0.99s
|
||
|
|
Memory: 161MB (+37MB)
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.02s
|
||
|
|
Memory: 161MB (+0MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
SERIALIZABLE?
|
||
|
|
Testing Time: 0.00s
|
||
|
|
Memory: 161MB (+0MB)
|
||
|
|
Answer: 2
|
||
|
|
occurs(action(("overcome","grief-7","entertainment","ham","pluto","jupiter")),1) occurs(action(("feast","satiety","onion","muffin","kentucky","bosnia")),1) occurs(action(("feast","stimulation","flounder","cherry","arizona","kentucky")),1) occurs(action(("drink","beef","muffin","surrey","bosnia","kentucky","kentucky","bosnia")),1) occurs(action(("overcome","depression-1","satiety","muffin","mercury","vulcan")),2) occurs(action(("feast","stimulation","cherry","beef","bosnia","surrey")),2) occurs(action(("feast","entertainment","ham","tuna","bosnia","surrey")),2) occurs(action(("drink","beef","onion","bosnia","kentucky","arizona","kentucky","bosnia")),2) occurs(action(("feast","entertainment","tuna","beef","arizona","kentucky")),3) occurs(action(("feast","curiosity","cherry","onion","kentucky","bosnia")),3) occurs(action(("feast","satiety","muffin","onion","kentucky","bosnia")),3) occurs(action(("succumb","grief-7","entertainment","beef","pluto","jupiter")),4) occurs(action(("feast","satiety","onion","beef","kentucky","bosnia")),4) occurs(action(("succumb","depression-1","satiety","beef","mercury","vulcan")),5)
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 3
|
||
|
|
Time : 1.745s (Solving: 0.01s 1st Model: 0.01s Unsat: 0.00s)
|
||
|
|
CPU Time : 1.696s
|
||
|
|
|
||
|
|
Choices : 363 (Domain: 275)
|
||
|
|
Conflicts : 56 (Analyzed: 56)
|
||
|
|
Restarts : 0
|
||
|
|
Model-Level : 83.0
|
||
|
|
Problems : 3 (Average Length: 5.33 Splits: 0)
|
||
|
|
Lemmas : 56 (Deleted: 0)
|
||
|
|
Binary : 10 (Ratio: 17.86%)
|
||
|
|
Ternary : 0 (Ratio: 0.00%)
|
||
|
|
Conflict : 56 (Average Length: 8.8 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 56 (Average: 4.02 Max: 34 Sum: 225)
|
||
|
|
Executed : 54 (Average: 3.77 Max: 34 Sum: 211 Ratio: 93.78%)
|
||
|
|
Bounded : 2 (Average: 7.00 Max: 7 Sum: 14 Ratio: 6.22%)
|
||
|
|
|
||
|
|
Rules : 112739 (Original: 112641)
|
||
|
|
Atoms : 83775
|
||
|
|
Bodies : 18835 (Original: 18737)
|
||
|
|
Count : 131 (Original: 151)
|
||
|
|
Equivalences : 10655 (Atom=Atom: 16 Body=Body: 0 Other: 10639)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 20086 (Eliminated: 0 Frozen: 11609)
|
||
|
|
Constraints : 124197 (Binary: 98.0% Ternary: 0.8% Other: 1.2%)
|
||
|
|
|
||
|
|
Memory Peak : 161MB
|
||
|
|
Max. Length : 5 steps
|
||
|
|
Sol. Length : 5 steps
|
||
|
|
Models : 2
|
||
|
|
|
||
|
|
|