Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #516969251
details
property
value
status
complete
benchmark
2.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n168.star.cs.uiowa.edu
space
Mixed_SRS
run statistics
property
value
solver
MnM 3.18b
configuration
default
runtime (wallclock)
2.6022670269 seconds
cpu usage
8.706129944
max memory
1.659219968E9
stage attributes
key
value
output-size
33107
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 }, it remains to prove termination of the 2-rule system { 0 0 0 ⟶ 0 0 1 , 1 0 1 ⟶ 0 1 0 } The system was reversed. After renaming modulo the bijection { 0 ↦ 0, 1 ↦ 1 }, it remains to prove termination of the 2-rule system { 0 0 0 ⟶ 1 0 0 , 1 0 1 ⟶ 0 1 0 } Applying the dependency pairs transformation. Here, ↑ marks so-called defined symbols. After renaming modulo the bijection { (0,↑) ↦ 0, (0,↓) ↦ 1, (1,↑) ↦ 2, (1,↓) ↦ 3 }, it remains to prove termination of the 6-rule system { 0 1 1 ⟶ 2 1 1 , 2 1 3 ⟶ 0 3 1 , 2 1 3 ⟶ 2 1 , 2 1 3 ⟶ 0 , 1 1 1 →= 3 1 1 , 3 1 3 →= 1 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 1 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 2 ↦ ⎛ ⎞ ⎜ 1 1 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 3 ↦ ⎛ ⎞ ⎜ 1 1 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ After renaming modulo the bijection { 0 ↦ 0, 1 ↦ 1, 2 ↦ 2, 3 ↦ 3 }, it remains to prove termination of the 4-rule system { 0 1 1 ⟶ 2 1 1 , 2 1 3 ⟶ 0 3 1 , 1 1 1 →= 3 1 1 , 3 1 3 →= 1 3 1 } Applying sparse tiling TROC(2) [Geser/Hofbauer/Waldmann, FSCD 2019]. After renaming modulo the bijection { (4,0) ↦ 0, (0,1) ↦ 1, (1,1) ↦ 2, (4,2) ↦ 3, (2,1) ↦ 4, (1,3) ↦ 5, (1,5) ↦ 6, (3,1) ↦ 7, (0,3) ↦ 8, (3,3) ↦ 9, (2,3) ↦ 10, (4,1) ↦ 11, (4,3) ↦ 12 }, it remains to prove termination of the 30-rule system { 0 1 2 2 ⟶ 3 4 2 2 , 0 1 2 5 ⟶ 3 4 2 5 , 0 1 2 6 ⟶ 3 4 2 6 , 3 4 5 7 ⟶ 0 8 7 2 , 3 4 5 9 ⟶ 0 8 7 5 , 1 2 2 2 →= 8 7 2 2 , 1 2 2 5 →= 8 7 2 5 , 1 2 2 6 →= 8 7 2 6 , 2 2 2 2 →= 5 7 2 2 , 2 2 2 5 →= 5 7 2 5 , 2 2 2 6 →= 5 7 2 6 , 4 2 2 2 →= 10 7 2 2 , 4 2 2 5 →= 10 7 2 5 , 4 2 2 6 →= 10 7 2 6 , 7 2 2 2 →= 9 7 2 2 , 7 2 2 5 →= 9 7 2 5 , 7 2 2 6 →= 9 7 2 6 , 11 2 2 2 →= 12 7 2 2 , 11 2 2 5 →= 12 7 2 5 , 11 2 2 6 →= 12 7 2 6 , 8 7 5 7 →= 1 5 7 2 , 8 7 5 9 →= 1 5 7 5 , 5 7 5 7 →= 2 5 7 2 , 5 7 5 9 →= 2 5 7 5 , 10 7 5 7 →= 4 5 7 2 , 10 7 5 9 →= 4 5 7 5 , 9 7 5 7 →= 7 5 7 2 , 9 7 5 9 →= 7 5 7 5 , 12 7 5 7 →= 11 5 7 2 , 12 7 5 9 →= 11 5 7 5 } The system was filtered by the following matrix interpretation of type E_J with J = {1,...,2} and dimension 5: 0 ↦ ⎛ ⎞
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Standard