/export/starexec/sandbox2/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


YES

Problem:
 not(not(x)) -> x
 not(or(x,y)) -> and(not(x),not(y))
 not(and(x,y)) -> or(not(x),not(y))
 and(x,or(y,z)) -> or(and(x,y),and(x,z))
 and(or(y,z),x) -> or(and(x,y),and(x,z))

Proof:
 DP Processor:
  DPs:
   not#(or(x,y)) -> not#(y)
   not#(or(x,y)) -> not#(x)
   not#(or(x,y)) -> and#(not(x),not(y))
   not#(and(x,y)) -> not#(y)
   not#(and(x,y)) -> not#(x)
   and#(x,or(y,z)) -> and#(x,z)
   and#(x,or(y,z)) -> and#(x,y)
   and#(or(y,z),x) -> and#(x,z)
   and#(or(y,z),x) -> and#(x,y)
  TRS:
   not(not(x)) -> x
   not(or(x,y)) -> and(not(x),not(y))
   not(and(x,y)) -> or(not(x),not(y))
   and(x,or(y,z)) -> or(and(x,y),and(x,z))
   and(or(y,z),x) -> or(and(x,y),and(x,z))
  TDG Processor:
   DPs:
    not#(or(x,y)) -> not#(y)
    not#(or(x,y)) -> not#(x)
    not#(or(x,y)) -> and#(not(x),not(y))
    not#(and(x,y)) -> not#(y)
    not#(and(x,y)) -> not#(x)
    and#(x,or(y,z)) -> and#(x,z)
    and#(x,or(y,z)) -> and#(x,y)
    and#(or(y,z),x) -> and#(x,z)
    and#(or(y,z),x) -> and#(x,y)
   TRS:
    not(not(x)) -> x
    not(or(x,y)) -> and(not(x),not(y))
    not(and(x,y)) -> or(not(x),not(y))
    and(x,or(y,z)) -> or(and(x,y),and(x,z))
    and(or(y,z),x) -> or(and(x,y),and(x,z))
   graph:
    and#(or(y,z),x) -> and#(x,z) -> and#(or(y,z),x) -> and#(x,y)
    and#(or(y,z),x) -> and#(x,z) -> and#(or(y,z),x) -> and#(x,z)
    and#(or(y,z),x) -> and#(x,z) -> and#(x,or(y,z)) -> and#(x,y)
    and#(or(y,z),x) -> and#(x,z) -> and#(x,or(y,z)) -> and#(x,z)
    and#(or(y,z),x) -> and#(x,y) -> and#(or(y,z),x) -> and#(x,y)
    and#(or(y,z),x) -> and#(x,y) -> and#(or(y,z),x) -> and#(x,z)
    and#(or(y,z),x) -> and#(x,y) -> and#(x,or(y,z)) -> and#(x,y)
    and#(or(y,z),x) -> and#(x,y) -> and#(x,or(y,z)) -> and#(x,z)
    and#(x,or(y,z)) -> and#(x,z) -> and#(or(y,z),x) -> and#(x,y)
    and#(x,or(y,z)) -> and#(x,z) -> and#(or(y,z),x) -> and#(x,z)
    and#(x,or(y,z)) -> and#(x,z) -> and#(x,or(y,z)) -> and#(x,y)
    and#(x,or(y,z)) -> and#(x,z) -> and#(x,or(y,z)) -> and#(x,z)
    and#(x,or(y,z)) -> and#(x,y) -> and#(or(y,z),x) -> and#(x,y)
    and#(x,or(y,z)) -> and#(x,y) -> and#(or(y,z),x) -> and#(x,z)
    and#(x,or(y,z)) -> and#(x,y) -> and#(x,or(y,z)) -> and#(x,y)
    and#(x,or(y,z)) -> and#(x,y) -> and#(x,or(y,z)) -> and#(x,z)
    not#(and(x,y)) -> not#(y) -> not#(and(x,y)) -> not#(x)
    not#(and(x,y)) -> not#(y) -> not#(and(x,y)) -> not#(y)
    not#(and(x,y)) -> not#(y) -> not#(or(x,y)) -> and#(not(x),not(y))
    not#(and(x,y)) -> not#(y) -> not#(or(x,y)) -> not#(x)
    not#(and(x,y)) -> not#(y) -> not#(or(x,y)) -> not#(y)
    not#(and(x,y)) -> not#(x) -> not#(and(x,y)) -> not#(x)
    not#(and(x,y)) -> not#(x) -> not#(and(x,y)) -> not#(y)
    not#(and(x,y)) -> not#(x) -> not#(or(x,y)) -> and#(not(x),not(y))
    not#(and(x,y)) -> not#(x) -> not#(or(x,y)) -> not#(x)
    not#(and(x,y)) -> not#(x) -> not#(or(x,y)) -> not#(y)
    not#(or(x,y)) -> and#(not(x),not(y)) ->
    and#(or(y,z),x) -> and#(x,y)
    not#(or(x,y)) -> and#(not(x),not(y)) ->
    and#(or(y,z),x) -> and#(x,z)
    not#(or(x,y)) -> and#(not(x),not(y)) ->
    and#(x,or(y,z)) -> and#(x,y)
    not#(or(x,y)) -> and#(not(x),not(y)) -> and#(x,or(y,z)) -> and#(x,z)
    not#(or(x,y)) -> not#(y) -> not#(and(x,y)) -> not#(x)
    not#(or(x,y)) -> not#(y) -> not#(and(x,y)) -> not#(y)
    not#(or(x,y)) -> not#(y) -> not#(or(x,y)) -> and#(not(x),not(y))
    not#(or(x,y)) -> not#(y) -> not#(or(x,y)) -> not#(x)
    not#(or(x,y)) -> not#(y) -> not#(or(x,y)) -> not#(y)
    not#(or(x,y)) -> not#(x) -> not#(and(x,y)) -> not#(x)
    not#(or(x,y)) -> not#(x) -> not#(and(x,y)) -> not#(y)
    not#(or(x,y)) -> not#(x) -> not#(or(x,y)) -> and#(not(x),not(y))
    not#(or(x,y)) -> not#(x) -> not#(or(x,y)) -> not#(x)
    not#(or(x,y)) -> not#(x) -> not#(or(x,y)) -> not#(y)
   SCC Processor:
    #sccs: 2
    #rules: 8
    #arcs: 40/81
    DPs:
     not#(and(x,y)) -> not#(y)
     not#(or(x,y)) -> not#(y)
     not#(or(x,y)) -> not#(x)
     not#(and(x,y)) -> not#(x)
    TRS:
     not(not(x)) -> x
     not(or(x,y)) -> and(not(x),not(y))
     not(and(x,y)) -> or(not(x),not(y))
     and(x,or(y,z)) -> or(and(x,y),and(x,z))
     and(or(y,z),x) -> or(and(x,y),and(x,z))
    Subterm Criterion Processor:
     simple projection:
      pi(not#) = 0
     problem:
      DPs:
       
      TRS:
       not(not(x)) -> x
       not(or(x,y)) -> and(not(x),not(y))
       not(and(x,y)) -> or(not(x),not(y))
       and(x,or(y,z)) -> or(and(x,y),and(x,z))
       and(or(y,z),x) -> or(and(x,y),and(x,z))
     Qed
    
    DPs:
     and#(or(y,z),x) -> and#(x,z)
     and#(x,or(y,z)) -> and#(x,z)
     and#(x,or(y,z)) -> and#(x,y)
     and#(or(y,z),x) -> and#(x,y)
    TRS:
     not(not(x)) -> x
     not(or(x,y)) -> and(not(x),not(y))
     not(and(x,y)) -> or(not(x),not(y))
     and(x,or(y,z)) -> or(and(x,y),and(x,z))
     and(or(y,z),x) -> or(and(x,y),and(x,z))
    Size-Change Termination Processor:
     DPs:
      
     TRS:
      not(not(x)) -> x
      not(or(x,y)) -> and(not(x),not(y))
      not(and(x,y)) -> or(not(x),not(y))
      and(x,or(y,z)) -> or(and(x,y),and(x,z))
      and(or(y,z),x) -> or(and(x,y),and(x,z))
     The DP: and#(or(y,z),x) -> and#(x,z) has the edges:
       0 >   1
       1 >=  0
     The DP: and#(x,or(y,z)) -> and#(x,z) has the edges:
       0 >=  0
       1 >   1
     The DP: and#(x,or(y,z)) -> and#(x,y) has the edges:
       0 >=  0
       1 >   1
     The DP: and#(or(y,z),x) -> and#(x,y) has the edges:
       0 >   1
       1 >=  0
     Qed