details

property	value
status	complete
benchmark	88143.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n146.star.cs.uiowa.edu
space	ICFP_2010_relative

run statistics

property	value
solver	MultumNonMulta 3.16 29 June 2020 60G
configuration	default
runtime (wallclock)	1.20466017723 seconds
cpu usage	3.371920073
max memory	8.59807744E8

stage attributes

key	value
output-size	44124
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES After renaming modulo { 0->0, 1->1, 2->2, 3->3 }, it remains to prove termination of the 29-rule system { 0 0 0 1 1 1 2 3 3 1 3 3 2 -> 0 2 2 1 0 1 2 3 0 0 3 2 2 3 1 2 2 , 0 0 0 3 3 1 1 1 3 3 1 3 2 -> 3 0 2 1 0 3 3 3 1 2 2 2 1 2 1 2 2 , 0 0 2 0 3 1 3 2 1 0 0 2 3 -> 0 2 2 2 1 3 3 3 2 2 0 3 1 3 2 1 2 , 0 1 0 0 3 3 2 1 2 0 1 2 3 -> 3 2 2 1 2 2 0 3 0 2 2 2 1 2 2 3 1 , 0 1 2 0 1 1 0 2 2 1 2 0 2 -> 2 0 3 3 2 2 1 0 3 3 3 3 2 2 2 3 3 , 0 1 2 1 1 1 2 2 0 1 3 2 0 -> 2 3 2 0 1 2 3 0 3 3 2 1 3 3 1 3 3 , 0 2 2 0 0 3 1 0 3 2 1 3 0 -> 3 1 2 2 1 3 3 2 2 3 0 2 2 1 1 1 0 , 0 2 3 3 1 0 3 3 0 2 3 1 1 -> 2 1 3 2 2 2 0 2 2 2 3 3 2 2 2 0 3 , 0 3 0 3 0 2 3 0 0 3 1 2 1 -> 3 1 1 2 2 3 0 1 2 2 2 2 3 2 2 2 0 , 0 3 0 3 1 0 1 2 2 0 3 1 3 -> 2 3 2 2 3 0 3 0 3 3 2 2 1 2 2 0 3 , 1 0 0 1 2 2 2 3 2 3 2 0 1 -> 1 2 1 0 2 2 1 2 1 0 3 3 2 2 2 3 3 , 1 0 2 3 0 3 2 3 2 2 3 2 3 -> 1 3 2 2 1 2 2 2 3 3 2 2 3 1 2 1 2 , 1 3 1 0 1 1 3 2 2 1 1 2 1 -> 1 2 3 2 3 2 1 2 2 2 2 2 2 0 1 2 2 , 2 0 0 1 3 0 3 1 3 0 1 2 1 -> 2 2 3 3 0 1 0 0 3 3 3 1 0 2 2 1 2 , 2 0 0 2 3 0 3 1 0 0 2 1 3 -> 2 0 2 1 2 2 2 2 3 2 3 1 3 3 1 3 1 , 2 1 0 2 2 0 0 1 3 2 0 3 3 -> 2 0 2 2 1 3 2 1 1 1 2 2 1 3 3 3 3 , 2 1 0 3 0 3 0 3 3 0 2 1 1 -> 2 2 0 1 2 1 1 0 2 2 2 3 2 3 0 2 2 , 2 1 1 2 0 1 1 3 0 2 3 0 1 -> 2 2 3 3 3 3 3 2 1 0 1 2 2 3 3 2 2 , 2 1 1 3 3 0 3 2 3 2 1 1 3 -> 2 3 2 3 2 2 3 3 2 1 2 2 3 3 0 1 3 , 2 1 1 3 3 3 0 3 0 3 0 0 2 -> 2 0 2 2 0 2 1 3 3 3 2 3 3 2 3 3 2 , 2 2 0 0 1 0 2 3 0 3 0 1 0 -> 2 2 2 1 0 2 0 1 3 1 3 0 3 3 3 3 2 , 2 2 0 0 3 0 2 2 3 0 1 3 3 -> 2 2 1 1 0 1 2 1 2 0 2 2 2 0 2 2 2 , 2 2 0 3 0 1 0 2 3 2 3 1 2 -> 2 2 0 2 2 2 1 0 0 3 1 3 1 3 3 2 2 , 2 2 1 0 2 1 2 1 1 0 1 2 0 -> 2 2 0 2 0 3 1 2 2 0 1 2 2 2 2 2 2 , 2 3 1 1 0 2 3 1 2 3 3 1 1 -> 2 2 2 1 2 1 1 2 0 2 0 0 3 0 1 3 3 , 2 3 2 0 3 0 1 3 2 2 2 0 2 -> 2 1 2 2 3 0 0 1 3 2 2 3 2 2 3 3 2 , 2 3 2 1 1 1 3 2 3 2 3 2 1 -> 2 2 2 0 3 2 2 0 2 3 2 3 0 2 2 0 2 , 3 0 2 3 0 1 0 3 3 0 0 1 0 -> 3 0 0 1 2 2 3 3 3 2 0 1 2 0 3 3 2 , 1 3 2 0 2 1 2 1 2 2 1 2 0 ->= 3 2 1 2 1 2 2 1 2 2 0 2 2 0 2 2 2 } The system was reversed. After renaming modulo { 2->0, 3->1, 1->2, 0->3 }, it remains to prove termination of the 29-rule system { 0 1 1 2 1 1 0 2 2 2 3 3 3 -> 0 0 2 1 0 0 1 3 3 1 0 2 3 2 0 0 3 , 0 1 2 1 1 2 2 2 1 1 3 3 3 -> 0 0 2 0 2 0 0 0 2 1 1 1 3 2 0 3 1 , 1 0 3 3 2 0 1 2 1 3 0 3 3 -> 0 2 0 1 2 1 3 0 0 1 1 1 2 0 0 0 3 , 1 0 2 3 0 2 0 1 1 3 3 2 3 -> 2 1 0 0 2 0 0 0 3 1 3 0 0 2 0 0 1 , 0 3 0 2 0 0 3 2 2 3 0 2 3 -> 1 1 0 0 0 1 1 1 1 3 2 0 0 1 1 3 0 , 3 0 1 2 3 0 0 2 2 2 0 2 3 -> 1 1 2 1 1 2 0 1 1 3 1 0 2 3 0 1 0 , 3 1 2 0 1 3 2 1 3 3 0 0 3 -> 3 2 2 2 0 0 3 1 0 0 1 1 2 0 0 2 1 , 2 2 1 0 3 1 1 3 2 1 1 0 3 -> 1 3 0 0 0 1 1 0 0 0 3 0 0 0 1 2 0 , 2 0 2 1 3 3 1 0 3 1 3 1 3 -> 3 0 0 0 1 0 0 0 0 2 3 1 0 0 2 2 1 , 1 2 1 3 0 0 2 3 2 1 3 1 3 -> 1 3 0 0 2 0 0 1 1 3 1 3 1 0 0 1 0 , 2 3 0 1 0 1 0 0 0 2 3 3 2 -> 1 1 0 0 0 1 1 3 2 0 2 0 0 3 2 0 2 , 1 0 1 0 0 1 0 1 3 1 0 3 2 -> 0 2 0 2 1 0 0 1 1 0 0 0 2 0 0 1 2 , 2 0 2 2 0 0 1 2 2 3 2 1 2 -> 0 0 2 3 0 0 0 0 0 0 2 0 1 0 1 0 2 , 2 0 2 3 1 2 1 3 1 2 3 3 0 -> 0 2 0 0 3 2 1 1 1 3 3 2 3 1 1 0 0 , 1 2 0 3 3 2 1 3 1 0 3 3 0 -> 2 1 2 1 1 2 1 0 1 0 0 0 0 2 0 3 0 , 1 1 3 0 1 2 3 3 0 0 3 2 0 -> 1 1 1 1 2 0 0 2 2 2 0 1 2 0 0 3 0 , 2 2 0 3 1 1 3 1 3 1 3 2 0 -> 0 0 3 1 0 1 0 0 0 3 2 2 0 2 3 0 0 , 2 3 1 0 3 1 2 2 3 0 2 2 0 -> 0 0 1 1 0 0 2 3 2 0 1 1 1 1 1 0 0 , 1 2 2 0 1 0 1 3 1 1 2 2 0 -> 1 2 3 1 1 0 0 2 0 1 1 0 0 1 0 1 0 , 0 3 3 1 3 1 3 1 1 1 2 2 0 -> 0 1 1 0 1 1 0 1 1 1 2 0 3 0 0 3 0 , 3 2 3 1 3 1 0 3 2 3 3 0 0 -> 0 1 1 1 1 3 1 2 1 2 3 0 3 2 0 0 0 , 1 1 2 3 1 0 0 3 1 3 3 0 0 -> 0 0 0 3 0 0 0 3 0 2 0 2 3 2 2 0 0 , 0 2 1 0 1 0 3 2 3 1 3 0 0 -> 0 0 1 1 2 1 2 1 3 3 2 0 0 0 3 0 0 , 3 0 2 3 2 2 0 2 0 3 2 0 0 -> 0 0 0 0 0 0 2 3 0 0 2 1 3 0 3 0 0 , 2 2 1 1 0 2 1 0 3 2 2 1 0 -> 1 1 2 3 1 3 3 0 3 0 2 2 0 2 0 0 0 , 0 3 0 0 0 1 2 3 1 3 0 1 0 -> 0 1 1 0 0 1 0 0 1 2 3 3 1 0 0 2 0 , 2 0 1 0 1 0 1 2 2 2 0 1 0 -> 0 3 0 0 3 1 0 1 0 3 0 0 1 3 0 0 0 , 3 2 3 3 1 1 3 2 3 1 0 3 1 -> 0 1 1 3 0 2 3 0 1 1 1 0 0 2 3 3 1 , 3 0 2 0 0 2 0 2 0 3 0 1 2 ->= 0 0 0 3 0 0 3 0 0 2 0 0 2 0 2 0 1 } Applying context closure of depth 1 in the following form: System R over Sigma maps to { fold(xly) -> fold(xry) | l -> r in R, x,y in Sigma } over Sigma^2, where fold(a_1...a_n) = (a_1,a_2)...(a_{n-1},a_{n}) After renaming modulo { [0, 0]->0, [0, 1]->1, [1, 1]->2, [1, 2]->3, [2, 1]->4, [1, 0]->5, [0, 2]->6, [2, 2]->7, [2, 3]->8, [3, 3]->9, [3, 0]->10, [1, 3]->11, [3, 1]->12, [3, 2]->13, [2, 0]->14, [0, 3]->15 }, it remains to prove termination of the 464-rule system { 0 1 2 3 4 2 5 6 7 7 8 9 9 10 -> 0 0 6 4 5 0 1 11 9 12 5 6 8 13 14 0 15 10 , 0 1 3 4 2 3 7 7 4 2 11 9 9 10 -> 0 0 6 14 6 14 0 0 6 4 2 2 11 13 14 15 12 5 , 1 5 15 9 13 14 1 3 4 11 10 15 9 10 -> 0 6 14 1 3 4 11 10 0 1 2 2 3 14 0 0 15 10 , 1 5 6 8 10 6 14 1 2 11 9 13 8 10 -> 6 4 5 0 6 14 0 0 15 12 11 10 0 6 14 0 1 5 , 0 15 10 6 14 0 15 13 7 8 10 6 8 10 -> 1 2 5 0 0 1 2 2 2 11 13 14 0 1 2 11 10 0 , 15 10 1 3 8 10 0 6 7 7 14 6 8 10 -> 1 2 3 4 2 3 14 1 2 11 12 5 6 8 10 1 5 0 , 15 12 3 14 1 11 13 4 11 9 10 0 15 10 -> 15 13 7 7 14 0 15 12 5 0 1 2 3 14 0 6 4 5 , 6 7 4 5 15 12 2 11 13 4 2 5 15 10 -> 1 11 10 0 0 1 2 5 0 0 15 10 0 0 1 3 14 0 , 6 14 6 4 11 9 12 5 15 12 11 12 11 10 -> 15 10 0 0 1 5 0 0 0 6 8 12 5 0 6 7 4 5 , 1 3 4 11 10 0 6 8 13 4 11 12 11 10 -> 1 11 10 0 6 14 0 1 2 11 12 11 12 5 0 1 5 0 , 6 8 10 1 5 1 5 0 0 6 8 9 13 14 -> 1 2 5 0 0 1 2 11 13 14 6 14 0 15 13 14 6 14 , 1 5 1 5 0 1 5 1 11 12 5 15 13 14 -> 0 6 14 6 4 5 0 1 2 5 0 0 6 14 0 1 3 14 , 6 14 6 7 14 0 1 3 7 8 13 4 3 14 -> 0 0 6 8 10 0 0 0 0 0 6 14 1 5 1 5 6 14 , 6 14 6 8 12 3 4 11 12 3 8 9 10 0 -> 0 6 14 0 15 13 4 2 2 11 9 13 8 12 2 5 0 0 , 1 3 14 15 9 13 4 11 12 5 15 9 10 0 -> 6 4 3 4 2 3 4 5 1 5 0 0 0 6 14 15 10 0 , 1 2 11 10 1 3 8 9 10 0 15 13 14 0 -> 1 2 2 2 3 14 0 6 7 7 14 1 3 14 0 15 10 0 , 6 7 14 15 12 2 11 12 11 12 11 13 14 0 -> 0 0 15 12 5 1 5 0 0 15 13 7 14 6 8 10 0 0 , 6 8 12 5 15 12 3 7 8 10 6 7 14 0 -> 0 0 1 2 5 0 6 8 13 14 1 2 2 2 2 5 0 0 , popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to SRS Relative