Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #487517562
details
property
value
status
complete
benchmark
aprove1.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n015.star.cs.uiowa.edu
space
Secret_05_SRS
run statistics
property
value
solver
MultumNonMulta 3.16 29 June 2020 60G
configuration
default
runtime (wallclock)
1.66581010818 seconds
cpu usage
4.780325762
max memory
1.267625984E9
stage attributes
key
value
output-size
37939
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 { p->0, 0->1, s->2, f->3, g->4, i->5, half->6, rd->7 }, it remains to prove termination of the 10-rule system { 0 1 -> 1 2 2 0 , 0 2 -> , 0 0 2 -> 0 , 3 2 -> 4 2 , 4 -> 5 2 6 , 5 -> 3 0 , 6 1 -> 1 2 2 6 , 6 2 2 -> 2 6 0 0 2 2 , 1 -> , 7 1 -> 1 1 1 1 1 1 7 } Applying sparse untiling TRFCU(2) [Geser/Hofbauer/Waldmann, FSCD 2019]. After renaming modulo { 0->0, 1->1, 2->2, 3->3, 4->4, 5->5, 6->6 }, it remains to prove termination of the 9-rule system { 0 1 -> 1 2 2 0 , 0 2 -> , 0 0 2 -> 0 , 3 2 -> 4 2 , 4 -> 5 2 6 , 5 -> 3 0 , 6 1 -> 1 2 2 6 , 6 2 2 -> 2 6 0 0 2 2 , 1 -> } The system was filtered by the following matrix interpretation of type E_J with J = {1,...,2} and dimension 2: 0 is interpreted by / \ | 1 0 | | 0 1 | \ / 1 is interpreted by / \ | 1 1 | | 0 1 | \ / 2 is interpreted by / \ | 1 0 | | 0 1 | \ / 3 is interpreted by / \ | 1 0 | | 0 1 | \ / 4 is interpreted by / \ | 1 0 | | 0 1 | \ / 5 is interpreted by / \ | 1 0 | | 0 1 | \ / 6 is interpreted by / \ | 1 0 | | 0 1 | \ / After renaming modulo { 0->0, 1->1, 2->2, 3->3, 4->4, 5->5, 6->6 }, it remains to prove termination of the 8-rule system { 0 1 -> 1 2 2 0 , 0 2 -> , 0 0 2 -> 0 , 3 2 -> 4 2 , 4 -> 5 2 6 , 5 -> 3 0 , 6 1 -> 1 2 2 6 , 6 2 2 -> 2 6 0 0 2 2 } Applying sparse untiling TRFCU(2) after reversal [Geser/Hofbauer/Waldmann, FSCD 2019]. After renaming modulo { 2->0, 1->1, 3->2, 4->3, 5->4, 6->5 }, it remains to prove termination of the 6-rule system { 0 1 -> , 0 1 1 -> 1 , 0 2 -> 0 3 , 3 -> 4 0 5 , 5 -> 1 2 , 0 0 4 -> 0 0 1 1 4 0 }
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Standard