Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Contextsensitive pair #487092476
details
property
value
status
complete
benchmark
ex5.8.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
Transformed_outermost_08
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.015434 seconds
cpu usage
0.015967
user time
0.005976
system time
0.009991
max virtual memory
113188.0
max residence set size
4940.0
stage attributes
key
value
starexec-result
YES
output
YES Problem 1: (VAR x xs) (STRATEGY CONTEXTSENSITIVE (cons_1) (from_1) (from_2) (from_3) (from_4) (cons_0 1 2) (nil_0) (s_0 1) ) (RULES cons_1(s_0(s_0(x)),xs) -> nil_0 from_1(x) -> cons_1(x,from_1(s_0(x))) from_2(x) -> cons_0(x,from_1(s_0(x))) from_3(x) -> cons_0(x,from_2(s_0(x))) from_4(x) -> cons_0(x,from_2(s_0(x))) ) Problem 1: Innermost Equivalent Processor: -> Rules: cons_1(s_0(s_0(x)),xs) -> nil_0 from_1(x) -> cons_1(x,from_1(s_0(x))) from_2(x) -> cons_0(x,from_1(s_0(x))) from_3(x) -> cons_0(x,from_2(s_0(x))) from_4(x) -> cons_0(x,from_2(s_0(x))) -> The context-sensitive term rewriting system is an orthogonal system. Therefore, innermost cs-termination implies cs-termination. Problem 1: Dependency Pairs Processor: -> Pairs: FROM_1(x) -> CONS_1(x,from_1(s_0(x))) FROM_2(x) -> FROM_1(s_0(x)) FROM_2(x) -> x FROM_3(x) -> FROM_2(s_0(x)) FROM_3(x) -> x FROM_4(x) -> FROM_2(s_0(x)) FROM_4(x) -> x -> Rules: cons_1(s_0(s_0(x)),xs) -> nil_0 from_1(x) -> cons_1(x,from_1(s_0(x))) from_2(x) -> cons_0(x,from_1(s_0(x))) from_3(x) -> cons_0(x,from_2(s_0(x))) from_4(x) -> cons_0(x,from_2(s_0(x))) -> Unhiding Rules: from_1(s_0(x)) -> FROM_1(s_0(x)) Problem 1: SCC Processor: -> Pairs: FROM_1(x) -> CONS_1(x,from_1(s_0(x))) FROM_2(x) -> FROM_1(s_0(x)) FROM_2(x) -> x FROM_3(x) -> FROM_2(s_0(x)) FROM_3(x) -> x FROM_4(x) -> FROM_2(s_0(x)) FROM_4(x) -> x -> Rules: cons_1(s_0(s_0(x)),xs) -> nil_0 from_1(x) -> cons_1(x,from_1(s_0(x))) from_2(x) -> cons_0(x,from_1(s_0(x))) from_3(x) -> cons_0(x,from_2(s_0(x))) from_4(x) -> cons_0(x,from_2(s_0(x))) -> Unhiding rules: from_1(s_0(x)) -> FROM_1(s_0(x)) ->Strongly Connected Components: There is no strongly connected component The problem is finite.
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Contextsensitive