Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Contextsensitive pair #487092522
details
property
value
status
complete
benchmark
Ex1_Luc02b.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
CSR_04
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.016556 seconds
cpu usage
0.016863
user time
0.010727
system time
0.006136
max virtual memory
113188.0
max residence set size
4960.0
stage attributes
key
value
starexec-result
YES
output
YES Problem 1: (VAR X Y Z) (STRATEGY CONTEXTSENSITIVE (first 1 2) (from 1) (sel 1 2) (0) (cons 1) (nil) (s 1) ) (RULES first(0,Z) -> nil first(s(X),cons(Y,Z)) -> cons(Y,first(X,Z)) from(X) -> cons(X,from(s(X))) sel(0,cons(X,Z)) -> X sel(s(X),cons(Y,Z)) -> sel(X,Z) ) Problem 1: Innermost Equivalent Processor: -> Rules: first(0,Z) -> nil first(s(X),cons(Y,Z)) -> cons(Y,first(X,Z)) from(X) -> cons(X,from(s(X))) sel(0,cons(X,Z)) -> X sel(s(X),cons(Y,Z)) -> sel(X,Z) -> The context-sensitive term rewriting system is an orthogonal system. Therefore, innermost cs-termination implies cs-termination. Problem 1: Dependency Pairs Processor: -> Pairs: SEL(s(X),cons(Y,Z)) -> SEL(X,Z) SEL(s(X),cons(Y,Z)) -> Z -> Rules: first(0,Z) -> nil first(s(X),cons(Y,Z)) -> cons(Y,first(X,Z)) from(X) -> cons(X,from(s(X))) sel(0,cons(X,Z)) -> X sel(s(X),cons(Y,Z)) -> sel(X,Z) -> Unhiding Rules: first(X,Z) -> FIRST(X,Z) first(X,x3) -> x3 from(s(X)) -> FROM(s(X)) Problem 1: SCC Processor: -> Pairs: SEL(s(X),cons(Y,Z)) -> SEL(X,Z) SEL(s(X),cons(Y,Z)) -> Z -> Rules: first(0,Z) -> nil first(s(X),cons(Y,Z)) -> cons(Y,first(X,Z)) from(X) -> cons(X,from(s(X))) sel(0,cons(X,Z)) -> X sel(s(X),cons(Y,Z)) -> sel(X,Z) -> Unhiding rules: first(X,Z) -> FIRST(X,Z) first(X,x3) -> x3 from(s(X)) -> FROM(s(X)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: SEL(s(X),cons(Y,Z)) -> SEL(X,Z) ->->-> Rules: first(0,Z) -> nil first(s(X),cons(Y,Z)) -> cons(Y,first(X,Z)) from(X) -> cons(X,from(s(X))) sel(0,cons(X,Z)) -> X sel(s(X),cons(Y,Z)) -> sel(X,Z) ->->-> Unhiding rules: Empty Problem 1: SubNColl Processor: -> Pairs: SEL(s(X),cons(Y,Z)) -> SEL(X,Z) -> Rules: first(0,Z) -> nil first(s(X),cons(Y,Z)) -> cons(Y,first(X,Z)) from(X) -> cons(X,from(s(X))) sel(0,cons(X,Z)) -> X sel(s(X),cons(Y,Z)) -> sel(X,Z) -> Unhiding rules: Empty ->Projection: pi(SEL) = 1 Problem 1: Basic Processor: -> Pairs:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Contextsensitive