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	n053.star.cs.uiowa.edu
space	CiME_04

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.020336151123 seconds
cpu usage	0.015362983
max memory	1675264.0

stage attributes

key	value
output-size	3039
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR x y z) (RULES and(xor(x,y),z) -> xor(and(x,z),and(y,z)) and(x,F) -> F and(x,T) -> x and(x,x) -> x equiv(x,y) -> xor(x,xor(y,T)) impl(x,y) -> xor(and(x,y),xor(x,T)) neg(x) -> xor(x,T) or(x,y) -> xor(and(x,y),xor(x,y)) xor(x,neg(x)) -> F xor(x,F) -> x xor(x,x) -> F ) Problem 1: Dependency Pairs Processor: -> Pairs: 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(x,xor(y,T)) EQUIV(x,y) -> XOR(y,T) IMPL(x,y) -> AND(x,y) IMPL(x,y) -> XOR(and(x,y),xor(x,T)) IMPL(x,y) -> XOR(x,T) NEG(x) -> XOR(x,T) OR(x,y) -> AND(x,y) OR(x,y) -> XOR(and(x,y),xor(x,y)) OR(x,y) -> XOR(x,y) -> Rules: and(xor(x,y),z) -> xor(and(x,z),and(y,z)) and(x,F) -> F and(x,T) -> x and(x,x) -> x equiv(x,y) -> xor(x,xor(y,T)) impl(x,y) -> xor(and(x,y),xor(x,T)) neg(x) -> xor(x,T) or(x,y) -> xor(and(x,y),xor(x,y)) xor(x,neg(x)) -> F xor(x,F) -> x xor(x,x) -> F Problem 1: SCC Processor: -> Pairs: 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(x,xor(y,T)) EQUIV(x,y) -> XOR(y,T) IMPL(x,y) -> AND(x,y) IMPL(x,y) -> XOR(and(x,y),xor(x,T)) IMPL(x,y) -> XOR(x,T) NEG(x) -> XOR(x,T) OR(x,y) -> AND(x,y) OR(x,y) -> XOR(and(x,y),xor(x,y)) OR(x,y) -> XOR(x,y) -> Rules: and(xor(x,y),z) -> xor(and(x,z),and(y,z)) and(x,F) -> F and(x,T) -> x and(x,x) -> x equiv(x,y) -> xor(x,xor(y,T)) impl(x,y) -> xor(and(x,y),xor(x,T)) neg(x) -> xor(x,T) or(x,y) -> xor(and(x,y),xor(x,y)) xor(x,neg(x)) -> F xor(x,F) -> x xor(x,x) -> F ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: AND(xor(x,y),z) -> AND(x,z) AND(xor(x,y),z) -> AND(y,z) ->->-> Rules: and(xor(x,y),z) -> xor(and(x,z),and(y,z)) and(x,F) -> F and(x,T) -> x and(x,x) -> x equiv(x,y) -> xor(x,xor(y,T)) impl(x,y) -> xor(and(x,y),xor(x,T)) neg(x) -> xor(x,T) or(x,y) -> xor(and(x,y),xor(x,y)) xor(x,neg(x)) -> F xor(x,F) -> x xor(x,x) -> F popout

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

job log

popout

actions

all output return to TRS Stand 20472