166 lines
8.0 KiB
Plaintext
166 lines
8.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-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.010s CPU, 0.021s 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.020s CPU, 0.026s wall-clock]
|
||
|
|
Preparing model... [0.020s CPU, 0.019s wall-clock]
|
||
|
|
Generated 42 rules.
|
||
|
|
Computing model... [1.300s CPU, 1.300s wall-clock]
|
||
|
|
11303 relevant atoms
|
||
|
|
5116 auxiliary atoms
|
||
|
|
16419 final queue length
|
||
|
|
36991 total queue pushes
|
||
|
|
Completing instantiation... [4.330s CPU, 4.325s wall-clock]
|
||
|
|
Instantiating: [5.690s CPU, 5.692s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
12 initial candidates
|
||
|
|
Finding invariants: [0.080s CPU, 0.083s 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.010s CPU, 0.004s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
4 uncovered facts
|
||
|
|
Choosing groups: [0.010s CPU, 0.014s wall-clock]
|
||
|
|
Building translation key... [0.000s CPU, 0.007s wall-clock]
|
||
|
|
Computing fact groups: [0.180s CPU, 0.185s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.010s 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.000s 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.219s 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.670s CPU, 1.665s 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.490s 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.070s CPU, 1.167s wall-clock]
|
||
|
|
Done! [12.490s CPU, 12.596s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 2.62s
|
||
|
|
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.44s
|
||
|
|
|
||
|
|
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: 262MB (+25MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
NOT SERIALIZABLE
|
||
|
|
Testing Time: 2.54s
|
||
|
|
Memory: 376MB (+114MB)
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.19s
|
||
|
|
Memory: 364MB (+-12MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
NOT SERIALIZABLE
|
||
|
|
Testing Time: 2.13s
|
||
|
|
Memory: 389MB (+25MB)
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.47s
|
||
|
|
Memory: 389MB (+0MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
SERIALIZABLE
|
||
|
|
Testing Time: 2.03s
|
||
|
|
Memory: 393MB (+4MB)
|
||
|
|
Answer: 3
|
||
|
|
occurs(action(("overcome","anger","rest","popover","mars","saturn")),1) occurs(action(("overcome","grief","achievement","chicken","venus","neptune")),1) occurs(action(("feast","lubricity","wonderbread","turkey","goias","quebec")),1) occurs(action(("feast","aesthetics","cantelope","tomato","alsace","goias")),1) occurs(action(("feast","love","tomato","cantelope","kentucky","alsace")),1) occurs(action(("feast","rest","popover","cantelope","bosnia","surrey")),1) occurs(action(("feast","satisfaction","pistachio","onion","kentucky","alsace")),1) occurs(action(("feast","triumph","turkey","mutton","kentucky","alsace")),1) occurs(action(("feast","aesthetics","tomato","tuna","surrey","kentucky")),2) occurs(action(("feast","lubricity","turkey","onion","surrey","kentucky")),2) occurs(action(("feast","rest","cantelope","tomato","kentucky","alsace")),2) occurs(action(("feast","triumph","mutton","onion","surrey","kentucky")),2) occurs(action(("feast","satisfaction","onion","mutton","alsace","goias")),2) occurs(action(("feast","aesthetics","tuna","beef","kentucky","alsace")),3) occurs(action(("feast","love","cantelope","popover","surrey","kentucky")),3) occurs(action(("feast","lubricity","onion","mutton","kentucky","alsace")),3) occurs(action(("feast","rest","tomato","tuna","bosnia","surrey")),3) occurs(action(("overcome","abrasion","aesthetics","beef","mars","saturn")),4) occurs(action(("feast","aesthetics","beef","papaya","surrey","kentucky")),4) occurs(action(("feast","rest","tuna","beef","surrey","kentucky")),4) occurs(action(("feast","aesthetics","papaya","chicken","bosnia","surrey")),5) occurs(action(("feast","rest","beef","scallop","bosnia","surrey")),5) occurs(action(("feast","aesthetics","chicken","turkey","surrey","kentucky")),6) occurs(action(("feast","rest","scallop","chicken","bosnia","surrey")),6) occurs(action(("succumb","abrasion","aesthetics","turkey","mars","saturn")),7) occurs(action(("feast","rest","chicken","turkey","bosnia","surrey")),7) occurs(action(("succumb","anger","rest","turkey","mars","saturn")),8) occurs(action(("feast","aesthetics","turkey","chicken","bosnia","surrey")),8) occurs(action(("feast","satisfaction","mutton","turkey","bosnia","surrey")),9) occurs(action(("feast","triumph","onion","mutton","surrey","kentucky")),9) occurs(action(("feast","curiosity","potato","marzipan","kentucky","alsace")),10)
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 5
|
||
|
|
Time : 6.763s (Solving: 0.58s 1st Model: 0.55s Unsat: 0.00s)
|
||
|
|
CPU Time : 6.652s
|
||
|
|
|
||
|
|
Choices : 26969 (Domain: 12809)
|
||
|
|
Conflicts : 1885 (Analyzed: 1884)
|
||
|
|
Restarts : 20 (Average: 94.20 Last: 108)
|
||
|
|
Model-Level : 318.0
|
||
|
|
Problems : 5 (Average Length: 9.00 Splits: 0)
|
||
|
|
Lemmas : 1884 (Deleted: 0)
|
||
|
|
Binary : 108 (Ratio: 5.73%)
|
||
|
|
Ternary : 32 (Ratio: 1.70%)
|
||
|
|
Conflict : 1884 (Average Length: 135.3 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 1884 (Average: 13.36 Max: 6959 Sum: 25162)
|
||
|
|
Executed : 1866 (Average: 13.27 Max: 6959 Sum: 25000 Ratio: 99.36%)
|
||
|
|
Bounded : 18 (Average: 9.00 Max: 12 Sum: 162 Ratio: 0.64%)
|
||
|
|
|
||
|
|
Rules : 331831 (Original: 331698)
|
||
|
|
Atoms : 211281
|
||
|
|
Bodies : 79171 (Original: 79045)
|
||
|
|
Count : 288 (Original: 305)
|
||
|
|
Equivalences : 42406 (Atom=Atom: 28 Body=Body: 0 Other: 42378)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 103415 (Eliminated: 0 Frozen: 46337)
|
||
|
|
Constraints : 615935 (Binary: 98.6% Ternary: 0.6% Other: 0.8%)
|
||
|
|
|
||
|
|
Memory Peak : 393MB
|
||
|
|
Max. Length : 10 steps
|
||
|
|
Sol. Length : 10 steps
|
||
|
|
Models : 3
|
||
|
|
|
||
|
|
|