details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	2.24116301537 seconds
cpu usage	1.937416818
max memory	1.1292672E7

stage attributes

key	value
output-size	68987
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) (THEORY (AC plus times)) (RULES 0(S) -> S plus(0(x),0(y)) -> 0(plus(x,y)) plus(0(x),1(y)) -> 1(plus(x,y)) plus(1(x),1(y)) -> 0(plus(x,plus(y,1(S)))) plus(S,x) -> x times(0(x),y) -> 0(times(x,y)) times(1(x),y) -> plus(0(times(x,y)),y) times(S,x) -> S ) 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: PLUS(0(x),0(y)) -> 0#(plus(x,y)) PLUS(0(x),0(y)) -> PLUS(x,y) PLUS(0(x),1(y)) -> PLUS(x,y) PLUS(plus(0(x),0(y)),x2) -> 0#(plus(x,y)) PLUS(plus(0(x),0(y)),x2) -> PLUS(0(plus(x,y)),x2) PLUS(plus(0(x),0(y)),x2) -> PLUS(x,y) PLUS(plus(0(x),1(y)),x2) -> PLUS(1(plus(x,y)),x2) PLUS(plus(0(x),1(y)),x2) -> PLUS(x,y) PLUS(plus(1(x),1(y)),x2) -> 0#(plus(x,plus(y,1(S)))) PLUS(plus(1(x),1(y)),x2) -> PLUS(0(plus(x,plus(y,1(S)))),x2) PLUS(plus(1(x),1(y)),x2) -> PLUS(x,plus(y,1(S))) PLUS(plus(1(x),1(y)),x2) -> PLUS(y,1(S)) PLUS(plus(S,x),x2) -> PLUS(x,x2) PLUS(1(x),1(y)) -> 0#(plus(x,plus(y,1(S)))) PLUS(1(x),1(y)) -> PLUS(x,plus(y,1(S))) PLUS(1(x),1(y)) -> PLUS(y,1(S)) TIMES(0(x),y) -> 0#(times(x,y)) TIMES(0(x),y) -> TIMES(x,y) TIMES(times(0(x),y),x2) -> 0#(times(x,y)) TIMES(times(0(x),y),x2) -> TIMES(0(times(x,y)),x2) TIMES(times(0(x),y),x2) -> TIMES(x,y) TIMES(times(1(x),y),x2) -> 0#(times(x,y)) TIMES(times(1(x),y),x2) -> PLUS(0(times(x,y)),y) TIMES(times(1(x),y),x2) -> TIMES(plus(0(times(x,y)),y),x2) TIMES(times(1(x),y),x2) -> TIMES(x,y) TIMES(times(S,x),x2) -> TIMES(S,x2) TIMES(1(x),y) -> 0#(times(x,y)) TIMES(1(x),y) -> PLUS(0(times(x,y)),y) TIMES(1(x),y) -> TIMES(x,y) -> 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: 0(S) -> S plus(0(x),0(y)) -> 0(plus(x,y)) plus(0(x),1(y)) -> 1(plus(x,y)) plus(1(x),1(y)) -> 0(plus(x,plus(y,1(S)))) plus(S,x) -> x times(0(x),y) -> 0(times(x,y)) times(1(x),y) -> plus(0(times(x,y)),y) times(S,x) -> S -> 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) Problem 1: SCC 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: PLUS(0(x),0(y)) -> 0#(plus(x,y)) PLUS(0(x),0(y)) -> PLUS(x,y) PLUS(0(x),1(y)) -> PLUS(x,y) PLUS(plus(0(x),0(y)),x2) -> 0#(plus(x,y)) PLUS(plus(0(x),0(y)),x2) -> PLUS(0(plus(x,y)),x2) PLUS(plus(0(x),0(y)),x2) -> PLUS(x,y) PLUS(plus(0(x),1(y)),x2) -> PLUS(1(plus(x,y)),x2) PLUS(plus(0(x),1(y)),x2) -> PLUS(x,y) PLUS(plus(1(x),1(y)),x2) -> 0#(plus(x,plus(y,1(S)))) popout

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

job log

popout

actions

all output return to TRS Equat 89423