1
0
tplp-planning-benchmark/fd-pb-e0-sh/ipc-1998_mystery-round-1-strips_26.out

130 lines
5.8 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.026s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.007s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.040s CPU, 0.036s wall-clock]
Preparing model... [0.010s CPU, 0.019s wall-clock]
Generated 42 rules.
Computing model... [0.260s CPU, 0.256s wall-clock]
1849 relevant atoms
1334 auxiliary atoms
3183 final queue length
6104 total queue pushes
Completing instantiation... [0.540s CPU, 0.542s wall-clock]
Instantiating: [0.870s CPU, 0.863s wall-clock]
Computing fact groups...
Finding invariants...
12 initial candidates
Finding invariants: [0.020s CPU, 0.030s wall-clock]
Checking invariant weight... [0.010s CPU, 0.001s wall-clock]
Instantiating groups... [0.010s CPU, 0.013s 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.050s CPU, 0.057s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
Building dictionary for full mutex groups... [0.010s 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.022s wall-clock]
Translating task: [0.390s CPU, 0.396s 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.220s CPU, 0.221s 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.067s 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: 38744 KB
Writing output... [0.140s CPU, 0.159s wall-clock]
Done! [1.790s CPU, 1.813s wall-clock]
planner.py version 0.0.1
Time: 0.36s
Memory: 69MB
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: 69MB (+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
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.10s
Memory: 69MB (+0MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("overcome","boils","entertainment","haroset","earth","neptune")),1) occurs(action(("feast","entertainment","haroset","endive","oregon","bavaria")),1) occurs(action(("feast","understanding","papaya","turkey","moravia","kentucky")),1) occurs(action(("overcome","depression","learning","marzipan","earth","neptune")),1) occurs(action(("feast","entertainment","endive","pistachio","moravia","kentucky")),2) occurs(action(("feast","satisfaction","snickers","pepper","moravia","kentucky")),2) occurs(action(("feast","understanding","turkey","pistachio","manitoba","oregon")),2) occurs(action(("overcome","hangover","understanding","pistachio","earth","neptune")),3) occurs(action(("feast","entertainment","pistachio","turkey","moravia","kentucky")),3) occurs(action(("feast","understanding","pistachio","turkey","moravia","kentucky")),3) occurs(action(("feast","entertainment","turkey","papaya","quebec","manitoba")),4) occurs(action(("succumb","boils","entertainment","papaya","earth","neptune")),5) occurs(action(("feast","understanding","turkey","marzipan","kentucky","quebec")),5)
Solving Time: 0.01s
Memory: 70MB (+1MB)
SAT
SATISFIABLE
Models : 1+
Calls : 2
Time : 0.548s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
CPU Time : 0.510s
Choices : 92
Conflicts : 4 (Analyzed: 4)
Restarts : 0
Model-Level : 60.0
Problems : 2 (Average Length: 4.50 Splits: 0)
Lemmas : 4 (Deleted: 0)
Binary : 2 (Ratio: 50.00%)
Ternary : 0 (Ratio: 0.00%)
Conflict : 4 (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 : 4 (Average: 9.75 Max: 12 Sum: 39)
Executed : 4 (Average: 9.75 Max: 12 Sum: 39 Ratio: 100.00%)
Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%)
Rules : 27683
Atoms : 27683
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 7788 (Eliminated: 0 Frozen: 478)
Constraints : 21375 (Binary: 95.9% Ternary: 2.0% Other: 2.1%)
Memory Peak : 71MB
Max. Length : 5 steps
Sol. Length : 5 steps