Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Contextsensitive pair #487092532
details
property
value
status
complete
benchmark
Ex4_7_56_Bor03.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n151.star.cs.uiowa.edu
space
CSR_04
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.0152571 seconds
cpu usage
0.015777
user time
0.007621
system time
0.008156
max virtual memory
113188.0
max residence set size
3696.0
stage attributes
key
value
starexec-result
YES
output
YES Problem 1: (VAR N X XS) (STRATEGY CONTEXTSENSITIVE (after 1 2) (from 1) (0) (cons 1) (s 1) ) (RULES after(0,XS) -> XS after(s(N),cons(X,XS)) -> after(N,XS) from(X) -> cons(X,from(s(X))) ) Problem 1: Innermost Equivalent Processor: -> Rules: after(0,XS) -> XS after(s(N),cons(X,XS)) -> after(N,XS) from(X) -> cons(X,from(s(X))) -> The context-sensitive term rewriting system is an orthogonal system. Therefore, innermost cs-termination implies cs-termination. Problem 1: Dependency Pairs Processor: -> Pairs: AFTER(s(N),cons(X,XS)) -> AFTER(N,XS) AFTER(s(N),cons(X,XS)) -> XS -> Rules: after(0,XS) -> XS after(s(N),cons(X,XS)) -> after(N,XS) from(X) -> cons(X,from(s(X))) -> Unhiding Rules: from(s(X)) -> FROM(s(X)) Problem 1: SCC Processor: -> Pairs: AFTER(s(N),cons(X,XS)) -> AFTER(N,XS) AFTER(s(N),cons(X,XS)) -> XS -> Rules: after(0,XS) -> XS after(s(N),cons(X,XS)) -> after(N,XS) from(X) -> cons(X,from(s(X))) -> Unhiding rules: from(s(X)) -> FROM(s(X)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: AFTER(s(N),cons(X,XS)) -> AFTER(N,XS) ->->-> Rules: after(0,XS) -> XS after(s(N),cons(X,XS)) -> after(N,XS) from(X) -> cons(X,from(s(X))) ->->-> Unhiding rules: Empty Problem 1: SubNColl Processor: -> Pairs: AFTER(s(N),cons(X,XS)) -> AFTER(N,XS) -> Rules: after(0,XS) -> XS after(s(N),cons(X,XS)) -> after(N,XS) from(X) -> cons(X,from(s(X))) -> Unhiding rules: Empty ->Projection: pi(AFTER) = 1 Problem 1: Basic Processor: -> Pairs: Empty -> Rules: after(0,XS) -> XS after(s(N),cons(X,XS)) -> after(N,XS) from(X) -> cons(X,from(s(X))) -> Unhiding rules: Empty -> Result: Set P is empty The problem is finite.
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Contextsensitive