203 lines
8.5 KiB
Plaintext
203 lines
8.5 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-13.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-13.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.030s CPU, 0.032s wall-clock]
|
||
|
|
Normalizing task... [0.010s CPU, 0.002s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.000s CPU, 0.011s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.040s CPU, 0.031s wall-clock]
|
||
|
|
Preparing model... [0.030s CPU, 0.032s wall-clock]
|
||
|
|
Generated 42 rules.
|
||
|
|
Computing model... [2.200s CPU, 2.207s wall-clock]
|
||
|
|
19584 relevant atoms
|
||
|
|
7514 auxiliary atoms
|
||
|
|
27098 final queue length
|
||
|
|
61437 total queue pushes
|
||
|
|
Completing instantiation... [7.740s CPU, 7.731s wall-clock]
|
||
|
|
Instantiating: [10.040s CPU, 10.038s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
12 initial candidates
|
||
|
|
Finding invariants: [0.130s CPU, 0.131s wall-clock]
|
||
|
|
Checking invariant weight... [0.000s CPU, 0.005s wall-clock]
|
||
|
|
Instantiating groups... [0.150s CPU, 0.145s wall-clock]
|
||
|
|
Collecting mutex groups... [0.010s CPU, 0.009s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
6 uncovered facts
|
||
|
|
Choosing groups: [0.020s CPU, 0.027s wall-clock]
|
||
|
|
Building translation key... [0.020s CPU, 0.017s wall-clock]
|
||
|
|
Computing fact groups: [0.410s CPU, 0.409s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.010s CPU, 0.012s wall-clock]
|
||
|
|
Building dictionary for full mutex groups... [0.010s CPU, 0.007s wall-clock]
|
||
|
|
Building mutex information...
|
||
|
|
Building mutex information: [0.000s CPU, 0.009s wall-clock]
|
||
|
|
Translating task...
|
||
|
|
Processing axioms...
|
||
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Processing axioms: [0.300s CPU, 0.296s wall-clock]
|
||
|
|
Translating task: [5.550s CPU, 5.546s wall-clock]
|
||
|
|
0 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
88 propositions removed
|
||
|
|
Detecting unreachable propositions: [2.860s CPU, 2.860s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
76 of 76 variables necessary.
|
||
|
|
0 of 76 mutex groups necessary.
|
||
|
|
17845 of 17845 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.850s CPU, 0.854s wall-clock]
|
||
|
|
Translator variables: 76
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 1427
|
||
|
|
Translator goal facts: 2
|
||
|
|
Translator mutex groups: 0
|
||
|
|
Translator total mutex groups size: 0
|
||
|
|
Translator operators: 17845
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 108118
|
||
|
|
Translator peak memory: 107160 KB
|
||
|
|
Writing output... [1.860s CPU, 2.028s wall-clock]
|
||
|
|
Done! [21.880s CPU, 22.037s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 4.78s
|
||
|
|
Memory: 358MB
|
||
|
|
|
||
|
|
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.02s
|
||
|
|
Memory: 358MB (+0MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.02s
|
||
|
|
|
||
|
|
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: 1.62s
|
||
|
|
Memory: 358MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.29s
|
||
|
|
Memory: 375MB (+17MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 2.85s
|
||
|
|
|
||
|
|
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: 1.42s
|
||
|
|
Memory: 382MB (+7MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.16s
|
||
|
|
Memory: 438MB (+56MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
NOT SERIALIZABLE
|
||
|
|
Testing Time: 3.92s
|
||
|
|
Memory: 628MB (+190MB)
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.07s
|
||
|
|
Memory: 628MB (+0MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
NOT SERIALIZABLE
|
||
|
|
Testing Time: 3.83s
|
||
|
|
Memory: 634MB (+6MB)
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.07s
|
||
|
|
Memory: 634MB (+0MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
NOT SERIALIZABLE
|
||
|
|
Testing Time: 3.81s
|
||
|
|
Memory: 637MB (+3MB)
|
||
|
|
Solving...
|
||
|
|
Solving Time: 3.54s
|
||
|
|
Memory: 637MB (+0MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
NOT SERIALIZABLE
|
||
|
|
Testing Time: 3.82s
|
||
|
|
Memory: 645MB (+8MB)
|
||
|
|
Solving...
|
||
|
|
Solving Time: 1.46s
|
||
|
|
Memory: 645MB (+0MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 22.95s
|
||
|
|
|
||
|
|
Iteration 4
|
||
|
|
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 10
|
||
|
|
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
|
||
|
|
Grounding Time: 1.48s
|
||
|
|
Memory: 645MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.17s
|
||
|
|
Memory: 630MB (+-15MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
NOT SERIALIZABLE
|
||
|
|
Testing Time: 3.86s
|
||
|
|
Memory: 633MB (+3MB)
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.13s
|
||
|
|
Memory: 633MB (+0MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
SERIALIZABLE
|
||
|
|
Testing Time: 3.78s
|
||
|
|
Memory: 632MB (+-1MB)
|
||
|
|
Answer: 6
|
||
|
|
occurs(action(("feast","love","baguette","lemon","alsace","bavaria")),1) occurs(action(("overcome","laceration-20","love","lemon","vulcan","venus")),2) occurs(action(("feast","achievement","turkey","scallop","alsace","bavaria")),2) occurs(action(("feast","aesthetics","hamburger","scallion","alsace","bavaria")),2) occurs(action(("feast","love","lemon","onion","bavaria","quebec")),2) occurs(action(("overcome","laceration","satisfaction","rice","mars","neptune")),2) occurs(action(("feast","entertainment","mutton","scallop","bavaria","quebec")),2) occurs(action(("feast","intoxication","yogurt","scallop","oregon","alsace")),2) occurs(action(("feast","satisfaction","rice","lettuce","bavaria","quebec")),2) occurs(action(("feast","love","onion","turkey","oregon","alsace")),3) occurs(action(("feast","love","turkey","potato","oregon","alsace")),4) occurs(action(("feast","love","potato","muffin","oregon","alsace")),5) occurs(action(("feast","love","muffin","ham","alsace","bavaria")),6) occurs(action(("succumb","laceration-20","love","ham","vulcan","venus")),7) occurs(action(("feast","aesthetics","scallion","flounder","oregon","alsace")),8) occurs(action(("feast","aesthetics","flounder","lemon","bavaria","quebec")),9) occurs(action(("overcome","prostatitis-18","aesthetics","lemon","mars","neptune")),10) occurs(action(("feast","aesthetics","lemon","baguette","alsace","bavaria")),11) occurs(action(("feast","aesthetics","baguette","lobster","oregon","alsace")),12) occurs(action(("overcome","abrasion-12","love","ham","vulcan","venus")),12) occurs(action(("feast","satisfaction","lettuce","chocolate","oregon","alsace")),12) occurs(action(("succumb","prostatitis-18","aesthetics","lobster","mars","neptune")),13) occurs(action(("overcome","prostatitis-13","curiosity","ham","neptune","vulcan")),13) occurs(action(("feast","aesthetics","lobster","papaya","oregon","alsace")),13) occurs(action(("overcome","loneliness-11","curiosity","ham","mars","neptune")),14) occurs(action(("feast","aesthetics","papaya","hamburger","alsace","bavaria")),14) occurs(action(("succumb","abrasion-12","love","ham","vulcan","venus")),14) occurs(action(("feast","satisfaction","chocolate","yogurt","alsace","bavaria")),15)
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 9
|
||
|
|
Time : 18.468s (Solving: 5.26s 1st Model: 3.73s Unsat: 1.43s)
|
||
|
|
CPU Time : 18.320s
|
||
|
|
|
||
|
|
Choices : 12780 (Domain: 10729)
|
||
|
|
Conflicts : 3681 (Analyzed: 3679)
|
||
|
|
Restarts : 35 (Average: 105.11 Last: 83)
|
||
|
|
Model-Level : 456.7
|
||
|
|
Problems : 9 (Average Length: 11.44 Splits: 0)
|
||
|
|
Lemmas : 3679 (Deleted: 977)
|
||
|
|
Binary : 141 (Ratio: 3.83%)
|
||
|
|
Ternary : 68 (Ratio: 1.85%)
|
||
|
|
Conflict : 3679 (Average Length: 182.7 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 3679 (Average: 2.60 Max: 112 Sum: 9578)
|
||
|
|
Executed : 3667 (Average: 2.58 Max: 112 Sum: 9477 Ratio: 98.95%)
|
||
|
|
Bounded : 12 (Average: 8.42 Max: 12 Sum: 101 Ratio: 1.05%)
|
||
|
|
|
||
|
|
Rules : 326480
|
||
|
|
Atoms : 326470
|
||
|
|
Bodies : 66 (Original: 65)
|
||
|
|
Count : 10
|
||
|
|
Equivalences : 165 (Atom=Atom: 55 Body=Body: 0 Other: 110)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 289050 (Eliminated: 0 Frozen: 137693)
|
||
|
|
Constraints : 1745765 (Binary: 98.1% Ternary: 0.9% Other: 1.0%)
|
||
|
|
|
||
|
|
Memory Peak : 755MB
|
||
|
|
Max. Length : 15 steps
|
||
|
|
Sol. Length : 15 steps
|
||
|
|
Models : 6
|
||
|
|
|
||
|
|
|