Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381714316
details
property
value
status
complete
benchmark
wiehe12.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n006.star.cs.uiowa.edu
space
AProVE_07
run statistics
property
value
solver
NaTT
configuration
Default
runtime (wallclock)
0.242182970047 seconds
cpu usage
0.270168025
max memory
1.69984E7
stage attributes
key
value
output-size
12492
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_Default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Input TRS: 1: g(s(x),s(y)) -> if(and(f(s(x)),f(s(y))),t(g(k(minus(m(x,y),n(x,y)),s(s(0()))),k(n(s(x),s(y)),s(s(0()))))),g(minus(m(x,y),n(x,y)),n(s(x),s(y)))) 2: n(0(),y) -> 0() 3: n(x,0()) -> 0() 4: n(s(x),s(y)) -> s(n(x,y)) 5: m(0(),y) -> y 6: m(x,0()) -> x 7: m(s(x),s(y)) -> s(m(x,y)) 8: k(0(),s(y)) -> 0() 9: k(s(x),s(y)) -> s(k(minus(x,y),s(y))) 10: t(x) -> p(x,x) 11: p(s(x),s(y)) -> s(s(p(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y))))) 12: p(s(x),x) -> p(if(gt(x,x),id(x),id(x)),s(x)) 13: p(0(),y) -> y 14: p(id(x),s(y)) -> s(p(x,if(gt(s(y),y),y,s(y)))) 15: minus(x,0()) -> x 16: minus(s(x),s(y)) -> minus(x,y) 17: id(x) -> x 18: if(true(),x,y) -> x 19: if(false(),x,y) -> y 20: not(x) -> if(x,false(),true()) 21: and(x,false()) -> false() 22: and(true(),true()) -> true() 23: f(0()) -> true() 24: f(s(x)) -> h(x) 25: h(0()) -> false() 26: h(s(x)) -> f(x) 27: gt(s(x),0()) -> true() 28: gt(0(),y) -> false() 29: gt(s(x),s(y)) -> gt(x,y) Number of strict rules: 29 Direct POLO(bPol) ... failed. Uncurrying f gt 1: g(s(x),s(y)) -> if(and(f^1_s(x),f^1_s(y)),t(g(k(minus(m(x,y),n(x,y)),s(s(0()))),k(n(s(x),s(y)),s(s(0()))))),g(minus(m(x,y),n(x,y)),n(s(x),s(y)))) 2: n(0(),y) -> 0() 3: n(x,0()) -> 0() 4: n(s(x),s(y)) -> s(n(x,y)) 5: m(0(),y) -> y 6: m(x,0()) -> x 7: m(s(x),s(y)) -> s(m(x,y)) 8: k(0(),s(y)) -> 0() 9: k(s(x),s(y)) -> s(k(minus(x,y),s(y))) 10: t(x) -> p(x,x) 11: p(s(x),s(y)) -> s(s(p(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y))))) 12: p(s(x),x) -> p(if(gt(x,x),id(x),id(x)),s(x)) 13: p(0(),y) -> y 14: p(id(x),s(y)) -> s(p(x,if(gt^1_s(y,y),y,s(y)))) 15: minus(x,0()) -> x 16: minus(s(x),s(y)) -> minus(x,y) 17: id(x) -> x 18: if(true(),x,y) -> x 19: if(false(),x,y) -> y 20: not(x) -> if(x,false(),true()) 21: and(x,false()) -> false() 22: and(true(),true()) -> true() 23: f^1_0() -> true() 24: f^1_s(x) -> h(x) 25: h(0()) -> false() 26: h(s(x)) -> f(x) 27: gt^1_s(x,0()) -> true() 28: gt^1_0(y) -> false() 29: gt^1_s(x,s(y)) -> gt(x,y) 30: gt(0(),_1) ->= gt^1_0(_1) 31: gt(s(_1),_2) ->= gt^1_s(_1,_2) 32: f(0()) ->= f^1_0() 33: f(s(_1)) ->= f^1_s(_1) Number of strict rules: 29 Direct POLO(bPol) ... failed. Dependency Pairs: #1: #gt^1_s(x,s(y)) -> #gt(x,y) #2: #k(s(x),s(y)) -> #k(minus(x,y),s(y)) #3: #k(s(x),s(y)) -> #minus(x,y) #4: #p(s(x),s(y)) -> #p(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y))) #5: #p(s(x),s(y)) -> #if(gt(x,y),x,y) #6: #p(s(x),s(y)) -> #gt(x,y) #7: #p(s(x),s(y)) -> #if(not(gt(x,y)),id(x),id(y)) #8: #p(s(x),s(y)) -> #not(gt(x,y)) #9: #p(s(x),s(y)) -> #gt(x,y) #10: #p(s(x),s(y)) -> #id(x) #11: #p(s(x),s(y)) -> #id(y) #12: #f^1_s(x) -> #h(x) #13: #p(s(x),x) -> #p(if(gt(x,x),id(x),id(x)),s(x)) #14: #p(s(x),x) -> #if(gt(x,x),id(x),id(x)) #15: #p(s(x),x) -> #gt(x,x) #16: #p(s(x),x) -> #id(x) #17: #p(s(x),x) -> #id(x) #18: #gt(s(_1),_2) ->? #gt^1_s(_1,_2) #19: #p(id(x),s(y)) -> #p(x,if(gt^1_s(y,y),y,s(y))) #20: #p(id(x),s(y)) -> #if(gt^1_s(y,y),y,s(y)) #21: #p(id(x),s(y)) -> #gt^1_s(y,y) #22: #gt(0(),_1) ->? #gt^1_0(_1) #23: #not(x) -> #if(x,false(),true()) #24: #m(s(x),s(y)) -> #m(x,y)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472