Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381710513
details
property
value
status
complete
benchmark
aprove02.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n027.star.cs.uiowa.edu
space
Secret_07_TRS
run statistics
property
value
solver
NaTT
configuration
Default
runtime (wallclock)
0.195117950439 seconds
cpu usage
0.238377187
max memory
2.1590016E7
stage attributes
key
value
output-size
7253
starexec-result
MAYBE
output
/export/starexec/sandbox/solver/bin/starexec_run_Default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- MAYBE Input TRS: 1: plus(x,y) -> ifPlus(isZero(x),x,inc(y)) 2: ifPlus(true(),x,y) -> p(y) 3: ifPlus(false(),x,y) -> plus(p(x),y) 4: times(x,y) -> timesIter(0(),x,y,0()) 5: timesIter(i,x,y,z) -> ifTimes(ge(i,x),i,x,y,z) 6: ifTimes(true(),i,x,y,z) -> z 7: ifTimes(false(),i,x,y,z) -> timesIter(inc(i),x,y,plus(z,y)) 8: isZero(0()) -> true() 9: isZero(s(0())) -> false() 10: isZero(s(s(x))) -> isZero(s(x)) 11: inc(0()) -> s(0()) 12: inc(s(x)) -> s(inc(x)) 13: inc(x) -> s(x) 14: p(0()) -> 0() 15: p(s(x)) -> x 16: p(s(s(x))) -> s(p(s(x))) 17: ge(x,0()) -> true() 18: ge(0(),s(y)) -> false() 19: ge(s(x),s(y)) -> ge(x,y) 20: f0(0(),y,x) -> f1(x,y,x) 21: f1(x,y,z) -> f2(x,y,z) 22: f2(x,1(),z) -> f0(x,z,z) 23: f0(x,y,z) -> d() 24: f1(x,y,z) -> c() Number of strict rules: 24 Direct POLO(bPol) ... failed. Uncurrying isZero p 1: plus(x,y) -> ifPlus(isZero(x),x,inc(y)) 2: ifPlus(true(),x,y) -> p(y) 3: ifPlus(false(),x,y) -> plus(p(x),y) 4: times(x,y) -> timesIter(0(),x,y,0()) 5: timesIter(i,x,y,z) -> ifTimes(ge(i,x),i,x,y,z) 6: ifTimes(true(),i,x,y,z) -> z 7: ifTimes(false(),i,x,y,z) -> timesIter(inc(i),x,y,plus(z,y)) 8: isZero^1_0() -> true() 9: isZero^1_s(0()) -> false() 10: isZero^1_s(s(x)) -> isZero^1_s(x) 11: inc(0()) -> s(0()) 12: inc(s(x)) -> s(inc(x)) 13: inc(x) -> s(x) 14: p^1_0() -> 0() 15: p^1_s(x) -> x 16: p^1_s(s(x)) -> s(p^1_s(x)) 17: ge(x,0()) -> true() 18: ge(0(),s(y)) -> false() 19: ge(s(x),s(y)) -> ge(x,y) 20: f0(0(),y,x) -> f1(x,y,x) 21: f1(x,y,z) -> f2(x,y,z) 22: f2(x,1(),z) -> f0(x,z,z) 23: f0(x,y,z) -> d() 24: f1(x,y,z) -> c() 25: p(0()) ->= p^1_0() 26: p(s(_1)) ->= p^1_s(_1) 27: isZero(0()) ->= isZero^1_0() 28: isZero(s(_1)) ->= isZero^1_s(_1) Number of strict rules: 24 Direct POLO(bPol) ... failed. Dependency Pairs: #1: #ifPlus(true(),x,y) -> #p(y) #2: #inc(s(x)) -> #inc(x) #3: #p(0()) ->? #p^1_0() #4: #f0(0(),y,x) -> #f1(x,y,x) #5: #ifTimes(false(),i,x,y,z) -> #timesIter(inc(i),x,y,plus(z,y)) #6: #ifTimes(false(),i,x,y,z) -> #inc(i) #7: #ifTimes(false(),i,x,y,z) -> #plus(z,y) #8: #isZero^1_s(s(x)) -> #isZero^1_s(x) #9: #timesIter(i,x,y,z) -> #ifTimes(ge(i,x),i,x,y,z) #10: #timesIter(i,x,y,z) -> #ge(i,x) #11: #isZero(s(_1)) ->? #isZero^1_s(_1) #12: #f2(x,1(),z) -> #f0(x,z,z) #13: #isZero(0()) ->? #isZero^1_0() #14: #ge(s(x),s(y)) -> #ge(x,y) #15: #p(s(_1)) ->? #p^1_s(_1) #16: #f1(x,y,z) -> #f2(x,y,z) #17: #p^1_s(s(x)) -> #p^1_s(x) #18: #ifPlus(false(),x,y) -> #plus(p(x),y) #19: #ifPlus(false(),x,y) -> #p(x) #20: #plus(x,y) -> #ifPlus(isZero(x),x,inc(y)) #21: #plus(x,y) -> #isZero(x) #22: #plus(x,y) -> #inc(y) #23: #times(x,y) -> #timesIter(0(),x,y,0()) Number of SCCs: 7, DPs: 11 SCC { #8 } POLO(Sum)... succeeded. ifTimes w: 0 1 w: 0 d w: 0 timesIter w: 0 s w: x1 + 1 #p^1_0 w: 0 #isZero w: 0 #f2 w: 0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472