143 lines
6.7 KiB
Plaintext
143 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.022s wall-clock]
|
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
|
Instantiating...
|
|
Generating Datalog program... [0.000s CPU, 0.006s wall-clock]
|
|
Normalizing Datalog program...
|
|
Normalizing Datalog program: [0.030s CPU, 0.031s wall-clock]
|
|
Preparing model... [0.020s CPU, 0.018s wall-clock]
|
|
Generated 42 rules.
|
|
Computing model... [0.480s CPU, 0.480s wall-clock]
|
|
4582 relevant atoms
|
|
2124 auxiliary atoms
|
|
6706 final queue length
|
|
14587 total queue pushes
|
|
Completing instantiation... [1.450s CPU, 1.450s wall-clock]
|
|
Instantiating: [1.980s CPU, 1.992s wall-clock]
|
|
Computing fact groups...
|
|
Finding invariants...
|
|
12 initial candidates
|
|
Finding invariants: [0.050s CPU, 0.043s wall-clock]
|
|
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
|
|
Instantiating groups... [0.020s CPU, 0.020s wall-clock]
|
|
Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
|
|
Choosing groups...
|
|
0 uncovered facts
|
|
Choosing groups: [0.000s CPU, 0.006s wall-clock]
|
|
Building translation key... [0.010s CPU, 0.004s wall-clock]
|
|
Computing fact groups: [0.100s CPU, 0.090s 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.060s CPU, 0.056s wall-clock]
|
|
Translating task: [1.090s CPU, 1.092s 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.520s CPU, 0.520s 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.170s CPU, 0.167s 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: 48728 KB
|
|
Writing output... [0.370s CPU, 0.411s wall-clock]
|
|
Done! [4.300s CPU, 4.350s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 0.88s
|
|
Memory: 108MB
|
|
|
|
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: 108MB (+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.40s
|
|
Memory: 108MB (+0MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.04s
|
|
Memory: 112MB (+4MB)
|
|
UNSAT
|
|
Iteration Time: 0.62s
|
|
|
|
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.45s
|
|
Memory: 127MB (+15MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Answer: 1
|
|
occurs(action(("overcome","boils","expectation","hamburger","neptune","venus")),1) occurs(action(("feast","achievement","guava","rice","arizona","oregon")),1) occurs(action(("feast","intoxication","beef","hamburger","bosnia","bavaria")),1) occurs(action(("feast","triumph","turkey","chicken","surrey","pennsylvania")),1) occurs(action(("feast","triumph","chicken","mutton","manitoba","surrey")),2) occurs(action(("feast","achievement","rice","baguette","alsace","guanabara")),2) occurs(action(("feast","expectation","hamburger","hotdog","bosnia","bavaria")),2) occurs(action(("overcome","dread","achievement","baguette","mars","vulcan")),3) occurs(action(("feast","expectation","hotdog","mutton","moravia","kentucky")),3) occurs(action(("succumb","boils","expectation","mutton","neptune","venus")),4) occurs(action(("feast","achievement","baguette","cucumber","alsace","guanabara")),4) occurs(action(("feast","achievement","cucumber","hotdog","bosnia","bavaria")),5) occurs(action(("feast","triumph","mutton","chicken","quebec","goias")),5) occurs(action(("feast","achievement","hotdog","mutton","bavaria","moravia")),6) occurs(action(("feast","triumph","chicken","turkey","goias","manitoba")),6) occurs(action(("succumb","dread","achievement","mutton","mars","vulcan")),7) occurs(action(("feast","triumph","turkey","muffin","manitoba","surrey")),7) occurs(action(("overcome","laceration","triumph","muffin","mars","vulcan")),8) occurs(action(("feast","triumph","muffin","turkey","arizona","oregon")),9) occurs(action(("feast","triumph","turkey","chicken","goias","manitoba")),10)
|
|
Solving Time: 0.03s
|
|
Memory: 139MB (+12MB)
|
|
SAT
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 3
|
|
Time : 2.284s (Solving: 0.02s 1st Model: 0.01s Unsat: 0.00s)
|
|
CPU Time : 2.170s
|
|
|
|
Choices : 405 (Domain: 360)
|
|
Conflicts : 80 (Analyzed: 79)
|
|
Restarts : 1 (Average: 79.00 Last: 15)
|
|
Model-Level : 175.0
|
|
Problems : 3 (Average Length: 7.00 Splits: 0)
|
|
Lemmas : 79 (Deleted: 0)
|
|
Binary : 11 (Ratio: 13.92%)
|
|
Ternary : 6 (Ratio: 7.59%)
|
|
Conflict : 79 (Average Length: 117.2 Ratio: 100.00%)
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 79 (Average: 3.37 Max: 42 Sum: 266)
|
|
Executed : 73 (Average: 3.06 Max: 42 Sum: 242 Ratio: 90.98%)
|
|
Bounded : 6 (Average: 4.00 Max: 7 Sum: 24 Ratio: 9.02%)
|
|
|
|
Rules : 80407
|
|
Atoms : 80407
|
|
Bodies : 1 (Original: 0)
|
|
Tight : Yes
|
|
Variables : 42977 (Eliminated: 0 Frozen: 39021)
|
|
Constraints : 277850 (Binary: 98.2% Ternary: 0.7% Other: 1.1%)
|
|
|
|
Memory Peak : 140MB
|
|
Max. Length : 10 steps
|
|
Sol. Length : 10 steps
|
|
|
|
|