details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	60.8824520111 seconds
cpu usage	60.235504747
max memory	8.3345408E7

stage attributes

key	value
output-size	30859
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 z) (RULES add(0,x) -> x add(s(x),y) -> s(add(x,y)) cond1(true,x,y,z) -> cond2(gr(x,0),x,y,z) cond2(false,x,y,z) -> cond3(gr(y,0),x,y,z) cond2(true,x,y,z) -> cond1(gr(add(x,y),z),p(x),y,z) cond3(false,x,y,z) -> cond1(gr(add(x,y),z),x,y,z) cond3(true,x,y,z) -> cond1(gr(add(x,y),z),x,p(y),z) 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: add(0,x) -> x add(s(x),y) -> s(add(x,y)) cond1(true,x,y,z) -> cond2(gr(x,0),x,y,z) cond2(false,x,y,z) -> cond3(gr(y,0),x,y,z) cond2(true,x,y,z) -> cond1(gr(add(x,y),z),p(x),y,z) cond3(false,x,y,z) -> cond1(gr(add(x,y),z),x,y,z) cond3(true,x,y,z) -> cond1(gr(add(x,y),z),x,p(y),z) 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: ADD(s(x),y) -> ADD(x,y) COND1(true,x,y,z) -> COND2(gr(x,0),x,y,z) COND1(true,x,y,z) -> GR(x,0) COND2(false,x,y,z) -> COND3(gr(y,0),x,y,z) COND2(false,x,y,z) -> GR(y,0) COND2(true,x,y,z) -> ADD(x,y) COND2(true,x,y,z) -> COND1(gr(add(x,y),z),p(x),y,z) COND2(true,x,y,z) -> GR(add(x,y),z) COND2(true,x,y,z) -> P(x) COND3(false,x,y,z) -> ADD(x,y) COND3(false,x,y,z) -> COND1(gr(add(x,y),z),x,y,z) COND3(false,x,y,z) -> GR(add(x,y),z) COND3(true,x,y,z) -> ADD(x,y) COND3(true,x,y,z) -> COND1(gr(add(x,y),z),x,p(y),z) COND3(true,x,y,z) -> GR(add(x,y),z) COND3(true,x,y,z) -> P(y) GR(s(x),s(y)) -> GR(x,y) -> Rules: add(0,x) -> x add(s(x),y) -> s(add(x,y)) cond1(true,x,y,z) -> cond2(gr(x,0),x,y,z) cond2(false,x,y,z) -> cond3(gr(y,0),x,y,z) cond2(true,x,y,z) -> cond1(gr(add(x,y),z),p(x),y,z) cond3(false,x,y,z) -> cond1(gr(add(x,y),z),x,y,z) cond3(true,x,y,z) -> cond1(gr(add(x,y),z),x,p(y),z) 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: ADD(s(x),y) -> ADD(x,y) COND1(true,x,y,z) -> COND2(gr(x,0),x,y,z) COND1(true,x,y,z) -> GR(x,0) COND2(false,x,y,z) -> COND3(gr(y,0),x,y,z) COND2(false,x,y,z) -> GR(y,0) COND2(true,x,y,z) -> ADD(x,y) COND2(true,x,y,z) -> COND1(gr(add(x,y),z),p(x),y,z) COND2(true,x,y,z) -> GR(add(x,y),z) COND2(true,x,y,z) -> P(x) COND3(false,x,y,z) -> ADD(x,y) COND3(false,x,y,z) -> COND1(gr(add(x,y),z),x,y,z) COND3(false,x,y,z) -> GR(add(x,y),z) COND3(true,x,y,z) -> ADD(x,y) COND3(true,x,y,z) -> COND1(gr(add(x,y),z),x,p(y),z) COND3(true,x,y,z) -> GR(add(x,y),z) COND3(true,x,y,z) -> P(y) popout

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

job log

popout

actions

all output return to TRS Stand 20472