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	n013.star.cs.uiowa.edu
space	Maude_06

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.329507 seconds
cpu usage	0.273085
user time	0.157553
system time	0.115532
max virtual memory	113176.0
max residence set size	5628.0

stage attributes

key	value
starexec-result	NO

output

0.00/0.32 NO 0.00/0.32 0.00/0.32 Problem 1: 0.00/0.32 0.00/0.32 (VAR IL L M N X) 0.00/0.32 (STRATEGY CONTEXTSENSITIVE 0.00/0.32 (and 1) 0.00/0.32 (length 1) 0.00/0.32 (take 1 2) 0.00/0.32 (zeros) 0.00/0.32 (0) 0.00/0.32 (cons 1) 0.00/0.32 (nil) 0.00/0.32 (s 1) 0.00/0.32 (tt) 0.00/0.32 ) 0.00/0.32 (RULES 0.00/0.32 and(tt,X) -> X 0.00/0.32 length(cons(N,L)) -> s(length(L)) 0.00/0.32 length(nil) -> 0 0.00/0.32 take(0,IL) -> nil 0.00/0.32 take(s(M),cons(N,IL)) -> cons(N,take(M,IL)) 0.00/0.32 zeros -> cons(0,zeros) 0.00/0.32 ) 0.00/0.32 0.00/0.32 Problem 1: 0.00/0.32 0.00/0.32 Dependency Pairs Processor: 0.00/0.32 -> Pairs: 0.00/0.32 AND(tt,X) -> X 0.00/0.32 LENGTH(cons(N,L)) -> LENGTH(L) 0.00/0.32 LENGTH(cons(N,L)) -> L 0.00/0.32 -> Rules: 0.00/0.32 and(tt,X) -> X 0.00/0.32 length(cons(N,L)) -> s(length(L)) 0.00/0.32 length(nil) -> 0 0.00/0.32 take(0,IL) -> nil 0.00/0.32 take(s(M),cons(N,IL)) -> cons(N,take(M,IL)) 0.00/0.32 zeros -> cons(0,zeros) 0.00/0.32 -> Unhiding Rules: 0.00/0.32 take(M,IL) -> TAKE(M,IL) 0.00/0.32 take(M,x5) -> x5 0.00/0.32 zeros -> ZEROS 0.00/0.32 0.00/0.32 Problem 1: 0.00/0.32 0.00/0.32 SCC Processor: 0.00/0.32 -> Pairs: 0.00/0.32 AND(tt,X) -> X 0.00/0.32 LENGTH(cons(N,L)) -> LENGTH(L) 0.00/0.32 LENGTH(cons(N,L)) -> L 0.00/0.32 -> Rules: 0.00/0.32 and(tt,X) -> X 0.00/0.32 length(cons(N,L)) -> s(length(L)) 0.00/0.32 length(nil) -> 0 0.00/0.32 take(0,IL) -> nil 0.00/0.32 take(s(M),cons(N,IL)) -> cons(N,take(M,IL)) 0.00/0.32 zeros -> cons(0,zeros) 0.00/0.32 -> Unhiding rules: 0.00/0.32 take(M,IL) -> TAKE(M,IL) 0.00/0.32 take(M,x5) -> x5 0.00/0.32 zeros -> ZEROS 0.00/0.32 ->Strongly Connected Components: 0.00/0.32 ->->Cycle: 0.00/0.32 ->->-> Pairs: 0.00/0.32 LENGTH(cons(N,L)) -> LENGTH(L) 0.00/0.32 ->->-> Rules: 0.00/0.32 and(tt,X) -> X 0.00/0.32 length(cons(N,L)) -> s(length(L)) 0.00/0.32 length(nil) -> 0 0.00/0.32 take(0,IL) -> nil 0.00/0.32 take(s(M),cons(N,IL)) -> cons(N,take(M,IL)) 0.00/0.32 zeros -> cons(0,zeros) 0.00/0.32 ->->-> Unhiding rules: 0.00/0.32 Empty 0.00/0.32 0.00/0.32 Problem 1: 0.00/0.32 0.00/0.32 Basic Processor: 0.00/0.32 -> Pairs: 0.00/0.32 LENGTH(cons(N,L)) -> LENGTH(L) 0.00/0.32 -> Rules: 0.00/0.32 and(tt,X) -> X 0.00/0.32 length(cons(N,L)) -> s(length(L)) 0.00/0.32 length(nil) -> 0 0.00/0.32 take(0,IL) -> nil 0.00/0.32 take(s(M),cons(N,IL)) -> cons(N,take(M,IL)) 0.00/0.32 zeros -> cons(0,zeros) 0.00/0.32 -> Unhiding rules: 0.00/0.32 Empty 0.00/0.32 -> Pairs in cycle: 0.00/0.32 LENGTH(zeros) -> LENGTH(cons(0,zeros)) 0.00/0.32 LENGTH(cons(0,zeros)) -> LENGTH(zeros) 0.00/0.32 0.00/0.32 The problem is infinite. 0.00/0.32 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