details

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

run statistics

property	value
solver	NaTT
configuration	Default
runtime (wallclock)	0.590007066727 seconds
cpu usage	0.676287091
max memory	2.7615232E7

stage attributes

key	value
output-size	3840
starexec-result	MAYBE

output

/export/starexec/sandbox/solver/bin/starexec_run_Default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- MAYBE Input TRS: 1: gcd(x,y) -> gcd2(x,y,0()) 2: gcd2(x,y,i) -> if1(le(x,0()),le(y,0()),le(x,y),le(y,x),x,y,inc(i)) 3: if1(true(),b1,b2,b3,x,y,i) -> pair(result(y),neededIterations(i)) 4: if1(false(),b1,b2,b3,x,y,i) -> if2(b1,b2,b3,x,y,i) 5: if2(true(),b2,b3,x,y,i) -> pair(result(x),neededIterations(i)) 6: if2(false(),b2,b3,x,y,i) -> if3(b2,b3,x,y,i) 7: if3(false(),b3,x,y,i) -> gcd2(minus(x,y),y,i) 8: if3(true(),b3,x,y,i) -> if4(b3,x,y,i) 9: if4(false(),x,y,i) -> gcd2(x,minus(y,x),i) 10: if4(true(),x,y,i) -> pair(result(x),neededIterations(i)) 11: inc(0()) -> 0() 12: inc(s(i)) -> s(inc(i)) 13: le(s(x),0()) -> false() 14: le(0(),y) -> true() 15: le(s(x),s(y)) -> le(x,y) 16: minus(x,0()) -> x 17: minus(0(),y) -> 0() 18: minus(s(x),s(y)) -> minus(x,y) 19: a() -> b() 20: a() -> c() Number of strict rules: 20 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #gcd2(x,y,i) -> #if1(le(x,0()),le(y,0()),le(x,y),le(y,x),x,y,inc(i)) #2: #gcd2(x,y,i) -> #le(x,0()) #3: #gcd2(x,y,i) -> #le(y,0()) #4: #gcd2(x,y,i) -> #le(x,y) #5: #gcd2(x,y,i) -> #le(y,x) #6: #gcd2(x,y,i) -> #inc(i) #7: #if2(false(),b2,b3,x,y,i) -> #if3(b2,b3,x,y,i) #8: #if4(false(),x,y,i) -> #gcd2(x,minus(y,x),i) #9: #if4(false(),x,y,i) -> #minus(y,x) #10: #inc(s(i)) -> #inc(i) #11: #if3(false(),b3,x,y,i) -> #gcd2(minus(x,y),y,i) #12: #if3(false(),b3,x,y,i) -> #minus(x,y) #13: #gcd(x,y) -> #gcd2(x,y,0()) #14: #if3(true(),b3,x,y,i) -> #if4(b3,x,y,i) #15: #le(s(x),s(y)) -> #le(x,y) #16: #if1(false(),b1,b2,b3,x,y,i) -> #if2(b1,b2,b3,x,y,i) #17: #minus(s(x),s(y)) -> #minus(x,y) Number of SCCs: 4, DPs: 9 SCC { #10 } POLO(Sum)... succeeded. a w: 0 le w: 0 #if4 w: 0 s w: x1 + 1 #le w: 0 result w: 0 b w: 0 minus w: 0 gcd w: 0 if1 w: 0 pair w: 0 false w: 0 #inc w: x1 c w: 0 inc w: 0 true w: 0 #if1 w: 0 if2 w: 0 #if3 w: 0 0 w: 0 #gcd2 w: 0 neededIterations w: 0 gcd2 w: 0 if4 w: 0 #minus w: 0 if3 w: 0 #a w: 0 #if2 w: 0 #gcd w: 0 USABLE RULES: { } Removed DPs: #10 Number of SCCs: 3, DPs: 8 SCC { #15 } POLO(Sum)... succeeded. a w: 0 le w: 0 #if4 w: 0 s w: x1 + 1 #le w: x2 result w: 0 b w: 0 minus w: 0 gcd w: 0 if1 w: 0 pair w: 0 false w: 0 #inc w: 0 c w: 0 popout

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

job log

popout

actions

all output return to TRS Stand 20472