153 lines
6.7 KiB
Plaintext
153 lines
6.7 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-30.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-30.pddl
|
|
Parsing...
|
|
Parsing: [0.020s CPU, 0.023s wall-clock]
|
|
Normalizing task... [0.010s CPU, 0.001s wall-clock]
|
|
Instantiating...
|
|
Generating Datalog program... [0.000s CPU, 0.007s wall-clock]
|
|
Normalizing Datalog program...
|
|
Normalizing Datalog program: [0.030s CPU, 0.031s wall-clock]
|
|
Preparing model... [0.020s CPU, 0.020s wall-clock]
|
|
Generated 42 rules.
|
|
Computing model... [0.530s CPU, 0.534s wall-clock]
|
|
4582 relevant atoms
|
|
2124 auxiliary atoms
|
|
6706 final queue length
|
|
14587 total queue pushes
|
|
Completing instantiation... [1.620s CPU, 1.621s wall-clock]
|
|
Instantiating: [2.220s CPU, 2.219s wall-clock]
|
|
Computing fact groups...
|
|
Finding invariants...
|
|
12 initial candidates
|
|
Finding invariants: [0.050s CPU, 0.046s wall-clock]
|
|
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
|
|
Instantiating groups... [0.020s CPU, 0.024s wall-clock]
|
|
Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
|
|
Choosing groups...
|
|
0 uncovered facts
|
|
Choosing groups: [0.010s CPU, 0.007s wall-clock]
|
|
Building translation key... [0.010s CPU, 0.004s wall-clock]
|
|
Computing fact groups: [0.100s CPU, 0.099s wall-clock]
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s 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.070s CPU, 0.064s wall-clock]
|
|
Translating task: [1.230s CPU, 1.235s wall-clock]
|
|
0 effect conditions simplified
|
|
0 implied preconditions added
|
|
Detecting unreachable propositions...
|
|
0 operators removed
|
|
0 axioms removed
|
|
30 propositions removed
|
|
Detecting unreachable propositions: [0.590s CPU, 0.576s wall-clock]
|
|
Reordering and filtering variables...
|
|
30 of 30 variables necessary.
|
|
0 of 30 mutex groups necessary.
|
|
4085 of 4085 operators necessary.
|
|
0 of 0 axiom rules necessary.
|
|
Reordering and filtering variables: [0.180s CPU, 0.188s wall-clock]
|
|
Translator variables: 30
|
|
Translator derived variables: 0
|
|
Translator facts: 319
|
|
Translator goal facts: 3
|
|
Translator mutex groups: 0
|
|
Translator total mutex groups size: 0
|
|
Translator operators: 4085
|
|
Translator axioms: 0
|
|
Translator task size: 23507
|
|
Translator peak memory: 51916 KB
|
|
Writing output... [0.400s CPU, 0.447s wall-clock]
|
|
Done! [4.810s CPU, 4.846s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 0.99s
|
|
Memory: 116MB
|
|
|
|
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: 116MB (+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.26s
|
|
Memory: 116MB (+0MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.03s
|
|
Memory: 120MB (+4MB)
|
|
SAT
|
|
Testing...
|
|
NOT SERIALIZABLE
|
|
Testing Time: 0.86s
|
|
Memory: 119MB (+-1MB)
|
|
Solving...
|
|
Solving Time: 0.01s
|
|
Memory: 119MB (+0MB)
|
|
SAT
|
|
Testing...
|
|
NOT SERIALIZABLE
|
|
Testing Time: 0.80s
|
|
Memory: 159MB (+40MB)
|
|
Solving...
|
|
Solving Time: 0.01s
|
|
Memory: 116MB (+-43MB)
|
|
SAT
|
|
Testing...
|
|
SERIALIZABLE
|
|
Testing Time: 0.76s
|
|
Memory: 159MB (+43MB)
|
|
Answer: 3
|
|
occurs(action(("overcome","abrasion","achievement","guava","mars","vulcan")),1) occurs(action(("overcome","boils","expectation","hamburger","neptune","venus")),1) occurs(action(("feast","achievement","guava","rice","arizona","oregon")),1) occurs(action(("feast","expectation","hamburger","hotdog","bosnia","bavaria")),1) occurs(action(("feast","intoxication","beef","baguette","bosnia","bavaria")),1) occurs(action(("feast","triumph","turkey","cucumber","surrey","pennsylvania")),1) occurs(action(("overcome","dread","intoxication","baguette","neptune","venus")),2) occurs(action(("feast","expectation","hotdog","mutton","moravia","kentucky")),2) occurs(action(("overcome","prostatitis","triumph","cucumber","mars","vulcan")),2) occurs(action(("feast","excitement","yogurt","scallop","oregon","bosnia")),2) occurs(action(("feast","triumph","cucumber","turkey","bosnia","bavaria")),2) occurs(action(("feast","intoxication","baguette","beef","alsace","guanabara")),2) occurs(action(("succumb","boils","expectation","mutton","neptune","venus")),3) occurs(action(("feast","intoxication","beef","hotdog","oregon","bosnia")),3) occurs(action(("feast","intoxication","hotdog","mutton","bavaria","moravia")),4) occurs(action(("feast","expectation","mutton","chicken","quebec","goias")),4) occurs(action(("feast","excitement","scallop","yogurt","arizona","oregon")),4) occurs(action(("feast","achievement","rice","guava","alsace","guanabara")),4) occurs(action(("succumb","dread","intoxication","mutton","neptune","venus")),5)
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 4
|
|
Time : 1.653s (Solving: 0.01s 1st Model: 0.01s Unsat: 0.00s)
|
|
CPU Time : 1.588s
|
|
|
|
Choices : 422 (Domain: 371)
|
|
Conflicts : 80 (Analyzed: 80)
|
|
Restarts : 0
|
|
Model-Level : 77.3
|
|
Problems : 4 (Average Length: 5.75 Splits: 0)
|
|
Lemmas : 80 (Deleted: 0)
|
|
Binary : 4 (Ratio: 5.00%)
|
|
Ternary : 2 (Ratio: 2.50%)
|
|
Conflict : 80 (Average Length: 17.9 Ratio: 100.00%)
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 80 (Average: 2.81 Max: 20 Sum: 225)
|
|
Executed : 78 (Average: 2.64 Max: 20 Sum: 211 Ratio: 93.78%)
|
|
Bounded : 2 (Average: 7.00 Max: 7 Sum: 14 Ratio: 6.22%)
|
|
|
|
Rules : 89598 (Original: 89570)
|
|
Atoms : 80543
|
|
Bodies : 5898 (Original: 5869)
|
|
Count : 58 (Original: 60)
|
|
Equivalences : 3376 (Atom=Atom: 10 Body=Body: 0 Other: 3366)
|
|
Tight : Yes
|
|
Variables : 19476 (Eliminated: 0 Frozen: 4515)
|
|
Constraints : 53118 (Binary: 97.0% Ternary: 1.2% Other: 1.7%)
|
|
|
|
Memory Peak : 159MB
|
|
Max. Length : 5 steps
|
|
Sol. Length : 5 steps
|
|
Models : 3
|
|
|
|
|