144 lines
6.3 KiB
Plaintext
144 lines
6.3 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.020s CPU, 0.023s 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.010s CPU, 0.017s wall-clock]
|
||
|
|
Generated 42 rules.
|
||
|
|
Computing model... [0.200s CPU, 0.201s wall-clock]
|
||
|
|
1446 relevant atoms
|
||
|
|
813 auxiliary atoms
|
||
|
|
2259 final queue length
|
||
|
|
4448 total queue pushes
|
||
|
|
Completing instantiation... [0.570s CPU, 0.570s wall-clock]
|
||
|
|
Instantiating: [0.830s CPU, 0.830s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
12 initial candidates
|
||
|
|
Finding invariants: [0.040s CPU, 0.036s wall-clock]
|
||
|
|
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Instantiating groups... [0.010s CPU, 0.016s wall-clock]
|
||
|
|
Collecting mutex groups... [0.010s CPU, 0.001s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
0 uncovered facts
|
||
|
|
Choosing groups: [0.000s CPU, 0.004s wall-clock]
|
||
|
|
Building translation key... [0.000s CPU, 0.003s wall-clock]
|
||
|
|
Computing fact groups: [0.070s CPU, 0.070s 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.030s CPU, 0.022s wall-clock]
|
||
|
|
Translating task: [0.430s CPU, 0.424s 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.200s CPU, 0.208s 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.080s CPU, 0.071s 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: 40908 KB
|
||
|
|
Writing output... [0.150s CPU, 0.166s wall-clock]
|
||
|
|
Done! [1.800s CPU, 1.816s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.27s
|
||
|
|
Memory: 68MB
|
||
|
|
|
||
|
|
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: 68MB (+0MB)
|
||
|
|
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.08s
|
||
|
|
Memory: 68MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.01s
|
||
|
|
Memory: 69MB (+1MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
NOT SERIALIZABLE
|
||
|
|
Testing Time: 2.28s
|
||
|
|
Memory: 209MB (+140MB)
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.07s
|
||
|
|
Memory: 209MB (+0MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
SERIALIZABLE?
|
||
|
|
Testing Time: 0.00s
|
||
|
|
Memory: 209MB (+0MB)
|
||
|
|
Answer: 2
|
||
|
|
occurs(action(("overcome","loneliness","satisfaction","scallion","mars","uranus")),1) occurs(action(("feast","satisfaction","scallion","guava","arizona","pennsylvania")),1) occurs(action(("feast","love","popover","scallion","kentucky","oregon")),1) occurs(action(("overcome","boils","love","scallion","mars","uranus")),2) occurs(action(("feast","love","scallion","guava","manitoba","arizona")),2) occurs(action(("feast","satisfaction","guava","wurst","kentucky","oregon")),2) occurs(action(("feast","triumph","onion","pork","goias","bosnia")),2) occurs(action(("succumb","boils","love","guava","mars","uranus")),3) occurs(action(("overcome","abrasion","satisfaction","wurst","mercury","mars")),3) occurs(action(("feast","satisfaction","wurst","guava","oregon","bavaria")),3) occurs(action(("feast","love","guava","scallion","quebec","kentucky")),3) occurs(action(("overcome","grief","love","scallion","mars","uranus")),4) occurs(action(("feast","love","scallion","guava","guanabara","manitoba")),4) occurs(action(("feast","satisfaction","guava","scallion","alsace","quebec")),4) occurs(action(("succumb","grief","love","guava","mars","uranus")),5) occurs(action(("feast","satisfaction","scallion","guava","surrey","guanabara")),5)
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 3
|
||
|
|
Time : 2.537s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
|
||
|
|
CPU Time : 2.524s
|
||
|
|
|
||
|
|
Choices : 189 (Domain: 150)
|
||
|
|
Conflicts : 11 (Analyzed: 11)
|
||
|
|
Restarts : 0
|
||
|
|
Model-Level : 68.0
|
||
|
|
Problems : 3 (Average Length: 5.33 Splits: 0)
|
||
|
|
Lemmas : 11 (Deleted: 0)
|
||
|
|
Binary : 4 (Ratio: 36.36%)
|
||
|
|
Ternary : 0 (Ratio: 0.00%)
|
||
|
|
Conflict : 11 (Average Length: 21.0 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 11 (Average: 6.09 Max: 21 Sum: 67)
|
||
|
|
Executed : 11 (Average: 6.09 Max: 21 Sum: 67 Ratio: 100.00%)
|
||
|
|
Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%)
|
||
|
|
|
||
|
|
Rules : 1129108
|
||
|
|
Atoms : 1124426
|
||
|
|
Bodies : 12610 (Original: 12609)
|
||
|
|
Equivalences : 44464 (Atom=Atom: 9509 Body=Body: 6032 Other: 28923)
|
||
|
|
Tight : No (SCCs: 411 Non-Hcfs: 0 Nodes: 10541 Gammas: 0)
|
||
|
|
Variables : 10544 (Eliminated: 0 Frozen: 7127)
|
||
|
|
Constraints : 21545 (Binary: 96.2% Ternary: 1.7% Other: 2.1%)
|
||
|
|
|
||
|
|
Memory Peak : 209MB
|
||
|
|
Max. Length : 5 steps
|
||
|
|
Sol. Length : 5 steps
|
||
|
|
Models : 2
|
||
|
|
|
||
|
|
|