Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Innermost pair #487093084
details
property
value
status
complete
benchmark
Ex6_Luc98_GM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n146.star.cs.uiowa.edu
space
Transformed_CSR_innermost_04
run statistics
property
value
solver
muterm 6.0.3
configuration
default
runtime (wallclock)
0.127744 seconds
cpu usage
0.096487
user time
0.055475
system time
0.041012
max virtual memory
113188.0
max residence set size
5836.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__first(0,X:S) -> nil a__first(s(X:S),cons(Y:S,Z:S)) -> cons(mark(Y:S),first(X:S,Z:S)) a__first(X1:S,X2:S) -> first(X1:S,X2:S) a__from(X:S) -> cons(mark(X:S),from(s(X:S))) a__from(X:S) -> from(X:S) mark(0) -> 0 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) mark(first(X1:S,X2:S)) -> a__first(mark(X1:S),mark(X2:S)) mark(from(X:S)) -> a__from(mark(X:S)) mark(nil) -> nil mark(s(X:S)) -> s(mark(X:S)) ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: A__FIRST(s(X:S),cons(Y:S,Z:S)) -> MARK(Y:S) A__FROM(X:S) -> MARK(X:S) MARK(cons(X1:S,X2:S)) -> MARK(X1:S) MARK(first(X1:S,X2:S)) -> A__FIRST(mark(X1:S),mark(X2:S)) MARK(first(X1:S,X2:S)) -> MARK(X1:S) MARK(first(X1:S,X2:S)) -> MARK(X2:S) MARK(from(X:S)) -> A__FROM(mark(X:S)) MARK(from(X:S)) -> MARK(X:S) MARK(s(X:S)) -> MARK(X:S) -> Rules: a__first(0,X:S) -> nil a__first(s(X:S),cons(Y:S,Z:S)) -> cons(mark(Y:S),first(X:S,Z:S)) a__first(X1:S,X2:S) -> first(X1:S,X2:S) a__from(X:S) -> cons(mark(X:S),from(s(X:S))) a__from(X:S) -> from(X:S) mark(0) -> 0 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) mark(first(X1:S,X2:S)) -> a__first(mark(X1:S),mark(X2:S)) mark(from(X:S)) -> a__from(mark(X:S)) mark(nil) -> nil mark(s(X:S)) -> s(mark(X:S)) Problem 1: SCC Processor: -> Pairs: A__FIRST(s(X:S),cons(Y:S,Z:S)) -> MARK(Y:S) A__FROM(X:S) -> MARK(X:S) MARK(cons(X1:S,X2:S)) -> MARK(X1:S) MARK(first(X1:S,X2:S)) -> A__FIRST(mark(X1:S),mark(X2:S)) MARK(first(X1:S,X2:S)) -> MARK(X1:S) MARK(first(X1:S,X2:S)) -> MARK(X2:S) MARK(from(X:S)) -> A__FROM(mark(X:S)) MARK(from(X:S)) -> MARK(X:S) MARK(s(X:S)) -> MARK(X:S) -> Rules: a__first(0,X:S) -> nil a__first(s(X:S),cons(Y:S,Z:S)) -> cons(mark(Y:S),first(X:S,Z:S)) a__first(X1:S,X2:S) -> first(X1:S,X2:S) a__from(X:S) -> cons(mark(X:S),from(s(X:S))) a__from(X:S) -> from(X:S) mark(0) -> 0 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) mark(first(X1:S,X2:S)) -> a__first(mark(X1:S),mark(X2:S)) mark(from(X:S)) -> a__from(mark(X:S)) mark(nil) -> nil mark(s(X:S)) -> s(mark(X:S)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A__FIRST(s(X:S),cons(Y:S,Z:S)) -> MARK(Y:S) A__FROM(X:S) -> MARK(X:S) MARK(cons(X1:S,X2:S)) -> MARK(X1:S) MARK(first(X1:S,X2:S)) -> A__FIRST(mark(X1:S),mark(X2:S)) MARK(first(X1:S,X2:S)) -> MARK(X1:S) MARK(first(X1:S,X2:S)) -> MARK(X2:S) MARK(from(X:S)) -> A__FROM(mark(X:S)) MARK(from(X:S)) -> MARK(X:S) MARK(s(X:S)) -> MARK(X:S) ->->-> Rules: a__first(0,X:S) -> nil a__first(s(X:S),cons(Y:S,Z:S)) -> cons(mark(Y:S),first(X:S,Z:S)) a__first(X1:S,X2:S) -> first(X1:S,X2:S) a__from(X:S) -> cons(mark(X:S),from(s(X:S))) a__from(X:S) -> from(X:S) mark(0) -> 0 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) mark(first(X1:S,X2:S)) -> a__first(mark(X1:S),mark(X2:S)) mark(from(X:S)) -> a__from(mark(X:S)) mark(nil) -> nil mark(s(X:S)) -> s(mark(X:S)) Problem 1: Reduction Pairs Processor: -> Pairs:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Innermost