details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	6.81905 seconds
cpu usage	6.39658
user time	5.09183
system time	1.30475
max virtual memory	693508.0
max residence set size	18704.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) -> U102(isBin(Y),X,Y) U102(tt,X,Y) -> 0(mult(X,Y)) U11(tt) -> tt U111(tt,X,Y) -> U112(isBin(Y),X,Y) U112(tt,X,Y) -> plus(0(mult(X,Y)),Y) U121(tt,X) -> X U131(tt,X,Y) -> U132(isBin(Y),X,Y) U132(tt,X,Y) -> 0(plus(X,Y)) U141(tt,X,Y) -> U142(isBin(Y),X,Y) U142(tt,X,Y) -> 1(plus(X,Y)) U151(tt,X,Y) -> U152(isBin(Y),X,Y) U152(tt,X,Y) -> 0(plus(plus(X,Y),1(z))) U161(tt,X) -> X U171(tt,A,B) -> U172(isBag(B),A,B) U172(tt,A,B) -> mult(prod(A),prod(B)) U181(tt,X) -> X U191(tt,A,B) -> U192(isBag(B),A,B) U192(tt,A,B) -> plus(sum(A),sum(B)) U21(tt,V2) -> U22(isBag(V2)) U22(tt) -> tt U31(tt) -> tt U41(tt) -> tt U51(tt,V2) -> U52(isBin(V2)) U52(tt) -> tt U61(tt,V2) -> U62(isBin(V2)) U62(tt) -> tt U71(tt) -> tt U81(tt) -> tt U91(tt) -> z isBag(union(V1,V2)) -> U21(isBag(V1),V2) isBag(empty) -> tt isBag(singl(V1)) -> U11(isBin(V1)) isBin(0(V1)) -> U31(isBin(V1)) isBin(mult(V1,V2)) -> U51(isBin(V1),V2) isBin(plus(V1,V2)) -> U61(isBin(V1),V2) isBin(prod(V1)) -> U71(isBag(V1)) isBin(sum(V1)) -> U81(isBag(V1)) isBin(1(V1)) -> U41(isBin(V1)) isBin(z) -> tt mult(0(X),Y) -> U101(isBin(X),X,Y) mult(1(X),Y) -> U111(isBin(X),X,Y) mult(z,X) -> U91(isBin(X)) plus(0(X),0(Y)) -> U131(isBin(X),X,Y) plus(0(X),1(Y)) -> U141(isBin(X),X,Y) plus(1(X),1(Y)) -> U151(isBin(X),X,Y) plus(z,X) -> U121(isBin(X),X) prod(union(A,B)) -> U171(isBag(A),A,B) prod(empty) -> 1(z) prod(singl(X)) -> U161(isBin(X),X) sum(union(A,B)) -> U191(isBag(A),A,B) sum(empty) -> 0(z) sum(singl(X)) -> U181(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: U101#(tt,X,Y) -> U102#(isBin(Y),X,Y) U101#(tt,X,Y) -> ISBIN(Y) U102#(tt,X,Y) -> 0#(mult(X,Y)) U102#(tt,X,Y) -> MULT(X,Y) U111#(tt,X,Y) -> U112#(isBin(Y),X,Y) U111#(tt,X,Y) -> ISBIN(Y) U112#(tt,X,Y) -> 0#(mult(X,Y)) U112#(tt,X,Y) -> MULT(X,Y) U112#(tt,X,Y) -> PLUS(0(mult(X,Y)),Y) U131#(tt,X,Y) -> U132#(isBin(Y),X,Y) U131#(tt,X,Y) -> ISBIN(Y) U132#(tt,X,Y) -> 0#(plus(X,Y)) U132#(tt,X,Y) -> PLUS(X,Y) U141#(tt,X,Y) -> U142#(isBin(Y),X,Y) U141#(tt,X,Y) -> ISBIN(Y) U142#(tt,X,Y) -> PLUS(X,Y) U151#(tt,X,Y) -> U152#(isBin(Y),X,Y) U151#(tt,X,Y) -> ISBIN(Y) U152#(tt,X,Y) -> 0#(plus(plus(X,Y),1(z))) U152#(tt,X,Y) -> PLUS(plus(X,Y),1(z)) U152#(tt,X,Y) -> PLUS(X,Y) U171#(tt,A,B) -> U172#(isBag(B),A,B) U171#(tt,A,B) -> ISBAG(B) U172#(tt,A,B) -> MULT(prod(A),prod(B)) popout

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

job log

popout

actions

all output return to TRS Equational