Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #487516308
details
property
value
status
complete
benchmark
212693.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n057.star.cs.uiowa.edu
space
ICFP_2010
run statistics
property
value
solver
MultumNonMulta 3.16 29 June 2020 60G
configuration
default
runtime (wallclock)
2.26267290115 seconds
cpu usage
7.38688432
max memory
1.390227456E9
stage attributes
key
value
output-size
91834
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 { 0->0, 1->1, 2->2, 3->3, 4->4, 5->5 }, it remains to prove termination of the 49-rule system { 0 1 2 -> 0 0 2 1 , 0 1 2 -> 0 2 1 3 , 0 1 2 -> 0 0 2 1 4 4 , 0 3 1 -> 0 1 3 4 0 , 0 3 1 -> 0 1 3 4 4 , 0 3 1 -> 1 3 4 4 4 0 , 0 3 2 -> 0 2 1 3 , 0 3 2 -> 0 2 3 4 , 0 3 2 -> 0 0 2 4 3 , 0 3 2 -> 0 2 1 4 3 , 0 3 2 -> 0 2 4 3 3 , 0 3 2 -> 0 2 1 3 3 4 , 0 3 2 -> 0 2 3 4 5 5 , 0 3 2 -> 2 4 4 3 4 0 , 0 4 1 -> 0 1 4 4 , 0 4 1 -> 0 2 1 4 , 0 4 2 -> 0 2 1 4 , 0 4 2 -> 0 2 3 4 , 0 4 2 -> 0 2 4 3 , 2 0 1 -> 5 0 2 1 , 2 3 1 -> 1 3 5 2 , 2 3 1 -> 0 2 1 3 5 , 2 3 1 -> 1 4 3 5 2 , 0 2 0 1 -> 5 0 0 2 1 , 0 3 1 1 -> 0 1 4 1 3 4 , 0 3 2 1 -> 0 0 3 4 2 1 , 0 3 2 2 -> 1 3 4 0 2 2 , 0 4 1 2 -> 1 4 0 2 5 , 0 4 3 2 -> 2 3 4 4 0 0 , 0 5 3 1 -> 0 1 4 3 5 4 , 0 5 3 1 -> 0 1 5 3 4 0 , 0 5 3 2 -> 0 2 4 5 3 , 0 5 3 2 -> 0 2 5 3 3 , 2 0 3 1 -> 2 0 1 3 5 2 , 2 0 4 1 -> 2 0 1 4 5 , 2 5 3 2 -> 2 5 2 3 3 , 2 5 4 2 -> 0 2 5 2 4 , 0 0 3 2 1 -> 0 0 1 3 5 2 , 0 1 0 3 2 -> 0 1 4 3 2 0 , 0 1 0 3 2 -> 2 3 1 0 0 5 , 0 3 2 5 1 -> 0 2 5 1 3 3 , 0 5 1 1 2 -> 0 2 4 1 1 5 , 0 5 1 2 2 -> 0 2 5 2 1 2 , 0 5 3 2 1 -> 0 1 3 4 2 5 , 0 5 5 3 2 -> 0 2 5 1 3 5 , 2 0 3 1 1 -> 2 1 0 1 3 4 , 2 2 0 3 1 -> 1 3 0 2 5 2 , 2 2 0 5 1 -> 2 0 2 1 5 1 , 2 5 5 4 1 -> 5 5 2 1 3 4 } Applying sparse tiling TRFC(2) [Geser/Hofbauer/Waldmann, FSCD 2019]. After renaming modulo { (0,0)->0, (0,1)->1, (1,2)->2, (2,0)->3, (0,2)->4, (2,1)->5, (1,0)->6, (1,1)->7, (2,2)->8, (2,3)->9, (1,3)->10, (2,4)->11, (1,4)->12, (2,5)->13, (1,5)->14, (2,7)->15, (1,7)->16, (3,0)->17, (4,0)->18, (5,0)->19, (6,0)->20, (3,1)->21, (3,2)->22, (3,3)->23, (3,4)->24, (3,5)->25, (3,7)->26, (4,4)->27, (4,1)->28, (4,2)->29, (4,3)->30, (4,5)->31, (4,7)->32, (0,3)->33, (0,4)->34, (0,5)->35, (0,7)->36, (5,1)->37, (6,1)->38, (5,5)->39, (5,2)->40, (5,3)->41, (5,4)->42, (5,7)->43, (6,2)->44, (6,5)->45 }, it remains to prove termination of the 2401-rule system { 0 1 2 3 -> 0 0 4 5 6 , 0 1 2 5 -> 0 0 4 5 7 , 0 1 2 8 -> 0 0 4 5 2 , 0 1 2 9 -> 0 0 4 5 10 , 0 1 2 11 -> 0 0 4 5 12 , 0 1 2 13 -> 0 0 4 5 14 , 0 1 2 15 -> 0 0 4 5 16 , 6 1 2 3 -> 6 0 4 5 6 , 6 1 2 5 -> 6 0 4 5 7 , 6 1 2 8 -> 6 0 4 5 2 , 6 1 2 9 -> 6 0 4 5 10 , 6 1 2 11 -> 6 0 4 5 12 , 6 1 2 13 -> 6 0 4 5 14 , 6 1 2 15 -> 6 0 4 5 16 , 3 1 2 3 -> 3 0 4 5 6 , 3 1 2 5 -> 3 0 4 5 7 , 3 1 2 8 -> 3 0 4 5 2 , 3 1 2 9 -> 3 0 4 5 10 , 3 1 2 11 -> 3 0 4 5 12 , 3 1 2 13 -> 3 0 4 5 14 , 3 1 2 15 -> 3 0 4 5 16 , 17 1 2 3 -> 17 0 4 5 6 , 17 1 2 5 -> 17 0 4 5 7 , 17 1 2 8 -> 17 0 4 5 2 , 17 1 2 9 -> 17 0 4 5 10 , 17 1 2 11 -> 17 0 4 5 12 , 17 1 2 13 -> 17 0 4 5 14 , 17 1 2 15 -> 17 0 4 5 16 , 18 1 2 3 -> 18 0 4 5 6 , 18 1 2 5 -> 18 0 4 5 7 , 18 1 2 8 -> 18 0 4 5 2 , 18 1 2 9 -> 18 0 4 5 10 , 18 1 2 11 -> 18 0 4 5 12 , 18 1 2 13 -> 18 0 4 5 14 , 18 1 2 15 -> 18 0 4 5 16 ,
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Standard