158 lines
6.2 KiB
Plaintext
158 lines
6.2 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-11.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-11.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.020s CPU, 0.015s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.000s CPU, 0.004s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.030s CPU, 0.026s wall-clock]
|
||
|
|
Preparing model... [0.010s CPU, 0.012s wall-clock]
|
||
|
|
Generated 42 rules.
|
||
|
|
Computing model... [0.080s CPU, 0.084s wall-clock]
|
||
|
|
527 relevant atoms
|
||
|
|
506 auxiliary atoms
|
||
|
|
1033 final queue length
|
||
|
|
1560 total queue pushes
|
||
|
|
Completing instantiation... [0.130s CPU, 0.123s wall-clock]
|
||
|
|
Instantiating: [0.250s CPU, 0.250s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
12 initial candidates
|
||
|
|
Finding invariants: [0.020s CPU, 0.023s wall-clock]
|
||
|
|
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Instantiating groups... [0.010s CPU, 0.009s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
1 uncovered facts
|
||
|
|
Choosing groups: [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Building translation key... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Computing fact groups: [0.040s CPU, 0.042s 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.001s wall-clock]
|
||
|
|
Translating task...
|
||
|
|
Processing axioms...
|
||
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Processing axioms: [0.000s CPU, 0.005s wall-clock]
|
||
|
|
Translating task: [0.090s CPU, 0.092s wall-clock]
|
||
|
|
0 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
19 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.050s CPU, 0.046s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
17 of 17 variables necessary.
|
||
|
|
0 of 17 mutex groups necessary.
|
||
|
|
310 of 310 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.010s CPU, 0.016s wall-clock]
|
||
|
|
Translator variables: 17
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 110
|
||
|
|
Translator goal facts: 2
|
||
|
|
Translator mutex groups: 0
|
||
|
|
Translator total mutex groups size: 0
|
||
|
|
Translator operators: 310
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 1935
|
||
|
|
Translator peak memory: 37580 KB
|
||
|
|
Writing output... [0.030s CPU, 0.037s wall-clock]
|
||
|
|
Done! [0.500s CPU, 0.506s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.11s
|
||
|
|
Memory: 53MB
|
||
|
|
|
||
|
|
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: 54MB (+1MB)
|
||
|
|
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.03s
|
||
|
|
Memory: 54MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 55MB (+1MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
NOT SERIALIZABLE
|
||
|
|
Testing Time: 0.07s
|
||
|
|
Memory: 58MB (+3MB)
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 58MB (+0MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.12s
|
||
|
|
|
||
|
|
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.04s
|
||
|
|
Memory: 58MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 59MB (+1MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
SERIALIZABLE?
|
||
|
|
Testing Time: 0.00s
|
||
|
|
Memory: 59MB (+0MB)
|
||
|
|
Answer: 2
|
||
|
|
occurs(action(("overcome","laceration","lubricity","pear","uranus","saturn")),1) occurs(action(("feast","lubricity","pear","sweetroll","quebec","bosnia")),2) occurs(action(("overcome","loneliness","lubricity","sweetroll","neptune","uranus")),3) occurs(action(("feast","lubricity","sweetroll","tomato","alsace","quebec")),4) occurs(action(("feast","lubricity","tomato","shrimp","quebec","bosnia")),5) occurs(action(("succumb","laceration","lubricity","shrimp","neptune","uranus")),6) occurs(action(("succumb","loneliness","lubricity","shrimp","uranus","saturn")),7) occurs(action(("overcome","sciatica","lubricity","shrimp","uranus","saturn")),8) occurs(action(("succumb","sciatica","lubricity","shrimp","uranus","saturn")),9) occurs(action(("feast","lubricity","shrimp","tomato","surrey","manitoba")),10)
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 4
|
||
|
|
Time : 0.238s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
|
||
|
|
CPU Time : 0.224s
|
||
|
|
|
||
|
|
Choices : 100 (Domain: 93)
|
||
|
|
Conflicts : 38 (Analyzed: 37)
|
||
|
|
Restarts : 0
|
||
|
|
Model-Level : 24.5
|
||
|
|
Problems : 4 (Average Length: 7.00 Splits: 0)
|
||
|
|
Lemmas : 37 (Deleted: 0)
|
||
|
|
Binary : 16 (Ratio: 43.24%)
|
||
|
|
Ternary : 4 (Ratio: 10.81%)
|
||
|
|
Conflict : 37 (Average Length: 21.8 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 37 (Average: 2.11 Max: 17 Sum: 78)
|
||
|
|
Executed : 35 (Average: 1.89 Max: 17 Sum: 70 Ratio: 89.74%)
|
||
|
|
Bounded : 2 (Average: 4.00 Max: 7 Sum: 8 Ratio: 10.26%)
|
||
|
|
|
||
|
|
Rules : 8500 (Original: 8348)
|
||
|
|
Atoms : 6790
|
||
|
|
Bodies : 1320 (Original: 1170)
|
||
|
|
Count : 28 (Original: 44)
|
||
|
|
Equivalences : 624 (Atom=Atom: 7 Body=Body: 0 Other: 617)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 5780 (Eliminated: 0 Frozen: 2914)
|
||
|
|
Constraints : 29317 (Binary: 91.8% Ternary: 6.0% Other: 2.2%)
|
||
|
|
|
||
|
|
Memory Peak : 59MB
|
||
|
|
Max. Length : 10 steps
|
||
|
|
Sol. Length : 10 steps
|
||
|
|
Models : 2
|
||
|
|
|
||
|
|
|