Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Contextsensitive pair #487092658
details
property
value
status
complete
benchmark
OvConsOS_nosorts.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n140.star.cs.uiowa.edu
space
Maude_06
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.311944 seconds
cpu usage
0.269132
user time
0.152413
system time
0.116719
max virtual memory
113188.0
max residence set size
5624.0
stage attributes
key
value
starexec-result
NO
output
NO Problem 1: (VAR IL L M N X) (STRATEGY CONTEXTSENSITIVE (and 1) (length 1) (take 1 2) (zeros) (0) (cons 1) (nil) (s 1) (tt) ) (RULES and(tt,X) -> X length(cons(N,L)) -> s(length(L)) length(nil) -> 0 take(0,IL) -> nil take(s(M),cons(N,IL)) -> cons(N,take(M,IL)) zeros -> cons(0,zeros) ) Problem 1: Dependency Pairs Processor: -> Pairs: AND(tt,X) -> X LENGTH(cons(N,L)) -> LENGTH(L) LENGTH(cons(N,L)) -> L -> Rules: and(tt,X) -> X length(cons(N,L)) -> s(length(L)) length(nil) -> 0 take(0,IL) -> nil take(s(M),cons(N,IL)) -> cons(N,take(M,IL)) zeros -> cons(0,zeros) -> Unhiding Rules: take(M,IL) -> TAKE(M,IL) take(M,x5) -> x5 zeros -> ZEROS Problem 1: SCC Processor: -> Pairs: AND(tt,X) -> X LENGTH(cons(N,L)) -> LENGTH(L) LENGTH(cons(N,L)) -> L -> Rules: and(tt,X) -> X length(cons(N,L)) -> s(length(L)) length(nil) -> 0 take(0,IL) -> nil take(s(M),cons(N,IL)) -> cons(N,take(M,IL)) zeros -> cons(0,zeros) -> Unhiding rules: take(M,IL) -> TAKE(M,IL) take(M,x5) -> x5 zeros -> ZEROS ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: LENGTH(cons(N,L)) -> LENGTH(L) ->->-> Rules: and(tt,X) -> X length(cons(N,L)) -> s(length(L)) length(nil) -> 0 take(0,IL) -> nil take(s(M),cons(N,IL)) -> cons(N,take(M,IL)) zeros -> cons(0,zeros) ->->-> Unhiding rules: Empty Problem 1: Basic Processor: -> Pairs: LENGTH(cons(N,L)) -> LENGTH(L) -> Rules: and(tt,X) -> X length(cons(N,L)) -> s(length(L)) length(nil) -> 0 take(0,IL) -> nil take(s(M),cons(N,IL)) -> cons(N,take(M,IL)) zeros -> cons(0,zeros) -> Unhiding rules: Empty -> Pairs in cycle: LENGTH(zeros) -> LENGTH(cons(0,zeros)) LENGTH(cons(0,zeros)) -> LENGTH(zeros) The problem is infinite.
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Contextsensitive