Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS_Contextsensitive 2019-03-21 05.07 pair #429996992
details
property
value
status
complete
benchmark
Ex3_12_Luc96a.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n059.star.cs.uiowa.edu
space
CSR_04
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.014685 seconds
cpu usage
0.015117
user time
0.007839
system time
0.007278
max virtual memory
113176.0
max residence set size
3680.0
stage attributes
key
value
starexec-result
YES
output
0.00/0.01 YES 0.00/0.01 0.00/0.01 Problem 1: 0.00/0.01 0.00/0.01 (VAR X Y Z) 0.00/0.01 (STRATEGY CONTEXTSENSITIVE 0.00/0.01 (from 1) 0.00/0.01 (sel 1 2) 0.00/0.01 (0) 0.00/0.01 (cons 1) 0.00/0.01 (s 1) 0.00/0.01 ) 0.00/0.01 (RULES 0.00/0.01 from(X) -> cons(X,from(s(X))) 0.00/0.01 sel(0,cons(X,Y)) -> X 0.00/0.01 sel(s(X),cons(Y,Z)) -> sel(X,Z) 0.00/0.01 ) 0.00/0.01 0.00/0.01 Problem 1: 0.00/0.01 0.00/0.01 Innermost Equivalent Processor: 0.00/0.01 -> Rules: 0.00/0.01 from(X) -> cons(X,from(s(X))) 0.00/0.01 sel(0,cons(X,Y)) -> X 0.00/0.01 sel(s(X),cons(Y,Z)) -> sel(X,Z) 0.00/0.01 -> The context-sensitive term rewriting system is an orthogonal system. Therefore, innermost cs-termination implies cs-termination. 0.00/0.01 0.00/0.01 0.00/0.01 Problem 1: 0.00/0.01 0.00/0.01 Dependency Pairs Processor: 0.00/0.01 -> Pairs: 0.00/0.01 SEL(s(X),cons(Y,Z)) -> SEL(X,Z) 0.00/0.01 SEL(s(X),cons(Y,Z)) -> Z 0.00/0.01 -> Rules: 0.00/0.01 from(X) -> cons(X,from(s(X))) 0.00/0.01 sel(0,cons(X,Y)) -> X 0.00/0.01 sel(s(X),cons(Y,Z)) -> sel(X,Z) 0.00/0.01 -> Unhiding Rules: 0.00/0.01 from(s(X)) -> FROM(s(X)) 0.00/0.01 0.00/0.01 Problem 1: 0.00/0.01 0.00/0.01 SCC Processor: 0.00/0.01 -> Pairs: 0.00/0.01 SEL(s(X),cons(Y,Z)) -> SEL(X,Z) 0.00/0.01 SEL(s(X),cons(Y,Z)) -> Z 0.00/0.01 -> Rules: 0.00/0.01 from(X) -> cons(X,from(s(X))) 0.00/0.01 sel(0,cons(X,Y)) -> X 0.00/0.01 sel(s(X),cons(Y,Z)) -> sel(X,Z) 0.00/0.01 -> Unhiding rules: 0.00/0.01 from(s(X)) -> FROM(s(X)) 0.00/0.01 ->Strongly Connected Components: 0.00/0.01 ->->Cycle: 0.00/0.01 ->->-> Pairs: 0.00/0.01 SEL(s(X),cons(Y,Z)) -> SEL(X,Z) 0.00/0.01 ->->-> Rules: 0.00/0.01 from(X) -> cons(X,from(s(X))) 0.00/0.01 sel(0,cons(X,Y)) -> X 0.00/0.01 sel(s(X),cons(Y,Z)) -> sel(X,Z) 0.00/0.01 ->->-> Unhiding rules: 0.00/0.01 Empty 0.00/0.01 0.00/0.01 Problem 1: 0.00/0.01 0.00/0.01 SubNColl Processor: 0.00/0.01 -> Pairs: 0.00/0.01 SEL(s(X),cons(Y,Z)) -> SEL(X,Z) 0.00/0.01 -> Rules: 0.00/0.01 from(X) -> cons(X,from(s(X))) 0.00/0.01 sel(0,cons(X,Y)) -> X 0.00/0.01 sel(s(X),cons(Y,Z)) -> sel(X,Z) 0.00/0.01 -> Unhiding rules: 0.00/0.01 Empty 0.00/0.01 ->Projection: 0.00/0.01 pi(SEL) = 1 0.00/0.01 0.00/0.01 Problem 1: 0.00/0.01 0.00/0.01 Basic Processor: 0.00/0.01 -> Pairs: 0.00/0.01 Empty 0.00/0.01 -> Rules: 0.00/0.01 from(X) -> cons(X,from(s(X))) 0.00/0.01 sel(0,cons(X,Y)) -> X 0.00/0.01 sel(s(X),cons(Y,Z)) -> sel(X,Z) 0.00/0.01 -> Unhiding rules: 0.00/0.01 Empty 0.00/0.01 -> Result: 0.00/0.01 Set P is empty 0.00/0.01 0.00/0.01 The problem is finite. 0.00/0.01 EOF
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS_Contextsensitive 2019-03-21 05.07