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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.375419855118 seconds
cpu usage	0.285786668
max memory	4792320.0

stage attributes

key	value
output-size	1939
starexec-result	NO

output

/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- 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) popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to TRS Context Sensitive