details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.0544381 seconds
cpu usage	0.055376
user time	0.023712
system time	0.031664
max virtual memory	113188.0
max residence set size	5724.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S x:S y:S z:S) (RULES and(or(y:S,z:S),x:S) -> or(and(x:S,y:S),and(x:S,z:S)) and(x:S,or(y:S,z:S)) -> or(and(x:S,y:S),and(x:S,z:S)) not(and(x:S,y:S)) -> or(not(x:S),not(y:S)) not(not(x:S)) -> x:S not(or(x:S,y:S)) -> and(not(x:S),not(y:S)) ) Problem 1: Dependency Pairs Processor: -> Pairs: AND(or(y:S,z:S),x:S) -> AND(x:S,y:S) AND(or(y:S,z:S),x:S) -> AND(x:S,z:S) AND(x:S,or(y:S,z:S)) -> AND(x:S,y:S) AND(x:S,or(y:S,z:S)) -> AND(x:S,z:S) NOT(and(x:S,y:S)) -> NOT(x:S) NOT(and(x:S,y:S)) -> NOT(y:S) NOT(or(x:S,y:S)) -> AND(not(x:S),not(y:S)) NOT(or(x:S,y:S)) -> NOT(x:S) NOT(or(x:S,y:S)) -> NOT(y:S) -> Rules: and(or(y:S,z:S),x:S) -> or(and(x:S,y:S),and(x:S,z:S)) and(x:S,or(y:S,z:S)) -> or(and(x:S,y:S),and(x:S,z:S)) not(and(x:S,y:S)) -> or(not(x:S),not(y:S)) not(not(x:S)) -> x:S not(or(x:S,y:S)) -> and(not(x:S),not(y:S)) Problem 1: SCC Processor: -> Pairs: AND(or(y:S,z:S),x:S) -> AND(x:S,y:S) AND(or(y:S,z:S),x:S) -> AND(x:S,z:S) AND(x:S,or(y:S,z:S)) -> AND(x:S,y:S) AND(x:S,or(y:S,z:S)) -> AND(x:S,z:S) NOT(and(x:S,y:S)) -> NOT(x:S) NOT(and(x:S,y:S)) -> NOT(y:S) NOT(or(x:S,y:S)) -> AND(not(x:S),not(y:S)) NOT(or(x:S,y:S)) -> NOT(x:S) NOT(or(x:S,y:S)) -> NOT(y:S) -> Rules: and(or(y:S,z:S),x:S) -> or(and(x:S,y:S),and(x:S,z:S)) and(x:S,or(y:S,z:S)) -> or(and(x:S,y:S),and(x:S,z:S)) not(and(x:S,y:S)) -> or(not(x:S),not(y:S)) not(not(x:S)) -> x:S not(or(x:S,y:S)) -> and(not(x:S),not(y:S)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: AND(or(y:S,z:S),x:S) -> AND(x:S,y:S) AND(or(y:S,z:S),x:S) -> AND(x:S,z:S) AND(x:S,or(y:S,z:S)) -> AND(x:S,y:S) AND(x:S,or(y:S,z:S)) -> AND(x:S,z:S) ->->-> Rules: and(or(y:S,z:S),x:S) -> or(and(x:S,y:S),and(x:S,z:S)) and(x:S,or(y:S,z:S)) -> or(and(x:S,y:S),and(x:S,z:S)) not(and(x:S,y:S)) -> or(not(x:S),not(y:S)) not(not(x:S)) -> x:S not(or(x:S,y:S)) -> and(not(x:S),not(y:S)) ->->Cycle: ->->-> Pairs: NOT(and(x:S,y:S)) -> NOT(x:S) NOT(and(x:S,y:S)) -> NOT(y:S) NOT(or(x:S,y:S)) -> NOT(x:S) NOT(or(x:S,y:S)) -> NOT(y:S) ->->-> Rules: and(or(y:S,z:S),x:S) -> or(and(x:S,y:S),and(x:S,z:S)) and(x:S,or(y:S,z:S)) -> or(and(x:S,y:S),and(x:S,z:S)) not(and(x:S,y:S)) -> or(not(x:S),not(y:S)) not(not(x:S)) -> x:S not(or(x:S,y:S)) -> and(not(x:S),not(y:S)) The problem is decomposed in 2 subproblems. Problem 1.1: Reduction Pair Processor: -> Pairs: AND(or(y:S,z:S),x:S) -> AND(x:S,y:S) AND(or(y:S,z:S),x:S) -> AND(x:S,z:S) AND(x:S,or(y:S,z:S)) -> AND(x:S,y:S) AND(x:S,or(y:S,z:S)) -> AND(x:S,z:S) -> Rules: and(or(y:S,z:S),x:S) -> or(and(x:S,y:S),and(x:S,z:S)) and(x:S,or(y:S,z:S)) -> or(and(x:S,y:S),and(x:S,z:S)) not(and(x:S,y:S)) -> or(not(x:S),not(y:S)) not(not(x:S)) -> x:S not(or(x:S,y:S)) -> and(not(x:S),not(y:S)) -> Usable rules: Empty ->Interpretation type: Linear ->Coefficients: popout

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

job log

popout

actions

all output return to TRS Standard