143 lines
8.0 KiB
Plaintext
143 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-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.010s CPU, 0.017s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.000s CPU, 0.005s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.020s CPU, 0.025s wall-clock]
|
||
|
|
Preparing model... [0.020s CPU, 0.016s wall-clock]
|
||
|
|
Generated 42 rules.
|
||
|
|
Computing model... [0.480s CPU, 0.478s wall-clock]
|
||
|
|
4582 relevant atoms
|
||
|
|
2124 auxiliary atoms
|
||
|
|
6706 final queue length
|
||
|
|
14587 total queue pushes
|
||
|
|
Completing instantiation... [1.450s CPU, 1.449s wall-clock]
|
||
|
|
Instantiating: [1.980s CPU, 1.980s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
12 initial candidates
|
||
|
|
Finding invariants: [0.050s CPU, 0.042s 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.010s CPU, 0.006s wall-clock]
|
||
|
|
Building translation key... [0.000s CPU, 0.003s wall-clock]
|
||
|
|
Computing fact groups: [0.090s CPU, 0.088s 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.059s wall-clock]
|
||
|
|
Translating task: [1.100s CPU, 1.094s 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.168s 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.360s CPU, 0.409s wall-clock]
|
||
|
|
Done! [4.280s CPU, 4.332s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.93s
|
||
|
|
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.03s
|
||
|
|
Memory: 111MB (+3MB)
|
||
|
|
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: 126MB (+15MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Answer: 1
|
||
|
|
occurs(action(("feast","achievement","guava","rice","arizona","oregon")),1) occurs(action(("feast","excitement","yogurt","scallop","oregon","bosnia")),1) occurs(action(("feast","expectation","hamburger","hotdog","bosnia","bavaria")),1) occurs(action(("feast","intoxication","beef","hamburger","bosnia","bavaria")),1) occurs(action(("feast","achievement","rice","baguette","alsace","guanabara")),2) occurs(action(("feast","excitement","scallop","rice","arizona","oregon")),2) occurs(action(("feast","expectation","hotdog","beef","moravia","kentucky")),2) occurs(action(("feast","intoxication","hamburger","hotdog","oregon","bosnia")),2) occurs(action(("feast","triumph","turkey","cucumber","surrey","pennsylvania")),2) occurs(action(("feast","intoxication","hotdog","mutton","bavaria","moravia")),3) occurs(action(("feast","achievement","baguette","beef","alsace","guanabara")),3) occurs(action(("feast","excitement","rice","baguette","pennsylvania","alsace")),3) occurs(action(("feast","triumph","cucumber","hotdog","bosnia","bavaria")),3) occurs(action(("feast","expectation","beef","hamburger","oregon","bosnia")),3) occurs(action(("overcome","dread","excitement","baguette","neptune","venus")),4) occurs(action(("feast","achievement","beef","hamburger","arizona","oregon")),4) occurs(action(("feast","expectation","hamburger","hotdog","arizona","oregon")),4) occurs(action(("feast","triumph","hotdog","hamburger","bosnia","bavaria")),4) occurs(action(("overcome","boils","achievement","hamburger","mars","vulcan")),5) occurs(action(("feast","expectation","hotdog","mutton","oregon","bosnia")),5) occurs(action(("feast","excitement","baguette","beef","pennsylvania","alsace")),5) occurs(action(("feast","triumph","hamburger","hotdog","guanabara","arizona")),5) occurs(action(("feast","achievement","hamburger","hotdog","alsace","guanabara")),6) occurs(action(("feast","excitement","beef","hamburger","guanabara","arizona")),6) occurs(action(("feast","triumph","hotdog","beef","arizona","oregon")),6) occurs(action(("feast","achievement","hotdog","mutton","guanabara","arizona")),7) occurs(action(("feast","excitement","hamburger","hotdog","pennsylvania","alsace")),7) occurs(action(("feast","triumph","beef","baguette","alsace","guanabara")),7) occurs(action(("succumb","boils","achievement","mutton","mars","vulcan")),8) occurs(action(("feast","excitement","hotdog","mutton","alsace","guanabara")),8) occurs(action(("feast","expectation","mutton","hotdog","quebec","goias")),8) occurs(action(("feast","triumph","baguette","cucumber","surrey","pennsylvania")),8) occurs(action(("overcome","boils","achievement","mutton","mars","vulcan")),9) occurs(action(("feast","expectation","hotdog","mutton","pennsylvania","alsace")),9) occurs(action(("feast","triumph","cucumber","turkey","oregon","bosnia")),9) occurs(action(("succumb","dread","excitement","mutton","neptune","venus")),10) occurs(action(("succumb","boils","achievement","mutton","mars","vulcan")),10)
|
||
|
|
Solving Time: 0.16s
|
||
|
|
Memory: 139MB (+13MB)
|
||
|
|
SAT
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 3
|
||
|
|
Time : 2.424s (Solving: 0.14s 1st Model: 0.14s Unsat: 0.00s)
|
||
|
|
CPU Time : 2.340s
|
||
|
|
|
||
|
|
Choices : 2133
|
||
|
|
Conflicts : 446 (Analyzed: 445)
|
||
|
|
Restarts : 4 (Average: 111.25 Last: 79)
|
||
|
|
Model-Level : 45.0
|
||
|
|
Problems : 3 (Average Length: 7.00 Splits: 0)
|
||
|
|
Lemmas : 445 (Deleted: 0)
|
||
|
|
Binary : 20 (Ratio: 4.49%)
|
||
|
|
Ternary : 14 (Ratio: 3.15%)
|
||
|
|
Conflict : 445 (Average Length: 62.0 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 445 (Average: 5.36 Max: 54 Sum: 2386)
|
||
|
|
Executed : 414 (Average: 4.71 Max: 54 Sum: 2098 Ratio: 87.93%)
|
||
|
|
Bounded : 31 (Average: 9.29 Max: 12 Sum: 288 Ratio: 12.07%)
|
||
|
|
|
||
|
|
Rules : 80407
|
||
|
|
Atoms : 80407
|
||
|
|
Bodies : 1 (Original: 0)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 42977 (Eliminated: 0 Frozen: 39021)
|
||
|
|
Constraints : 278117 (Binary: 98.2% Ternary: 0.7% Other: 1.1%)
|
||
|
|
|
||
|
|
Memory Peak : 139MB
|
||
|
|
Max. Length : 10 steps
|
||
|
|
Sol. Length : 10 steps
|
||
|
|
|
||
|
|
|