Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Conte Sensi 17651 pair #381733420
details
property
value
status
complete
benchmark
Ex5_DLMMU04.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n094.star.cs.uiowa.edu
space
CSR_04
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.0202691555023 seconds
cpu usage
0.017675584
max memory
1847296.0
stage attributes
key
value
output-size
2242
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 Problem 1: (VAR N X XS Y YS) (STRATEGY CONTEXTSENSITIVE (incr 1) (oddNs) (pairNs) (repItems 1) (tail 1) (take 1 2) (zip 1 2) (0) (cons 1) (nil) (pair 1 2) (s 1) ) (RULES incr(cons(X,XS)) -> cons(s(X),incr(XS)) oddNs -> incr(pairNs) pairNs -> cons(0,incr(oddNs)) repItems(cons(X,XS)) -> cons(X,cons(X,repItems(XS))) repItems(nil) -> nil tail(cons(X,XS)) -> XS take(0,XS) -> nil take(s(N),cons(X,XS)) -> cons(X,take(N,XS)) zip(cons(X,XS),cons(Y,YS)) -> cons(pair(X,Y),zip(XS,YS)) zip(nil,XS) -> nil zip(X,nil) -> nil ) Problem 1: Dependency Pairs Processor: -> Pairs: ODDNS -> INCR(pairNs) ODDNS -> PAIRNS TAIL(cons(X,XS)) -> XS -> Rules: incr(cons(X,XS)) -> cons(s(X),incr(XS)) oddNs -> incr(pairNs) pairNs -> cons(0,incr(oddNs)) repItems(cons(X,XS)) -> cons(X,cons(X,repItems(XS))) repItems(nil) -> nil tail(cons(X,XS)) -> XS take(0,XS) -> nil take(s(N),cons(X,XS)) -> cons(X,take(N,XS)) zip(cons(X,XS),cons(Y,YS)) -> cons(pair(X,Y),zip(XS,YS)) zip(nil,XS) -> nil zip(X,nil) -> nil -> Unhiding Rules: incr(oddNs) -> INCR(oddNs) incr(oddNs) -> ODDNS incr(XS) -> INCR(XS) incr(x5) -> x5 take(N,XS) -> TAKE(N,XS) take(N,x5) -> x5 zip(XS,YS) -> ZIP(XS,YS) zip(XS,x5) -> x5 zip(x5,YS) -> x5 Problem 1: SCC Processor: -> Pairs: ODDNS -> INCR(pairNs) ODDNS -> PAIRNS TAIL(cons(X,XS)) -> XS -> Rules: incr(cons(X,XS)) -> cons(s(X),incr(XS)) oddNs -> incr(pairNs) pairNs -> cons(0,incr(oddNs)) repItems(cons(X,XS)) -> cons(X,cons(X,repItems(XS))) repItems(nil) -> nil tail(cons(X,XS)) -> XS take(0,XS) -> nil take(s(N),cons(X,XS)) -> cons(X,take(N,XS)) zip(cons(X,XS),cons(Y,YS)) -> cons(pair(X,Y),zip(XS,YS)) zip(nil,XS) -> nil zip(X,nil) -> nil -> Unhiding rules: incr(oddNs) -> INCR(oddNs) incr(oddNs) -> ODDNS incr(XS) -> INCR(XS) incr(x5) -> x5 take(N,XS) -> TAKE(N,XS) take(N,x5) -> x5 zip(XS,YS) -> ZIP(XS,YS) zip(XS,x5) -> x5 zip(x5,YS) -> x5 ->Strongly Connected Components: There is no strongly connected component
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Conte Sensi 17651