Add benchmark result [gc-ta5-tt0 | ipc-1998 | mystery-round-1-strips | 9]
This commit is contained in:
152
gc-ta5-tt0/ipc-1998_mystery-round-1-strips_9.out
Normal file
152
gc-ta5-tt0/ipc-1998_mystery-round-1-strips_9.out
Normal file
@@ -0,0 +1,152 @@
|
||||
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-9.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-9.pddl
|
||||
Parsing...
|
||||
Parsing: [0.020s CPU, 0.022s 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.010s CPU, 0.015s wall-clock]
|
||||
Generated 42 rules.
|
||||
Computing model... [0.320s CPU, 0.318s wall-clock]
|
||||
2607 relevant atoms
|
||||
1254 auxiliary atoms
|
||||
3861 final queue length
|
||||
8243 total queue pushes
|
||||
Completing instantiation... [0.930s CPU, 0.931s wall-clock]
|
||||
Instantiating: [1.300s CPU, 1.307s wall-clock]
|
||||
Computing fact groups...
|
||||
Finding invariants...
|
||||
12 initial candidates
|
||||
Finding invariants: [0.030s CPU, 0.035s wall-clock]
|
||||
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
|
||||
Instantiating groups... [0.020s CPU, 0.019s wall-clock]
|
||||
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
|
||||
Choosing groups...
|
||||
1 uncovered facts
|
||||
Choosing groups: [0.010s CPU, 0.004s wall-clock]
|
||||
Building translation key... [0.000s CPU, 0.003s wall-clock]
|
||||
Computing fact groups: [0.070s CPU, 0.072s 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.040s CPU, 0.037s wall-clock]
|
||||
Translating task: [0.680s CPU, 0.672s wall-clock]
|
||||
0 effect conditions simplified
|
||||
0 implied preconditions added
|
||||
Detecting unreachable propositions...
|
||||
0 operators removed
|
||||
0 axioms removed
|
||||
29 propositions removed
|
||||
Detecting unreachable propositions: [0.330s CPU, 0.331s wall-clock]
|
||||
Reordering and filtering variables...
|
||||
27 of 27 variables necessary.
|
||||
0 of 27 mutex groups necessary.
|
||||
2280 of 2280 operators necessary.
|
||||
0 of 0 axiom rules necessary.
|
||||
Reordering and filtering variables: [0.110s CPU, 0.111s wall-clock]
|
||||
Translator variables: 27
|
||||
Translator derived variables: 0
|
||||
Translator facts: 205
|
||||
Translator goal facts: 2
|
||||
Translator mutex groups: 0
|
||||
Translator total mutex groups size: 0
|
||||
Translator operators: 2280
|
||||
Translator axioms: 0
|
||||
Translator task size: 13818
|
||||
Translator peak memory: 45516 KB
|
||||
Writing output... [0.230s CPU, 0.257s wall-clock]
|
||||
Done! [2.770s CPU, 2.808s wall-clock]
|
||||
planner.py version 0.0.1
|
||||
|
||||
Time: 0.59s
|
||||
Memory: 88MB
|
||||
|
||||
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: 88MB (+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.16s
|
||||
Memory: 88MB (+0MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.01s
|
||||
Memory: 90MB (+2MB)
|
||||
SAT
|
||||
Testing...
|
||||
NOT SERIALIZABLE
|
||||
Testing Time: 0.46s
|
||||
Memory: 112MB (+22MB)
|
||||
Solving...
|
||||
Solving Time: 0.00s
|
||||
Memory: 112MB (+0MB)
|
||||
SAT
|
||||
Testing...
|
||||
NOT SERIALIZABLE
|
||||
Testing Time: 0.46s
|
||||
Memory: 112MB (+0MB)
|
||||
Solving...
|
||||
Solving Time: 0.00s
|
||||
Memory: 112MB (+0MB)
|
||||
SAT
|
||||
Testing...
|
||||
SERIALIZABLE
|
||||
Testing Time: 0.44s
|
||||
Memory: 113MB (+1MB)
|
||||
Answer: 3
|
||||
occurs(action(("overcome","sciatica","entertainment","flounder","saturn","venus")),1) occurs(action(("feast","entertainment","flounder","hamburger","bavaria","arizona")),2) occurs(action(("overcome","jealousy","excitement","guava","earth","uranus")),2) occurs(action(("overcome","prostatitis","intoxication","haroset","earth","uranus")),2) occurs(action(("feast","intoxication","haroset","guava","bavaria","arizona")),2) occurs(action(("feast","excitement","guava","apple","manitoba","kentucky")),2) occurs(action(("succumb","sciatica","entertainment","hamburger","saturn","venus")),3) occurs(action(("feast","excitement","apple","hotdog","bavaria","arizona")),3) occurs(action(("feast","excitement","hotdog","wurst","bosnia","bavaria")),4) occurs(action(("succumb","jealousy","excitement","wurst","earth","uranus")),5)
|
||||
SATISFIABLE
|
||||
|
||||
Models : 1+
|
||||
Calls : 4
|
||||
Time : 0.899s (Solving: 0.01s 1st Model: 0.01s Unsat: 0.00s)
|
||||
CPU Time : 0.864s
|
||||
|
||||
Choices : 342 (Domain: 302)
|
||||
Conflicts : 76 (Analyzed: 76)
|
||||
Restarts : 0
|
||||
Model-Level : 48.7
|
||||
Problems : 4 (Average Length: 5.75 Splits: 0)
|
||||
Lemmas : 76 (Deleted: 0)
|
||||
Binary : 4 (Ratio: 5.26%)
|
||||
Ternary : 0 (Ratio: 0.00%)
|
||||
Conflict : 76 (Average Length: 14.2 Ratio: 100.00%)
|
||||
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Backjumps : 76 (Average: 2.95 Max: 15 Sum: 224)
|
||||
Executed : 75 (Average: 2.86 Max: 15 Sum: 217 Ratio: 96.88%)
|
||||
Bounded : 1 (Average: 7.00 Max: 7 Sum: 7 Ratio: 3.12%)
|
||||
|
||||
Rules : 41822
|
||||
Atoms : 41820
|
||||
Bodies : 13 (Original: 12)
|
||||
Count : 2
|
||||
Equivalences : 30 (Atom=Atom: 10 Body=Body: 0 Other: 20)
|
||||
Tight : Yes
|
||||
Variables : 11092 (Eliminated: 0 Frozen: 2146)
|
||||
Constraints : 39176 (Binary: 96.8% Ternary: 1.5% Other: 1.7%)
|
||||
|
||||
Memory Peak : 113MB
|
||||
Max. Length : 5 steps
|
||||
Sol. Length : 5 steps
|
||||
Models : 3
|
||||
|
||||
|
||||
Reference in New Issue
Block a user