details

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

run statistics

property	value
solver	NaTT
configuration	Default
runtime (wallclock)	0.115248203278 seconds
cpu usage	0.12995458
max memory	1.2038144E7

stage attributes

key	value
output-size	7247
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 Input TRS: 1: p(0()) -> 0() 2: p(s(x)) -> x 3: plus(x,0()) -> x 4: plus(0(),y) -> y 5: plus(s(x),y) -> s(plus(x,y)) 6: plus(s(x),y) -> s(plus(p(s(x)),y)) 7: plus(x,s(y)) -> s(plus(x,p(s(y)))) 8: times(0(),y) -> 0() 9: times(s(0()),y) -> y 10: times(s(x),y) -> plus(y,times(x,y)) 11: div(0(),y) -> 0() 12: div(x,y) -> quot(x,y,y) 13: quot(0(),s(y),z) -> 0() 14: quot(s(x),s(y),z) -> quot(x,y,z) 15: quot(x,0(),s(z)) -> s(div(x,s(z))) 16: div(div(x,y),z) -> div(x,times(y,z)) 17: eq(0(),0()) -> true() 18: eq(s(x),0()) -> false() 19: eq(0(),s(y)) -> false() 20: eq(s(x),s(y)) -> eq(x,y) 21: divides(y,x) -> eq(x,times(div(x,y),y)) 22: prime(s(s(x))) -> pr(s(s(x)),s(x)) 23: pr(x,s(0())) -> true() 24: pr(x,s(s(y))) -> if(divides(s(s(y)),x),x,s(y)) 25: if(true(),x,y) -> false() 26: if(false(),x,y) -> pr(x,y) Number of strict rules: 26 Direct POLO(bPol) ... failed. Uncurrying p 1: p^1_0() -> 0() 2: p^1_s(x) -> x 3: plus(x,0()) -> x 4: plus(0(),y) -> y 5: plus(s(x),y) -> s(plus(x,y)) 6: plus(s(x),y) -> s(plus(p^1_s(x),y)) 7: plus(x,s(y)) -> s(plus(x,p^1_s(y))) 8: times(0(),y) -> 0() 9: times(s(0()),y) -> y 10: times(s(x),y) -> plus(y,times(x,y)) 11: div(0(),y) -> 0() 12: div(x,y) -> quot(x,y,y) 13: quot(0(),s(y),z) -> 0() 14: quot(s(x),s(y),z) -> quot(x,y,z) 15: quot(x,0(),s(z)) -> s(div(x,s(z))) 16: div(div(x,y),z) -> div(x,times(y,z)) 17: eq(0(),0()) -> true() 18: eq(s(x),0()) -> false() 19: eq(0(),s(y)) -> false() 20: eq(s(x),s(y)) -> eq(x,y) 21: divides(y,x) -> eq(x,times(div(x,y),y)) 22: prime(s(s(x))) -> pr(s(s(x)),s(x)) 23: pr(x,s(0())) -> true() 24: pr(x,s(s(y))) -> if(divides(s(s(y)),x),x,s(y)) 25: if(true(),x,y) -> false() 26: if(false(),x,y) -> pr(x,y) 27: p(0()) ->= p^1_0() 28: p(s(_1)) ->= p^1_s(_1) Number of strict rules: 26 Direct POLO(bPol) ... failed. Dependency Pairs: #1: #plus(s(x),y) -> #plus(p^1_s(x),y) #2: #plus(s(x),y) -> #p^1_s(x) #3: #pr(x,s(s(y))) -> #if(divides(s(s(y)),x),x,s(y)) #4: #pr(x,s(s(y))) -> #divides(s(s(y)),x) #5: #div(x,y) -> #quot(x,y,y) #6: #quot(s(x),s(y),z) -> #quot(x,y,z) #7: #eq(s(x),s(y)) -> #eq(x,y) #8: #plus(x,s(y)) -> #plus(x,p^1_s(y)) #9: #plus(x,s(y)) -> #p^1_s(y) #10: #times(s(x),y) -> #plus(y,times(x,y)) #11: #times(s(x),y) -> #times(x,y) #12: #plus(s(x),y) -> #plus(x,y) #13: #p(s(_1)) ->? #p^1_s(_1) #14: #prime(s(s(x))) -> #pr(s(s(x)),s(x)) #15: #p(0()) ->? #p^1_0() #16: #if(false(),x,y) -> #pr(x,y) #17: #divides(y,x) -> #eq(x,times(div(x,y),y)) #18: #divides(y,x) -> #times(div(x,y),y) #19: #divides(y,x) -> #div(x,y) #20: #div(div(x,y),z) -> #div(x,times(y,z)) #21: #div(div(x,y),z) -> #times(y,z) #22: #quot(x,0(),s(z)) -> #div(x,s(z)) Number of SCCs: 5, DPs: 11 SCC { #11 } POLO(Sum)... succeeded. #div w: 0 s w: x1 + 1 #p^1_0 w: 0 #p^1_s w: 0 prime w: 0 p^1_0 w: 0 #plus w: 0 popout

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

job log

popout

actions

all output return to TRS Stand 20472