Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #516974681
details
property
value
status
complete
benchmark
size-12-alpha-2-num-16.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n067.star.cs.uiowa.edu
space
Waldmann_07_size12
run statistics
property
value
solver
MnM 3.18b
configuration
default
runtime (wallclock)
2.25736498833 seconds
cpu usage
7.178872314
max memory
1.270095872E9
stage attributes
key
value
output-size
35140
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 3-rule system { 0 ⟶ , 0 0 ⟶ 1 , 1 0 1 ⟶ 0 0 1 1 1 } 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 8-rule system { 0 1 ⟶ 2 , 2 1 3 ⟶ 0 1 3 3 3 , 2 1 3 ⟶ 0 3 3 3 , 2 1 3 ⟶ 2 3 3 , 2 1 3 ⟶ 2 3 , 1 →= , 1 1 →= 3 , 3 1 3 →= 1 1 3 3 3 } 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, (2,3) ↦ 6, (3,1) ↦ 7, (3,3) ↦ 8, (3,5) ↦ 9, (0,3) ↦ 10, (4,1) ↦ 11, (4,3) ↦ 12 }, it remains to prove termination of the 49-rule system { 0 1 2 ⟶ 3 4 , 0 1 5 ⟶ 3 6 , 3 4 5 7 ⟶ 0 1 5 8 8 7 , 3 4 5 8 ⟶ 0 1 5 8 8 8 , 3 4 5 9 ⟶ 0 1 5 8 8 9 , 3 4 5 7 ⟶ 0 10 8 8 7 , 3 4 5 8 ⟶ 0 10 8 8 8 , 3 4 5 9 ⟶ 0 10 8 8 9 , 3 4 5 7 ⟶ 3 6 8 7 , 3 4 5 8 ⟶ 3 6 8 8 , 3 4 5 9 ⟶ 3 6 8 9 , 3 4 5 7 ⟶ 3 6 7 , 3 4 5 8 ⟶ 3 6 8 , 3 4 5 9 ⟶ 3 6 9 , 1 2 →= 1 , 1 5 →= 10 , 2 2 →= 2 , 2 5 →= 5 , 4 2 →= 4 , 4 5 →= 6 , 7 2 →= 7 , 7 5 →= 8 , 11 2 →= 11 , 11 5 →= 12 , 1 2 2 →= 10 7 , 1 2 5 →= 10 8 , 2 2 2 →= 5 7 , 2 2 5 →= 5 8 , 4 2 2 →= 6 7 , 4 2 5 →= 6 8 , 7 2 2 →= 8 7 , 7 2 5 →= 8 8 , 11 2 2 →= 12 7 , 11 2 5 →= 12 8 , 10 7 5 7 →= 1 2 5 8 8 7 , 10 7 5 8 →= 1 2 5 8 8 8 , 10 7 5 9 →= 1 2 5 8 8 9 , 5 7 5 7 →= 2 2 5 8 8 7 , 5 7 5 8 →= 2 2 5 8 8 8 , 5 7 5 9 →= 2 2 5 8 8 9 , 6 7 5 7 →= 4 2 5 8 8 7 , 6 7 5 8 →= 4 2 5 8 8 8 , 6 7 5 9 →= 4 2 5 8 8 9 , 8 7 5 7 →= 7 2 5 8 8 7 , 8 7 5 8 →= 7 2 5 8 8 8 , 8 7 5 9 →= 7 2 5 8 8 9 , 12 7 5 7 →= 11 2 5 8 8 7 , 12 7 5 8 →= 11 2 5 8 8 8 , 12 7 5 9 →= 11 2 5 8 8 9 } Applying sparse untiling TROCU(2) [Geser/Hofbauer/Waldmann, FSCD 2019]. After renaming modulo the bijection { 0 ↦ 0, 1 ↦ 1, 2 ↦ 2, 3 ↦ 3, 4 ↦ 4, 5 ↦ 5, 6 ↦ 6, 7 ↦ 7, 8 ↦ 8, 10 ↦ 9, 11 ↦ 10, 12 ↦ 11 }, it remains to prove termination of the 40-rule system { 0 1 2 ⟶ 3 4 , 0 1 5 ⟶ 3 6 , 3 4 5 7 ⟶ 0 1 5 8 8 7 , 3 4 5 8 ⟶ 0 1 5 8 8 8 , 3 4 5 7 ⟶ 0 9 8 8 7 , 3 4 5 8 ⟶ 0 9 8 8 8 , 3 4 5 7 ⟶ 3 6 8 7 , 3 4 5 8 ⟶ 3 6 8 8 , 3 4 5 7 ⟶ 3 6 7 , 3 4 5 8 ⟶ 3 6 8 , 1 2 →= 1 , 1 5 →= 9 , 2 2 →= 2 , 2 5 →= 5 , 4 2 →= 4 ,
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Standard