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