Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Equational pair #487523264
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
n140.star.cs.uiowa.edu
space
Mixed_AC
run statistics
property
value
solver
NaTT v.1.6c
configuration
Default
runtime (wallclock)
1.30048704147 seconds
cpu usage
1.493665437
max memory
5.4693888E7
stage attributes
key
value
output-size
17209
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,Y) -> 0(mult(X,Y)) 5: U11(tt(),V1) -> U12(isBin(V1)) 6: U111(tt(),X,Y) -> plus(0(mult(X,Y)),Y) 7: U12(tt()) -> tt() 8: U121(tt(),X) -> X 9: U131(tt(),X,Y) -> 0(plus(X,Y)) 10: U141(tt(),X,Y) -> 1(plus(X,Y)) 11: U151(tt(),X,Y) -> 0(plus(plus(X,Y),1(z()))) 12: U161(tt(),X) -> X 13: U171(tt(),A,B) -> mult(prod(A),prod(B)) 14: U181(tt(),X) -> X 15: U191(tt(),A,B) -> plus(sum(A),sum(B)) 16: U21(tt(),V1,V2) -> U22(isBag(V1),V2) 17: U22(tt(),V2) -> U23(isBag(V2)) 18: U23(tt()) -> tt() 19: U31(tt(),V1) -> U32(isBin(V1)) 20: U32(tt()) -> tt() 21: U41(tt(),V1) -> U42(isBin(V1)) 22: U42(tt()) -> tt() 23: U51(tt(),V1,V2) -> U52(isBin(V1),V2) 24: U52(tt(),V2) -> U53(isBin(V2)) 25: U53(tt()) -> tt() 26: U61(tt(),V1,V2) -> U62(isBin(V1),V2) 27: U62(tt(),V2) -> U63(isBin(V2)) 28: U63(tt()) -> tt() 29: U71(tt(),V1) -> U72(isBag(V1)) 30: U72(tt()) -> tt() 31: U81(tt(),V1) -> U82(isBag(V1)) 32: U82(tt()) -> tt() 33: U91(tt()) -> z() 34: and(tt(),X) -> X 35: isBag(empty()) -> tt() 36: isBag(singl(V1)) -> U11(isBinKind(V1),V1) 37: isBag(union(V1,V2)) -> U21(and(isBagKind(V1),isBagKind(V2)),V1,V2) 38: isBagKind(empty()) -> tt() 39: isBagKind(singl(V1)) -> isBinKind(V1) 40: isBagKind(union(V1,V2)) -> and(isBagKind(V1),isBagKind(V2)) 41: isBin(z()) -> tt() 42: isBin(0(V1)) -> U31(isBinKind(V1),V1) 43: isBin(1(V1)) -> U41(isBinKind(V1),V1) 44: isBin(mult(V1,V2)) -> U51(and(isBinKind(V1),isBinKind(V2)),V1,V2) 45: isBin(plus(V1,V2)) -> U61(and(isBinKind(V1),isBinKind(V2)),V1,V2) 46: isBin(prod(V1)) -> U71(isBagKind(V1),V1) 47: isBin(sum(V1)) -> U81(isBagKind(V1),V1) 48: isBinKind(z()) -> tt() 49: isBinKind(0(V1)) -> isBinKind(V1) 50: isBinKind(1(V1)) -> isBinKind(V1) 51: isBinKind(mult(V1,V2)) -> and(isBinKind(V1),isBinKind(V2)) 52: isBinKind(plus(V1,V2)) -> and(isBinKind(V1),isBinKind(V2)) 53: isBinKind(prod(V1)) -> isBagKind(V1) 54: isBinKind(sum(V1)) -> isBagKind(V1) 55: mult(z(),X) -> U91(and(isBin(X),isBinKind(X))) 56: mult(0(X),Y) -> U101(and(and(isBin(X),isBinKind(X)),and(isBin(Y),isBinKind(Y))),X,Y) 57: mult(1(X),Y) -> U111(and(and(isBin(X),isBinKind(X)),and(isBin(Y),isBinKind(Y))),X,Y) 58: plus(z(),X) -> U121(and(isBin(X),isBinKind(X)),X) 59: plus(0(X),0(Y)) -> U131(and(and(isBin(X),isBinKind(X)),and(isBin(Y),isBinKind(Y))),X,Y) 60: plus(0(X),1(Y)) -> U141(and(and(isBin(X),isBinKind(X)),and(isBin(Y),isBinKind(Y))),X,Y) 61: plus(1(X),1(Y)) -> U151(and(and(isBin(X),isBinKind(X)),and(isBin(Y),isBinKind(Y))),X,Y) 62: prod(empty()) -> 1(z()) 63: prod(singl(X)) -> U161(and(isBin(X),isBinKind(X)),X) 64: prod(union(A,B)) -> U171(and(and(isBag(A),isBagKind(A)),and(isBag(B),isBagKind(B))),A,B) 65: sum(empty()) -> 0(z()) 66: sum(singl(X)) -> U181(and(isBin(X),isBinKind(X)),X) 67: sum(union(A,B)) -> U191(and(and(isBag(A),isBagKind(A)),and(isBag(B),isBagKind(B))),A,B) Number of strict rules: 67 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #isBin(1(V1)) -> #U41(isBinKind(V1),V1) #2: #isBin(1(V1)) -> #isBinKind(V1) #3: #U71(tt(),V1) -> #U72(isBag(V1)) #4: #U71(tt(),V1) -> #isBag(V1) #5: #sum(singl(X)) -> #U181(and(isBin(X),isBinKind(X)),X) #6: #sum(singl(X)) -> #and(isBin(X),isBinKind(X)) #7: #sum(singl(X)) -> #isBin(X) #8: #sum(singl(X)) -> #isBinKind(X) #9: #isBin(prod(V1)) -> #U71(isBagKind(V1),V1) #10: #isBin(prod(V1)) -> #isBagKind(V1) #11: #isBin(0(V1)) -> #U31(isBinKind(V1),V1) #12: #isBin(0(V1)) -> #isBinKind(V1) #13: #isBag(union(V1,V2)) -> #U21(and(isBagKind(V1),isBagKind(V2)),V1,V2) #14: #isBag(union(V1,V2)) -> #and(isBagKind(V1),isBagKind(V2)) #15: #isBag(union(V1,V2)) -> #isBagKind(V1) #16: #isBag(union(V1,V2)) -> #isBagKind(V2) #17: #isBin(sum(V1)) -> #U81(isBagKind(V1),V1) #18: #isBin(sum(V1)) -> #isBagKind(V1) #19: #isBinKind(prod(V1)) -> #isBagKind(V1) #20: #plus(z(),X) -> #U121(and(isBin(X),isBinKind(X)),X)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Equational