Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Innermost pair #487093438
details
property
value
status
complete
benchmark
Ex2_Luc03b_GM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n139.star.cs.uiowa.edu
space
Transformed_CSR_innermost_04
run statistics
property
value
solver
muterm 6.0.3
configuration
default
runtime (wallclock)
0.18351 seconds
cpu usage
0.186712
user time
0.136692
system time
0.05002
max virtual memory
113188.0
max residence set size
9176.0
stage attributes
key
value
starexec-result
YES
output
YES Problem 1: (VAR v_NonEmpty:S X:S X1:S X2:S Y:S Z:S) (RULES a__add(0,X:S) -> mark(X:S) a__add(s(X:S),Y:S) -> s(add(X:S,Y:S)) a__add(X1:S,X2:S) -> add(X1:S,X2:S) a__from(X:S) -> cons(mark(X:S),from(s(X:S))) a__from(X:S) -> from(X:S) a__fst(0,Z:S) -> nil a__fst(s(X:S),cons(Y:S,Z:S)) -> cons(mark(Y:S),fst(X:S,Z:S)) a__fst(X1:S,X2:S) -> fst(X1:S,X2:S) a__len(cons(X:S,Z:S)) -> s(len(Z:S)) a__len(nil) -> 0 a__len(X:S) -> len(X:S) mark(0) -> 0 mark(add(X1:S,X2:S)) -> a__add(mark(X1:S),mark(X2:S)) mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) mark(from(X:S)) -> a__from(mark(X:S)) mark(fst(X1:S,X2:S)) -> a__fst(mark(X1:S),mark(X2:S)) mark(len(X:S)) -> a__len(mark(X:S)) mark(nil) -> nil mark(s(X:S)) -> s(X:S) ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: A__ADD(0,X:S) -> MARK(X:S) A__FROM(X:S) -> MARK(X:S) A__FST(s(X:S),cons(Y:S,Z:S)) -> MARK(Y:S) MARK(add(X1:S,X2:S)) -> A__ADD(mark(X1:S),mark(X2:S)) MARK(add(X1:S,X2:S)) -> MARK(X1:S) MARK(add(X1:S,X2:S)) -> MARK(X2:S) MARK(cons(X1:S,X2:S)) -> MARK(X1:S) MARK(from(X:S)) -> A__FROM(mark(X:S)) MARK(from(X:S)) -> MARK(X:S) MARK(fst(X1:S,X2:S)) -> A__FST(mark(X1:S),mark(X2:S)) MARK(fst(X1:S,X2:S)) -> MARK(X1:S) MARK(fst(X1:S,X2:S)) -> MARK(X2:S) MARK(len(X:S)) -> A__LEN(mark(X:S)) MARK(len(X:S)) -> MARK(X:S) -> Rules: a__add(0,X:S) -> mark(X:S) a__add(s(X:S),Y:S) -> s(add(X:S,Y:S)) a__add(X1:S,X2:S) -> add(X1:S,X2:S) a__from(X:S) -> cons(mark(X:S),from(s(X:S))) a__from(X:S) -> from(X:S) a__fst(0,Z:S) -> nil a__fst(s(X:S),cons(Y:S,Z:S)) -> cons(mark(Y:S),fst(X:S,Z:S)) a__fst(X1:S,X2:S) -> fst(X1:S,X2:S) a__len(cons(X:S,Z:S)) -> s(len(Z:S)) a__len(nil) -> 0 a__len(X:S) -> len(X:S) mark(0) -> 0 mark(add(X1:S,X2:S)) -> a__add(mark(X1:S),mark(X2:S)) mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) mark(from(X:S)) -> a__from(mark(X:S)) mark(fst(X1:S,X2:S)) -> a__fst(mark(X1:S),mark(X2:S)) mark(len(X:S)) -> a__len(mark(X:S)) mark(nil) -> nil mark(s(X:S)) -> s(X:S) Problem 1: SCC Processor: -> Pairs: A__ADD(0,X:S) -> MARK(X:S) A__FROM(X:S) -> MARK(X:S) A__FST(s(X:S),cons(Y:S,Z:S)) -> MARK(Y:S) MARK(add(X1:S,X2:S)) -> A__ADD(mark(X1:S),mark(X2:S)) MARK(add(X1:S,X2:S)) -> MARK(X1:S) MARK(add(X1:S,X2:S)) -> MARK(X2:S) MARK(cons(X1:S,X2:S)) -> MARK(X1:S) MARK(from(X:S)) -> A__FROM(mark(X:S)) MARK(from(X:S)) -> MARK(X:S) MARK(fst(X1:S,X2:S)) -> A__FST(mark(X1:S),mark(X2:S)) MARK(fst(X1:S,X2:S)) -> MARK(X1:S) MARK(fst(X1:S,X2:S)) -> MARK(X2:S) MARK(len(X:S)) -> A__LEN(mark(X:S)) MARK(len(X:S)) -> MARK(X:S) -> Rules: a__add(0,X:S) -> mark(X:S) a__add(s(X:S),Y:S) -> s(add(X:S,Y:S)) a__add(X1:S,X2:S) -> add(X1:S,X2:S) a__from(X:S) -> cons(mark(X:S),from(s(X:S))) a__from(X:S) -> from(X:S) a__fst(0,Z:S) -> nil a__fst(s(X:S),cons(Y:S,Z:S)) -> cons(mark(Y:S),fst(X:S,Z:S)) a__fst(X1:S,X2:S) -> fst(X1:S,X2:S) a__len(cons(X:S,Z:S)) -> s(len(Z:S)) a__len(nil) -> 0 a__len(X:S) -> len(X:S) mark(0) -> 0 mark(add(X1:S,X2:S)) -> a__add(mark(X1:S),mark(X2:S)) mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Innermost