details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.243641138077 seconds
cpu usage	0.18379071
max memory	4685824.0

stage attributes

key	value
output-size	9560
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 v_NonEmpty:S X:S X1:S X2:S) (RULES a__f(0) -> cons(0,f(s(0))) a__f(s(0)) -> a__f(a__p(s(0))) a__f(X:S) -> f(X:S) a__p(s(X:S)) -> mark(X:S) a__p(X:S) -> p(X:S) mark(0) -> 0 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) mark(f(X:S)) -> a__f(mark(X:S)) mark(p(X:S)) -> a__p(mark(X:S)) mark(s(X:S)) -> s(mark(X:S)) ) Problem 1: Dependency Pairs Processor: -> Pairs: A__F(s(0)) -> A__F(a__p(s(0))) A__F(s(0)) -> A__P(s(0)) A__P(s(X:S)) -> MARK(X:S) MARK(cons(X1:S,X2:S)) -> MARK(X1:S) MARK(f(X:S)) -> A__F(mark(X:S)) MARK(f(X:S)) -> MARK(X:S) MARK(p(X:S)) -> A__P(mark(X:S)) MARK(p(X:S)) -> MARK(X:S) MARK(s(X:S)) -> MARK(X:S) -> Rules: a__f(0) -> cons(0,f(s(0))) a__f(s(0)) -> a__f(a__p(s(0))) a__f(X:S) -> f(X:S) a__p(s(X:S)) -> mark(X:S) a__p(X:S) -> p(X:S) mark(0) -> 0 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) mark(f(X:S)) -> a__f(mark(X:S)) mark(p(X:S)) -> a__p(mark(X:S)) mark(s(X:S)) -> s(mark(X:S)) Problem 1: SCC Processor: -> Pairs: A__F(s(0)) -> A__F(a__p(s(0))) A__F(s(0)) -> A__P(s(0)) A__P(s(X:S)) -> MARK(X:S) MARK(cons(X1:S,X2:S)) -> MARK(X1:S) MARK(f(X:S)) -> A__F(mark(X:S)) MARK(f(X:S)) -> MARK(X:S) MARK(p(X:S)) -> A__P(mark(X:S)) MARK(p(X:S)) -> MARK(X:S) MARK(s(X:S)) -> MARK(X:S) -> Rules: a__f(0) -> cons(0,f(s(0))) a__f(s(0)) -> a__f(a__p(s(0))) a__f(X:S) -> f(X:S) a__p(s(X:S)) -> mark(X:S) a__p(X:S) -> p(X:S) mark(0) -> 0 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) mark(f(X:S)) -> a__f(mark(X:S)) mark(p(X:S)) -> a__p(mark(X:S)) mark(s(X:S)) -> s(mark(X:S)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A__F(s(0)) -> A__F(a__p(s(0))) A__F(s(0)) -> A__P(s(0)) A__P(s(X:S)) -> MARK(X:S) MARK(cons(X1:S,X2:S)) -> MARK(X1:S) MARK(f(X:S)) -> A__F(mark(X:S)) MARK(f(X:S)) -> MARK(X:S) MARK(p(X:S)) -> A__P(mark(X:S)) MARK(p(X:S)) -> MARK(X:S) MARK(s(X:S)) -> MARK(X:S) ->->-> Rules: a__f(0) -> cons(0,f(s(0))) a__f(s(0)) -> a__f(a__p(s(0))) a__f(X:S) -> f(X:S) a__p(s(X:S)) -> mark(X:S) a__p(X:S) -> p(X:S) mark(0) -> 0 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) mark(f(X:S)) -> a__f(mark(X:S)) mark(p(X:S)) -> a__p(mark(X:S)) mark(s(X:S)) -> s(mark(X:S)) Problem 1: Reduction Pair Processor: popout

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

job log

popout

actions

all output return to TRS Standard