details

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

run statistics

property	value
solver	NaTT 2.1
configuration	default
runtime (wallclock)	0.347491025925 seconds
cpu usage	0.3433713
max memory	1.7932288E7

stage attributes

key	value
output-size	5585
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: check(0()) -> zero() 2: check(s(0())) -> odd() 3: check(s(s(0()))) -> even() 4: check(s(s(s(x)))) -> check(s(x)) 5: half(0()) -> 0() 6: half(s(0())) -> 0() 7: half(s(s(x))) -> s(half(x)) 8: plus(0(),y) -> y 9: plus(s(x),y) -> s(plus(x,y)) 10: times(x,y) -> timesIter(x,y,0()) 11: timesIter(x,y,z) -> if(check(x),x,y,z,plus(z,y)) 12: p(s(x)) -> x 13: p(0()) -> 0() 14: if(zero(),x,y,z,u) -> z 15: if(odd(),x,y,z,u) -> timesIter(p(x),y,u) 16: if(even(),x,y,z,u) -> plus(timesIter(half(x),y,half(z)),timesIter(half(x),y,half(s(z)))) Number of strict rules: 16 Direct poly ... failed. Freezing half check 1: check❆1_0() -> zero() 2: check❆1_s(0()) -> odd() 3: check❆1_s(s(0())) -> even() 4: check❆1_s(s(s(x))) -> check❆1_s(x) 5: half❆1_0() -> 0() 6: half❆1_s(0()) -> 0() 7: half❆1_s(s(x)) -> s(half(x)) 8: plus(0(),y) -> y 9: plus(s(x),y) -> s(plus(x,y)) 10: times(x,y) -> timesIter(x,y,0()) 11: timesIter(x,y,z) -> if(check(x),x,y,z,plus(z,y)) 12: p(s(x)) -> x 13: p(0()) -> 0() 14: if(zero(),x,y,z,u) -> z 15: if(odd(),x,y,z,u) -> timesIter(p(x),y,u) 16: if(even(),x,y,z,u) -> plus(timesIter(half(x),y,half(z)),timesIter(half(x),y,half❆1_s(z))) 17: check(0()) ->= check❆1_0() 18: check(s(_1)) ->= check❆1_s(_1) 19: half(0()) ->= half❆1_0() 20: half(s(_1)) ->= half❆1_s(_1) Number of strict rules: 16 Direct poly ... failed. Dependency Pairs: #1: #plus(s(x),y) -> #plus(x,y) #2: #timesIter(x,y,z) -> #if(check(x),x,y,z,plus(z,y)) #3: #timesIter(x,y,z) -> #check(x) #4: #timesIter(x,y,z) -> #plus(z,y) #5: #half(s(_1)) ->? #half❆1_s(_1) #6: #half❆1_s(s(x)) -> #half(x) #7: #times(x,y) -> #timesIter(x,y,0()) #8: #check(0()) ->? #check❆1_0() #9: #half(0()) ->? #half❆1_0() #10: #if(even(),x,y,z,u) -> #plus(timesIter(half(x),y,half(z)),timesIter(half(x),y,half❆1_s(z))) #11: #if(even(),x,y,z,u) -> #timesIter(half(x),y,half(z)) #12: #if(even(),x,y,z,u) -> #half(x) #13: #if(even(),x,y,z,u) -> #half(z) #14: #if(even(),x,y,z,u) -> #timesIter(half(x),y,half❆1_s(z)) #15: #if(even(),x,y,z,u) -> #half(x) #16: #if(even(),x,y,z,u) -> #half❆1_s(z) #17: #if(odd(),x,y,z,u) -> #timesIter(p(x),y,u) #18: #if(odd(),x,y,z,u) -> #p(x) #19: #check❆1_s(s(s(x))) -> #check❆1_s(x) #20: #check(s(_1)) ->? #check❆1_s(_1) Number of SCCs: 4, DPs: 8 SCC { #19 } Sum... succeeded. zero() w: (0) timesIter(x1,x2,x3) w: (0) s(x1) w: (1 + x1) #half❆1_s(x1) w: (0) #timesIter(x1,x2,x3) w: (0) even() w: (0) #plus(x1,x2) w: (0) #check(x1) w: (0) check❆1_0() w: (0) #half(x1) w: (0) check❆1_s(x1) w: (0) #p(x1) w: (0) #half❆1_0() w: (0) half(x1) w: (0) half❆1_s(x1) w: (0) check(x1) w: (0) p(x1) w: (0) #times(x1,x2) w: (0) 0() w: (0) if(x1,x2,x3,x4,x5) w: (0) times(x1,x2) w: (0) #check❆1_s(x1) w: (x1) #check❆1_0() w: (0) plus(x1,x2) w: (0) odd() w: (0) #if(x1,x2,x3,x4,x5) w: (0) half❆1_0() w: (0) popout

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

job log

popout

actions

all output return to TRS Standard