details

property	value
status	complete
benchmark	velroyen-nonloop-AlternatingIncr_c.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n084.star.cs.uiowa.edu
space	EEG_IJCAR_12

run statistics

property	value
solver	NaTT
configuration	Default
runtime (wallclock)	0.376060962677 seconds
cpu usage	0.451142927
max memory	2.3691264E7

stage attributes

key	value
output-size	4214
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: while(true(),s(s(s(s(s(i)))))) -> while(gt(s(s(s(s(s(i))))),0()),f(s(s(s(s(s(i))))))) 2: f(i) -> if(eq(mod2(i),0()),i) 3: gt(s(x),s(y)) -> gt(x,y) 4: gt(s(x),0()) -> true() 5: gt(0(),y) -> false() 6: if(true(),i) -> plus(i,s(0())) 7: if(false(),i) -> plus(i,s(s(s(0())))) 8: mod2(s(s(x))) -> mod2(x) 9: mod2(s(0())) -> s(0()) 10: mod2(0()) -> 0() 11: eq(s(x),s(y)) -> eq(x,y) 12: eq(0(),0()) -> true() 13: eq(0(),s(y)) -> false() 14: eq(s(x),0()) -> false() 15: plus(s(x),y) -> plus(x,s(y)) 16: plus(0(),y) -> y Number of strict rules: 16 Direct POLO(bPol) ... failed. Uncurrying gt 1: while(true(),s(s(s(s(s(i)))))) -> while(gt^1_s(s(s(s(s(i)))),0()),f(s(s(s(s(s(i))))))) 2: f(i) -> if(eq(mod2(i),0()),i) 3: gt^1_s(x,s(y)) -> gt(x,y) 4: gt^1_s(x,0()) -> true() 5: gt^1_0(y) -> false() 6: if(true(),i) -> plus(i,s(0())) 7: if(false(),i) -> plus(i,s(s(s(0())))) 8: mod2(s(s(x))) -> mod2(x) 9: mod2(s(0())) -> s(0()) 10: mod2(0()) -> 0() 11: eq(s(x),s(y)) -> eq(x,y) 12: eq(0(),0()) -> true() 13: eq(0(),s(y)) -> false() 14: eq(s(x),0()) -> false() 15: plus(s(x),y) -> plus(x,s(y)) 16: plus(0(),y) -> y 17: gt(0(),_1) ->= gt^1_0(_1) 18: gt(s(_1),_2) ->= gt^1_s(_1,_2) Number of strict rules: 16 Direct POLO(bPol) ... failed. Dependency Pairs: #1: #f(i) -> #if(eq(mod2(i),0()),i) #2: #f(i) -> #eq(mod2(i),0()) #3: #f(i) -> #mod2(i) #4: #if(true(),i) -> #plus(i,s(0())) #5: #eq(s(x),s(y)) -> #eq(x,y) #6: #if(false(),i) -> #plus(i,s(s(s(0())))) #7: #gt(0(),_1) ->? #gt^1_0(_1) #8: #gt^1_s(x,s(y)) -> #gt(x,y) #9: #while(true(),s(s(s(s(s(i)))))) -> #while(gt^1_s(s(s(s(s(i)))),0()),f(s(s(s(s(s(i))))))) #10: #while(true(),s(s(s(s(s(i)))))) -> #gt^1_s(s(s(s(s(i)))),0()) #11: #while(true(),s(s(s(s(s(i)))))) -> #f(s(s(s(s(s(i)))))) #12: #mod2(s(s(x))) -> #mod2(x) #13: #plus(s(x),y) -> #plus(x,s(y)) #14: #gt(s(_1),_2) ->? #gt^1_s(_1,_2) Number of SCCs: 5, DPs: 6 SCC { #12 } POLO(Sum)... succeeded. #mod2 w: x1 s w: x1 + 1 gt w: 0 #gt^1_0 w: 0 #plus w: 0 eq w: 0 false w: 0 #while w: 0 true w: 0 f w: 0 #eq w: 0 0 w: 0 if w: 0 gt^1_0 w: 0 while w: 0 #gt w: 0 #f w: 0 plus w: 0 gt^1_s w: 0 #if w: 0 mod2 w: 0 #gt^1_s w: 0 USABLE RULES: { } Removed DPs: #12 Number of SCCs: 4, DPs: 5 SCC { #13 } POLO(Sum)... succeeded. #mod2 w: 0 s w: x1 + 1 gt w: 0 #gt^1_0 w: 0 #plus w: x1 eq w: 0 false w: 0 #while w: 0 popout

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

job log

popout

actions

all output return to TRS Stand 20472