130 lines
5.8 KiB
Plaintext
130 lines
5.8 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-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.010s CPU, 0.018s 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.020s CPU, 0.027s wall-clock]
|
|
Preparing model... [0.010s CPU, 0.014s wall-clock]
|
|
Generated 42 rules.
|
|
Computing model... [0.170s CPU, 0.169s wall-clock]
|
|
1446 relevant atoms
|
|
813 auxiliary atoms
|
|
2259 final queue length
|
|
4448 total queue pushes
|
|
Completing instantiation... [0.400s CPU, 0.404s wall-clock]
|
|
Instantiating: [0.620s CPU, 0.621s wall-clock]
|
|
Computing fact groups...
|
|
Finding invariants...
|
|
12 initial candidates
|
|
Finding invariants: [0.020s CPU, 0.025s wall-clock]
|
|
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
|
|
Instantiating groups... [0.010s CPU, 0.011s 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.010s CPU, 0.002s wall-clock]
|
|
Computing fact groups: [0.050s CPU, 0.048s 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.001s wall-clock]
|
|
Translating task...
|
|
Processing axioms...
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
|
Processing axioms: [0.020s 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.149s 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.110s CPU, 0.118s wall-clock]
|
|
Done! [1.290s CPU, 1.316s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 2.22s
|
|
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.36s
|
|
Memory: 207MB (+43MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Answer: 1
|
|
occurs(action(("feast","satisfaction","scallion","guava","arizona","pennsylvania")),1) occurs(action(("feast","love","popover","scallion","kentucky","oregon")),1) occurs(action(("feast","triumph","onion","popover","goias","bosnia")),1) occurs(action(("feast","satisfaction","guava","wurst","kentucky","oregon")),2) occurs(action(("feast","triumph","popover","scallion","quebec","kentucky")),2) occurs(action(("overcome","loneliness","love","scallion","mars","uranus")),3) occurs(action(("overcome","boils","triumph","scallion","uranus","earth")),3) occurs(action(("feast","triumph","scallion","guava","manitoba","arizona")),3) occurs(action(("overcome","grief","love","scallion","mercury","mars")),4) occurs(action(("feast","love","scallion","guava","guanabara","manitoba")),4) occurs(action(("succumb","grief","love","guava","mercury","mars")),5) occurs(action(("succumb","boils","triumph","guava","uranus","earth")),5) occurs(action(("overcome","anxiety","satisfaction","wurst","mars","uranus")),5) occurs(action(("feast","satisfaction","wurst","guava","oregon","bavaria")),5)
|
|
Solving Time: 0.02s
|
|
Memory: 210MB (+3MB)
|
|
SAT
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 2
|
|
Time : 2.735s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
|
|
CPU Time : 2.710s
|
|
|
|
Choices : 127
|
|
Conflicts : 29 (Analyzed: 29)
|
|
Restarts : 0
|
|
Model-Level : 40.0
|
|
Problems : 2 (Average Length: 4.50 Splits: 0)
|
|
Lemmas : 29 (Deleted: 0)
|
|
Binary : 5 (Ratio: 17.24%)
|
|
Ternary : 0 (Ratio: 0.00%)
|
|
Conflict : 29 (Average Length: 17.3 Ratio: 100.00%)
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 29 (Average: 3.48 Max: 27 Sum: 101)
|
|
Executed : 28 (Average: 3.24 Max: 27 Sum: 94 Ratio: 93.07%)
|
|
Bounded : 1 (Average: 7.00 Max: 7 Sum: 7 Ratio: 6.93%)
|
|
|
|
Rules : 1107003
|
|
Atoms : 1107003
|
|
Bodies : 1 (Original: 0)
|
|
Tight : Yes
|
|
Variables : 14400 (Eliminated: 0 Frozen: 13457)
|
|
Constraints : 21545 (Binary: 96.2% Ternary: 1.7% Other: 2.1%)
|
|
|
|
Memory Peak : 210MB
|
|
Max. Length : 5 steps
|
|
Sol. Length : 5 steps
|
|
|
|
|