Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #516972137
details
property
value
status
complete
benchmark
88156.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n177.star.cs.uiowa.edu
space
ICFP_2010
run statistics
property
value
solver
MnM 3.18b
configuration
default
runtime (wallclock)
2.06196093559 seconds
cpu usage
6.647216273
max memory
1.640665088E9
stage attributes
key
value
output-size
64943
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 { 0 ↦ 0, 1 ↦ 1, 2 ↦ 2, 3 ↦ 3 }, it remains to prove termination of the 30-rule system { 0 0 1 1 2 0 3 0 1 2 0 1 1 ⟶ 0 0 3 0 0 2 0 2 2 0 0 1 0 0 0 1 0 , 0 1 0 3 1 0 2 2 1 1 0 2 1 ⟶ 0 0 2 2 3 0 0 0 0 1 0 1 0 3 0 1 2 , 0 1 1 0 0 1 3 1 2 0 3 1 2 ⟶ 0 2 0 2 0 1 3 0 2 0 0 0 0 1 2 2 0 , 0 1 3 2 1 0 3 0 0 1 1 1 1 ⟶ 0 3 1 3 1 0 0 3 2 0 3 0 3 0 0 1 0 , 0 2 0 2 0 2 3 2 3 1 1 3 1 ⟶ 0 0 1 3 0 0 3 0 3 2 3 0 0 2 2 1 0 , 0 2 2 3 2 2 1 2 0 3 2 0 3 ⟶ 0 3 2 1 0 2 3 0 0 1 0 2 1 0 0 3 0 , 0 2 3 0 2 2 3 2 2 1 1 2 3 ⟶ 1 0 0 2 3 2 0 2 0 1 3 0 2 0 1 1 2 , 0 2 3 1 1 0 2 0 0 2 1 3 2 ⟶ 0 2 2 0 0 3 2 2 0 1 2 2 0 0 2 2 0 , 0 2 3 2 2 3 1 0 2 0 3 1 3 ⟶ 0 0 3 0 2 1 1 0 0 2 2 0 2 0 2 2 3 , 1 0 0 3 2 0 1 0 1 2 2 1 1 ⟶ 0 0 3 3 1 0 0 0 2 0 2 0 1 0 0 1 2 , 1 0 3 0 2 1 1 0 1 1 1 2 2 ⟶ 0 3 2 0 0 2 0 0 3 0 0 0 3 3 3 3 3 , 1 1 2 0 2 2 0 0 1 3 2 3 2 ⟶ 2 0 0 0 0 1 2 3 0 1 0 0 3 2 0 0 1 , 1 2 2 1 2 2 0 0 1 2 2 0 1 ⟶ 0 0 3 0 0 1 2 2 0 3 2 0 2 0 1 0 3 , 1 2 3 1 0 2 1 0 0 1 1 1 0 ⟶ 0 3 0 1 0 1 2 0 3 0 0 0 1 0 1 3 0 , 1 3 0 0 3 2 2 2 2 1 0 2 3 ⟶ 3 0 0 2 2 0 3 2 0 3 0 2 3 1 2 0 0 , 1 3 1 0 1 3 1 2 0 1 3 1 0 ⟶ 1 2 0 3 1 3 0 0 3 3 1 0 3 0 0 0 0 , 1 3 1 1 3 0 0 1 0 0 2 3 0 ⟶ 2 1 0 2 0 3 2 0 0 0 0 2 0 1 1 3 0 , 1 3 1 3 1 0 2 0 1 3 0 0 1 ⟶ 2 2 0 0 0 1 0 0 2 0 0 1 3 3 3 0 1 , 1 3 2 1 0 1 0 3 0 1 3 0 0 ⟶ 0 3 1 0 0 0 3 0 0 2 3 2 1 0 1 0 0 , 1 3 3 0 2 3 0 3 2 0 0 1 1 ⟶ 3 2 0 3 0 3 0 0 2 0 0 0 1 0 2 3 1 , 1 3 3 2 2 2 3 2 2 0 2 3 0 ⟶ 3 0 3 2 2 0 2 2 1 0 2 2 3 1 2 0 0 , 2 0 2 1 2 2 3 2 2 2 2 1 0 ⟶ 1 0 0 0 0 1 0 0 2 0 3 1 0 0 2 3 0 , 2 0 2 2 1 2 2 3 2 0 1 1 2 ⟶ 0 2 3 1 3 1 0 0 0 0 0 0 1 2 2 1 0 , 2 0 3 3 1 2 2 0 0 2 1 0 1 ⟶ 3 2 0 1 0 0 2 0 3 1 0 0 0 2 1 0 2 , 2 1 1 0 3 2 1 2 0 0 3 1 3 ⟶ 2 2 0 1 0 0 0 0 2 2 0 0 2 2 1 3 3 , 2 2 0 1 0 1 0 3 3 2 1 2 3 ⟶ 0 3 0 1 2 0 1 2 0 2 2 1 2 1 0 0 0 , 2 3 0 0 0 2 3 3 2 0 3 0 3 ⟶ 2 2 0 0 0 1 2 0 0 0 3 0 2 0 3 2 0 , 2 3 0 2 2 0 2 0 3 2 3 2 3 ⟶ 1 0 0 3 2 0 3 3 0 0 3 0 0 2 0 0 2 , 3 0 0 1 3 1 2 0 2 0 3 3 3 ⟶ 0 0 1 0 1 2 0 0 3 0 2 2 2 0 0 1 3 , 3 2 2 2 0 1 3 0 2 2 3 3 0 ⟶ 1 1 0 1 0 0 3 0 1 2 1 1 0 0 1 0 0 } The system was reversed. After renaming modulo the bijection { 1 ↦ 0, 0 ↦ 1, 2 ↦ 2, 3 ↦ 3 }, it remains to prove termination of the 30-rule system { 0 0 1 2 0 1 3 1 2 0 0 1 1 ⟶ 1 0 1 1 1 0 1 1 2 2 1 2 1 1 3 1 1 , 0 2 1 0 0 2 2 1 0 3 1 0 1 ⟶ 2 0 1 3 1 0 1 0 1 1 1 1 3 2 2 1 1 , 2 0 3 1 2 0 3 0 1 1 0 0 1 ⟶ 1 2 2 0 1 1 1 1 2 1 3 0 1 2 1 2 1 , 0 0 0 0 1 1 3 1 0 2 3 0 1 ⟶ 1 0 1 1 3 1 3 1 2 3 1 1 0 3 0 3 1 , 0 3 0 0 3 2 3 2 1 2 1 2 1 ⟶ 1 0 2 2 1 1 3 2 3 1 3 1 1 3 0 1 1 , 3 1 2 3 1 2 0 2 2 3 2 2 1 ⟶ 1 3 1 1 0 2 1 0 1 1 3 2 1 0 2 3 1 , 3 2 0 0 2 2 3 2 2 1 3 2 1 ⟶ 2 0 0 1 2 1 3 0 1 2 1 2 3 2 1 1 0 , 2 3 0 2 1 1 2 1 0 0 3 2 1 ⟶ 1 2 2 1 1 2 2 0 1 2 2 3 1 1 2 2 1 , 3 0 3 1 2 1 0 3 2 2 3 2 1 ⟶ 3 2 2 1 2 1 2 2 1 1 0 0 2 1 3 1 1 , 0 0 2 2 0 1 0 1 2 3 1 1 0 ⟶ 2 0 1 1 0 1 2 1 2 1 1 1 0 3 3 1 1 , 2 2 0 0 0 1 0 0 2 1 3 1 0 ⟶ 3 3 3 3 3 1 1 1 3 1 1 2 1 1 2 3 1 , 2 3 2 3 0 1 1 2 2 1 2 0 0 ⟶ 0 1 1 2 3 1 1 0 1 3 2 0 1 1 1 1 2 , 0 1 2 2 0 1 1 2 2 0 2 2 0 ⟶ 3 1 0 1 2 1 2 3 1 2 2 0 1 1 3 1 1 , 1 0 0 0 1 1 0 2 1 0 3 2 0 ⟶ 1 3 0 1 0 1 1 1 3 1 2 0 1 0 1 3 1 , 3 2 1 0 2 2 2 2 3 1 1 3 0 ⟶ 1 1 2 0 3 2 1 3 1 2 3 1 2 2 1 1 3 , 1 0 3 0 1 2 0 3 0 1 0 3 0 ⟶ 1 1 1 1 3 1 0 3 3 1 1 3 0 3 1 2 0 , 1 3 2 1 1 0 1 1 3 0 0 3 0 ⟶ 1 3 0 0 1 2 1 1 1 1 2 3 1 2 1 0 2 , 0 1 1 3 0 1 2 1 0 3 0 3 0 ⟶ 0 1 3 3 3 0 1 1 2 1 1 0 1 1 1 2 2 , 1 1 3 0 1 3 1 0 1 0 2 3 0 ⟶ 1 1 0 1 0 2 3 2 1 1 3 1 1 1 0 3 1 , 0 0 1 1 2 3 1 3 2 1 3 3 0 ⟶ 0 3 2 1 0 1 1 1 2 1 1 3 1 3 1 2 3 , 1 3 2 1 2 2 3 2 2 2 3 3 0 ⟶ 1 1 2 0 3 2 2 1 0 2 2 1 2 2 3 1 3 , 1 0 2 2 2 2 3 2 2 0 2 1 2 ⟶ 1 3 2 1 1 0 3 1 2 1 1 0 1 1 1 1 0 , 2 0 0 1 2 3 2 2 0 2 2 1 2 ⟶ 1 0 2 2 0 1 1 1 1 1 1 0 3 0 3 2 1 , 0 1 0 2 1 1 2 2 0 3 3 1 2 ⟶ 2 1 0 2 1 1 1 0 3 1 2 1 1 0 1 2 3 , 3 0 3 1 1 2 0 2 3 1 0 0 2 ⟶ 3 3 0 2 2 1 1 2 2 1 1 1 1 0 1 2 2 , 3 2 0 2 3 3 1 0 1 0 1 2 2 ⟶ 1 1 1 0 2 0 2 2 1 2 0 1 2 0 1 3 1 , 3 1 3 1 2 3 3 2 1 1 1 3 2 ⟶ 1 2 3 1 2 1 3 1 1 1 2 0 1 1 1 2 2 , 3 2 3 2 3 1 2 1 2 2 1 3 2 ⟶ 2 1 1 2 1 1 3 1 1 3 3 1 2 3 1 1 0 , 3 3 3 1 2 1 2 0 3 0 1 1 3 ⟶ 3 0 1 1 2 2 2 1 3 1 1 2 0 1 0 1 1 , 1 3 3 2 2 1 3 0 1 2 2 2 3 ⟶ 1 1 0 1 1 0 0 2 0 1 3 1 1 0 1 0 0 } 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, (1,3) ↦ 4, (3,1) ↦ 5, (1,1) ↦ 6, (1,0) ↦ 7, (2,2) ↦ 8, (2,1) ↦ 9, (1,5) ↦ 10, (3,0) ↦ 11, (4,0) ↦ 12, (4,1) ↦ 13, (0,2) ↦ 14, (0,3) ↦ 15, (3,2) ↦ 16, (4,2) ↦ 17, (2,3) ↦ 18, (3,3) ↦ 19, (4,3) ↦ 20, (0,5) ↦ 21, (2,5) ↦ 22, (3,5) ↦ 23 }, it remains to prove termination of the 750-rule system { 0 0 1 2 3 1 4 5 2 3 0 1 6 7 ⟶ 1 7 1 6 6 7 1 6 2 8 9 2 9 6 4 5 6 7 , 0 0 1 2 3 1 4 5 2 3 0 1 6 6 ⟶ 1 7 1 6 6 7 1 6 2 8 9 2 9 6 4 5 6 6 , 0 0 1 2 3 1 4 5 2 3 0 1 6 2 ⟶ 1 7 1 6 6 7 1 6 2 8 9 2 9 6 4 5 6 2 , 0 0 1 2 3 1 4 5 2 3 0 1 6 4 ⟶ 1 7 1 6 6 7 1 6 2 8 9 2 9 6 4 5 6 4 , 0 0 1 2 3 1 4 5 2 3 0 1 6 10 ⟶ 1 7 1 6 6 7 1 6 2 8 9 2 9 6 4 5 6 10 , 7 0 1 2 3 1 4 5 2 3 0 1 6 7 ⟶ 6 7 1 6 6 7 1 6 2 8 9 2 9 6 4 5 6 7 , 7 0 1 2 3 1 4 5 2 3 0 1 6 6 ⟶ 6 7 1 6 6 7 1 6 2 8 9 2 9 6 4 5 6 6 , 7 0 1 2 3 1 4 5 2 3 0 1 6 2 ⟶ 6 7 1 6 6 7 1 6 2 8 9 2 9 6 4 5 6 2 , 7 0 1 2 3 1 4 5 2 3 0 1 6 4 ⟶ 6 7 1 6 6 7 1 6 2 8 9 2 9 6 4 5 6 4 , 7 0 1 2 3 1 4 5 2 3 0 1 6 10 ⟶ 6 7 1 6 6 7 1 6 2 8 9 2 9 6 4 5 6 10 , 3 0 1 2 3 1 4 5 2 3 0 1 6 7 ⟶ 9 7 1 6 6 7 1 6 2 8 9 2 9 6 4 5 6 7 , 3 0 1 2 3 1 4 5 2 3 0 1 6 6 ⟶ 9 7 1 6 6 7 1 6 2 8 9 2 9 6 4 5 6 6 , 3 0 1 2 3 1 4 5 2 3 0 1 6 2 ⟶ 9 7 1 6 6 7 1 6 2 8 9 2 9 6 4 5 6 2 , 3 0 1 2 3 1 4 5 2 3 0 1 6 4 ⟶ 9 7 1 6 6 7 1 6 2 8 9 2 9 6 4 5 6 4 , 3 0 1 2 3 1 4 5 2 3 0 1 6 10 ⟶ 9 7 1 6 6 7 1 6 2 8 9 2 9 6 4 5 6 10 , 11 0 1 2 3 1 4 5 2 3 0 1 6 7 ⟶ 5 7 1 6 6 7 1 6 2 8 9 2 9 6 4 5 6 7 , 11 0 1 2 3 1 4 5 2 3 0 1 6 6 ⟶ 5 7 1 6 6 7 1 6 2 8 9 2 9 6 4 5 6 6 , 11 0 1 2 3 1 4 5 2 3 0 1 6 2 ⟶ 5 7 1 6 6 7 1 6 2 8 9 2 9 6 4 5 6 2 , 11 0 1 2 3 1 4 5 2 3 0 1 6 4 ⟶ 5 7 1 6 6 7 1 6 2 8 9 2 9 6 4 5 6 4 , 11 0 1 2 3 1 4 5 2 3 0 1 6 10 ⟶ 5 7 1 6 6 7 1 6 2 8 9 2 9 6 4 5 6 10 ,
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Standard