Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381717048
details
property
value
status
complete
benchmark
LISTUTILITIES_nokinds_Z.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n097.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
NaTT
configuration
Default
runtime (wallclock)
3.27288198471 seconds
cpu usage
3.632427425
max memory
8.4815872E7
stage attributes
key
value
output-size
17306
starexec-result
MAYBE
output
/export/starexec/sandbox2/solver/bin/starexec_run_Default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE Input TRS: 1: U101(tt(),N,XS) -> fst(splitAt(activate(N),activate(XS))) 2: U11(tt(),N,XS) -> snd(splitAt(activate(N),activate(XS))) 3: U21(tt(),X) -> activate(X) 4: U31(tt(),N) -> activate(N) 5: U41(tt(),N) -> cons(activate(N),n__natsFrom(s(activate(N)))) 6: U51(tt(),N,XS) -> head(afterNth(activate(N),activate(XS))) 7: U61(tt(),Y) -> activate(Y) 8: U71(tt(),XS) -> pair(nil(),activate(XS)) 9: U81(tt(),N,X,XS) -> U82(splitAt(activate(N),activate(XS)),activate(X)) 10: U82(pair(YS,ZS),X) -> pair(cons(activate(X),YS),ZS) 11: U91(tt(),XS) -> activate(XS) 12: afterNth(N,XS) -> U11(and(isNatural(N),n__isLNat(XS)),N,XS) 13: and(tt(),X) -> activate(X) 14: fst(pair(X,Y)) -> U21(and(isLNat(X),n__isLNat(Y)),X) 15: head(cons(N,XS)) -> U31(and(isNatural(N),n__isLNat(activate(XS))),N) 16: isLNat(n__nil()) -> tt() 17: isLNat(n__afterNth(V1,V2)) -> and(isNatural(activate(V1)),n__isLNat(activate(V2))) 18: isLNat(n__cons(V1,V2)) -> and(isNatural(activate(V1)),n__isLNat(activate(V2))) 19: isLNat(n__fst(V1)) -> isPLNat(activate(V1)) 20: isLNat(n__natsFrom(V1)) -> isNatural(activate(V1)) 21: isLNat(n__snd(V1)) -> isPLNat(activate(V1)) 22: isLNat(n__tail(V1)) -> isLNat(activate(V1)) 23: isLNat(n__take(V1,V2)) -> and(isNatural(activate(V1)),n__isLNat(activate(V2))) 24: isNatural(n__0()) -> tt() 25: isNatural(n__head(V1)) -> isLNat(activate(V1)) 26: isNatural(n__s(V1)) -> isNatural(activate(V1)) 27: isNatural(n__sel(V1,V2)) -> and(isNatural(activate(V1)),n__isLNat(activate(V2))) 28: isPLNat(n__pair(V1,V2)) -> and(isLNat(activate(V1)),n__isLNat(activate(V2))) 29: isPLNat(n__splitAt(V1,V2)) -> and(isNatural(activate(V1)),n__isLNat(activate(V2))) 30: natsFrom(N) -> U41(isNatural(N),N) 31: sel(N,XS) -> U51(and(isNatural(N),n__isLNat(XS)),N,XS) 32: snd(pair(X,Y)) -> U61(and(isLNat(X),n__isLNat(Y)),Y) 33: splitAt(0(),XS) -> U71(isLNat(XS),XS) 34: splitAt(s(N),cons(X,XS)) -> U81(and(isNatural(N),n__and(isNatural(X),n__isLNat(activate(XS)))),N,X,activate(XS)) 35: tail(cons(N,XS)) -> U91(and(isNatural(N),n__isLNat(activate(XS))),activate(XS)) 36: take(N,XS) -> U101(and(isNatural(N),n__isLNat(XS)),N,XS) 37: natsFrom(X) -> n__natsFrom(X) 38: isLNat(X) -> n__isLNat(X) 39: nil() -> n__nil() 40: afterNth(X1,X2) -> n__afterNth(X1,X2) 41: cons(X1,X2) -> n__cons(X1,X2) 42: fst(X) -> n__fst(X) 43: snd(X) -> n__snd(X) 44: tail(X) -> n__tail(X) 45: take(X1,X2) -> n__take(X1,X2) 46: 0() -> n__0() 47: head(X) -> n__head(X) 48: s(X) -> n__s(X) 49: sel(X1,X2) -> n__sel(X1,X2) 50: pair(X1,X2) -> n__pair(X1,X2) 51: splitAt(X1,X2) -> n__splitAt(X1,X2) 52: and(X1,X2) -> n__and(X1,X2) 53: activate(n__natsFrom(X)) -> natsFrom(X) 54: activate(n__isLNat(X)) -> isLNat(X) 55: activate(n__nil()) -> nil() 56: activate(n__afterNth(X1,X2)) -> afterNth(X1,X2) 57: activate(n__cons(X1,X2)) -> cons(X1,X2) 58: activate(n__fst(X)) -> fst(X) 59: activate(n__snd(X)) -> snd(X) 60: activate(n__tail(X)) -> tail(X) 61: activate(n__take(X1,X2)) -> take(X1,X2) 62: activate(n__0()) -> 0() 63: activate(n__head(X)) -> head(X) 64: activate(n__s(X)) -> s(X) 65: activate(n__sel(X1,X2)) -> sel(X1,X2) 66: activate(n__pair(X1,X2)) -> pair(X1,X2) 67: activate(n__splitAt(X1,X2)) -> splitAt(X1,X2) 68: activate(n__and(X1,X2)) -> and(X1,X2) 69: activate(X) -> X Number of strict rules: 69 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #U11(tt(),N,XS) -> #snd(splitAt(activate(N),activate(XS))) #2: #U11(tt(),N,XS) -> #splitAt(activate(N),activate(XS)) #3: #U11(tt(),N,XS) -> #activate(N) #4: #U11(tt(),N,XS) -> #activate(XS) #5: #isPLNat(n__splitAt(V1,V2)) -> #and(isNatural(activate(V1)),n__isLNat(activate(V2))) #6: #isPLNat(n__splitAt(V1,V2)) -> #isNatural(activate(V1)) #7: #isPLNat(n__splitAt(V1,V2)) -> #activate(V1) #8: #isPLNat(n__splitAt(V1,V2)) -> #activate(V2) #9: #tail(cons(N,XS)) -> #U91(and(isNatural(N),n__isLNat(activate(XS))),activate(XS)) #10: #tail(cons(N,XS)) -> #and(isNatural(N),n__isLNat(activate(XS))) #11: #tail(cons(N,XS)) -> #isNatural(N) #12: #tail(cons(N,XS)) -> #activate(XS) #13: #tail(cons(N,XS)) -> #activate(XS) #14: #activate(n__pair(X1,X2)) -> #pair(X1,X2) #15: #activate(n__natsFrom(X)) -> #natsFrom(X) #16: #activate(n__fst(X)) -> #fst(X) #17: #activate(n__take(X1,X2)) -> #take(X1,X2) #18: #U51(tt(),N,XS) -> #head(afterNth(activate(N),activate(XS))) #19: #U51(tt(),N,XS) -> #afterNth(activate(N),activate(XS))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472