details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	9.72492599487 seconds
cpu usage	8.768496586
max memory	2.8983296E7

stage attributes

key	value
output-size	270707
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 u x y z) (THEORY (AC plus times)) (RULES 0(S) -> S abs(x) -> if_abs(x,x,S) if_abs(0(x),y,z) -> if_abs(x,y,z) if_abs(1(x),y,z) -> if_abs(x,y,1(S)) if_abs(S,x,1(S)) -> x if_abs(S,x,S) -> S if_abs(S,x,j(S)) -> opp(x) if_abs(j(x),y,z) -> if_abs(x,y,j(S)) if_min(0(x),y,z,u) -> if_min(x,y,z,u) if_min(1(x),y,z,u) -> if_min(x,y,z,1(S)) if_min(S,x,y,1(S)) -> x if_min(S,x,y,S) -> x if_min(S,x,y,j(S)) -> y if_min(j(x),y,z,u) -> if_min(x,y,z,j(S)) if_sign(0(x),y) -> if_sign(x,y) if_sign(1(x),y) -> if_sign(x,1(S)) if_sign(S,x) -> x if_sign(j(x),y) -> if_sign(x,j(S)) min(x,y) -> if_min(minus(abs(y),abs(x)),x,y,S) min'(x,y) -> if_min(minus(abs(1(y)),abs(1(x))),x,y,S) min''(x,y) -> if_min(minus(abs(j(y)),abs(j(x))),x,y,S) minus(x,y) -> plus(opp(y),x) opp(0(x)) -> 0(opp(x)) opp(1(x)) -> j(opp(x)) opp(S) -> S opp(j(x)) -> 1(opp(x)) plus(0(x),0(y)) -> 0(plus(x,y)) plus(0(x),1(y)) -> 1(plus(x,y)) plus(0(x),j(y)) -> j(plus(x,y)) plus(1(x),1(y)) -> j(plus(1(S),plus(x,y))) plus(1(x),j(y)) -> 0(plus(x,y)) plus(S,x) -> x plus(j(x),j(y)) -> 1(plus(j(S),plus(x,y))) sign(x) -> if_sign(x,S) times(0(x),y) -> 0(times(x,y)) times(1(x),y) -> plus(0(times(x,y)),y) times(S,x) -> S times(j(x),y) -> minus(0(times(x,y)),y) ) Problem 1: Dependency Pairs Processor: -> FAxioms: PLUS(plus(x4,x5),x6) = PLUS(x4,plus(x5,x6)) PLUS(x4,x5) = PLUS(x5,x4) TIMES(times(x4,x5),x6) = TIMES(x4,times(x5,x6)) TIMES(x4,x5) = TIMES(x5,x4) -> Pairs: ABS(x) -> IF_ABS(x,x,S) IF_ABS(0(x),y,z) -> IF_ABS(x,y,z) IF_ABS(1(x),y,z) -> IF_ABS(x,y,1(S)) IF_ABS(S,x,j(S)) -> OPP(x) IF_ABS(j(x),y,z) -> IF_ABS(x,y,j(S)) IF_MIN(0(x),y,z,u) -> IF_MIN(x,y,z,u) IF_MIN(1(x),y,z,u) -> IF_MIN(x,y,z,1(S)) IF_MIN(j(x),y,z,u) -> IF_MIN(x,y,z,j(S)) IF_SIGN(0(x),y) -> IF_SIGN(x,y) IF_SIGN(1(x),y) -> IF_SIGN(x,1(S)) IF_SIGN(j(x),y) -> IF_SIGN(x,j(S)) MIN(x,y) -> ABS(x) MIN(x,y) -> ABS(y) MIN(x,y) -> IF_MIN(minus(abs(y),abs(x)),x,y,S) MIN(x,y) -> MINUS(abs(y),abs(x)) MIN'(x,y) -> ABS(1(x)) MIN'(x,y) -> ABS(1(y)) MIN'(x,y) -> IF_MIN(minus(abs(1(y)),abs(1(x))),x,y,S) MIN'(x,y) -> MINUS(abs(1(y)),abs(1(x))) MIN''(x,y) -> ABS(j(x)) MIN''(x,y) -> ABS(j(y)) MIN''(x,y) -> IF_MIN(minus(abs(j(y)),abs(j(x))),x,y,S) MIN''(x,y) -> MINUS(abs(j(y)),abs(j(x))) MINUS(x,y) -> OPP(y) MINUS(x,y) -> PLUS(opp(y),x) OPP(0(x)) -> 0#(opp(x)) OPP(0(x)) -> OPP(x) OPP(1(x)) -> OPP(x) OPP(j(x)) -> OPP(x) 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(0(x),j(y)) -> PLUS(x,y) PLUS(plus(0(x),0(y)),x4) -> 0#(plus(x,y)) PLUS(plus(0(x),0(y)),x4) -> PLUS(0(plus(x,y)),x4) PLUS(plus(0(x),0(y)),x4) -> PLUS(x,y) PLUS(plus(0(x),1(y)),x4) -> PLUS(1(plus(x,y)),x4) popout

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

job log

popout

actions

all output return to TRS Equational