Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #516975983
details
property
value
status
complete
benchmark
dup08.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n078.star.cs.uiowa.edu
space
Trafo_06
run statistics
property
value
solver
MnM 3.18b
configuration
default
runtime (wallclock)
0.958539962769 seconds
cpu usage
2.095237831
max memory
6.79047168E8
stage attributes
key
value
output-size
1800
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/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 0 1 1 ⟶ 1 1 0 0 1 1 , 1 1 0 0 ⟶ 0 0 1 1 1 1 , 1 1 2 2 0 0 ⟶ 2 2 2 2 0 0 0 0 1 1 } Applying sparse untiling TRFCU(2) after reversal [Geser/Hofbauer/Waldmann, FSCD 2019]. After renaming modulo the bijection { 1 ↦ 0, 0 ↦ 1 }, it remains to prove termination of the 2-rule system { 0 0 0 0 1 1 ⟶ 1 1 0 0 1 1 , 1 1 0 0 ⟶ 0 0 1 1 1 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 ⎟ ⎝ ⎠ After renaming modulo the bijection { 1 ↦ 0, 0 ↦ 1 }, it remains to prove termination of the 1-rule system { 0 0 1 1 ⟶ 1 1 0 0 0 0 } Applying the dependency pairs transformation. Here, ↑ marks so-called defined symbols. After renaming modulo the bijection { (0,↑) ↦ 0, (0,↓) ↦ 1, (1,↓) ↦ 2 }, it remains to prove termination of the 5-rule system { 0 1 2 2 ⟶ 0 1 1 1 , 0 1 2 2 ⟶ 0 1 1 , 0 1 2 2 ⟶ 0 1 , 0 1 2 2 ⟶ 0 , 1 1 2 2 →= 2 2 1 1 1 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 ⎟ ⎝ ⎠ After renaming modulo the bijection { 1 ↦ 0, 2 ↦ 1 }, it remains to prove termination of the 1-rule system { 0 0 1 1 →= 1 1 0 0 0 0 } The system is trivially terminating.
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Standard