details

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

run statistics

property	value
solver	NaTT
configuration	Default
runtime (wallclock)	0.183790922165 seconds
cpu usage	0.222676159
max memory	1.927168E7

stage attributes

key	value
output-size	1987
starexec-result	MAYBE

output

/export/starexec/sandbox2/solver/bin/starexec_run_Default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE Input TRS: 1: minus(0(),x) -> 0() 2: minus(s(x),0()) -> s(x) 3: minus(s(x),s(y)) -> minus(x,y) 4: mod(x,0()) -> 0() 5: mod(x,s(y)) -> if(lt(x,s(y)),x,s(y)) 6: if(true(),x,y) -> x 7: if(false(),x,y) -> mod(minus(x,y),y) 8: gcd(x,0()) -> x 9: gcd(0(),s(y)) -> s(y) 10: gcd(s(x),s(y)) -> gcd(mod(s(x),s(y)),mod(s(y),s(x))) 11: lt(x,0()) -> false() 12: lt(0(),s(x)) -> true() 13: lt(s(x),s(y)) -> lt(x,y) Number of strict rules: 13 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #lt(s(x),s(y)) -> #lt(x,y) #2: #if(false(),x,y) -> #mod(minus(x,y),y) #3: #if(false(),x,y) -> #minus(x,y) #4: #gcd(s(x),s(y)) -> #gcd(mod(s(x),s(y)),mod(s(y),s(x))) #5: #gcd(s(x),s(y)) -> #mod(s(x),s(y)) #6: #gcd(s(x),s(y)) -> #mod(s(y),s(x)) #7: #mod(x,s(y)) -> #if(lt(x,s(y)),x,s(y)) #8: #mod(x,s(y)) -> #lt(x,s(y)) #9: #minus(s(x),s(y)) -> #minus(x,y) Number of SCCs: 4, DPs: 5 SCC { #9 } POLO(Sum)... succeeded. s w: x1 + 1 #lt w: 0 minus w: 0 gcd w: 0 mod w: 0 false w: 0 true w: 0 0 w: 0 if w: 0 #minus w: x2 #mod w: 0 #if w: 0 lt w: 0 #gcd w: 0 USABLE RULES: { } Removed DPs: #9 Number of SCCs: 3, DPs: 4 SCC { #1 } POLO(Sum)... succeeded. s w: x1 + 1 #lt w: x1 minus w: 0 gcd w: 0 mod w: 0 false w: 0 true w: 0 0 w: 0 if w: 0 #minus w: 0 #mod w: 0 #if w: 0 lt w: 0 #gcd w: 0 USABLE RULES: { } Removed DPs: #1 Number of SCCs: 2, DPs: 3 SCC { #4 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed. Finding a loop... failed. popout

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

job log

popout

actions

all output return to TRS Stand 20472