Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #516975143
details
property
value
status
complete
benchmark
size-12-alpha-3-num-484.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n174.star.cs.uiowa.edu
space
Waldmann_07_size12
run statistics
property
value
solver
MnM 3.18b
configuration
default
runtime (wallclock)
3.80182003975 seconds
cpu usage
12.990379628
max memory
2.446360576E9
stage attributes
key
value
output-size
124342
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES After renaming modulo the bijection { a ↦ 0, b ↦ 1, c ↦ 2 }, it remains to prove termination of the 3-rule system { 0 0 ⟶ 0 1 2 1 , 1 2 ⟶ , 2 1 ⟶ 0 2 } The system was reversed. After renaming modulo the bijection { 0 ↦ 0, 1 ↦ 1, 2 ↦ 2 }, it remains to prove termination of the 3-rule system { 0 0 ⟶ 1 2 1 0 , 2 1 ⟶ , 1 2 ⟶ 2 0 } Applying the dependency pairs transformation. Here, ↑ marks so-called defined symbols. After renaming modulo the bijection { (0,↑) ↦ 0, (0,↓) ↦ 1, (1,↑) ↦ 2, (2,↓) ↦ 3, (1,↓) ↦ 4, (2,↑) ↦ 5 }, it remains to prove termination of the 8-rule system { 0 1 ⟶ 2 3 4 1 , 0 1 ⟶ 5 4 1 , 0 1 ⟶ 2 1 , 2 3 ⟶ 5 1 , 2 3 ⟶ 0 , 1 1 →= 4 3 4 1 , 3 4 →= , 4 3 →= 3 1 } The system was filtered by the following matrix interpretation of type E_J with J = {1,...,2} and dimension 2: 0 ↦ ⎛ ⎞ ⎜ 1 1 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 1 ↦ ⎛ ⎞ ⎜ 1 0 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 2 ↦ ⎛ ⎞ ⎜ 1 1 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 3 ↦ ⎛ ⎞ ⎜ 1 0 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 4 ↦ ⎛ ⎞ ⎜ 1 0 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 5 ↦ ⎛ ⎞ ⎜ 1 0 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ After renaming modulo the bijection { 0 ↦ 0, 1 ↦ 1, 2 ↦ 2, 3 ↦ 3, 4 ↦ 4 }, it remains to prove termination of the 6-rule system { 0 1 ⟶ 2 3 4 1 , 0 1 ⟶ 2 1 , 2 3 ⟶ 0 , 1 1 →= 4 3 4 1 , 3 4 →= , 4 3 →= 3 1 } Applying sparse tiling TROC(2) [Geser/Hofbauer/Waldmann, FSCD 2019]. After renaming modulo the bijection { (5,0) ↦ 0, (0,1) ↦ 1, (1,1) ↦ 2, (5,2) ↦ 3, (2,3) ↦ 4, (3,4) ↦ 5, (4,1) ↦ 6, (1,3) ↦ 7, (1,4) ↦ 8, (1,6) ↦ 9, (2,1) ↦ 10, (3,1) ↦ 11, (3,3) ↦ 12, (0,3) ↦ 13, (0,4) ↦ 14, (4,3) ↦ 15, (2,4) ↦ 16, (4,4) ↦ 17, (5,1) ↦ 18, (5,4) ↦ 19, (5,3) ↦ 20 }, it remains to prove termination of the 71-rule system { 0 1 2 ⟶ 3 4 5 6 2 , 0 1 7 ⟶ 3 4 5 6 7 , 0 1 8 ⟶ 3 4 5 6 8 , 0 1 9 ⟶ 3 4 5 6 9 , 0 1 2 ⟶ 3 10 2 , 0 1 7 ⟶ 3 10 7 , 0 1 8 ⟶ 3 10 8 , 0 1 9 ⟶ 3 10 9 , 3 4 11 ⟶ 0 1 , 3 4 12 ⟶ 0 13 , 3 4 5 ⟶ 0 14 , 1 2 2 →= 14 15 5 6 2 , 1 2 7 →= 14 15 5 6 7 , 1 2 8 →= 14 15 5 6 8 , 1 2 9 →= 14 15 5 6 9 , 2 2 2 →= 8 15 5 6 2 , 2 2 7 →= 8 15 5 6 7 , 2 2 8 →= 8 15 5 6 8 , 2 2 9 →= 8 15 5 6 9 ,
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Standard