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	n120.star.cs.uiowa.edu
space	Mixed_AC

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	21.2636 seconds
cpu usage	19.983
user time	17.8792
system time	2.10377
max virtual memory	851108.0
max residence set size	128204.0

stage attributes

key	value
starexec-result	YES

output

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