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

run statistics

property	value
solver	NaTT
configuration	Default
runtime (wallclock)	0.558526992798 seconds
cpu usage	0.687346343
max memory	3.6302848E7

stage attributes

key	value
output-size	9142
starexec-result	MAYBE

output

/export/starexec/sandbox2/solver/bin/starexec_run_Default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE Input TRS: AC symbols: plus union mult 1: union(X,empty()) -> X 2: union(empty(),X) -> X 3: 0(z()) -> z() 4: U101(tt(),X,Y) -> U102(isBin(Y),X,Y) 5: U102(tt(),X,Y) -> 0(mult(X,Y)) 6: U11(tt()) -> tt() 7: U111(tt(),X,Y) -> U112(isBin(Y),X,Y) 8: U112(tt(),X,Y) -> plus(0(mult(X,Y)),Y) 9: U121(tt(),X) -> X 10: U131(tt(),X,Y) -> U132(isBin(Y),X,Y) 11: U132(tt(),X,Y) -> 0(plus(X,Y)) 12: U141(tt(),X,Y) -> U142(isBin(Y),X,Y) 13: U142(tt(),X,Y) -> 1(plus(X,Y)) 14: U151(tt(),X,Y) -> U152(isBin(Y),X,Y) 15: U152(tt(),X,Y) -> 0(plus(plus(X,Y),1(z()))) 16: U161(tt(),X) -> X 17: U171(tt(),A,B) -> U172(isBag(B),A,B) 18: U172(tt(),A,B) -> mult(prod(A),prod(B)) 19: U181(tt(),X) -> X 20: U191(tt(),A,B) -> U192(isBag(B),A,B) 21: U192(tt(),A,B) -> plus(sum(A),sum(B)) 22: U21(tt(),V2) -> U22(isBag(V2)) 23: U22(tt()) -> tt() 24: U31(tt()) -> tt() 25: U41(tt()) -> tt() 26: U51(tt(),V2) -> U52(isBin(V2)) 27: U52(tt()) -> tt() 28: U61(tt(),V2) -> U62(isBin(V2)) 29: U62(tt()) -> tt() 30: U71(tt()) -> tt() 31: U81(tt()) -> tt() 32: U91(tt()) -> z() 33: isBag(empty()) -> tt() 34: isBag(singl(V1)) -> U11(isBin(V1)) 35: isBag(union(V1,V2)) -> U21(isBag(V1),V2) 36: isBin(z()) -> tt() 37: isBin(0(V1)) -> U31(isBin(V1)) 38: isBin(1(V1)) -> U41(isBin(V1)) 39: isBin(mult(V1,V2)) -> U51(isBin(V1),V2) 40: isBin(plus(V1,V2)) -> U61(isBin(V1),V2) 41: isBin(prod(V1)) -> U71(isBag(V1)) 42: isBin(sum(V1)) -> U81(isBag(V1)) 43: mult(z(),X) -> U91(isBin(X)) 44: mult(0(X),Y) -> U101(isBin(X),X,Y) 45: mult(1(X),Y) -> U111(isBin(X),X,Y) 46: plus(z(),X) -> U121(isBin(X),X) 47: plus(0(X),0(Y)) -> U131(isBin(X),X,Y) 48: plus(0(X),1(Y)) -> U141(isBin(X),X,Y) 49: plus(1(X),1(Y)) -> U151(isBin(X),X,Y) 50: prod(empty()) -> 1(z()) 51: prod(singl(X)) -> U161(isBin(X),X) 52: prod(union(A,B)) -> U171(isBag(A),A,B) 53: sum(empty()) -> 0(z()) 54: sum(singl(X)) -> U181(isBin(X),X) 55: sum(union(A,B)) -> U191(isBag(A),A,B) Number of strict rules: 55 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #mult(z(),X) -> #U91(isBin(X)) #2: #mult(z(),X) -> #isBin(X) #3: #isBag(union(V1,V2)) -> #U21(isBag(V1),V2) #4: #isBag(union(V1,V2)) -> #isBag(V1) #5: #plus(z(),X) -> #U121(isBin(X),X) #6: #plus(z(),X) -> #isBin(X) #7: #isBin(sum(V1)) -> #U81(isBag(V1)) #8: #isBin(sum(V1)) -> #isBag(V1) #9: #isBin(prod(V1)) -> #U71(isBag(V1)) #10: #isBin(prod(V1)) -> #isBag(V1) #11: #isBin(0(V1)) -> #U31(isBin(V1)) #12: #isBin(0(V1)) -> #isBin(V1) #13: #plus(0(X),0(Y)) -> #U131(isBin(X),X,Y) #14: #plus(0(X),0(Y)) -> #isBin(X) #15: #sum(empty()) -> #0(z()) #16: #plus(0(X),1(Y)) -> #U141(isBin(X),X,Y) #17: #plus(0(X),1(Y)) -> #isBin(X) #18: #mult(x,mult(y,z)) ->= #mult(mult(x,y),z) #19: #mult(x,mult(y,z)) ->= #mult(x,y) #20: #isBin(1(V1)) -> #U41(isBin(V1)) #21: #isBin(1(V1)) -> #isBin(V1) #22: #sum(union(A,B)) -> #U191(isBag(A),A,B) #23: #sum(union(A,B)) -> #isBag(A) #24: #isBin(plus(V1,V2)) -> #U61(isBin(V1),V2) #25: #isBin(plus(V1,V2)) -> #isBin(V1) #26: #prod(singl(X)) -> #U161(isBin(X),X) #27: #prod(singl(X)) -> #isBin(X) #28: #U142(tt(),X,Y) -> #plus(X,Y) #29: #U132(tt(),X,Y) -> #0(plus(X,Y)) #30: #U132(tt(),X,Y) -> #plus(X,Y) #31: #union(x,union(y,z)) ->= #union(union(x,y),z) #32: #union(x,union(y,z)) ->= #union(x,y) popout

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

job log

popout

actions

all output return to TRS Equat 89423