details

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

run statistics

property	value
solver	NaTT
configuration	Default
runtime (wallclock)	0.0760831 seconds
cpu usage	0.046484
user time	0.027345
system time	0.019139
max virtual memory	113176.0
max residence set size	6716.0

stage attributes

key	value
starexec-result	YES

output

0.00/0.07 YES 0.00/0.07 Input TRS: 0.00/0.07 AC symbols: or xor and 0.00/0.07 1: xor(F(),x) -> x 0.00/0.07 2: xor(neg(x),x) -> F() 0.00/0.07 3: and(T(),x) -> x 0.00/0.07 4: and(F(),x) -> F() 0.00/0.07 5: and(x,x) -> x 0.00/0.07 6: and(xor(x,y),z) -> xor(and(x,z),and(y,z)) 0.00/0.07 7: xor(x,x) -> F() 0.00/0.07 8: impl(x,y) -> xor(and(x,y),xor(T(),x)) 0.00/0.07 9: or(x,y) -> xor(and(x,y),xor(x,y)) 0.00/0.07 10: equiv(x,y) -> xor(xor(T(),y),x) 0.00/0.07 11: neg(x) -> xor(T(),x) 0.00/0.07 Number of strict rules: 11 0.00/0.07 Direct POLO(bPol) ... failed. 0.00/0.07 Uncurrying ... failed. 0.00/0.07 Dependency Pairs: 0.00/0.07 #1: #and(xor(x,y),z) -> #xor(and(x,z),and(y,z)) 0.00/0.07 #2: #and(xor(x,y),z) -> #and(x,z) 0.00/0.07 #3: #and(xor(x,y),z) -> #and(y,z) 0.00/0.07 #4: #xor(x,xor(y,z)) ->= #xor(xor(x,y),z) 0.00/0.07 #5: #xor(x,xor(y,z)) ->= #xor(x,y) 0.00/0.07 #6: #or(x,y) -> #xor(and(x,y),xor(x,y)) 0.00/0.07 #7: #or(x,y) -> #and(x,y) 0.00/0.07 #8: #or(x,y) -> #xor(x,y) 0.00/0.07 #9: #neg(x) -> #xor(T(),x) 0.00/0.07 #10: #or(x,or(y,z)) ->= #or(or(x,y),z) 0.00/0.07 #11: #or(x,or(y,z)) ->= #or(x,y) 0.00/0.07 #12: #and(x,and(y,z)) ->= #and(and(x,y),z) 0.00/0.07 #13: #and(x,and(y,z)) ->= #and(x,y) 0.00/0.07 #14: #equiv(x,y) -> #xor(xor(T(),y),x) 0.00/0.07 #15: #equiv(x,y) -> #xor(T(),y) 0.00/0.07 #16: #impl(x,y) -> #xor(and(x,y),xor(T(),x)) 0.00/0.07 #17: #impl(x,y) -> #and(x,y) 0.00/0.07 #18: #impl(x,y) -> #xor(T(),x) 0.00/0.07 Number of SCCs: 3, DPs: 8 0.00/0.07 SCC { #10 #11 } 0.00/0.07 only weak rules. 0.00/0.07 Number of SCCs: 2, DPs: 6 0.00/0.07 SCC { #4 #5 } 0.00/0.07 only weak rules. 0.00/0.07 Number of SCCs: 1, DPs: 4 0.00/0.07 SCC { #2 #3 #12 #13 } 0.00/0.07 POLO(Sum)... POLO(max)... QLPOS... succeeded. 0.00/0.07 T s: [] p: 0 0.00/0.07 F s: [] p: 0 0.00/0.07 and s: {1,2} p: 2 0.00/0.07 #impl s: [] p: 0 0.00/0.07 equiv s: [] p: 0 0.00/0.07 or s: {} p: 0 0.00/0.07 neg s: [] p: 0 0.00/0.07 impl s: [] p: 0 0.00/0.07 #xor s: {} p: 1 0.00/0.07 #equiv s: [] p: 0 0.00/0.07 #or s: {} p: 0 0.00/0.07 #neg s: [] p: 0 0.00/0.07 xor s: {1,2} p: 1 0.00/0.07 #and s: {1,2} p: 2 0.00/0.07 USABLE RULES: { 1..7 13 14 } 0.00/0.07 Removed DPs: #2 #3 #13 0.00/0.07 Number of SCCs: 1, DPs: 1 0.00/0.07 SCC { #12 } 0.00/0.07 only weak rules. 0.00/0.07 Number of SCCs: 0, DPs: 0 0.00/0.07 Next Dependency Pairs: 0.00/0.07 #19: #xor(xor(neg(x),x),_1) -> #xor(F(),_1) 0.00/0.07 #20: #and(and(xor(x,y),z),_1) -> #and(xor(and(x,z),and(y,z)),_1) 0.00/0.07 #21: #xor(x,xor(y,z)) ->= #xor(xor(x,y),z) 0.00/0.07 #22: #xor(x,xor(y,z)) ->= #xor(x,y) 0.00/0.07 #23: #or(or(x,y),_1) -> #or(xor(and(x,y),xor(x,y)),_1) 0.00/0.07 #24: #or(x,or(y,z)) ->= #or(or(x,y),z) 0.00/0.07 #25: #or(x,or(y,z)) ->= #or(x,y) 0.00/0.07 #26: #and(x,and(y,z)) ->= #and(and(x,y),z) 0.00/0.07 #27: #and(x,and(y,z)) ->= #and(x,y) 0.00/0.07 #28: #xor(xor(x,x),_1) -> #xor(F(),_1) 0.00/0.07 #29: #and(and(x,x),_1) -> #and(x,_1) 0.00/0.07 #30: #and(and(T(),x),_1) -> #and(x,_1) 0.00/0.07 #31: #xor(xor(F(),x),_1) -> #xor(x,_1) 0.00/0.07 #32: #and(and(F(),x),_1) -> #and(F(),_1) 0.00/0.07 Number of SCCs: 3, DPs: 14 0.00/0.07 SCC { #23..25 } 0.00/0.07 POLO(Sum)... POLO(max)... QLPOS... succeeded. 0.00/0.07 T s: [] p: 0 0.00/0.07 F s: [] p: 0 0.00/0.07 and s: {1,2} p: 2 0.00/0.07 #impl s: [] p: 0 0.00/0.07 equiv s: [] p: 0 0.00/0.07 or s: {1,2} p: 3 0.00/0.07 neg s: [] p: 0 0.00/0.07 impl s: [] p: 0 0.00/0.07 #xor s: {} p: 1 0.00/0.07 #equiv s: [] p: 0 0.00/0.07 #or s: {1,2} p: 3 0.00/0.07 #neg s: [] p: 0 0.00/0.07 xor s: {1,2} p: 1 0.00/0.07 #and s: {1,2} p: 2 0.00/0.07 USABLE RULES: { 1..7 9 12..14 } 0.00/0.07 Removed DPs: #23 #25 0.00/0.07 Number of SCCs: 3, DPs: 12 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