Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Contextsensitive pair #487092556
details
property
value
status
complete
benchmark
Ex2_Luc03b.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n137.star.cs.uiowa.edu
space
CSR_04
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.014156 seconds
cpu usage
0.014594
user time
0.004565
system time
0.010029
max virtual memory
113188.0
max residence set size
3440.0
stage attributes
key
value
starexec-result
YES
output
YES Problem 1: (VAR X Y Z) (STRATEGY CONTEXTSENSITIVE (add 1 2) (from 1) (fst 1 2) (len 1) (0) (cons 1) (nil) (s) ) (RULES add(0,X) -> X add(s(X),Y) -> s(add(X,Y)) from(X) -> cons(X,from(s(X))) fst(0,Z) -> nil fst(s(X),cons(Y,Z)) -> cons(Y,fst(X,Z)) len(cons(X,Z)) -> s(len(Z)) len(nil) -> 0 ) Problem 1: Innermost Equivalent Processor: -> Rules: add(0,X) -> X add(s(X),Y) -> s(add(X,Y)) from(X) -> cons(X,from(s(X))) fst(0,Z) -> nil fst(s(X),cons(Y,Z)) -> cons(Y,fst(X,Z)) len(cons(X,Z)) -> s(len(Z)) len(nil) -> 0 -> The context-sensitive term rewriting system is an orthogonal system. Therefore, innermost cs-termination implies cs-termination. Problem 1: Dependency Pairs Processor: -> Pairs: Empty -> Rules: add(0,X) -> X add(s(X),Y) -> s(add(X,Y)) from(X) -> cons(X,from(s(X))) fst(0,Z) -> nil fst(s(X),cons(Y,Z)) -> cons(Y,fst(X,Z)) len(cons(X,Z)) -> s(len(Z)) len(nil) -> 0 -> Unhiding Rules: Empty Problem 1: Basic Processor: -> Pairs: Empty -> Rules: add(0,X) -> X add(s(X),Y) -> s(add(X,Y)) from(X) -> cons(X,from(s(X))) fst(0,Z) -> nil fst(s(X),cons(Y,Z)) -> cons(Y,fst(X,Z)) len(cons(X,Z)) -> s(len(Z)) len(nil) -> 0 -> 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