143 lines
7.1 KiB
Plaintext
143 lines
7.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.020s CPU, 0.019s 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.020s CPU, 0.031s wall-clock]
|
||
|
|
Preparing model... [0.020s CPU, 0.015s wall-clock]
|
||
|
|
Generated 42 rules.
|
||
|
|
Computing model... [0.240s CPU, 0.239s wall-clock]
|
||
|
|
1849 relevant atoms
|
||
|
|
1334 auxiliary atoms
|
||
|
|
3183 final queue length
|
||
|
|
6104 total queue pushes
|
||
|
|
Completing instantiation... [0.540s CPU, 0.539s wall-clock]
|
||
|
|
Instantiating: [0.830s CPU, 0.834s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
12 initial candidates
|
||
|
|
Finding invariants: [0.030s CPU, 0.030s wall-clock]
|
||
|
|
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Instantiating groups... [0.010s CPU, 0.012s wall-clock]
|
||
|
|
Collecting mutex groups... [0.010s CPU, 0.001s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
3 uncovered facts
|
||
|
|
Choosing groups: [0.000s CPU, 0.003s wall-clock]
|
||
|
|
Building translation key... [0.010s CPU, 0.002s wall-clock]
|
||
|
|
Computing fact groups: [0.060s CPU, 0.056s 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.020s CPU, 0.021s wall-clock]
|
||
|
|
Translating task: [0.390s CPU, 0.397s 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.230s CPU, 0.224s 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.060s CPU, 0.065s 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: 39000 KB
|
||
|
|
Writing output... [0.140s CPU, 0.161s wall-clock]
|
||
|
|
Done! [1.750s CPU, 1.779s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.35s
|
||
|
|
Memory: 69MB
|
||
|
|
|
||
|
|
Iteration 1
|
||
|
|
Queue: [0]
|
||
|
|
Grounded Until: 0
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 69MB (+0MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.00s
|
||
|
|
|
||
|
|
Iteration 2
|
||
|
|
Queue: [5]
|
||
|
|
Grounded Until: 0
|
||
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||
|
|
Grounding Time: 0.14s
|
||
|
|
Memory: 69MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.01s
|
||
|
|
Memory: 71MB (+2MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.20s
|
||
|
|
|
||
|
|
Iteration 3
|
||
|
|
Queue: [10]
|
||
|
|
Grounded Until: 5
|
||
|
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
||
|
|
Grounding Time: 0.16s
|
||
|
|
Memory: 78MB (+7MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Answer: 1
|
||
|
|
occurs(action(("feast","empathy","scallop","hamburger","manitoba","oregon")),1) occurs(action(("feast","entertainment","haroset","endive","oregon","bavaria")),1) occurs(action(("feast","satisfaction","snickers","hamburger","moravia","kentucky")),1) occurs(action(("feast","satisfaction","hamburger","scallop","oregon","bavaria")),2) occurs(action(("feast","entertainment","endive","haroset","moravia","kentucky")),2) occurs(action(("overcome","depression","learning","marzipan","earth","neptune")),2) occurs(action(("feast","empathy","hamburger","haroset","manitoba","oregon")),3) occurs(action(("feast","entertainment","haroset","marzipan","manitoba","oregon")),3) occurs(action(("feast","satisfaction","scallop","rice","quebec","manitoba")),3) occurs(action(("succumb","depression","learning","marzipan","earth","neptune")),3) occurs(action(("overcome","depression","entertainment","marzipan","earth","neptune")),4) occurs(action(("feast","satisfaction","rice","haroset","manitoba","oregon")),4) occurs(action(("overcome","boils","satisfaction","haroset","venus","saturn")),5) occurs(action(("succumb","depression","entertainment","marzipan","earth","neptune")),5) occurs(action(("feast","empathy","haroset","hamburger","quebec","manitoba")),5) occurs(action(("overcome","depression","entertainment","marzipan","earth","neptune")),6) occurs(action(("feast","empathy","hamburger","haroset","quebec","manitoba")),6) occurs(action(("feast","satisfaction","haroset","rice","kentucky","quebec")),6) occurs(action(("succumb","depression","entertainment","marzipan","earth","neptune")),7) occurs(action(("feast","empathy","haroset","hamburger","moravia","kentucky")),7) occurs(action(("feast","satisfaction","rice","pistachio","quebec","manitoba")),7) occurs(action(("overcome","depression","entertainment","marzipan","earth","neptune")),8) occurs(action(("feast","empathy","hamburger","haroset","kentucky","quebec")),8) occurs(action(("feast","satisfaction","pistachio","turkey","moravia","kentucky")),8) occurs(action(("feast","understanding","papaya","turkey","moravia","kentucky")),8) occurs(action(("feast","satisfaction","turkey","papaya","manitoba","oregon")),9) occurs(action(("succumb","boils","satisfaction","papaya","venus","saturn")),10)
|
||
|
|
Solving Time: 0.13s
|
||
|
|
Memory: 82MB (+4MB)
|
||
|
|
SAT
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 3
|
||
|
|
Time : 0.947s (Solving: 0.12s 1st Model: 0.12s Unsat: 0.00s)
|
||
|
|
CPU Time : 0.910s
|
||
|
|
|
||
|
|
Choices : 2121
|
||
|
|
Conflicts : 900 (Analyzed: 899)
|
||
|
|
Restarts : 11 (Average: 81.73 Last: 48)
|
||
|
|
Model-Level : 39.0
|
||
|
|
Problems : 3 (Average Length: 7.00 Splits: 0)
|
||
|
|
Lemmas : 899 (Deleted: 0)
|
||
|
|
Binary : 100 (Ratio: 11.12%)
|
||
|
|
Ternary : 34 (Ratio: 3.78%)
|
||
|
|
Conflict : 899 (Average Length: 73.0 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 899 (Average: 2.93 Max: 41 Sum: 2636)
|
||
|
|
Executed : 850 (Average: 2.32 Max: 41 Sum: 2090 Ratio: 79.29%)
|
||
|
|
Bounded : 49 (Average: 11.14 Max: 12 Sum: 546 Ratio: 20.71%)
|
||
|
|
|
||
|
|
Rules : 30755
|
||
|
|
Atoms : 30755
|
||
|
|
Bodies : 1 (Original: 0)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 17645 (Eliminated: 0 Frozen: 15006)
|
||
|
|
Constraints : 117195 (Binary: 97.4% Ternary: 1.1% Other: 1.5%)
|
||
|
|
|
||
|
|
Memory Peak : 83MB
|
||
|
|
Max. Length : 10 steps
|
||
|
|
Sol. Length : 10 steps
|
||
|
|
|
||
|
|
|