details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.0191421508789 seconds
cpu usage	0.015665876
max memory	1634304.0

stage attributes

key	value
output-size	2829
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,false) -> false and(x,true) -> x and(x,x) -> x implies(x,y) -> xor(and(x,y),xor(x,true)) not(x) -> xor(x,true) or(x,y) -> xor(and(x,y),xor(x,y)) xor(x,false) -> x xor(x,x) -> false ) 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)) IMPLIES(x,y) -> AND(x,y) IMPLIES(x,y) -> XOR(and(x,y),xor(x,true)) IMPLIES(x,y) -> XOR(x,true) NOT(x) -> XOR(x,true) 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,false) -> false and(x,true) -> x and(x,x) -> x implies(x,y) -> xor(and(x,y),xor(x,true)) not(x) -> xor(x,true) or(x,y) -> xor(and(x,y),xor(x,y)) xor(x,false) -> x xor(x,x) -> false 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)) IMPLIES(x,y) -> AND(x,y) IMPLIES(x,y) -> XOR(and(x,y),xor(x,true)) IMPLIES(x,y) -> XOR(x,true) NOT(x) -> XOR(x,true) 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,false) -> false and(x,true) -> x and(x,x) -> x implies(x,y) -> xor(and(x,y),xor(x,true)) not(x) -> xor(x,true) or(x,y) -> xor(and(x,y),xor(x,y)) xor(x,false) -> x xor(x,x) -> false ->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,false) -> false and(x,true) -> x and(x,x) -> x implies(x,y) -> xor(and(x,y),xor(x,true)) not(x) -> xor(x,true) or(x,y) -> xor(and(x,y),xor(x,y)) xor(x,false) -> x xor(x,x) -> false Problem 1: Subterm Processor: -> 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,false) -> false and(x,true) -> x and(x,x) -> x implies(x,y) -> xor(and(x,y),xor(x,true)) popout

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

job log

popout

actions

all output return to TRS Stand 20472