Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #516972935
details
property
value
status
complete
benchmark
13.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n008.star.cs.uiowa.edu
space
Bouchare_06
run statistics
property
value
solver
MnM 3.18b
configuration
default
runtime (wallclock)
1.78463196754 seconds
cpu usage
5.284612102
max memory
1.1200512E9
stage attributes
key
value
output-size
28151
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 }, it remains to prove termination of the 3-rule system { 0 0 1 ⟶ 0 , 0 1 0 ⟶ 1 1 0 , 1 1 ⟶ 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, (1,↑) ↦ 3 }, it remains to prove termination of the 8-rule system { 0 1 2 ⟶ 0 , 0 2 1 ⟶ 3 2 1 , 3 2 ⟶ 0 1 1 , 3 2 ⟶ 0 1 , 3 2 ⟶ 0 , 1 1 2 →= 1 , 1 2 1 →= 2 2 1 , 2 2 →= 1 1 1 } Applying sparse tiling TROC(2) [Geser/Hofbauer/Waldmann, FSCD 2019]. After renaming modulo the bijection { (4,0) ↦ 0, (0,1) ↦ 1, (1,2) ↦ 2, (2,1) ↦ 3, (2,2) ↦ 4, (0,2) ↦ 5, (1,1) ↦ 6, (4,3) ↦ 7, (3,2) ↦ 8, (1,5) ↦ 9, (3,1) ↦ 10, (4,1) ↦ 11, (4,2) ↦ 12 }, it remains to prove termination of the 46-rule system { 0 1 2 3 ⟶ 0 1 , 0 1 2 4 ⟶ 0 5 , 0 5 3 6 ⟶ 7 8 3 6 , 0 5 3 2 ⟶ 7 8 3 2 , 0 5 3 9 ⟶ 7 8 3 9 , 7 8 3 ⟶ 0 1 6 6 , 7 8 4 ⟶ 0 1 6 2 , 7 8 3 ⟶ 0 1 6 , 7 8 4 ⟶ 0 1 2 , 7 8 3 ⟶ 0 1 , 7 8 4 ⟶ 0 5 , 1 6 2 3 →= 1 6 , 1 6 2 4 →= 1 2 , 6 6 2 3 →= 6 6 , 6 6 2 4 →= 6 2 , 3 6 2 3 →= 3 6 , 3 6 2 4 →= 3 2 , 10 6 2 3 →= 10 6 , 10 6 2 4 →= 10 2 , 11 6 2 3 →= 11 6 , 11 6 2 4 →= 11 2 , 1 2 3 6 →= 5 4 3 6 , 1 2 3 2 →= 5 4 3 2 , 1 2 3 9 →= 5 4 3 9 , 6 2 3 6 →= 2 4 3 6 , 6 2 3 2 →= 2 4 3 2 , 6 2 3 9 →= 2 4 3 9 , 3 2 3 6 →= 4 4 3 6 , 3 2 3 2 →= 4 4 3 2 , 3 2 3 9 →= 4 4 3 9 , 10 2 3 6 →= 8 4 3 6 , 10 2 3 2 →= 8 4 3 2 , 10 2 3 9 →= 8 4 3 9 , 11 2 3 6 →= 12 4 3 6 , 11 2 3 2 →= 12 4 3 2 , 11 2 3 9 →= 12 4 3 9 , 5 4 3 →= 1 6 6 6 , 5 4 4 →= 1 6 6 2 , 2 4 3 →= 6 6 6 6 , 2 4 4 →= 6 6 6 2 , 4 4 3 →= 3 6 6 6 , 4 4 4 →= 3 6 6 2 , 8 4 3 →= 10 6 6 6 , 8 4 4 →= 10 6 6 2 , 12 4 3 →= 11 6 6 6 , 12 4 4 →= 11 6 6 2 } Applying sparse tiling TROC(2) [Geser/Hofbauer/Waldmann, FSCD 2019]. After renaming modulo the bijection { (13,0) ↦ 0, (0,1) ↦ 1, (1,2) ↦ 2, (2,3) ↦ 3, (3,2) ↦ 4, (3,6) ↦ 5, (1,6) ↦ 6, (3,9) ↦ 7, (1,9) ↦ 8, (2,4) ↦ 9, (4,3) ↦ 10, (0,5) ↦ 11, (5,3) ↦ 12, (4,4) ↦ 13, (5,4) ↦ 14, (6,2) ↦ 15, (13,7) ↦ 16, (7,8) ↦ 17, (8,3) ↦ 18, (6,6) ↦ 19, (6,9) ↦ 20, (6,14) ↦ 21, (2,14) ↦ 22, (9,14) ↦ 23, (8,4) ↦ 24, (13,1) ↦ 25, (10,6) ↦ 26, (11,6) ↦ 27, (13,6) ↦ 28, (12,3) ↦ 29, (13,3) ↦ 30, (7,10) ↦ 31, (13,10) ↦ 32, (10,2) ↦ 33, (13,11) ↦ 34, (11,2) ↦ 35, (13,5) ↦ 36, (13,2) ↦ 37, (12,4) ↦ 38, (13,4) ↦ 39, (13,8) ↦ 40, (13,12) ↦ 41 }, it remains to prove termination of the 334-rule system { 0 1 2 3 4 ⟶ 0 1 2 , 0 1 2 3 5 ⟶ 0 1 6 , 0 1 2 3 7 ⟶ 0 1 8 , 0 1 2 9 10 ⟶ 0 11 12 , 0 1 2 9 13 ⟶ 0 11 14 , 0 11 12 5 15 ⟶ 16 17 18 5 15 , 0 11 12 5 19 ⟶ 16 17 18 5 19 , 0 11 12 5 20 ⟶ 16 17 18 5 20 , 0 11 12 5 21 ⟶ 16 17 18 5 21 , 0 11 12 4 3 ⟶ 16 17 18 4 3 , 0 11 12 4 9 ⟶ 16 17 18 4 9 , 0 11 12 4 22 ⟶ 16 17 18 4 22 , 0 11 12 7 23 ⟶ 16 17 18 7 23 , 16 17 18 4 ⟶ 0 1 6 19 15 , 16 17 18 5 ⟶ 0 1 6 19 19 , 16 17 18 7 ⟶ 0 1 6 19 20 , 16 17 24 10 ⟶ 0 1 6 15 3 , 16 17 24 13 ⟶ 0 1 6 15 9 ,
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Standard