Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381716848
details
property
value
status
complete
benchmark
LISTUTILITIES_nosorts_FR.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
Transformed_CSR_04
run statistics
property
value
solver
NaTT
configuration
Default
runtime (wallclock)
0.0913460254669 seconds
cpu usage
0.101544046
max memory
1.1853824E7
stage attributes
key
value
output-size
4486
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: U11(tt(),N,X,XS) -> U12(splitAt(activate(N),activate(XS)),activate(X)) 2: U12(pair(YS,ZS),X) -> pair(cons(activate(X),YS),ZS) 3: afterNth(N,XS) -> snd(splitAt(N,XS)) 4: and(tt(),X) -> activate(X) 5: fst(pair(X,Y)) -> X 6: head(cons(N,XS)) -> N 7: natsFrom(N) -> cons(N,n__natsFrom(n__s(N))) 8: sel(N,XS) -> head(afterNth(N,XS)) 9: snd(pair(X,Y)) -> Y 10: splitAt(0(),XS) -> pair(nil(),XS) 11: splitAt(s(N),cons(X,XS)) -> U11(tt(),N,X,activate(XS)) 12: tail(cons(N,XS)) -> activate(XS) 13: take(N,XS) -> fst(splitAt(N,XS)) 14: natsFrom(X) -> n__natsFrom(X) 15: s(X) -> n__s(X) 16: activate(n__natsFrom(X)) -> natsFrom(activate(X)) 17: activate(n__s(X)) -> s(activate(X)) 18: activate(X) -> X Number of strict rules: 18 Direct POLO(bPol) ... failed. Uncurrying U11 1: U11^1_tt(N,X,XS) -> U12(splitAt(activate(N),activate(XS)),activate(X)) 2: U12(pair(YS,ZS),X) -> pair(cons(activate(X),YS),ZS) 3: afterNth(N,XS) -> snd(splitAt(N,XS)) 4: and(tt(),X) -> activate(X) 5: fst(pair(X,Y)) -> X 6: head(cons(N,XS)) -> N 7: natsFrom(N) -> cons(N,n__natsFrom(n__s(N))) 8: sel(N,XS) -> head(afterNth(N,XS)) 9: snd(pair(X,Y)) -> Y 10: splitAt(0(),XS) -> pair(nil(),XS) 11: splitAt(s(N),cons(X,XS)) -> U11^1_tt(N,X,activate(XS)) 12: tail(cons(N,XS)) -> activate(XS) 13: take(N,XS) -> fst(splitAt(N,XS)) 14: natsFrom(X) -> n__natsFrom(X) 15: s(X) -> n__s(X) 16: activate(n__natsFrom(X)) -> natsFrom(activate(X)) 17: activate(n__s(X)) -> s(activate(X)) 18: activate(X) -> X 19: U11(tt(),_3,_4,_5) ->= U11^1_tt(_3,_4,_5) Number of strict rules: 18 Direct POLO(bPol) ... failed. Dependency Pairs: #1: #U12(pair(YS,ZS),X) -> #activate(X) #2: #take(N,XS) -> #fst(splitAt(N,XS)) #3: #take(N,XS) -> #splitAt(N,XS) #4: #splitAt(s(N),cons(X,XS)) -> #U11^1_tt(N,X,activate(XS)) #5: #splitAt(s(N),cons(X,XS)) -> #activate(XS) #6: #tail(cons(N,XS)) -> #activate(XS) #7: #activate(n__s(X)) -> #s(activate(X)) #8: #activate(n__s(X)) -> #activate(X) #9: #U11(tt(),_3,_4,_5) ->? #U11^1_tt(_3,_4,_5) #10: #activate(n__natsFrom(X)) -> #natsFrom(activate(X)) #11: #activate(n__natsFrom(X)) -> #activate(X) #12: #afterNth(N,XS) -> #snd(splitAt(N,XS)) #13: #afterNth(N,XS) -> #splitAt(N,XS) #14: #U11^1_tt(N,X,XS) -> #U12(splitAt(activate(N),activate(XS)),activate(X)) #15: #U11^1_tt(N,X,XS) -> #splitAt(activate(N),activate(XS)) #16: #U11^1_tt(N,X,XS) -> #activate(N) #17: #U11^1_tt(N,X,XS) -> #activate(XS) #18: #U11^1_tt(N,X,XS) -> #activate(X) #19: #sel(N,XS) -> #head(afterNth(N,XS)) #20: #sel(N,XS) -> #afterNth(N,XS) #21: #and(tt(),X) -> #activate(X) Number of SCCs: 2, DPs: 4 SCC { #8 #11 } POLO(Sum)... succeeded. U11 w: 0 s w: 0 #take w: 0 activate w: 0 take w: 0 and w: 0 pair w: 0 fst w: 0 #activate w: x1 natsFrom w: 0 #head w: 0 splitAt w: 0 #fst w: 0 U12 w: 0 n__natsFrom w: x1 + 1 n__s w: x1 + 1 #U12 w: 0 tail w: 0 0 w: 0 #sel w: 0 sel w: 0 #s w: 0 afterNth w: 0 nil w: 0 U11^1_tt w: 0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472