tplp-planning-benchmark/fd-pa-e1-sh/ipc-1998_mystery-round-1-strips_9.out

130 lines
5.5 KiB
Plaintext
Raw Permalink Normal View History

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-9.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-9.pddl
Parsing...
Parsing: [0.010s CPU, 0.015s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.004s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.024s wall-clock]
Preparing model... [0.010s CPU, 0.012s wall-clock]
Generated 42 rules.
Computing model... [0.280s CPU, 0.274s wall-clock]
2607 relevant atoms
1254 auxiliary atoms
3861 final queue length
8243 total queue pushes
Completing instantiation... [0.840s CPU, 0.841s wall-clock]
Instantiating: [1.160s CPU, 1.158s 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.020s CPU, 0.017s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
Choosing groups...
1 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.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.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.030s CPU, 0.033s wall-clock]
Translating task: [0.600s CPU, 0.599s 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.290s CPU, 0.297s wall-clock]
Reordering and filtering variables...
27 of 27 variables necessary.
0 of 27 mutex groups necessary.
2280 of 2280 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.100s CPU, 0.099s wall-clock]
Translator variables: 27
Translator derived variables: 0
Translator facts: 205
Translator goal facts: 2
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 2280
Translator axioms: 0
Translator task size: 13818
Translator peak memory: 42328 KB
Writing output... [0.210s CPU, 0.235s wall-clock]
Done! [2.470s CPU, 2.500s wall-clock]
planner.py version 0.0.1
Time: 0.52s
Memory: 82MB
Iteration 1
Queue: [0, 5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75]
Grounded Until: 0
Solving...
Solving Time: 0.00s
Memory: 82MB (+0MB)
UNSAT
Iteration Time: 0.00s
Iteration 2
Queue: [5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80]
Grounded Until: 0
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.34s
Memory: 82MB (+0MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("overcome","jealousy","excitement","guava","earth","uranus")),1) occurs(action(("overcome","sciatica","entertainment","flounder","saturn","venus")),2) occurs(action(("feast","intoxication","haroset","hamburger","bavaria","arizona")),2) occurs(action(("feast","excitement","guava","apple","manitoba","kentucky")),2) occurs(action(("overcome","dread","entertainment","flounder","uranus","saturn")),3) occurs(action(("feast","excitement","apple","hotdog","bavaria","arizona")),3) occurs(action(("feast","entertainment","flounder","hamburger","bavaria","arizona")),4) occurs(action(("feast","excitement","hotdog","wurst","bosnia","bavaria")),4) occurs(action(("succumb","sciatica","entertainment","hamburger","uranus","saturn")),5) occurs(action(("succumb","jealousy","excitement","wurst","earth","uranus")),5)
Solving Time: 0.03s
Memory: 85MB (+3MB)
SAT
SATISFIABLE
Models : 1+
Calls : 2
Time : 1.078s (Solving: 0.01s 1st Model: 0.01s Unsat: 0.00s)
CPU Time : 1.040s
Choices : 185
Conflicts : 59 (Analyzed: 59)
Restarts : 0
Model-Level : 31.0
Problems : 2 (Average Length: 4.50 Splits: 0)
Lemmas : 59 (Deleted: 0)
Binary : 5 (Ratio: 8.47%)
Ternary : 0 (Ratio: 0.00%)
Conflict : 59 (Average Length: 29.7 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 59 (Average: 4.15 Max: 26 Sum: 245)
Executed : 47 (Average: 2.73 Max: 26 Sum: 161 Ratio: 65.71%)
Bounded : 12 (Average: 7.00 Max: 7 Sum: 84 Ratio: 34.29%)
Rules : 46360
Atoms : 46360
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 11342 (Eliminated: 0 Frozen: 9924)
Constraints : 52435 (Binary: 97.1% Ternary: 1.2% Other: 1.7%)
Memory Peak : 85MB
Max. Length : 5 steps
Sol. Length : 5 steps