details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.0567948818207 seconds
cpu usage	0.045341457
max memory	3682304.0

stage attributes

key	value
output-size	3181
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR x y) (RULES cond(true,x,y) -> cond(gr(x,y),p(x),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: cond(true,x,y) -> cond(gr(x,y),p(x),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: COND(true,x,y) -> COND(gr(x,y),p(x),y) COND(true,x,y) -> GR(x,y) COND(true,x,y) -> P(x) GR(s(x),s(y)) -> GR(x,y) -> Rules: cond(true,x,y) -> cond(gr(x,y),p(x),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: COND(true,x,y) -> COND(gr(x,y),p(x),y) COND(true,x,y) -> GR(x,y) COND(true,x,y) -> P(x) GR(s(x),s(y)) -> GR(x,y) -> Rules: cond(true,x,y) -> cond(gr(x,y),p(x),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: cond(true,x,y) -> cond(gr(x,y),p(x),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: COND(true,x,y) -> COND(gr(x,y),p(x),y) ->->-> Rules: cond(true,x,y) -> cond(gr(x,y),p(x),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 problem is decomposed in 2 subproblems. Problem 1.1: Subterm Processor: -> Pairs: GR(s(x),s(y)) -> GR(x,y) -> Rules: cond(true,x,y) -> cond(gr(x,y),p(x),y) gr(0,x) -> false gr(s(x),0) -> true gr(s(x),s(y)) -> gr(x,y) p(0) -> 0 popout

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

job log

popout

actions

all output return to TRS Stand 20472