Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #516975473
details
property
value
status
complete
benchmark
size-12-alpha-3-num-443.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
Waldmann_07_size12
run statistics
property
value
solver
MnM 3.18b
configuration
default
runtime (wallclock)
8.25512599945 seconds
cpu usage
31.050758036
max memory
4.39549952E9
stage attributes
key
value
output-size
147709
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, c ↦ 2 }, it remains to prove termination of the 3-rule system { 0 ⟶ 1 2 , 0 1 ⟶ 2 0 , 2 2 2 ⟶ 0 1 } Applying sparse tiling TRFC(2) [Geser/Hofbauer/Waldmann, FSCD 2019]. After renaming modulo the bijection { (0,0) ↦ 0, (0,1) ↦ 1, (1,2) ↦ 2, (2,0) ↦ 3, (2,1) ↦ 4, (0,2) ↦ 5, (2,2) ↦ 6, (0,4) ↦ 7, (2,4) ↦ 8, (1,0) ↦ 9, (1,1) ↦ 10, (3,0) ↦ 11, (3,1) ↦ 12, (1,4) ↦ 13, (3,2) ↦ 14 }, it remains to prove termination of the 48-rule system { 0 0 ⟶ 1 2 3 , 0 1 ⟶ 1 2 4 , 0 5 ⟶ 1 2 6 , 0 7 ⟶ 1 2 8 , 9 0 ⟶ 10 2 3 , 9 1 ⟶ 10 2 4 , 9 5 ⟶ 10 2 6 , 9 7 ⟶ 10 2 8 , 3 0 ⟶ 4 2 3 , 3 1 ⟶ 4 2 4 , 3 5 ⟶ 4 2 6 , 3 7 ⟶ 4 2 8 , 11 0 ⟶ 12 2 3 , 11 1 ⟶ 12 2 4 , 11 5 ⟶ 12 2 6 , 11 7 ⟶ 12 2 8 , 0 1 9 ⟶ 5 3 0 , 0 1 10 ⟶ 5 3 1 , 0 1 2 ⟶ 5 3 5 , 0 1 13 ⟶ 5 3 7 , 9 1 9 ⟶ 2 3 0 , 9 1 10 ⟶ 2 3 1 , 9 1 2 ⟶ 2 3 5 , 9 1 13 ⟶ 2 3 7 , 3 1 9 ⟶ 6 3 0 , 3 1 10 ⟶ 6 3 1 , 3 1 2 ⟶ 6 3 5 , 3 1 13 ⟶ 6 3 7 , 11 1 9 ⟶ 14 3 0 , 11 1 10 ⟶ 14 3 1 , 11 1 2 ⟶ 14 3 5 , 11 1 13 ⟶ 14 3 7 , 5 6 6 3 ⟶ 0 1 9 , 5 6 6 4 ⟶ 0 1 10 , 5 6 6 6 ⟶ 0 1 2 , 5 6 6 8 ⟶ 0 1 13 , 2 6 6 3 ⟶ 9 1 9 , 2 6 6 4 ⟶ 9 1 10 , 2 6 6 6 ⟶ 9 1 2 , 2 6 6 8 ⟶ 9 1 13 , 6 6 6 3 ⟶ 3 1 9 , 6 6 6 4 ⟶ 3 1 10 , 6 6 6 6 ⟶ 3 1 2 , 6 6 6 8 ⟶ 3 1 13 , 14 6 6 3 ⟶ 11 1 9 , 14 6 6 4 ⟶ 11 1 10 , 14 6 6 6 ⟶ 11 1 2 , 14 6 6 8 ⟶ 11 1 13 } Applying sparse untiling TRFCU(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, 9 ↦ 9, 10 ↦ 10, 11 ↦ 11, 12 ↦ 12, 13 ↦ 13, 14 ↦ 14 }, it remains to prove termination of the 45-rule system { 0 0 ⟶ 1 2 3 , 0 1 ⟶ 1 2 4 , 0 5 ⟶ 1 2 6 , 0 7 ⟶ 1 2 8 , 9 0 ⟶ 10 2 3 , 9 1 ⟶ 10 2 4 , 9 5 ⟶ 10 2 6 , 9 7 ⟶ 10 2 8 , 3 0 ⟶ 4 2 3 , 3 1 ⟶ 4 2 4 , 3 5 ⟶ 4 2 6 , 3 7 ⟶ 4 2 8 , 11 1 ⟶ 12 2 4 , 0 1 9 ⟶ 5 3 0 , 0 1 10 ⟶ 5 3 1 , 0 1 2 ⟶ 5 3 5 , 0 1 13 ⟶ 5 3 7 , 9 1 9 ⟶ 2 3 0 , 9 1 10 ⟶ 2 3 1 , 9 1 2 ⟶ 2 3 5 , 9 1 13 ⟶ 2 3 7 , 3 1 9 ⟶ 6 3 0 , 3 1 10 ⟶ 6 3 1 , 3 1 2 ⟶ 6 3 5 , 3 1 13 ⟶ 6 3 7 , 11 1 9 ⟶ 14 3 0 , 11 1 10 ⟶ 14 3 1 , 11 1 2 ⟶ 14 3 5 , 11 1 13 ⟶ 14 3 7 ,
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Standard