Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #516971831
details
property
value
status
complete
benchmark
28464.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n010.star.cs.uiowa.edu
space
ICFP_2010
run statistics
property
value
solver
MnM 3.18b
configuration
default
runtime (wallclock)
6.02858805656 seconds
cpu usage
21.942195544
max memory
4.325453824E9
stage attributes
key
value
output-size
49090
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 }, it remains to prove termination of the 19-rule system { 0 1 2 1 ⟶ 1 2 1 1 0 1 2 0 1 2 , 0 1 2 1 ⟶ 1 2 1 1 0 1 2 0 1 2 0 1 2 , 0 1 2 1 ⟶ 1 2 1 1 0 1 2 0 1 2 0 1 2 0 1 2 , 0 1 2 1 ⟶ 1 2 1 1 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 , 0 1 2 1 ⟶ 1 2 1 1 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 , 0 1 2 1 ⟶ 1 2 1 1 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 , 0 1 2 1 ⟶ 1 2 1 1 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 , 0 1 2 1 ⟶ 1 2 1 1 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 , 0 1 2 1 ⟶ 1 2 1 1 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 , 0 1 2 1 ⟶ 1 2 1 1 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 , 0 1 2 1 ⟶ 1 2 1 1 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 , 0 1 2 1 ⟶ 1 2 1 1 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 , 0 1 2 1 ⟶ 1 2 1 1 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 , 0 1 2 1 ⟶ 1 2 1 1 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 , 0 1 2 1 ⟶ 1 2 1 1 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 , 0 1 2 1 ⟶ 1 2 1 1 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 , 0 1 2 1 ⟶ 1 2 1 1 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 , 0 1 2 1 ⟶ 1 2 1 1 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 , 0 1 2 1 ⟶ 1 2 1 1 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 } The system was reversed. After renaming modulo the bijection { 1 ↦ 0, 2 ↦ 1, 0 ↦ 2 }, it remains to prove termination of the 19-rule system { 0 1 0 2 ⟶ 1 0 2 1 0 2 0 0 1 0 , 0 1 0 2 ⟶ 1 0 2 1 0 2 1 0 2 0 0 1 0 , 0 1 0 2 ⟶ 1 0 2 1 0 2 1 0 2 1 0 2 0 0 1 0 , 0 1 0 2 ⟶ 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 0 0 1 0 , 0 1 0 2 ⟶ 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 0 0 1 0 , 0 1 0 2 ⟶ 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 0 0 1 0 , 0 1 0 2 ⟶ 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 0 0 1 0 , 0 1 0 2 ⟶ 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 0 0 1 0 , 0 1 0 2 ⟶ 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 0 0 1 0 , 0 1 0 2 ⟶ 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 0 0 1 0 , 0 1 0 2 ⟶ 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 0 0 1 0 , 0 1 0 2 ⟶ 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 0 0 1 0 , 0 1 0 2 ⟶ 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 0 0 1 0 , 0 1 0 2 ⟶ 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 0 0 1 0 , 0 1 0 2 ⟶ 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 0 0 1 0 , 0 1 0 2 ⟶ 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 0 0 1 0 , 0 1 0 2 ⟶ 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 0 0 1 0 , 0 1 0 2 ⟶ 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 0 0 1 0 , 0 1 0 2 ⟶ 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 1 0 2 0 0 1 0 } Applying sparse tiling TRFC(2) [Geser/Hofbauer/Waldmann, FSCD 2019]. After renaming modulo the bijection { (0,0) ↦ 0, (0,1) ↦ 1, (1,0) ↦ 2, (0,2) ↦ 3, (2,0) ↦ 4, (2,1) ↦ 5, (1,1) ↦ 6 }, it remains to prove termination of the 114-rule system { 0 1 2 3 4 ⟶ 1 2 3 5 2 3 4 0 1 2 0 , 0 1 2 3 5 ⟶ 1 2 3 5 2 3 4 0 1 2 1 , 2 1 2 3 4 ⟶ 6 2 3 5 2 3 4 0 1 2 0 , 2 1 2 3 5 ⟶ 6 2 3 5 2 3 4 0 1 2 1 , 4 1 2 3 4 ⟶ 5 2 3 5 2 3 4 0 1 2 0 , 4 1 2 3 5 ⟶ 5 2 3 5 2 3 4 0 1 2 1 , 0 1 2 3 4 ⟶ 1 2 3 5 2 3 5 2 3 4 0 1 2 0 , 0 1 2 3 5 ⟶ 1 2 3 5 2 3 5 2 3 4 0 1 2 1 , 2 1 2 3 4 ⟶ 6 2 3 5 2 3 5 2 3 4 0 1 2 0 , 2 1 2 3 5 ⟶ 6 2 3 5 2 3 5 2 3 4 0 1 2 1 , 4 1 2 3 4 ⟶ 5 2 3 5 2 3 5 2 3 4 0 1 2 0 , 4 1 2 3 5 ⟶ 5 2 3 5 2 3 5 2 3 4 0 1 2 1 , 0 1 2 3 4 ⟶ 1 2 3 5 2 3 5 2 3 5 2 3 4 0 1 2 0 , 0 1 2 3 5 ⟶ 1 2 3 5 2 3 5 2 3 5 2 3 4 0 1 2 1 , 2 1 2 3 4 ⟶ 6 2 3 5 2 3 5 2 3 5 2 3 4 0 1 2 0 , 2 1 2 3 5 ⟶ 6 2 3 5 2 3 5 2 3 5 2 3 4 0 1 2 1 , 4 1 2 3 4 ⟶ 5 2 3 5 2 3 5 2 3 5 2 3 4 0 1 2 0 , 4 1 2 3 5 ⟶ 5 2 3 5 2 3 5 2 3 5 2 3 4 0 1 2 1 , 0 1 2 3 4 ⟶ 1 2 3 5 2 3 5 2 3 5 2 3 5 2 3 4 0 1 2 0 , 0 1 2 3 5 ⟶ 1 2 3 5 2 3 5 2 3 5 2 3 5 2 3 4 0 1 2 1 , 2 1 2 3 4 ⟶ 6 2 3 5 2 3 5 2 3 5 2 3 5 2 3 4 0 1 2 0 , 2 1 2 3 5 ⟶ 6 2 3 5 2 3 5 2 3 5 2 3 5 2 3 4 0 1 2 1 , 4 1 2 3 4 ⟶ 5 2 3 5 2 3 5 2 3 5 2 3 5 2 3 4 0 1 2 0 , 4 1 2 3 5 ⟶ 5 2 3 5 2 3 5 2 3 5 2 3 5 2 3 4 0 1 2 1 , 0 1 2 3 4 ⟶ 1 2 3 5 2 3 5 2 3 5 2 3 5 2 3 5 2 3 4 0 1 2 0 , 0 1 2 3 5 ⟶ 1 2 3 5 2 3 5 2 3 5 2 3 5 2 3 5 2 3 4 0 1 2 1 , 2 1 2 3 4 ⟶ 6 2 3 5 2 3 5 2 3 5 2 3 5 2 3 5 2 3 4 0 1 2 0 , 2 1 2 3 5 ⟶ 6 2 3 5 2 3 5 2 3 5 2 3 5 2 3 5 2 3 4 0 1 2 1 , 4 1 2 3 4 ⟶ 5 2 3 5 2 3 5 2 3 5 2 3 5 2 3 5 2 3 4 0 1 2 0 , 4 1 2 3 5 ⟶ 5 2 3 5 2 3 5 2 3 5 2 3 5 2 3 5 2 3 4 0 1 2 1 , 0 1 2 3 4 ⟶ 1 2 3 5 2 3 5 2 3 5 2 3 5 2 3 5 2 3 5 2 3 4 0 1 2 0 , 0 1 2 3 5 ⟶ 1 2 3 5 2 3 5 2 3 5 2 3 5 2 3 5 2 3 5 2 3 4 0 1 2 1 , 2 1 2 3 4 ⟶ 6 2 3 5 2 3 5 2 3 5 2 3 5 2 3 5 2 3 5 2 3 4 0 1 2 0 , 2 1 2 3 5 ⟶ 6 2 3 5 2 3 5 2 3 5 2 3 5 2 3 5 2 3 5 2 3 4 0 1 2 1 , 4 1 2 3 4 ⟶ 5 2 3 5 2 3 5 2 3 5 2 3 5 2 3 5 2 3 5 2 3 4 0 1 2 0 , 4 1 2 3 5 ⟶ 5 2 3 5 2 3 5 2 3 5 2 3 5 2 3 5 2 3 5 2 3 4 0 1 2 1 , 0 1 2 3 4 ⟶ 1 2 3 5 2 3 5 2 3 5 2 3 5 2 3 5 2 3 5 2 3 5 2 3 4 0 1 2 0 , 0 1 2 3 5 ⟶ 1 2 3 5 2 3 5 2 3 5 2 3 5 2 3 5 2 3 5 2 3 5 2 3 4 0 1 2 1 , 2 1 2 3 4 ⟶ 6 2 3 5 2 3 5 2 3 5 2 3 5 2 3 5 2 3 5 2 3 5 2 3 4 0 1 2 0 , 2 1 2 3 5 ⟶ 6 2 3 5 2 3 5 2 3 5 2 3 5 2 3 5 2 3 5 2 3 5 2 3 4 0 1 2 1 , 4 1 2 3 4 ⟶ 5 2 3 5 2 3 5 2 3 5 2 3 5 2 3 5 2 3 5 2 3 5 2 3 4 0 1 2 0 , 4 1 2 3 5 ⟶ 5 2 3 5 2 3 5 2 3 5 2 3 5 2 3 5 2 3 5 2 3 5 2 3 4 0 1 2 1 ,
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Standard