details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	4.52426409721 seconds
cpu usage	4.322283341
max memory	2.4580096E7

stage attributes

key	value
output-size	159747
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 A B V1 V2 X Y) (THEORY (AC mult plus union)) (RULES 0(z) -> z U101(tt,X) -> X U11(tt) -> z U111(tt,A,B) -> plus(sum(A),sum(B)) U21(tt,X,Y) -> 0(mult(X,Y)) U31(tt,X,Y) -> plus(0(mult(X,Y)),Y) U41(tt,X) -> X U51(tt,X,Y) -> 0(plus(X,Y)) U61(tt,X,Y) -> 1(plus(X,Y)) U71(tt,X,Y) -> 0(plus(plus(X,Y),1(z))) U81(tt,X) -> X U91(tt,A,B) -> mult(prod(A),prod(B)) and(tt,X) -> X isBag(union(V1,V2)) -> and(isBag(V1),isBag(V2)) isBag(empty) -> tt isBag(singl(V1)) -> isBin(V1) isBin(0(V1)) -> isBin(V1) isBin(mult(V1,V2)) -> and(isBin(V1),isBin(V2)) isBin(plus(V1,V2)) -> and(isBin(V1),isBin(V2)) isBin(prod(V1)) -> isBag(V1) isBin(sum(V1)) -> isBag(V1) isBin(1(V1)) -> isBin(V1) isBin(z) -> tt mult(0(X),Y) -> U21(and(isBin(X),isBin(Y)),X,Y) mult(1(X),Y) -> U31(and(isBin(X),isBin(Y)),X,Y) mult(z,X) -> U11(isBin(X)) plus(0(X),0(Y)) -> U51(and(isBin(X),isBin(Y)),X,Y) plus(0(X),1(Y)) -> U61(and(isBin(X),isBin(Y)),X,Y) plus(1(X),1(Y)) -> U71(and(isBin(X),isBin(Y)),X,Y) plus(z,X) -> U41(isBin(X),X) prod(union(A,B)) -> U91(and(isBag(A),isBag(B)),A,B) prod(empty) -> 1(z) prod(singl(X)) -> U81(isBin(X),X) sum(union(A,B)) -> U111(and(isBag(A),isBag(B)),A,B) sum(empty) -> 0(z) sum(singl(X)) -> U101(isBin(X),X) union(empty,X) -> X union(X,empty) -> X ) Problem 1: Dependency Pairs Processor: -> FAxioms: MULT(mult(x6,x7),x8) = MULT(x6,mult(x7,x8)) MULT(x6,x7) = MULT(x7,x6) PLUS(plus(x6,x7),x8) = PLUS(x6,plus(x7,x8)) PLUS(x6,x7) = PLUS(x7,x6) UNION(union(x6,x7),x8) = UNION(x6,union(x7,x8)) UNION(x6,x7) = UNION(x7,x6) -> Pairs: U111#(tt,A,B) -> PLUS(sum(A),sum(B)) U111#(tt,A,B) -> SUM(A) U111#(tt,A,B) -> SUM(B) U21#(tt,X,Y) -> 0#(mult(X,Y)) U21#(tt,X,Y) -> MULT(X,Y) U31#(tt,X,Y) -> 0#(mult(X,Y)) U31#(tt,X,Y) -> MULT(X,Y) U31#(tt,X,Y) -> PLUS(0(mult(X,Y)),Y) U51#(tt,X,Y) -> 0#(plus(X,Y)) U51#(tt,X,Y) -> PLUS(X,Y) U61#(tt,X,Y) -> PLUS(X,Y) U71#(tt,X,Y) -> 0#(plus(plus(X,Y),1(z))) U71#(tt,X,Y) -> PLUS(plus(X,Y),1(z)) U71#(tt,X,Y) -> PLUS(X,Y) U91#(tt,A,B) -> MULT(prod(A),prod(B)) U91#(tt,A,B) -> PROD(A) U91#(tt,A,B) -> PROD(B) ISBAG(union(V1,V2)) -> AND(isBag(V1),isBag(V2)) ISBAG(union(V1,V2)) -> ISBAG(V1) ISBAG(union(V1,V2)) -> ISBAG(V2) ISBAG(singl(V1)) -> ISBIN(V1) ISBIN(0(V1)) -> ISBIN(V1) ISBIN(mult(V1,V2)) -> AND(isBin(V1),isBin(V2)) ISBIN(mult(V1,V2)) -> ISBIN(V1) ISBIN(mult(V1,V2)) -> ISBIN(V2) ISBIN(plus(V1,V2)) -> AND(isBin(V1),isBin(V2)) ISBIN(plus(V1,V2)) -> ISBIN(V1) ISBIN(plus(V1,V2)) -> ISBIN(V2) ISBIN(prod(V1)) -> ISBAG(V1) ISBIN(sum(V1)) -> ISBAG(V1) ISBIN(1(V1)) -> ISBIN(V1) MULT(0(X),Y) -> U21#(and(isBin(X),isBin(Y)),X,Y) MULT(0(X),Y) -> AND(isBin(X),isBin(Y)) MULT(0(X),Y) -> ISBIN(X) MULT(0(X),Y) -> ISBIN(Y) popout

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

job log

popout

actions

all output return to TRS Equational