1
0
tplp-planning-benchmark/gc-ta1-tt1/ipc-1998_mystery-prime-round-1-strips_7.out

145 lines
5.6 KiB
Plaintext

INFO Running translator.
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-prime-round-1-strips/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-prime-round-1-strips/instances/instance-7.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-prime-round-1-strips/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-prime-round-1-strips/instances/instance-7.pddl
Parsing...
Parsing: [0.020s CPU, 0.020s 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.030s CPU, 0.032s wall-clock]
Preparing model... [0.020s CPU, 0.018s wall-clock]
Generated 55 rules.
Computing model... [0.340s CPU, 0.350s wall-clock]
2239 relevant atoms
1850 auxiliary atoms
4089 final queue length
7231 total queue pushes
Completing instantiation... [0.650s CPU, 0.648s wall-clock]
Instantiating: [1.060s CPU, 1.058s wall-clock]
Computing fact groups...
Finding invariants...
12 initial candidates
Finding invariants: [0.030s CPU, 0.038s wall-clock]
Checking invariant weight... [0.010s CPU, 0.002s wall-clock]
Instantiating groups... [0.030s CPU, 0.036s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
Choosing groups...
0 uncovered facts
Choosing groups: [0.010s CPU, 0.007s wall-clock]
Building translation key... [0.000s CPU, 0.004s wall-clock]
Computing fact groups: [0.100s CPU, 0.104s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.002s 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.030s CPU, 0.025s wall-clock]
Translating task: [0.500s CPU, 0.500s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
38 propositions removed
Detecting unreachable propositions: [0.240s CPU, 0.239s wall-clock]
Reordering and filtering variables...
38 of 38 variables necessary.
0 of 38 mutex groups necessary.
1668 of 1668 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.080s CPU, 0.080s wall-clock]
Translator variables: 38
Translator derived variables: 0
Translator facts: 352
Translator goal facts: 1
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 1668
Translator axioms: 0
Translator task size: 9691
Translator peak memory: 42700 KB
Writing output... [0.160s CPU, 0.186s wall-clock]
Done! [2.200s CPU, 2.216s wall-clock]
planner.py version 0.0.1
Time: 0.42s
Memory: 77MB
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: 77MB (+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.11s
Memory: 77MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 79MB (+2MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.37s
Memory: 94MB (+15MB)
Solving...
Solving Time: 0.01s
Memory: 94MB (+0MB)
SAT
Testing...
SERIALIZABLE?
Testing Time: 0.00s
Memory: 94MB (+0MB)
Answer: 2
occurs(action(("feast","learning","pea","snickers","manitoba","moravia")),1) occurs(action(("drink","shrimp","snickers","moravia","manitoba","arizona","arizona","manitoba")),1) occurs(action(("feast","learning","snickers","popover","arizona","manitoba")),2) occurs(action(("overcome","jealousy","learning","popover","mercury","saturn")),3) occurs(action(("feast","learning","popover","muffin","arizona","manitoba")),4) occurs(action(("succumb","jealousy","learning","muffin","mercury","saturn")),5)
SATISFIABLE
Models : 1+
Calls : 3
Time : 0.677s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
CPU Time : 0.656s
Choices : 107 (Domain: 55)
Conflicts : 3 (Analyzed: 3)
Restarts : 0
Model-Level : 46.5
Problems : 3 (Average Length: 5.33 Splits: 0)
Lemmas : 3 (Deleted: 0)
Binary : 0 (Ratio: 0.00%)
Ternary : 0 (Ratio: 0.00%)
Conflict : 3 (Average Length: 4.7 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 3 (Average: 11.67 Max: 15 Sum: 35)
Executed : 2 (Average: 9.33 Max: 15 Sum: 28 Ratio: 80.00%)
Bounded : 1 (Average: 7.00 Max: 7 Sum: 7 Ratio: 20.00%)
Rules : 42666 (Original: 42594)
Atoms : 33934
Bodies : 5535 (Original: 5462)
Count : 113 (Original: 132)
Equivalences : 3750 (Atom=Atom: 20 Body=Body: 0 Other: 3730)
Tight : Yes
Variables : 10447 (Eliminated: 0 Frozen: 4924)
Constraints : 41962 (Binary: 95.5% Ternary: 2.7% Other: 1.8%)
Memory Peak : 94MB
Max. Length : 5 steps
Sol. Length : 5 steps
Models : 2