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

run statistics

property	value
solver	NaTT v.1.6c
configuration	Default
runtime (wallclock)	0.623419046402 seconds
cpu usage	0.661450901
max memory	3.2837632E7

stage attributes

key	value
output-size	7405
starexec-result	MAYBE

output

/export/starexec/sandbox/solver/bin/starexec_run_Default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/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) -> X 5: U11(tt()) -> z() 6: U111(tt(),A,B) -> plus(sum(A),sum(B)) 7: U21(tt(),X,Y) -> 0(mult(X,Y)) 8: U31(tt(),X,Y) -> plus(0(mult(X,Y)),Y) 9: U41(tt(),X) -> X 10: U51(tt(),X,Y) -> 0(plus(X,Y)) 11: U61(tt(),X,Y) -> 1(plus(X,Y)) 12: U71(tt(),X,Y) -> 0(plus(plus(X,Y),1(z()))) 13: U81(tt(),X) -> X 14: U91(tt(),A,B) -> mult(prod(A),prod(B)) 15: and(tt(),X) -> X 16: isBag(empty()) -> tt() 17: isBag(singl(V1)) -> isBin(V1) 18: isBag(union(V1,V2)) -> and(isBag(V1),isBag(V2)) 19: isBin(z()) -> tt() 20: isBin(0(V1)) -> isBin(V1) 21: isBin(1(V1)) -> isBin(V1) 22: isBin(mult(V1,V2)) -> and(isBin(V1),isBin(V2)) 23: isBin(plus(V1,V2)) -> and(isBin(V1),isBin(V2)) 24: isBin(prod(V1)) -> isBag(V1) 25: isBin(sum(V1)) -> isBag(V1) 26: mult(z(),X) -> U11(isBin(X)) 27: mult(0(X),Y) -> U21(and(isBin(X),isBin(Y)),X,Y) 28: mult(1(X),Y) -> U31(and(isBin(X),isBin(Y)),X,Y) 29: plus(z(),X) -> U41(isBin(X),X) 30: plus(0(X),0(Y)) -> U51(and(isBin(X),isBin(Y)),X,Y) 31: plus(0(X),1(Y)) -> U61(and(isBin(X),isBin(Y)),X,Y) 32: plus(1(X),1(Y)) -> U71(and(isBin(X),isBin(Y)),X,Y) 33: prod(empty()) -> 1(z()) 34: prod(singl(X)) -> U81(isBin(X),X) 35: prod(union(A,B)) -> U91(and(isBag(A),isBag(B)),A,B) 36: sum(empty()) -> 0(z()) 37: sum(singl(X)) -> U101(isBin(X),X) 38: sum(union(A,B)) -> U111(and(isBag(A),isBag(B)),A,B) Number of strict rules: 38 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #plus(z(),X) -> #U41(isBin(X),X) #2: #plus(z(),X) -> #isBin(X) #3: #prod(union(A,B)) -> #U91(and(isBag(A),isBag(B)),A,B) #4: #prod(union(A,B)) -> #and(isBag(A),isBag(B)) #5: #prod(union(A,B)) -> #isBag(A) #6: #prod(union(A,B)) -> #isBag(B) #7: #mult(x,mult(y,z)) ->= #mult(mult(x,y),z) #8: #mult(x,mult(y,z)) ->= #mult(x,y) #9: #sum(singl(X)) -> #U101(isBin(X),X) #10: #sum(singl(X)) -> #isBin(X) #11: #sum(union(A,B)) -> #U111(and(isBag(A),isBag(B)),A,B) #12: #sum(union(A,B)) -> #and(isBag(A),isBag(B)) #13: #sum(union(A,B)) -> #isBag(A) #14: #sum(union(A,B)) -> #isBag(B) #15: #U111(tt(),A,B) -> #plus(sum(A),sum(B)) #16: #U111(tt(),A,B) -> #sum(A) #17: #U111(tt(),A,B) -> #sum(B) #18: #union(x,union(y,z)) ->= #union(union(x,y),z) #19: #union(x,union(y,z)) ->= #union(x,y) #20: #U61(tt(),X,Y) -> #plus(X,Y) #21: #isBin(prod(V1)) -> #isBag(V1) #22: #isBin(plus(V1,V2)) -> #and(isBin(V1),isBin(V2)) #23: #isBin(plus(V1,V2)) -> #isBin(V1) #24: #isBin(plus(V1,V2)) -> #isBin(V2) #25: #U71(tt(),X,Y) -> #0(plus(plus(X,Y),1(z()))) #26: #U71(tt(),X,Y) -> #plus(plus(X,Y),1(z())) #27: #U71(tt(),X,Y) -> #plus(X,Y) #28: #plus(0(X),1(Y)) -> #U61(and(isBin(X),isBin(Y)),X,Y) #29: #plus(0(X),1(Y)) -> #and(isBin(X),isBin(Y)) #30: #plus(0(X),1(Y)) -> #isBin(X) #31: #plus(0(X),1(Y)) -> #isBin(Y) #32: #U91(tt(),A,B) -> #mult(prod(A),prod(B)) #33: #U91(tt(),A,B) -> #prod(A) #34: #U91(tt(),A,B) -> #prod(B) #35: #plus(0(X),0(Y)) -> #U51(and(isBin(X),isBin(Y)),X,Y) #36: #plus(0(X),0(Y)) -> #and(isBin(X),isBin(Y)) #37: #plus(0(X),0(Y)) -> #isBin(X) #38: #plus(0(X),0(Y)) -> #isBin(Y) #39: #isBin(sum(V1)) -> #isBag(V1) #40: #isBin(0(V1)) -> #isBin(V1) #41: #U21(tt(),X,Y) -> #0(mult(X,Y)) #42: #U21(tt(),X,Y) -> #mult(X,Y) #43: #plus(x,plus(y,z)) ->= #plus(plus(x,y),z) #44: #plus(x,plus(y,z)) ->= #plus(x,y) #45: #U51(tt(),X,Y) -> #0(plus(X,Y)) #46: #U51(tt(),X,Y) -> #plus(X,Y) #47: #mult(1(X),Y) -> #U31(and(isBin(X),isBin(Y)),X,Y) #48: #mult(1(X),Y) -> #and(isBin(X),isBin(Y)) #49: #mult(1(X),Y) -> #isBin(X) popout

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

job log

popout

actions

all output return to TRS Equational