Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381713064
details
property
value
status
complete
benchmark
wiehe11.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n030.star.cs.uiowa.edu
space
AProVE_07
run statistics
property
value
solver
NaTT
configuration
Default
runtime (wallclock)
0.201589107513 seconds
cpu usage
0.22394377
max memory
1.4491648E7
stage attributes
key
value
output-size
9588
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: quot(0(),s(y)) -> 0() 4: quot(s(x),s(y)) -> s(quot(minus(x,y),s(y))) 5: plus(0(),y) -> y 6: plus(s(x),y) -> s(plus(x,y)) 7: minus(minus(x,y),z) -> minus(x,plus(y,z)) 8: app(nil(),k) -> k 9: app(l,nil()) -> l 10: app(cons(x,l),k) -> cons(x,app(l,k)) 11: sum(cons(x,nil())) -> cons(x,nil()) 12: sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l)) 13: sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k))))) 14: plus(s(x),s(y)) -> s(s(plus(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y))))) 15: plus(s(x),x) -> plus(if(gt(x,x),id(x),id(x)),s(x)) 16: plus(zero(),y) -> y 17: plus(id(x),s(y)) -> s(plus(x,if(gt(s(y),y),y,s(y)))) 18: id(x) -> x 19: if(true(),x,y) -> x 20: if(false(),x,y) -> y 21: not(x) -> if(x,false(),true()) 22: gt(s(x),zero()) -> true() 23: gt(zero(),y) -> false() 24: gt(s(x),s(y)) -> gt(x,y) Number of strict rules: 24 Direct POLO(bPol) ... failed. Uncurrying gt 1: minus(x,0()) -> x 2: minus(s(x),s(y)) -> minus(x,y) 3: quot(0(),s(y)) -> 0() 4: quot(s(x),s(y)) -> s(quot(minus(x,y),s(y))) 5: plus(0(),y) -> y 6: plus(s(x),y) -> s(plus(x,y)) 7: minus(minus(x,y),z) -> minus(x,plus(y,z)) 8: app(nil(),k) -> k 9: app(l,nil()) -> l 10: app(cons(x,l),k) -> cons(x,app(l,k)) 11: sum(cons(x,nil())) -> cons(x,nil()) 12: sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l)) 13: sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k))))) 14: plus(s(x),s(y)) -> s(s(plus(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y))))) 15: plus(s(x),x) -> plus(if(gt(x,x),id(x),id(x)),s(x)) 16: plus(zero(),y) -> y 17: plus(id(x),s(y)) -> s(plus(x,if(gt^1_s(y,y),y,s(y)))) 18: id(x) -> x 19: if(true(),x,y) -> x 20: if(false(),x,y) -> y 21: not(x) -> if(x,false(),true()) 22: gt^1_s(x,zero()) -> true() 23: gt^1_zero(y) -> false() 24: gt^1_s(x,s(y)) -> gt(x,y) 25: gt(zero(),_1) ->= gt^1_zero(_1) 26: gt(s(_1),_2) ->= gt^1_s(_1,_2) Number of strict rules: 24 Direct POLO(bPol) ... failed. Dependency Pairs: #1: #minus(s(x),s(y)) -> #minus(x,y) #2: #plus(s(x),y) -> #plus(x,y) #3: #sum(app(l,cons(x,cons(y,k)))) -> #sum(app(l,sum(cons(x,cons(y,k))))) #4: #sum(app(l,cons(x,cons(y,k)))) -> #app(l,sum(cons(x,cons(y,k)))) #5: #sum(app(l,cons(x,cons(y,k)))) -> #sum(cons(x,cons(y,k))) #6: #gt^1_s(x,s(y)) -> #gt(x,y) #7: #sum(cons(x,cons(y,l))) -> #sum(cons(plus(x,y),l)) #8: #sum(cons(x,cons(y,l))) -> #plus(x,y) #9: #plus(s(x),s(y)) -> #plus(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y))) #10: #plus(s(x),s(y)) -> #if(gt(x,y),x,y) #11: #plus(s(x),s(y)) -> #gt(x,y) #12: #plus(s(x),s(y)) -> #if(not(gt(x,y)),id(x),id(y)) #13: #plus(s(x),s(y)) -> #not(gt(x,y)) #14: #plus(s(x),s(y)) -> #gt(x,y) #15: #plus(s(x),s(y)) -> #id(x) #16: #plus(s(x),s(y)) -> #id(y) #17: #gt(zero(),_1) ->? #gt^1_zero(_1) #18: #minus(minus(x,y),z) -> #minus(x,plus(y,z)) #19: #minus(minus(x,y),z) -> #plus(y,z) #20: #app(cons(x,l),k) -> #app(l,k) #21: #plus(id(x),s(y)) -> #plus(x,if(gt^1_s(y,y),y,s(y))) #22: #plus(id(x),s(y)) -> #if(gt^1_s(y,y),y,s(y)) #23: #plus(id(x),s(y)) -> #gt^1_s(y,y) #24: #gt(s(_1),_2) ->? #gt^1_s(_1,_2) #25: #not(x) -> #if(x,false(),true()) #26: #plus(s(x),x) -> #plus(if(gt(x,x),id(x),id(x)),s(x)) #27: #plus(s(x),x) -> #if(gt(x,x),id(x),id(x)) #28: #plus(s(x),x) -> #gt(x,x) #29: #plus(s(x),x) -> #id(x) #30: #plus(s(x),x) -> #id(x) #31: #quot(s(x),s(y)) -> #quot(minus(x,y),s(y)) #32: #quot(s(x),s(y)) -> #minus(x,y) Number of SCCs: 7, DPs: 12 SCC { #20 } POLO(Sum)... succeeded. zero w: 0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472