Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516962306
details
property
value
status
complete
benchmark
Ex5_DLMMU04_iGM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n045.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
muterm 6.0.3
configuration
default
runtime (wallclock)
20.0668270588 seconds
cpu usage
18.572750367
max memory
2.9884416E7
stage attributes
key
value
output-size
358608
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 v_NonEmpty:S N:S X:S X1:S X2:S XS:S Y:S YS:S) (RULES active(incr(cons(X:S,XS:S))) -> mark(cons(s(X:S),incr(XS:S))) active(repItems(cons(X:S,XS:S))) -> mark(cons(X:S,cons(X:S,repItems(XS:S)))) active(repItems(nil)) -> mark(nil) active(tail(cons(X:S,XS:S))) -> mark(XS:S) active(take(s(N:S),cons(X:S,XS:S))) -> mark(cons(X:S,take(N:S,XS:S))) active(take(0,XS:S)) -> mark(nil) active(zip(cons(X:S,XS:S),cons(Y:S,YS:S))) -> mark(cons(pair(X:S,Y:S),zip(XS:S,YS:S))) active(zip(nil,XS:S)) -> mark(nil) active(zip(X:S,nil)) -> mark(nil) active(oddNs) -> mark(incr(pairNs)) active(pairNs) -> mark(cons(0,incr(oddNs))) cons(active(X1:S),X2:S) -> cons(X1:S,X2:S) cons(mark(X1:S),X2:S) -> cons(X1:S,X2:S) cons(X1:S,active(X2:S)) -> cons(X1:S,X2:S) cons(X1:S,mark(X2:S)) -> cons(X1:S,X2:S) incr(active(X:S)) -> incr(X:S) incr(mark(X:S)) -> incr(X:S) mark(cons(X1:S,X2:S)) -> active(cons(mark(X1:S),X2:S)) mark(incr(X:S)) -> active(incr(mark(X:S))) mark(pair(X1:S,X2:S)) -> active(pair(mark(X1:S),mark(X2:S))) mark(repItems(X:S)) -> active(repItems(mark(X:S))) mark(s(X:S)) -> active(s(mark(X:S))) mark(tail(X:S)) -> active(tail(mark(X:S))) mark(take(X1:S,X2:S)) -> active(take(mark(X1:S),mark(X2:S))) mark(zip(X1:S,X2:S)) -> active(zip(mark(X1:S),mark(X2:S))) mark(0) -> active(0) mark(nil) -> active(nil) mark(oddNs) -> active(oddNs) mark(pairNs) -> active(pairNs) pair(active(X1:S),X2:S) -> pair(X1:S,X2:S) pair(mark(X1:S),X2:S) -> pair(X1:S,X2:S) pair(X1:S,active(X2:S)) -> pair(X1:S,X2:S) pair(X1:S,mark(X2:S)) -> pair(X1:S,X2:S) repItems(active(X:S)) -> repItems(X:S) repItems(mark(X:S)) -> repItems(X:S) s(active(X:S)) -> s(X:S) s(mark(X:S)) -> s(X:S) tail(active(X:S)) -> tail(X:S) tail(mark(X:S)) -> tail(X:S) take(active(X1:S),X2:S) -> take(X1:S,X2:S) take(mark(X1:S),X2:S) -> take(X1:S,X2:S) take(X1:S,active(X2:S)) -> take(X1:S,X2:S) take(X1:S,mark(X2:S)) -> take(X1:S,X2:S) zip(active(X1:S),X2:S) -> zip(X1:S,X2:S) zip(mark(X1:S),X2:S) -> zip(X1:S,X2:S) zip(X1:S,active(X2:S)) -> zip(X1:S,X2:S) zip(X1:S,mark(X2:S)) -> zip(X1:S,X2:S) ) Problem 1: Dependency Pairs Processor: -> Pairs: ACTIVE(incr(cons(X:S,XS:S))) -> CONS(s(X:S),incr(XS:S)) ACTIVE(incr(cons(X:S,XS:S))) -> INCR(XS:S) ACTIVE(incr(cons(X:S,XS:S))) -> MARK(cons(s(X:S),incr(XS:S))) ACTIVE(incr(cons(X:S,XS:S))) -> S(X:S) ACTIVE(repItems(cons(X:S,XS:S))) -> CONS(X:S,cons(X:S,repItems(XS:S))) ACTIVE(repItems(cons(X:S,XS:S))) -> CONS(X:S,repItems(XS:S)) ACTIVE(repItems(cons(X:S,XS:S))) -> MARK(cons(X:S,cons(X:S,repItems(XS:S)))) ACTIVE(repItems(cons(X:S,XS:S))) -> REPITEMS(XS:S) ACTIVE(repItems(nil)) -> MARK(nil) ACTIVE(tail(cons(X:S,XS:S))) -> MARK(XS:S) ACTIVE(take(s(N:S),cons(X:S,XS:S))) -> CONS(X:S,take(N:S,XS:S)) ACTIVE(take(s(N:S),cons(X:S,XS:S))) -> MARK(cons(X:S,take(N:S,XS:S))) ACTIVE(take(s(N:S),cons(X:S,XS:S))) -> TAKE(N:S,XS:S) ACTIVE(take(0,XS:S)) -> MARK(nil) ACTIVE(zip(cons(X:S,XS:S),cons(Y:S,YS:S))) -> CONS(pair(X:S,Y:S),zip(XS:S,YS:S)) ACTIVE(zip(cons(X:S,XS:S),cons(Y:S,YS:S))) -> MARK(cons(pair(X:S,Y:S),zip(XS:S,YS:S))) ACTIVE(zip(cons(X:S,XS:S),cons(Y:S,YS:S))) -> PAIR(X:S,Y:S) ACTIVE(zip(cons(X:S,XS:S),cons(Y:S,YS:S))) -> ZIP(XS:S,YS:S) ACTIVE(zip(nil,XS:S)) -> MARK(nil) ACTIVE(zip(X:S,nil)) -> MARK(nil) ACTIVE(oddNs) -> MARK(incr(pairNs)) ACTIVE(pairNs) -> MARK(cons(0,incr(oddNs))) CONS(active(X1:S),X2:S) -> CONS(X1:S,X2:S) CONS(mark(X1:S),X2:S) -> CONS(X1:S,X2:S) CONS(X1:S,active(X2:S)) -> CONS(X1:S,X2:S) CONS(X1:S,mark(X2:S)) -> CONS(X1:S,X2:S) INCR(active(X:S)) -> INCR(X:S) INCR(mark(X:S)) -> INCR(X:S) MARK(cons(X1:S,X2:S)) -> ACTIVE(cons(mark(X1:S),X2:S)) MARK(cons(X1:S,X2:S)) -> CONS(mark(X1:S),X2:S) MARK(cons(X1:S,X2:S)) -> MARK(X1:S) MARK(incr(X:S)) -> ACTIVE(incr(mark(X:S))) MARK(incr(X:S)) -> INCR(mark(X:S)) MARK(incr(X:S)) -> MARK(X:S) MARK(pair(X1:S,X2:S)) -> ACTIVE(pair(mark(X1:S),mark(X2:S)))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard