144 lines
6.1 KiB
Plaintext
144 lines
6.1 KiB
Plaintext
|
INFO Running translator.
|
||
|
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-round-1-strips/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-round-1-strips/instances/instance-26.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-round-1-strips/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-round-1-strips/instances/instance-26.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.010s CPU, 0.018s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.000s CPU, 0.005s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.030s CPU, 0.026s wall-clock]
|
||
|
|
Preparing model... [0.020s CPU, 0.014s wall-clock]
|
||
|
|
Generated 42 rules.
|
||
|
|
Computing model... [0.250s CPU, 0.251s wall-clock]
|
||
|
|
1849 relevant atoms
|
||
|
|
1334 auxiliary atoms
|
||
|
|
3183 final queue length
|
||
|
|
6104 total queue pushes
|
||
|
|
Completing instantiation... [0.600s CPU, 0.602s wall-clock]
|
||
|
|
Instantiating: [0.900s CPU, 0.902s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
12 initial candidates
|
||
|
|
Finding invariants: [0.040s CPU, 0.033s wall-clock]
|
||
|
|
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Instantiating groups... [0.010s CPU, 0.014s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
3 uncovered facts
|
||
|
|
Choosing groups: [0.010s CPU, 0.003s wall-clock]
|
||
|
|
Building translation key... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Computing fact groups: [0.060s CPU, 0.063s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Building dictionary for full mutex groups... [0.010s CPU, 0.002s 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.020s CPU, 0.025s wall-clock]
|
||
|
|
Translating task: [0.440s CPU, 0.443s wall-clock]
|
||
|
|
0 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
29 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.250s CPU, 0.247s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
23 of 23 variables necessary.
|
||
|
|
0 of 23 mutex groups necessary.
|
||
|
|
1536 of 1536 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.070s CPU, 0.075s wall-clock]
|
||
|
|
Translator variables: 23
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 174
|
||
|
|
Translator goal facts: 1
|
||
|
|
Translator mutex groups: 0
|
||
|
|
Translator total mutex groups size: 0
|
||
|
|
Translator operators: 1536
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 9030
|
||
|
|
Translator peak memory: 42188 KB
|
||
|
|
Writing output... [0.150s CPU, 0.169s wall-clock]
|
||
|
|
Done! [1.920s CPU, 1.942s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.38s
|
||
|
|
Memory: 74MB
|
||
|
|
|
||
|
|
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: 75MB (+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.09s
|
||
|
|
Memory: 75MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.01s
|
||
|
|
Memory: 75MB (+0MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
NOT SERIALIZABLE
|
||
|
|
Testing Time: 0.30s
|
||
|
|
Memory: 90MB (+15MB)
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 75MB (+-15MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
SERIALIZABLE
|
||
|
|
Testing Time: 0.30s
|
||
|
|
Memory: 75MB (+0MB)
|
||
|
|
Answer: 2
|
||
|
|
occurs(action(("overcome","boils","entertainment","haroset","earth","neptune")),1) occurs(action(("overcome","jealousy","satisfaction","snickers","venus","saturn")),1) occurs(action(("feast","entertainment","haroset","endive","oregon","bavaria")),1) occurs(action(("feast","satisfaction","snickers","pepper","moravia","kentucky")),1) occurs(action(("feast","understanding","papaya","flounder","moravia","kentucky")),1) occurs(action(("overcome","depression","learning","marzipan","earth","neptune")),1) occurs(action(("feast","entertainment","endive","pistachio","moravia","kentucky")),2) occurs(action(("feast","understanding","flounder","pepper","kentucky","quebec")),2) occurs(action(("succumb","jealousy","satisfaction","pepper","venus","saturn")),2) occurs(action(("overcome","jealousy","understanding","pepper","earth","neptune")),3) occurs(action(("feast","entertainment","pistachio","turkey","moravia","kentucky")),3) occurs(action(("feast","entertainment","turkey","papaya","manitoba","oregon")),4) occurs(action(("succumb","boils","entertainment","papaya","earth","neptune")),5)
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 3
|
||
|
|
Time : 0.559s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
|
||
|
|
CPU Time : 0.544s
|
||
|
|
|
||
|
|
Choices : 138 (Domain: 124)
|
||
|
|
Conflicts : 15 (Analyzed: 15)
|
||
|
|
Restarts : 0
|
||
|
|
Model-Level : 48.5
|
||
|
|
Problems : 3 (Average Length: 5.33 Splits: 0)
|
||
|
|
Lemmas : 15 (Deleted: 0)
|
||
|
|
Binary : 4 (Ratio: 26.67%)
|
||
|
|
Ternary : 5 (Ratio: 33.33%)
|
||
|
|
Conflict : 15 (Average Length: 4.0 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 15 (Average: 4.13 Max: 13 Sum: 62)
|
||
|
|
Executed : 14 (Average: 3.67 Max: 13 Sum: 55 Ratio: 88.71%)
|
||
|
|
Bounded : 1 (Average: 7.00 Max: 7 Sum: 7 Ratio: 11.29%)
|
||
|
|
|
||
|
|
Rules : 27699
|
||
|
|
Atoms : 27696
|
||
|
|
Bodies : 9 (Original: 8)
|
||
|
|
Equivalences : 15 (Atom=Atom: 5 Body=Body: 0 Other: 10)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 7788 (Eliminated: 0 Frozen: 478)
|
||
|
|
Constraints : 21378 (Binary: 95.9% Ternary: 2.0% Other: 2.1%)
|
||
|
|
|
||
|
|
Memory Peak : 90MB
|
||
|
|
Max. Length : 5 steps
|
||
|
|
Sol. Length : 5 steps
|
||
|
|
Models : 2
|
||
|
|
|
||
|
|
|