158 lines
7.0 KiB
Plaintext
158 lines
7.0 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-26.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-26.pddl
|
|
Parsing...
|
|
Parsing: [0.020s CPU, 0.024s wall-clock]
|
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
|
Instantiating...
|
|
Generating Datalog program... [0.010s CPU, 0.006s wall-clock]
|
|
Normalizing Datalog program...
|
|
Normalizing Datalog program: [0.030s CPU, 0.033s wall-clock]
|
|
Preparing model... [0.020s CPU, 0.017s wall-clock]
|
|
Generated 42 rules.
|
|
Computing model... [0.260s CPU, 0.262s wall-clock]
|
|
1849 relevant atoms
|
|
1334 auxiliary atoms
|
|
3183 final queue length
|
|
6104 total queue pushes
|
|
Completing instantiation... [0.600s CPU, 0.603s wall-clock]
|
|
Instantiating: [0.930s CPU, 0.926s wall-clock]
|
|
Computing fact groups...
|
|
Finding invariants...
|
|
12 initial candidates
|
|
Finding invariants: [0.030s CPU, 0.031s wall-clock]
|
|
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
|
|
Instantiating groups... [0.010s CPU, 0.014s wall-clock]
|
|
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
|
|
Choosing groups...
|
|
3 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.060s CPU, 0.061s wall-clock]
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
|
|
Building dictionary for full mutex groups... [0.000s CPU, 0.002s 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.450s CPU, 0.446s wall-clock]
|
|
0 effect conditions simplified
|
|
0 implied preconditions added
|
|
Detecting unreachable propositions...
|
|
0 operators removed
|
|
0 axioms removed
|
|
29 propositions removed
|
|
Detecting unreachable propositions: [0.250s CPU, 0.248s wall-clock]
|
|
Reordering and filtering variables...
|
|
23 of 23 variables necessary.
|
|
0 of 23 mutex groups necessary.
|
|
1536 of 1536 operators necessary.
|
|
0 of 0 axiom rules necessary.
|
|
Reordering and filtering variables: [0.070s CPU, 0.072s wall-clock]
|
|
Translator variables: 23
|
|
Translator derived variables: 0
|
|
Translator facts: 174
|
|
Translator goal facts: 1
|
|
Translator mutex groups: 0
|
|
Translator total mutex groups size: 0
|
|
Translator operators: 1536
|
|
Translator axioms: 0
|
|
Translator task size: 9030
|
|
Translator peak memory: 41932 KB
|
|
Writing output... [0.160s CPU, 0.173s wall-clock]
|
|
Done! [1.960s CPU, 1.976s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 0.37s
|
|
Memory: 74MB
|
|
|
|
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: 75MB (+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.10s
|
|
Memory: 75MB (+0MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.01s
|
|
Memory: 76MB (+1MB)
|
|
SAT
|
|
Testing...
|
|
NOT SERIALIZABLE
|
|
Testing Time: 0.37s
|
|
Memory: 90MB (+14MB)
|
|
Solving...
|
|
Solving Time: 0.01s
|
|
Memory: 90MB (+0MB)
|
|
UNSAT
|
|
Iteration Time: 0.53s
|
|
|
|
Iteration 3
|
|
Queue: [(2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
|
Grounded Until: 5
|
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
|
Grounding Time: 0.19s
|
|
Memory: 90MB (+0MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.01s
|
|
Memory: 91MB (+1MB)
|
|
SAT
|
|
Testing...
|
|
SERIALIZABLE?
|
|
Testing Time: 0.00s
|
|
Memory: 91MB (+0MB)
|
|
Answer: 2
|
|
occurs(action(("feast","empathy","scallop","rice","manitoba","oregon")),1) occurs(action(("feast","entertainment","haroset","marzipan","oregon","bavaria")),1) occurs(action(("feast","satisfaction","snickers","hamburger","moravia","kentucky")),1) occurs(action(("feast","understanding","papaya","turkey","moravia","kentucky")),1) occurs(action(("overcome","depression","entertainment","marzipan","earth","neptune")),2) occurs(action(("feast","empathy","rice","haroset","manitoba","oregon")),2) occurs(action(("feast","satisfaction","hamburger","haroset","oregon","bavaria")),2) occurs(action(("feast","understanding","turkey","pistachio","manitoba","oregon")),2) occurs(action(("overcome","boils","empathy","haroset","neptune","venus")),3) occurs(action(("overcome","hangover","understanding","pistachio","earth","neptune")),3) occurs(action(("feast","satisfaction","haroset","rice","manitoba","oregon")),3) occurs(action(("feast","empathy","haroset","endive","quebec","manitoba")),4) occurs(action(("feast","empathy","endive","pistachio","moravia","kentucky")),5) occurs(action(("feast","empathy","pistachio","turkey","moravia","kentucky")),6) occurs(action(("feast","satisfaction","rice","haroset","quebec","manitoba")),6) occurs(action(("feast","empathy","turkey","papaya","quebec","manitoba")),7) occurs(action(("succumb","boils","empathy","papaya","neptune","venus")),8) occurs(action(("feast","satisfaction","haroset","rice","kentucky","quebec")),9) occurs(action(("feast","satisfaction","rice","pistachio","kentucky","quebec")),10)
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 4
|
|
Time : 0.873s (Solving: 0.01s 1st Model: 0.01s Unsat: 0.00s)
|
|
CPU Time : 0.852s
|
|
|
|
Choices : 330 (Domain: 274)
|
|
Conflicts : 36 (Analyzed: 35)
|
|
Restarts : 0
|
|
Model-Level : 70.0
|
|
Problems : 4 (Average Length: 7.00 Splits: 0)
|
|
Lemmas : 35 (Deleted: 0)
|
|
Binary : 5 (Ratio: 14.29%)
|
|
Ternary : 3 (Ratio: 8.57%)
|
|
Conflict : 35 (Average Length: 56.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: 6.34 Max: 53 Sum: 222)
|
|
Executed : 33 (Average: 5.97 Max: 53 Sum: 209 Ratio: 94.14%)
|
|
Bounded : 2 (Average: 6.50 Max: 12 Sum: 13 Ratio: 5.86%)
|
|
|
|
Rules : 37338 (Original: 37171)
|
|
Atoms : 30992
|
|
Bodies : 4245 (Original: 4096)
|
|
Count : 64 (Original: 85)
|
|
Equivalences : 2419 (Atom=Atom: 14 Body=Body: 0 Other: 2405)
|
|
Tight : Yes
|
|
Variables : 17801 (Eliminated: 0 Frozen: 11124)
|
|
Constraints : 118403 (Binary: 97.3% Ternary: 1.3% Other: 1.5%)
|
|
|
|
Memory Peak : 91MB
|
|
Max. Length : 10 steps
|
|
Sol. Length : 10 steps
|
|
Models : 2
|
|
|
|
|