patrick/tplp-planning-benchmark
1
0
Fork 0
Code Issues Releases Activity

Add benchmark result [gc-ta5-tt0 | ipc-1998 | mystery-round-1-strips | 27]

Browse Source
This commit is contained in:
Potassco Bot
2017-11-27 06:11:51 +01:00
parent 7822865243
commit 362513ed8f
3 changed files with 243 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

160
gc-ta5-tt0/ipc-1998_mystery-round-1-strips_27.out Normal file
View File

@@ -0,0 +1,160 @@
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-27.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-27.pddl
Parsing...
Parsing: [0.020s CPU, 0.019s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.005s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.029s wall-clock]
Preparing model... [0.020s CPU, 0.015s wall-clock]
Generated 42 rules.
Computing model... [0.180s CPU, 0.188s wall-clock]
1446 relevant atoms
813 auxiliary atoms
2259 final queue length
4448 total queue pushes
Completing instantiation... [0.460s CPU, 0.453s wall-clock]
Instantiating: [0.690s CPU, 0.692s wall-clock]
Computing fact groups...
Finding invariants...
12 initial candidates
Finding invariants: [0.030s CPU, 0.029s wall-clock]
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
Instantiating groups... [0.010s CPU, 0.012s wall-clock]
Collecting mutex groups... [0.010s CPU, 0.001s wall-clock]
Choosing groups...
0 uncovered facts
Choosing groups: [0.000s CPU, 0.003s wall-clock]
Building translation key... [0.000s CPU, 0.002s wall-clock]
Computing fact groups: [0.050s CPU, 0.054s wall-clock]
Building STRIPS to SAS dictionary... [0.010s 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.020s CPU, 0.018s wall-clock]
Translating task: [0.330s CPU, 0.332s 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.170s CPU, 0.166s wall-clock]
Reordering and filtering variables...
19 of 19 variables necessary.
0 of 19 mutex groups necessary.
1161 of 1161 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.050s CPU, 0.055s wall-clock]
Translator variables: 19
Translator derived variables: 0
Translator facts: 152
Translator goal facts: 2
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 1161
Translator axioms: 0
Translator task size: 6734
Translator peak memory: 40908 KB
Writing output... [0.110s CPU, 0.127s wall-clock]
Done! [1.450s CPU, 1.465s wall-clock]
planner.py version 0.0.1
Time: 0.27s
Memory: 67MB
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: 68MB (+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.07s
Memory: 68MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 69MB (+1MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.23s
Memory: 80MB (+11MB)
Solving...
Solving Time: 0.00s
Memory: 80MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.22s
Memory: 80MB (+0MB)
Solving...
Solving Time: 0.00s
Memory: 80MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.22s
Memory: 81MB (+1MB)
Solving...
Solving Time: 0.01s
Memory: 71MB (+-10MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 0.22s
Memory: 81MB (+10MB)
Answer: 4
occurs(action(("overcome","grief","satisfaction","scallion","mars","uranus")),1) occurs(action(("overcome","boils","satisfaction","scallion","mercury","mars")),2) occurs(action(("feast","satisfaction","scallion","guava","arizona","pennsylvania")),3) occurs(action(("succumb","grief","satisfaction","guava","mercury","mars")),4) occurs(action(("succumb","boils","satisfaction","guava","mars","uranus")),5)
SATISFIABLE
Models : 1+
Calls : 5
Time : 0.431s (Solving: 0.01s 1st Model: 0.01s Unsat: 0.00s)
CPU Time : 0.416s
Choices : 597 (Domain: 504)
Conflicts : 147 (Analyzed: 147)
Restarts : 1 (Average: 147.00 Last: 54)
Model-Level : 45.0
Problems : 5 (Average Length: 6.00 Splits: 0)
Lemmas : 147 (Deleted: 0)
Binary : 11 (Ratio: 7.48%)
Ternary : 5 (Ratio: 3.40%)
Conflict : 147 (Average Length: 18.8 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 147 (Average: 3.04 Max: 22 Sum: 447)
Executed : 146 (Average: 2.99 Max: 22 Sum: 440 Ratio: 98.43%)
Bounded : 1 (Average: 7.00 Max: 7 Sum: 7 Ratio: 1.57%)
Rules : 20871 (Original: 20832)
Atoms : 20846 (Original: 20827 Auxiliary: 19)
Bodies : 51 (Original: 20)
Count : 4 (Original: 5)
Equivalences : 56 (Atom=Atom: 15 Body=Body: 0 Other: 41)
Tight : Yes
Variables : 6116 (Eliminated: 0 Frozen: 2841)
Constraints : 21608 (Binary: 96.1% Ternary: 1.7% Other: 2.2%)
Memory Peak : 81MB
Max. Length : 5 steps
Sol. Length : 5 steps
Models : 4