details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	21.072 seconds
cpu usage	19.9144
user time	17.8116
system time	2.10279
max virtual memory	850132.0
max residence set size	128196.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR A B V1 V2 X Y) (THEORY (AC mult plus union)) (RULES 0(z) -> z U101(tt,X,Y) -> 0(mult(X,Y)) U11(tt,V1) -> U12(isBin(V1)) U111(tt,X,Y) -> plus(0(mult(X,Y)),Y) U12(tt) -> tt U121(tt,X) -> X U131(tt,X,Y) -> 0(plus(X,Y)) U141(tt,X,Y) -> 1(plus(X,Y)) U151(tt,X,Y) -> 0(plus(plus(X,Y),1(z))) U161(tt,X) -> X U171(tt,A,B) -> mult(prod(A),prod(B)) U181(tt,X) -> X U191(tt,A,B) -> plus(sum(A),sum(B)) U21(tt,V1,V2) -> U22(isBag(V1),V2) U22(tt,V2) -> U23(isBag(V2)) U23(tt) -> tt U31(tt,V1) -> U32(isBin(V1)) U32(tt) -> tt U41(tt,V1) -> U42(isBin(V1)) U42(tt) -> tt U51(tt,V1,V2) -> U52(isBin(V1),V2) U52(tt,V2) -> U53(isBin(V2)) U53(tt) -> tt U61(tt,V1,V2) -> U62(isBin(V1),V2) U62(tt,V2) -> U63(isBin(V2)) U63(tt) -> tt U71(tt,V1) -> U72(isBag(V1)) U72(tt) -> tt U81(tt,V1) -> U82(isBag(V1)) U82(tt) -> tt U91(tt) -> z and(tt,X) -> X isBag(union(V1,V2)) -> U21(and(isBagKind(V1),isBagKind(V2)),V1,V2) isBag(empty) -> tt isBag(singl(V1)) -> U11(isBinKind(V1),V1) isBagKind(union(V1,V2)) -> and(isBagKind(V1),isBagKind(V2)) isBagKind(empty) -> tt isBagKind(singl(V1)) -> isBinKind(V1) isBin(0(V1)) -> U31(isBinKind(V1),V1) isBin(mult(V1,V2)) -> U51(and(isBinKind(V1),isBinKind(V2)),V1,V2) isBin(plus(V1,V2)) -> U61(and(isBinKind(V1),isBinKind(V2)),V1,V2) isBin(prod(V1)) -> U71(isBagKind(V1),V1) isBin(sum(V1)) -> U81(isBagKind(V1),V1) isBin(1(V1)) -> U41(isBinKind(V1),V1) isBin(z) -> tt isBinKind(0(V1)) -> isBinKind(V1) isBinKind(mult(V1,V2)) -> and(isBinKind(V1),isBinKind(V2)) isBinKind(plus(V1,V2)) -> and(isBinKind(V1),isBinKind(V2)) isBinKind(prod(V1)) -> isBagKind(V1) isBinKind(sum(V1)) -> isBagKind(V1) isBinKind(1(V1)) -> isBinKind(V1) isBinKind(z) -> tt mult(0(X),Y) -> U101(and(and(isBin(X),isBinKind(X)),and(isBin(Y),isBinKind(Y))),X,Y) mult(1(X),Y) -> U111(and(and(isBin(X),isBinKind(X)),and(isBin(Y),isBinKind(Y))),X,Y) mult(z,X) -> U91(and(isBin(X),isBinKind(X))) plus(0(X),0(Y)) -> U131(and(and(isBin(X),isBinKind(X)),and(isBin(Y),isBinKind(Y))),X,Y) plus(0(X),1(Y)) -> U141(and(and(isBin(X),isBinKind(X)),and(isBin(Y),isBinKind(Y))),X,Y) plus(1(X),1(Y)) -> U151(and(and(isBin(X),isBinKind(X)),and(isBin(Y),isBinKind(Y))),X,Y) plus(z,X) -> U121(and(isBin(X),isBinKind(X)),X) prod(union(A,B)) -> U171(and(and(isBag(A),isBagKind(A)),and(isBag(B),isBagKind(B))),A,B) prod(empty) -> 1(z) prod(singl(X)) -> U161(and(isBin(X),isBinKind(X)),X) sum(union(A,B)) -> U191(and(and(isBag(A),isBagKind(A)),and(isBag(B),isBagKind(B))),A,B) sum(empty) -> 0(z) sum(singl(X)) -> U181(and(isBin(X),isBinKind(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: U101#(tt,X,Y) -> 0#(mult(X,Y)) U101#(tt,X,Y) -> MULT(X,Y) U11#(tt,V1) -> U12#(isBin(V1)) U11#(tt,V1) -> ISBIN(V1) U111#(tt,X,Y) -> 0#(mult(X,Y)) U111#(tt,X,Y) -> MULT(X,Y) U111#(tt,X,Y) -> PLUS(0(mult(X,Y)),Y) U131#(tt,X,Y) -> 0#(plus(X,Y)) U131#(tt,X,Y) -> PLUS(X,Y) U141#(tt,X,Y) -> PLUS(X,Y) U151#(tt,X,Y) -> 0#(plus(plus(X,Y),1(z))) U151#(tt,X,Y) -> PLUS(plus(X,Y),1(z)) popout

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

job log

popout

actions

all output return to TRS Equational