166 lines
6.9 KiB
Plaintext
166 lines
6.9 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-6.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-6.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.020s CPU, 0.027s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.010s CPU, 0.008s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.030s CPU, 0.031s wall-clock]
|
||
|
|
Preparing model... [0.020s CPU, 0.023s wall-clock]
|
||
|
|
Generated 42 rules.
|
||
|
|
Computing model... [1.320s CPU, 1.314s wall-clock]
|
||
|
|
11303 relevant atoms
|
||
|
|
5116 auxiliary atoms
|
||
|
|
16419 final queue length
|
||
|
|
36991 total queue pushes
|
||
|
|
Completing instantiation... [4.340s CPU, 4.336s wall-clock]
|
||
|
|
Instantiating: [5.730s CPU, 5.727s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
12 initial candidates
|
||
|
|
Finding invariants: [0.090s CPU, 0.086s wall-clock]
|
||
|
|
Checking invariant weight... [0.000s CPU, 0.003s wall-clock]
|
||
|
|
Instantiating groups... [0.050s CPU, 0.046s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.004s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
4 uncovered facts
|
||
|
|
Choosing groups: [0.020s CPU, 0.013s wall-clock]
|
||
|
|
Building translation key... [0.010s CPU, 0.007s wall-clock]
|
||
|
|
Computing fact groups: [0.190s CPU, 0.187s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.003s wall-clock]
|
||
|
|
Building dictionary for full mutex groups... [0.000s CPU, 0.003s wall-clock]
|
||
|
|
Building mutex information...
|
||
|
|
Building mutex information: [0.010s CPU, 0.004s wall-clock]
|
||
|
|
Translating task...
|
||
|
|
Processing axioms...
|
||
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Processing axioms: [0.170s CPU, 0.171s wall-clock]
|
||
|
|
Translating task: [3.230s CPU, 3.221s wall-clock]
|
||
|
|
0 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
54 propositions removed
|
||
|
|
Detecting unreachable propositions: [1.660s CPU, 1.663s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
46 of 46 variables necessary.
|
||
|
|
0 of 46 mutex groups necessary.
|
||
|
|
10539 of 10539 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.500s CPU, 0.495s wall-clock]
|
||
|
|
Translator variables: 46
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 552
|
||
|
|
Translator goal facts: 2
|
||
|
|
Translator mutex groups: 0
|
||
|
|
Translator total mutex groups size: 0
|
||
|
|
Translator operators: 10539
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 62529
|
||
|
|
Translator peak memory: 77004 KB
|
||
|
|
Writing output... [1.060s CPU, 1.157s wall-clock]
|
||
|
|
Done! [12.540s CPU, 12.629s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 2.61s
|
||
|
|
Memory: 228MB
|
||
|
|
|
||
|
|
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: 228MB (+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.84s
|
||
|
|
Memory: 228MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.11s
|
||
|
|
Memory: 237MB (+9MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 1.43s
|
||
|
|
|
||
|
|
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.78s
|
||
|
|
Memory: 237MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.10s
|
||
|
|
Memory: 266MB (+29MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
NOT SERIALIZABLE
|
||
|
|
Testing Time: 2.17s
|
||
|
|
Memory: 268MB (+2MB)
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.94s
|
||
|
|
Memory: 268MB (+0MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
NOT SERIALIZABLE
|
||
|
|
Testing Time: 2.11s
|
||
|
|
Memory: 268MB (+0MB)
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.14s
|
||
|
|
Memory: 268MB (+0MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
SERIALIZABLE
|
||
|
|
Testing Time: 2.06s
|
||
|
|
Memory: 268MB (+0MB)
|
||
|
|
Answer: 3
|
||
|
|
occurs(action(("overcome","anger","rest","popover","mars","saturn")),1) occurs(action(("feast","love","tomato","tuna","kentucky","alsace")),1) occurs(action(("feast","lubricity","wonderbread","marzipan","goias","quebec")),1) occurs(action(("feast","rest","popover","cantelope","bosnia","surrey")),1) occurs(action(("feast","satisfaction","pistachio","onion","kentucky","alsace")),1) occurs(action(("feast","triumph","turkey","onion","kentucky","alsace")),1) occurs(action(("feast","rest","cantelope","tomato","alsace","goias")),2) occurs(action(("feast","rest","tomato","tuna","surrey","kentucky")),3) occurs(action(("feast","rest","tuna","beef","kentucky","alsace")),4) occurs(action(("overcome","abrasion","rest","beef","neptune","mars")),5) occurs(action(("feast","rest","beef","papaya","surrey","kentucky")),6) occurs(action(("feast","rest","papaya","chicken","bosnia","surrey")),7) occurs(action(("overcome","grief","achievement","chicken","venus","neptune")),8) occurs(action(("feast","rest","chicken","turkey","surrey","kentucky")),8) occurs(action(("overcome","boils","satisfaction","onion","neptune","mars")),8) occurs(action(("feast","satisfaction","onion","turkey","alsace","goias")),8) occurs(action(("succumb","anger","rest","turkey","neptune","mars")),9) occurs(action(("succumb","abrasion","rest","turkey","mars","saturn")),10)
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 5
|
||
|
|
Time : 6.750s (Solving: 1.08s 1st Model: 1.06s Unsat: 0.00s)
|
||
|
|
CPU Time : 6.652s
|
||
|
|
|
||
|
|
Choices : 30691 (Domain: 29285)
|
||
|
|
Conflicts : 4687 (Analyzed: 4686)
|
||
|
|
Restarts : 54 (Average: 86.78 Last: 86)
|
||
|
|
Model-Level : 320.3
|
||
|
|
Problems : 5 (Average Length: 9.00 Splits: 0)
|
||
|
|
Lemmas : 4686 (Deleted: 2403)
|
||
|
|
Binary : 392 (Ratio: 8.37%)
|
||
|
|
Ternary : 54 (Ratio: 1.15%)
|
||
|
|
Conflict : 4686 (Average Length: 119.2 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 4686 (Average: 5.84 Max: 159 Sum: 27353)
|
||
|
|
Executed : 4670 (Average: 5.81 Max: 159 Sum: 27215 Ratio: 99.50%)
|
||
|
|
Bounded : 16 (Average: 8.62 Max: 12 Sum: 138 Ratio: 0.50%)
|
||
|
|
|
||
|
|
Rules : 189578
|
||
|
|
Atoms : 189570
|
||
|
|
Bodies : 29 (Original: 28)
|
||
|
|
Count : 8
|
||
|
|
Equivalences : 60 (Atom=Atom: 20 Body=Body: 0 Other: 40)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 102651 (Eliminated: 0 Frozen: 49344)
|
||
|
|
Constraints : 490085 (Binary: 98.4% Ternary: 0.7% Other: 0.8%)
|
||
|
|
|
||
|
|
Memory Peak : 387MB
|
||
|
|
Max. Length : 10 steps
|
||
|
|
Sol. Length : 10 steps
|
||
|
|
Models : 3
|
||
|
|
|
||
|
|
|