details

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

run statistics

property	value
solver	NaTT 2.1
configuration	default
runtime (wallclock)	0.205888986588 seconds
cpu usage	0.224317501
max memory	1.667072E7

stage attributes

key	value
output-size	5591
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: minus(x,0()) -> x 2: minus(s(x),s(y)) -> minus(x,y) 3: double(0()) -> 0() 4: double(s(x)) -> s(s(double(x))) 5: plus(s(x),s(y)) -> s(s(plus(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y))))) 6: plus(s(x),x) -> plus(if(gt(x,x),id(x),id(x)),s(x)) 7: plus(zero(),y) -> y 8: plus(id(x),s(y)) -> s(plus(x,if(gt(s(y),y),y,s(y)))) 9: id(x) -> x 10: if(true(),x,y) -> x 11: if(false(),x,y) -> y 12: not(x) -> if(x,false(),true()) 13: gt(s(x),zero()) -> true() 14: gt(zero(),y) -> false() 15: gt(s(x),s(y)) -> gt(x,y) Number of strict rules: 15 Direct poly ... failed. Freezing gt 1: minus(x,0()) -> x 2: minus(s(x),s(y)) -> minus(x,y) 3: double(0()) -> 0() 4: double(s(x)) -> s(s(double(x))) 5: plus(s(x),s(y)) -> s(s(plus(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y))))) 6: plus(s(x),x) -> plus(if(gt(x,x),id(x),id(x)),s(x)) 7: plus(zero(),y) -> y 8: plus(id(x),s(y)) -> s(plus(x,if(gt❆1_s(y,y),y,s(y)))) 9: id(x) -> x 10: if(true(),x,y) -> x 11: if(false(),x,y) -> y 12: not(x) -> if(x,false(),true()) 13: gt❆1_s(x,zero()) -> true() 14: gt❆1_zero(y) -> false() 15: gt❆1_s(x,s(y)) -> gt(x,y) 16: gt(zero(),_1) ->= gt❆1_zero(_1) 17: gt(s(_1),_2) ->= gt❆1_s(_1,_2) Number of strict rules: 15 Direct poly ... failed. Dependency Pairs: #1: #minus(s(x),s(y)) -> #minus(x,y) #2: #plus(s(x),x) -> #plus(if(gt(x,x),id(x),id(x)),s(x)) #3: #plus(s(x),x) -> #if(gt(x,x),id(x),id(x)) #4: #plus(s(x),x) -> #gt(x,x) #5: #plus(s(x),x) -> #id(x) #6: #plus(s(x),x) -> #id(x) #7: #not(x) -> #if(x,false(),true()) #8: #plus(s(x),s(y)) -> #plus(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y))) #9: #plus(s(x),s(y)) -> #if(gt(x,y),x,y) #10: #plus(s(x),s(y)) -> #gt(x,y) #11: #plus(s(x),s(y)) -> #if(not(gt(x,y)),id(x),id(y)) #12: #plus(s(x),s(y)) -> #not(gt(x,y)) #13: #plus(s(x),s(y)) -> #gt(x,y) #14: #plus(s(x),s(y)) -> #id(x) #15: #plus(s(x),s(y)) -> #id(y) #16: #gt(s(_1),_2) ->? #gt❆1_s(_1,_2) #17: #gt(zero(),_1) ->? #gt❆1_zero(_1) #18: #plus(id(x),s(y)) -> #plus(x,if(gt❆1_s(y,y),y,s(y))) #19: #plus(id(x),s(y)) -> #if(gt❆1_s(y,y),y,s(y)) #20: #plus(id(x),s(y)) -> #gt❆1_s(y,y) #21: #gt❆1_s(x,s(y)) -> #gt(x,y) #22: #double(s(x)) -> #double(x) Number of SCCs: 4, DPs: 7 SCC { #22 } Sum... succeeded. zero() w: (0) s(x1) w: (1 + x1) gt(x1,x2) w: (0) minus(x1,x2) w: (0) #plus(x1,x2) w: (0) false() w: (0) #id(x1) w: (0) true() w: (0) gt❆1_zero(x1) w: (0) #not(x1) w: (0) #gt❆1_zero(x1) w: (0) 0() w: (0) if(x1,x2,x3) w: (0) #double(x1) w: (x1) double(x1) w: (0) #gt(x1,x2) w: (0) #gt❆1_s(x1,x2) w: (0) #minus(x1,x2) w: (0) plus(x1,x2) w: (0) #if(x1,x2,x3) w: (0) id(x1) w: (0) gt❆1_s(x1,x2) w: (0) not(x1) w: (0) USABLE RULES: { } Removed DPs: #22 Number of SCCs: 3, DPs: 6 SCC { #1 } Sum... succeeded. zero() w: (0) popout

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

job log

popout

actions

all output return to TRS Standard