details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.660242795944 seconds
cpu usage	0.137263591
max memory	4190208.0

stage attributes

key	value
output-size	5892
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 x y) (RULES cond1(true,x,y) -> cond2(gr(y,0),x,y) cond2(false,x,y) -> cond1(gr(x,0),p(x),y) cond2(true,x,y) -> cond2(gr(y,0),x,p(y)) gr(0,x) -> false gr(s(x),0) -> true gr(s(x),s(y)) -> gr(x,y) p(0) -> 0 p(s(x)) -> x ) Problem 1: Innermost Equivalent Processor: -> Rules: cond1(true,x,y) -> cond2(gr(y,0),x,y) cond2(false,x,y) -> cond1(gr(x,0),p(x),y) cond2(true,x,y) -> cond2(gr(y,0),x,p(y)) gr(0,x) -> false gr(s(x),0) -> true gr(s(x),s(y)) -> gr(x,y) p(0) -> 0 p(s(x)) -> x -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: COND1(true,x,y) -> COND2(gr(y,0),x,y) COND1(true,x,y) -> GR(y,0) COND2(false,x,y) -> COND1(gr(x,0),p(x),y) COND2(false,x,y) -> GR(x,0) COND2(false,x,y) -> P(x) COND2(true,x,y) -> COND2(gr(y,0),x,p(y)) COND2(true,x,y) -> GR(y,0) COND2(true,x,y) -> P(y) GR(s(x),s(y)) -> GR(x,y) -> Rules: cond1(true,x,y) -> cond2(gr(y,0),x,y) cond2(false,x,y) -> cond1(gr(x,0),p(x),y) cond2(true,x,y) -> cond2(gr(y,0),x,p(y)) gr(0,x) -> false gr(s(x),0) -> true gr(s(x),s(y)) -> gr(x,y) p(0) -> 0 p(s(x)) -> x Problem 1: SCC Processor: -> Pairs: COND1(true,x,y) -> COND2(gr(y,0),x,y) COND1(true,x,y) -> GR(y,0) COND2(false,x,y) -> COND1(gr(x,0),p(x),y) COND2(false,x,y) -> GR(x,0) COND2(false,x,y) -> P(x) COND2(true,x,y) -> COND2(gr(y,0),x,p(y)) COND2(true,x,y) -> GR(y,0) COND2(true,x,y) -> P(y) GR(s(x),s(y)) -> GR(x,y) -> Rules: cond1(true,x,y) -> cond2(gr(y,0),x,y) cond2(false,x,y) -> cond1(gr(x,0),p(x),y) cond2(true,x,y) -> cond2(gr(y,0),x,p(y)) gr(0,x) -> false gr(s(x),0) -> true gr(s(x),s(y)) -> gr(x,y) p(0) -> 0 p(s(x)) -> x ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: GR(s(x),s(y)) -> GR(x,y) ->->-> Rules: cond1(true,x,y) -> cond2(gr(y,0),x,y) cond2(false,x,y) -> cond1(gr(x,0),p(x),y) cond2(true,x,y) -> cond2(gr(y,0),x,p(y)) gr(0,x) -> false gr(s(x),0) -> true gr(s(x),s(y)) -> gr(x,y) p(0) -> 0 p(s(x)) -> x ->->Cycle: ->->-> Pairs: COND1(true,x,y) -> COND2(gr(y,0),x,y) COND2(false,x,y) -> COND1(gr(x,0),p(x),y) COND2(true,x,y) -> COND2(gr(y,0),x,p(y)) popout

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

job log

popout

actions

all output return to TRS Stand 20472