details

property	value
status	complete
benchmark	AC06.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	AProVE_AC_04

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	3.60780286789 seconds
cpu usage	3.484623627
max memory	1.5507456E7

stage attributes

key	value
output-size	70233
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) (THEORY (AC plus times)) (RULES i(i(x)) -> x i(p(x)) -> s(i(x)) i(plus(x,y)) -> plus(i(y),i(x)) i(s(x)) -> p(i(x)) i(0) -> 0 p(s(x)) -> x plus(i(x),x) -> 0 plus(p(x),y) -> p(plus(x,y)) plus(s(x),y) -> s(plus(x,y)) plus(0,y) -> y plus(x,plus(i(x),y)) -> y s(p(x)) -> x times(p(x),y) -> plus(times(x,y),i(y)) times(s(x),y) -> plus(times(x,y),y) times(0,y) -> 0 ) Problem 1: Dependency Pairs Processor: -> FAxioms: PLUS(plus(x2,x3),x4) = PLUS(x2,plus(x3,x4)) PLUS(x2,x3) = PLUS(x3,x2) TIMES(times(x2,x3),x4) = TIMES(x2,times(x3,x4)) TIMES(x2,x3) = TIMES(x3,x2) -> Pairs: I(p(x)) -> I(x) I(p(x)) -> S(i(x)) I(plus(x,y)) -> I(x) I(plus(x,y)) -> I(y) I(plus(x,y)) -> PLUS(i(y),i(x)) I(s(x)) -> I(x) I(s(x)) -> P(i(x)) PLUS(p(x),y) -> P(plus(x,y)) PLUS(p(x),y) -> PLUS(x,y) PLUS(plus(i(x),x),x2) -> PLUS(0,x2) PLUS(plus(p(x),y),x2) -> P(plus(x,y)) PLUS(plus(p(x),y),x2) -> PLUS(p(plus(x,y)),x2) PLUS(plus(p(x),y),x2) -> PLUS(x,y) PLUS(plus(s(x),y),x2) -> PLUS(s(plus(x,y)),x2) PLUS(plus(s(x),y),x2) -> PLUS(x,y) PLUS(plus(s(x),y),x2) -> S(plus(x,y)) PLUS(plus(0,y),x2) -> PLUS(y,x2) PLUS(plus(x,plus(i(x),y)),x2) -> PLUS(y,x2) PLUS(s(x),y) -> PLUS(x,y) PLUS(s(x),y) -> S(plus(x,y)) TIMES(p(x),y) -> I(y) TIMES(p(x),y) -> PLUS(times(x,y),i(y)) TIMES(p(x),y) -> TIMES(x,y) TIMES(s(x),y) -> PLUS(times(x,y),y) TIMES(s(x),y) -> TIMES(x,y) TIMES(times(p(x),y),x2) -> I(y) TIMES(times(p(x),y),x2) -> PLUS(times(x,y),i(y)) TIMES(times(p(x),y),x2) -> TIMES(plus(times(x,y),i(y)),x2) TIMES(times(p(x),y),x2) -> TIMES(x,y) TIMES(times(s(x),y),x2) -> PLUS(times(x,y),y) TIMES(times(s(x),y),x2) -> TIMES(plus(times(x,y),y),x2) TIMES(times(s(x),y),x2) -> TIMES(x,y) TIMES(times(0,y),x2) -> TIMES(0,x2) -> EAxioms: plus(plus(x2,x3),x4) = plus(x2,plus(x3,x4)) plus(x2,x3) = plus(x3,x2) times(times(x2,x3),x4) = times(x2,times(x3,x4)) times(x2,x3) = times(x3,x2) -> Rules: i(i(x)) -> x i(p(x)) -> s(i(x)) i(plus(x,y)) -> plus(i(y),i(x)) i(s(x)) -> p(i(x)) i(0) -> 0 p(s(x)) -> x plus(i(x),x) -> 0 plus(p(x),y) -> p(plus(x,y)) plus(s(x),y) -> s(plus(x,y)) plus(0,y) -> y plus(x,plus(i(x),y)) -> y s(p(x)) -> x times(p(x),y) -> plus(times(x,y),i(y)) times(s(x),y) -> plus(times(x,y),y) times(0,y) -> 0 -> SRules: PLUS(plus(x2,x3),x4) -> PLUS(x2,x3) PLUS(x2,plus(x3,x4)) -> PLUS(x3,x4) TIMES(times(x2,x3),x4) -> TIMES(x2,x3) TIMES(x2,times(x3,x4)) -> TIMES(x3,x4) popout

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

job log

popout

actions

all output return to TRS Equational