details

property	value
status	complete
benchmark	Ex1_GL02a.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n088.star.cs.uiowa.edu
space	CSR_04

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.0382430553436 seconds
cpu usage	0.028987368
max memory	3309568.0

stage attributes

key	value
output-size	2367
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR L X Y) (STRATEGY CONTEXTSENSITIVE (eq) (inf 1) (length 1) (take 1 2) (0) (cons) (false) (nil) (s) (true) ) (RULES eq(0,0) -> true eq(s(X),s(Y)) -> eq(X,Y) eq(X,Y) -> false inf(X) -> cons(X,inf(s(X))) length(cons(X,L)) -> s(length(L)) length(nil) -> 0 take(0,X) -> nil take(s(X),cons(Y,L)) -> cons(Y,take(X,L)) ) Problem 1: Dependency Pairs Processor: -> Pairs: EQ(s(X),s(Y)) -> EQ(X,Y) -> Rules: eq(0,0) -> true eq(s(X),s(Y)) -> eq(X,Y) eq(X,Y) -> false inf(X) -> cons(X,inf(s(X))) length(cons(X,L)) -> s(length(L)) length(nil) -> 0 take(0,X) -> nil take(s(X),cons(Y,L)) -> cons(Y,take(X,L)) -> Unhiding Rules: Empty Problem 1: SCC Processor: -> Pairs: EQ(s(X),s(Y)) -> EQ(X,Y) -> Rules: eq(0,0) -> true eq(s(X),s(Y)) -> eq(X,Y) eq(X,Y) -> false inf(X) -> cons(X,inf(s(X))) length(cons(X,L)) -> s(length(L)) length(nil) -> 0 take(0,X) -> nil take(s(X),cons(Y,L)) -> cons(Y,take(X,L)) -> Unhiding rules: Empty ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: EQ(s(X),s(Y)) -> EQ(X,Y) ->->-> Rules: eq(0,0) -> true eq(s(X),s(Y)) -> eq(X,Y) eq(X,Y) -> false inf(X) -> cons(X,inf(s(X))) length(cons(X,L)) -> s(length(L)) length(nil) -> 0 take(0,X) -> nil take(s(X),cons(Y,L)) -> cons(Y,take(X,L)) ->->-> Unhiding rules: Empty Problem 1: Reduction Pairs Processor: -> Pairs: EQ(s(X),s(Y)) -> EQ(X,Y) -> Rules: eq(0,0) -> true eq(s(X),s(Y)) -> eq(X,Y) eq(X,Y) -> false inf(X) -> cons(X,inf(s(X))) length(cons(X,L)) -> s(length(L)) length(nil) -> 0 take(0,X) -> nil take(s(X),cons(Y,L)) -> cons(Y,take(X,L)) -> Unhiding rules: Empty -> Usable rules: popout

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

job log

popout

actions

all output return to TRS Conte Sensi 17651