1
0
tplp-planning-benchmark/fd-pc-e1-sh/ipc-1998_mystery-round-1-strips_3.out

121 lines
5.3 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-3.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-3.pddl
Parsing...
Parsing: [0.010s CPU, 0.020s 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.030s CPU, 0.030s wall-clock]
Preparing model... [0.010s CPU, 0.015s wall-clock]
Generated 42 rules.
Computing model... [0.260s CPU, 0.253s wall-clock]
2016 relevant atoms
1407 auxiliary atoms
3423 final queue length
6590 total queue pushes
Completing instantiation... [0.600s CPU, 0.594s wall-clock]
Instantiating: [0.910s CPU, 0.901s wall-clock]
Computing fact groups...
Finding invariants...
12 initial candidates
Finding invariants: [0.030s CPU, 0.026s wall-clock]
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
Instantiating groups... [0.010s CPU, 0.014s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
Choosing groups...
1 uncovered facts
Choosing groups: [0.010s CPU, 0.004s wall-clock]
Building translation key... [0.010s CPU, 0.002s wall-clock]
Computing fact groups: [0.060s CPU, 0.057s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.004s 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.024s wall-clock]
Translating task: [0.440s CPU, 0.433s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
28 propositions removed
Detecting unreachable propositions: [0.240s CPU, 0.246s wall-clock]
Reordering and filtering variables...
26 of 26 variables necessary.
0 of 26 mutex groups necessary.
1676 of 1676 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.080s CPU, 0.073s wall-clock]
Translator variables: 26
Translator derived variables: 0
Translator facts: 211
Translator goal facts: 1
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 1676
Translator axioms: 0
Translator task size: 10026
Translator peak memory: 39512 KB
Writing output... [0.160s CPU, 0.176s wall-clock]
Done! [1.920s CPU, 1.934s wall-clock]
planner.py version 0.0.1
Time: 0.38s
Memory: 71MB
Iteration 1
Queue: [5]
Grounded Until: 0
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.15s
Memory: 72MB (+1MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("overcome","laceration","entertainment","pepper","vulcan","venus")),1) occurs(action(("feast","love","orange","mutton","guanabara","bavaria")),1) occurs(action(("feast","satisfaction","mutton","orange","goias","guanabara")),1) occurs(action(("feast","entertainment","pepper","melon","arizona","manitoba")),2) occurs(action(("feast","satisfaction","orange","chocolate","goias","guanabara")),2) occurs(action(("feast","triumph","popover","lemon","bavaria","arizona")),2) occurs(action(("overcome","hangover","satisfaction","chocolate","venus","neptune")),3) occurs(action(("feast","satisfaction","chocolate","ham","goias","guanabara")),4) occurs(action(("succumb","laceration","entertainment","melon","vulcan","venus")),4) occurs(action(("succumb","hangover","satisfaction","ham","venus","neptune")),5) occurs(action(("feast","entertainment","melon","ham","arizona","manitoba")),5)
Solving Time: 0.01s
Memory: 76MB (+4MB)
SAT
SATISFIABLE
Models : 1+
Calls : 1
Time : 0.656s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
CPU Time : 0.610s
Choices : 94
Conflicts : 11 (Analyzed: 11)
Restarts : 0
Model-Level : 49.0
Problems : 1 (Average Length: 7.00 Splits: 0)
Lemmas : 11 (Deleted: 0)
Binary : 2 (Ratio: 18.18%)
Ternary : 0 (Ratio: 0.00%)
Conflict : 11 (Average Length: 8.9 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 11 (Average: 5.36 Max: 19 Sum: 59)
Executed : 10 (Average: 4.73 Max: 19 Sum: 52 Ratio: 88.14%)
Bounded : 1 (Average: 7.00 Max: 7 Sum: 7 Ratio: 11.86%)
Rules : 0
Atoms : 0
Bodies : 0
Tight : Yes
Variables : 10090 (Eliminated: 0 Frozen: 6808)
Constraints : 37705 (Binary: 95.4% Ternary: 2.6% Other: 1.9%)
Memory Peak : 77MB
Max. Length : 5 steps
Sol. Length : 5 steps