Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #487070546
details
property
value
status
complete
benchmark
MYNAT_nokinds-noand_FR.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n070.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
NaTT v.1.6c
configuration
Default
runtime (wallclock)
0.727394 seconds
cpu usage
0.679066
user time
0.643889
system time
0.035177
max virtual memory
250360.0
max residence set size
6752.0
stage attributes
key
value
starexec-result
YES
output
YES Input TRS: 1: U11(tt(),V2) -> U12(isNat(activate(V2))) 2: U12(tt()) -> tt() 3: U21(tt()) -> tt() 4: U31(tt(),V2) -> U32(isNat(activate(V2))) 5: U32(tt()) -> tt() 6: U41(tt(),N) -> activate(N) 7: U51(tt(),M,N) -> U52(isNat(activate(N)),activate(M),activate(N)) 8: U52(tt(),M,N) -> s(plus(activate(N),activate(M))) 9: U61(tt()) -> 0() 10: U71(tt(),M,N) -> U72(isNat(activate(N)),activate(M),activate(N)) 11: U72(tt(),M,N) -> plus(x(activate(N),activate(M)),activate(N)) 12: isNat(n__0()) -> tt() 13: isNat(n__plus(V1,V2)) -> U11(isNat(activate(V1)),activate(V2)) 14: isNat(n__s(V1)) -> U21(isNat(activate(V1))) 15: isNat(n__x(V1,V2)) -> U31(isNat(activate(V1)),activate(V2)) 16: plus(N,0()) -> U41(isNat(N),N) 17: plus(N,s(M)) -> U51(isNat(M),M,N) 18: x(N,0()) -> U61(isNat(N)) 19: x(N,s(M)) -> U71(isNat(M),M,N) 20: 0() -> n__0() 21: plus(X1,X2) -> n__plus(X1,X2) 22: s(X) -> n__s(X) 23: x(X1,X2) -> n__x(X1,X2) 24: activate(n__0()) -> 0() 25: activate(n__plus(X1,X2)) -> plus(activate(X1),activate(X2)) 26: activate(n__s(X)) -> s(activate(X)) 27: activate(n__x(X1,X2)) -> x(activate(X1),activate(X2)) 28: activate(X) -> X Number of strict rules: 28 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #U41(tt(),N) -> #activate(N) #2: #isNat(n__plus(V1,V2)) -> #U11(isNat(activate(V1)),activate(V2)) #3: #isNat(n__plus(V1,V2)) -> #isNat(activate(V1)) #4: #isNat(n__plus(V1,V2)) -> #activate(V1) #5: #isNat(n__plus(V1,V2)) -> #activate(V2) #6: #U61(tt()) -> #0() #7: #U72(tt(),M,N) -> #plus(x(activate(N),activate(M)),activate(N)) #8: #U72(tt(),M,N) -> #x(activate(N),activate(M)) #9: #U72(tt(),M,N) -> #activate(N) #10: #U72(tt(),M,N) -> #activate(M) #11: #U72(tt(),M,N) -> #activate(N) #12: #activate(n__0()) -> #0() #13: #isNat(n__s(V1)) -> #U21(isNat(activate(V1))) #14: #isNat(n__s(V1)) -> #isNat(activate(V1)) #15: #isNat(n__s(V1)) -> #activate(V1) #16: #activate(n__plus(X1,X2)) -> #plus(activate(X1),activate(X2)) #17: #activate(n__plus(X1,X2)) -> #activate(X1) #18: #activate(n__plus(X1,X2)) -> #activate(X2) #19: #U51(tt(),M,N) -> #U52(isNat(activate(N)),activate(M),activate(N)) #20: #U51(tt(),M,N) -> #isNat(activate(N)) #21: #U51(tt(),M,N) -> #activate(N) #22: #U51(tt(),M,N) -> #activate(M) #23: #U51(tt(),M,N) -> #activate(N) #24: #U71(tt(),M,N) -> #U72(isNat(activate(N)),activate(M),activate(N)) #25: #U71(tt(),M,N) -> #isNat(activate(N)) #26: #U71(tt(),M,N) -> #activate(N) #27: #U71(tt(),M,N) -> #activate(M) #28: #U71(tt(),M,N) -> #activate(N) #29: #activate(n__x(X1,X2)) -> #x(activate(X1),activate(X2)) #30: #activate(n__x(X1,X2)) -> #activate(X1) #31: #activate(n__x(X1,X2)) -> #activate(X2) #32: #plus(N,s(M)) -> #U51(isNat(M),M,N) #33: #plus(N,s(M)) -> #isNat(M) #34: #x(N,s(M)) -> #U71(isNat(M),M,N) #35: #x(N,s(M)) -> #isNat(M) #36: #activate(n__s(X)) -> #s(activate(X)) #37: #activate(n__s(X)) -> #activate(X) #38: #plus(N,0()) -> #U41(isNat(N),N) #39: #plus(N,0()) -> #isNat(N) #40: #U11(tt(),V2) -> #U12(isNat(activate(V2))) #41: #U11(tt(),V2) -> #isNat(activate(V2)) #42: #U11(tt(),V2) -> #activate(V2) #43: #U52(tt(),M,N) -> #s(plus(activate(N),activate(M))) #44: #U52(tt(),M,N) -> #plus(activate(N),activate(M)) #45: #U52(tt(),M,N) -> #activate(N) #46: #U52(tt(),M,N) -> #activate(M) #47: #isNat(n__x(V1,V2)) -> #U31(isNat(activate(V1)),activate(V2)) #48: #isNat(n__x(V1,V2)) -> #isNat(activate(V1)) #49: #isNat(n__x(V1,V2)) -> #activate(V1) #50: #isNat(n__x(V1,V2)) -> #activate(V2) #51: #U31(tt(),V2) -> #U32(isNat(activate(V2))) #52: #U31(tt(),V2) -> #isNat(activate(V2)) #53: #U31(tt(),V2) -> #activate(V2) #54: #x(N,0()) -> #U61(isNat(N)) #55: #x(N,0()) -> #isNat(N) Number of SCCs: 1, DPs: 47 SCC { #1..5 #7..11 #14..35 #37..39 #41 #42 #44..50 #52 #53 #55 } POLO(Sum)... POLO(max)... succeeded. #0 w: 0 #U72 w: max(x2 + 5, x3 + 4) #U32 w: 0 U21 w: x1 + 1 U11 w: max(x1 + 3) s w: x1 #isNat w: x1 + 1 activate w: x1
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard