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