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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	4.27947 seconds
cpu usage	3.61087
user time	2.35123
system time	1.25964
max virtual memory	687340.0
max residence set size	8344.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR x y z) (THEORY (AC and or xor)) (RULES and(xor(x,y),z) -> xor(and(x,z),and(y,z)) and(F,x) -> F and(T,x) -> x and(x,x) -> x equiv(x,y) -> xor(xor(T,y),x) impl(x,y) -> xor(and(x,y),xor(T,x)) neg(x) -> xor(T,x) or(x,y) -> xor(and(x,y),xor(x,y)) xor(neg(x),x) -> F xor(F,x) -> x xor(x,x) -> F ) Problem 1: Dependency Pairs Processor: -> FAxioms: AND(and(x3,x4),x5) = AND(x3,and(x4,x5)) AND(x3,x4) = AND(x4,x3) OR(or(x3,x4),x5) = OR(x3,or(x4,x5)) OR(x3,x4) = OR(x4,x3) XOR(xor(x3,x4),x5) = XOR(x3,xor(x4,x5)) XOR(x3,x4) = XOR(x4,x3) -> Pairs: AND(and(xor(x,y),z),x3) -> AND(xor(and(x,z),and(y,z)),x3) AND(and(xor(x,y),z),x3) -> AND(x,z) AND(and(xor(x,y),z),x3) -> AND(y,z) AND(and(xor(x,y),z),x3) -> XOR(and(x,z),and(y,z)) AND(and(F,x),x3) -> AND(F,x3) AND(and(T,x),x3) -> AND(x,x3) AND(and(x,x),x3) -> AND(x,x3) AND(xor(x,y),z) -> AND(x,z) AND(xor(x,y),z) -> AND(y,z) AND(xor(x,y),z) -> XOR(and(x,z),and(y,z)) EQUIV(x,y) -> XOR(xor(T,y),x) EQUIV(x,y) -> XOR(T,y) IMPL(x,y) -> AND(x,y) IMPL(x,y) -> XOR(and(x,y),xor(T,x)) IMPL(x,y) -> XOR(T,x) NEG(x) -> XOR(T,x) OR(or(x,y),x3) -> AND(x,y) OR(or(x,y),x3) -> OR(xor(and(x,y),xor(x,y)),x3) OR(or(x,y),x3) -> XOR(and(x,y),xor(x,y)) OR(or(x,y),x3) -> XOR(x,y) OR(x,y) -> AND(x,y) OR(x,y) -> XOR(and(x,y),xor(x,y)) OR(x,y) -> XOR(x,y) XOR(xor(neg(x),x),x3) -> XOR(F,x3) XOR(xor(F,x),x3) -> XOR(x,x3) XOR(xor(x,x),x3) -> XOR(F,x3) -> EAxioms: and(and(x3,x4),x5) = and(x3,and(x4,x5)) and(x3,x4) = and(x4,x3) or(or(x3,x4),x5) = or(x3,or(x4,x5)) or(x3,x4) = or(x4,x3) xor(xor(x3,x4),x5) = xor(x3,xor(x4,x5)) xor(x3,x4) = xor(x4,x3) -> Rules: and(xor(x,y),z) -> xor(and(x,z),and(y,z)) and(F,x) -> F and(T,x) -> x and(x,x) -> x equiv(x,y) -> xor(xor(T,y),x) impl(x,y) -> xor(and(x,y),xor(T,x)) neg(x) -> xor(T,x) or(x,y) -> xor(and(x,y),xor(x,y)) xor(neg(x),x) -> F xor(F,x) -> x xor(x,x) -> F -> SRules: AND(and(x3,x4),x5) -> AND(x3,x4) AND(x3,and(x4,x5)) -> AND(x4,x5) OR(or(x3,x4),x5) -> OR(x3,x4) OR(x3,or(x4,x5)) -> OR(x4,x5) XOR(xor(x3,x4),x5) -> XOR(x3,x4) XOR(x3,xor(x4,x5)) -> XOR(x4,x5) Problem 1: SCC Processor: -> FAxioms: AND(and(x3,x4),x5) = AND(x3,and(x4,x5)) AND(x3,x4) = AND(x4,x3) OR(or(x3,x4),x5) = OR(x3,or(x4,x5)) OR(x3,x4) = OR(x4,x3) XOR(xor(x3,x4),x5) = XOR(x3,xor(x4,x5)) XOR(x3,x4) = XOR(x4,x3) -> Pairs: AND(and(xor(x,y),z),x3) -> AND(xor(and(x,z),and(y,z)),x3) AND(and(xor(x,y),z),x3) -> AND(x,z) AND(and(xor(x,y),z),x3) -> AND(y,z) AND(and(xor(x,y),z),x3) -> XOR(and(x,z),and(y,z)) popout

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

job log

popout

actions

all output return to TRS Equational