130 lines
6.2 KiB
Plaintext
130 lines
6.2 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-2.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-2.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.030s CPU, 0.024s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.010s CPU, 0.007s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.050s CPU, 0.045s wall-clock]
|
||
|
|
Preparing model... [0.020s CPU, 0.025s wall-clock]
|
||
|
|
Generated 42 rules.
|
||
|
|
Computing model... [0.500s CPU, 0.500s wall-clock]
|
||
|
|
4036 relevant atoms
|
||
|
|
1687 auxiliary atoms
|
||
|
|
5723 final queue length
|
||
|
|
12658 total queue pushes
|
||
|
|
Completing instantiation... [1.450s CPU, 1.447s wall-clock]
|
||
|
|
Instantiating: [2.030s CPU, 2.030s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
12 initial candidates
|
||
|
|
Finding invariants: [0.050s CPU, 0.043s wall-clock]
|
||
|
|
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Instantiating groups... [0.030s CPU, 0.030s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
0 uncovered facts
|
||
|
|
Choosing groups: [0.000s CPU, 0.009s wall-clock]
|
||
|
|
Building translation key... [0.010s CPU, 0.004s wall-clock]
|
||
|
|
Computing fact groups: [0.110s CPU, 0.101s 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.000s CPU, 0.002s wall-clock]
|
||
|
|
Translating task...
|
||
|
|
Processing axioms...
|
||
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Processing axioms: [0.060s CPU, 0.060s wall-clock]
|
||
|
|
Translating task: [1.060s CPU, 1.062s wall-clock]
|
||
|
|
0 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
35 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.580s CPU, 0.580s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
35 of 35 variables necessary.
|
||
|
|
0 of 35 mutex groups necessary.
|
||
|
|
3596 of 3596 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.180s CPU, 0.173s wall-clock]
|
||
|
|
Translator variables: 35
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 292
|
||
|
|
Translator goal facts: 2
|
||
|
|
Translator mutex groups: 0
|
||
|
|
Translator total mutex groups size: 0
|
||
|
|
Translator operators: 3596
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 21669
|
||
|
|
Translator peak memory: 50124 KB
|
||
|
|
Writing output... [0.370s CPU, 0.400s wall-clock]
|
||
|
|
Done! [4.400s CPU, 4.425s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.90s
|
||
|
|
Memory: 110MB
|
||
|
|
|
||
|
|
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: 111MB (+1MB)
|
||
|
|
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.24s
|
||
|
|
Memory: 111MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Answer: 1
|
||
|
|
occurs(action(("overcome","grief-7","entertainment","ham","pluto","jupiter")),1) occurs(action(("overcome","loneliness","satiety","onion","mercury","vulcan")),1) occurs(action(("overcome","jealousy","stimulation","flounder","vulcan","pluto")),1) occurs(action(("feast","curiosity","cherry","onion","bosnia","surrey")),1) occurs(action(("feast","entertainment","ham","tuna","bosnia","surrey")),1) occurs(action(("feast","satiety","onion","muffin","kentucky","bosnia")),1) occurs(action(("feast","stimulation","flounder","tuna","arizona","kentucky")),1) occurs(action(("feast","entertainment","tuna","beef","arizona","kentucky")),2) occurs(action(("feast","curiosity","onion","muffin","arizona","kentucky")),2) occurs(action(("feast","satiety","muffin","tuna","arizona","kentucky")),2) occurs(action(("feast","stimulation","tuna","muffin","arizona","kentucky")),2) occurs(action(("succumb","grief-7","entertainment","beef","pluto","jupiter")),3) occurs(action(("overcome","depression-1","stimulation","muffin","mercury","vulcan")),3) occurs(action(("feast","satiety","tuna","flounder","alsace","arizona")),3) occurs(action(("feast","stimulation","muffin","onion","alsace","arizona")),3) occurs(action(("succumb","jealousy","stimulation","onion","mercury","vulcan")),4) occurs(action(("feast","stimulation","onion","beef","alsace","arizona")),4) occurs(action(("feast","satiety","flounder","tuna","alsace","arizona")),4) occurs(action(("succumb","depression-1","stimulation","beef","vulcan","pluto")),5)
|
||
|
|
Solving Time: 0.02s
|
||
|
|
Memory: 114MB (+3MB)
|
||
|
|
SAT
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 2
|
||
|
|
Time : 1.347s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
|
||
|
|
CPU Time : 1.308s
|
||
|
|
|
||
|
|
Choices : 154 (Domain: 131)
|
||
|
|
Conflicts : 35 (Analyzed: 35)
|
||
|
|
Restarts : 0
|
||
|
|
Model-Level : 66.0
|
||
|
|
Problems : 2 (Average Length: 4.50 Splits: 0)
|
||
|
|
Lemmas : 35 (Deleted: 0)
|
||
|
|
Binary : 5 (Ratio: 14.29%)
|
||
|
|
Ternary : 2 (Ratio: 5.71%)
|
||
|
|
Conflict : 35 (Average Length: 8.8 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 35 (Average: 2.91 Max: 24 Sum: 102)
|
||
|
|
Executed : 34 (Average: 2.71 Max: 24 Sum: 95 Ratio: 93.14%)
|
||
|
|
Bounded : 1 (Average: 7.00 Max: 7 Sum: 7 Ratio: 6.86%)
|
||
|
|
|
||
|
|
Rules : 65595
|
||
|
|
Atoms : 65595
|
||
|
|
Bodies : 1 (Original: 0)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 17184 (Eliminated: 0 Frozen: 1006)
|
||
|
|
Constraints : 79327 (Binary: 97.6% Ternary: 1.1% Other: 1.3%)
|
||
|
|
|
||
|
|
Memory Peak : 114MB
|
||
|
|
Max. Length : 5 steps
|
||
|
|
Sol. Length : 5 steps
|
||
|
|
|
||
|
|
|