130 lines
6.1 KiB
Plaintext
130 lines
6.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-29.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-29.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.030s CPU, 0.031s wall-clock]
|
||
|
|
Preparing model... [0.020s CPU, 0.016s wall-clock]
|
||
|
|
Generated 42 rules.
|
||
|
|
Computing model... [0.190s CPU, 0.194s wall-clock]
|
||
|
|
1534 relevant atoms
|
||
|
|
892 auxiliary atoms
|
||
|
|
2426 final queue length
|
||
|
|
4719 total queue pushes
|
||
|
|
Completing instantiation... [0.430s CPU, 0.432s wall-clock]
|
||
|
|
Instantiating: [0.670s CPU, 0.681s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
12 initial candidates
|
||
|
|
Finding invariants: [0.030s CPU, 0.024s 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.000s CPU, 0.003s wall-clock]
|
||
|
|
Building translation key... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Computing fact groups: [0.050s CPU, 0.052s 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.010s CPU, 0.001s wall-clock]
|
||
|
|
Translating task...
|
||
|
|
Processing axioms...
|
||
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Processing axioms: [0.010s CPU, 0.019s wall-clock]
|
||
|
|
Translating task: [0.320s CPU, 0.320s wall-clock]
|
||
|
|
0 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
24 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.160s CPU, 0.159s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
22 of 22 variables necessary.
|
||
|
|
0 of 22 mutex groups necessary.
|
||
|
|
1224 of 1224 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.050s CPU, 0.052s wall-clock]
|
||
|
|
Translator variables: 22
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 177
|
||
|
|
Translator goal facts: 2
|
||
|
|
Translator mutex groups: 0
|
||
|
|
Translator total mutex groups size: 0
|
||
|
|
Translator operators: 1224
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 7377
|
||
|
|
Translator peak memory: 37976 KB
|
||
|
|
Writing output... [0.110s CPU, 0.129s wall-clock]
|
||
|
|
Done! [1.410s CPU, 1.434s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 2.67s
|
||
|
|
Memory: 196MB
|
||
|
|
|
||
|
|
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: 196MB (+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: 3.24s
|
||
|
|
Memory: 529MB (+333MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Answer: 1
|
||
|
|
occurs(action(("overcome","anger","achievement","scallop","neptune","uranus")),1) occurs(action(("overcome","jealousy","excitement","pork","neptune","uranus")),1) occurs(action(("feast","achievement","scallop","melon","bavaria","oregon")),1) occurs(action(("feast","excitement","pork","broccoli","manitoba","bavaria")),1) occurs(action(("overcome","grief","achievement","shrimp","pluto","neptune")),2) occurs(action(("feast","achievement","melon","shrimp","kentucky","moravia")),2) occurs(action(("overcome","prostatitis","excitement","shrimp","pluto","neptune")),2) occurs(action(("feast","excitement","broccoli","shrimp","pennsylvania","alsace")),2) occurs(action(("succumb","anger","achievement","broccoli","pluto","neptune")),3) occurs(action(("succumb","prostatitis","excitement","shrimp","pluto","neptune")),3) occurs(action(("feast","achievement","shrimp","broccoli","oregon","kentucky")),3) occurs(action(("succumb","jealousy","excitement","shrimp","neptune","uranus")),4) occurs(action(("overcome","anger","achievement","broccoli","pluto","neptune")),4) occurs(action(("feast","excitement","shrimp","popover","bavaria","oregon")),4) occurs(action(("overcome","boils","achievement","broccoli","earth","pluto")),5) occurs(action(("overcome","abrasion","excitement","papaya","neptune","uranus")),5) occurs(action(("feast","excitement","popover","papaya","manitoba","bavaria")),5)
|
||
|
|
Solving Time: 0.58s
|
||
|
|
Memory: 556MB (+27MB)
|
||
|
|
SAT
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 2
|
||
|
|
Time : 7.532s (Solving: 0.42s 1st Model: 0.42s Unsat: 0.00s)
|
||
|
|
CPU Time : 7.490s
|
||
|
|
|
||
|
|
Choices : 8722
|
||
|
|
Conflicts : 1413 (Analyzed: 1413)
|
||
|
|
Restarts : 14 (Average: 100.93 Last: 54)
|
||
|
|
Model-Level : 27.0
|
||
|
|
Problems : 2 (Average Length: 4.50 Splits: 0)
|
||
|
|
Lemmas : 1658 (Deleted: 0)
|
||
|
|
Binary : 516 (Ratio: 31.12%)
|
||
|
|
Ternary : 89 (Ratio: 5.37%)
|
||
|
|
Conflict : 1413 (Average Length: 22.0 Ratio: 85.22%)
|
||
|
|
Loop : 245 (Average Length: 39.7 Ratio: 14.78%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 1413 (Average: 6.52 Max: 111 Sum: 9215)
|
||
|
|
Executed : 1332 (Average: 6.12 Max: 111 Sum: 8654 Ratio: 93.91%)
|
||
|
|
Bounded : 81 (Average: 6.93 Max: 7 Sum: 561 Ratio: 6.09%)
|
||
|
|
|
||
|
|
Rules : 1228348
|
||
|
|
Atoms : 1228348
|
||
|
|
Bodies : 1 (Original: 0)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 39859 (Eliminated: 0 Frozen: 37570)
|
||
|
|
Constraints : 113484 (Binary: 87.1% Ternary: 7.0% Other: 5.9%)
|
||
|
|
|
||
|
|
Memory Peak : 561MB
|
||
|
|
Max. Length : 5 steps
|
||
|
|
Sol. Length : 5 steps
|
||
|
|
|
||
|
|
|