1
0
tplp-planning-benchmark/fd-pb-e4/ipc-1998_mystery-round-1-strips_27.out

130 lines
5.5 KiB
Plaintext
Raw 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-27.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-27.pddl
Parsing...
Parsing: [0.020s CPU, 0.020s 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.040s CPU, 0.032s wall-clock]
Preparing model... [0.010s CPU, 0.016s wall-clock]
Generated 42 rules.
Computing model... [0.180s CPU, 0.183s wall-clock]
1446 relevant atoms
813 auxiliary atoms
2259 final queue length
4448 total queue pushes
Completing instantiation... [0.400s CPU, 0.403s wall-clock]
Instantiating: [0.640s CPU, 0.641s wall-clock]
Computing fact groups...
Finding invariants...
12 initial candidates
Finding invariants: [0.020s CPU, 0.024s wall-clock]
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
Instantiating groups... [0.020s CPU, 0.010s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
Choosing groups...
0 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.040s CPU, 0.046s wall-clock]
Building STRIPS to SAS dictionary... [0.010s 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.010s CPU, 0.016s wall-clock]
Translating task: [0.290s CPU, 0.294s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
19 propositions removed
Detecting unreachable propositions: [0.150s CPU, 0.150s wall-clock]
Reordering and filtering variables...
19 of 19 variables necessary.
0 of 19 mutex groups necessary.
1161 of 1161 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.050s CPU, 0.048s wall-clock]
Translator variables: 19
Translator derived variables: 0
Translator facts: 152
Translator goal facts: 2
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 1161
Translator axioms: 0
Translator task size: 6734
Translator peak memory: 37720 KB
Writing output... [0.100s CPU, 0.117s wall-clock]
Done! [1.320s CPU, 1.335s wall-clock]
planner.py version 0.0.1
Time: 2.25s
Memory: 164MB
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.01s
Memory: 164MB (+0MB)
UNSAT
Iteration Time: 0.01s
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.14s
Memory: 173MB (+9MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("feast","love","popover","scallion","kentucky","oregon")),1) occurs(action(("feast","triumph","onion","muffin","goias","bosnia")),1) occurs(action(("feast","triumph","muffin","scallion","surrey","guanabara")),2) occurs(action(("overcome","grief","triumph","scallion","uranus","earth")),3) occurs(action(("overcome","loneliness","love","scallion","mars","uranus")),3) occurs(action(("feast","triumph","scallion","guava","arizona","pennsylvania")),3) occurs(action(("overcome","boils","love","scallion","mercury","mars")),4) occurs(action(("feast","love","scallion","guava","manitoba","arizona")),4) occurs(action(("succumb","grief","triumph","guava","uranus","earth")),5) occurs(action(("succumb","boils","love","guava","mercury","mars")),5)
Solving Time: 0.01s
Memory: 177MB (+4MB)
SAT
SATISFIABLE
Models : 1+
Calls : 2
Time : 2.512s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
CPU Time : 2.480s
Choices : 76
Conflicts : 16 (Analyzed: 16)
Restarts : 0
Model-Level : 36.0
Problems : 2 (Average Length: 4.50 Splits: 0)
Lemmas : 55 (Deleted: 0)
Binary : 40 (Ratio: 72.73%)
Ternary : 0 (Ratio: 0.00%)
Conflict : 16 (Average Length: 24.6 Ratio: 29.09%)
Loop : 39 (Average Length: 2.0 Ratio: 70.91%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 16 (Average: 3.38 Max: 28 Sum: 54)
Executed : 15 (Average: 2.94 Max: 28 Sum: 47 Ratio: 87.04%)
Bounded : 1 (Average: 7.00 Max: 7 Sum: 7 Ratio: 12.96%)
Rules : 1107003
Atoms : 1107003
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 6097 (Eliminated: 0 Frozen: 5168)
Constraints : 21545 (Binary: 96.2% Ternary: 1.7% Other: 2.1%)
Memory Peak : 177MB
Max. Length : 5 steps
Sol. Length : 5 steps