/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:
 cond(true(),x) -> cond(odd(x),p(p(p(x))))
 odd(0()) -> false()
 odd(s(0())) -> true()
 odd(s(s(x))) -> odd(x)
 p(0()) -> 0()
 p(s(x)) -> x

Proof:
 DP Processor:
  DPs:
   cond#(true(),x) -> p#(x)
   cond#(true(),x) -> p#(p(x))
   cond#(true(),x) -> p#(p(p(x)))
   cond#(true(),x) -> odd#(x)
   cond#(true(),x) -> cond#(odd(x),p(p(p(x))))
   odd#(s(s(x))) -> odd#(x)
  TRS:
   cond(true(),x) -> cond(odd(x),p(p(p(x))))
   odd(0()) -> false()
   odd(s(0())) -> true()
   odd(s(s(x))) -> odd(x)
   p(0()) -> 0()
   p(s(x)) -> x
  TDG Processor:
   DPs:
    cond#(true(),x) -> p#(x)
    cond#(true(),x) -> p#(p(x))
    cond#(true(),x) -> p#(p(p(x)))
    cond#(true(),x) -> odd#(x)
    cond#(true(),x) -> cond#(odd(x),p(p(p(x))))
    odd#(s(s(x))) -> odd#(x)
   TRS:
    cond(true(),x) -> cond(odd(x),p(p(p(x))))
    odd(0()) -> false()
    odd(s(0())) -> true()
    odd(s(s(x))) -> odd(x)
    p(0()) -> 0()
    p(s(x)) -> x
   graph:
    odd#(s(s(x))) -> odd#(x) -> odd#(s(s(x))) -> odd#(x)
    cond#(true(),x) -> odd#(x) ->
    odd#(s(s(x))) -> odd#(x)
    cond#(true(),x) -> cond#(odd(x),p(p(p(x)))) ->
    cond#(true(),x) -> cond#(odd(x),p(p(p(x))))
    cond#(true(),x) -> cond#(odd(x),p(p(p(x)))) ->
    cond#(true(),x) -> odd#(x)
    cond#(true(),x) -> cond#(odd(x),p(p(p(x)))) ->
    cond#(true(),x) -> p#(p(p(x)))
    cond#(true(),x) -> cond#(odd(x),p(p(p(x)))) ->
    cond#(true(),x) -> p#(p(x))
    cond#(true(),x) -> cond#(odd(x),p(p(p(x)))) -> cond#(true(),x) -> p#(x)
   SCC Processor:
    #sccs: 2
    #rules: 2
    #arcs: 7/36
    DPs:
     cond#(true(),x) -> cond#(odd(x),p(p(p(x))))
    TRS:
     cond(true(),x) -> cond(odd(x),p(p(p(x))))
     odd(0()) -> false()
     odd(s(0())) -> true()
     odd(s(s(x))) -> odd(x)
     p(0()) -> 0()
     p(s(x)) -> x
    Usable Rule Processor:
     DPs:
      cond#(true(),x) -> cond#(odd(x),p(p(p(x))))
     TRS:
      p(0()) -> 0()
      p(s(x)) -> x
      odd(0()) -> false()
      odd(s(0())) -> true()
      odd(s(s(x))) -> odd(x)
     Arctic Interpretation Processor:
      dimension: 1
      usable rules:
       p(0()) -> 0()
       p(s(x)) -> x
       odd(0()) -> false()
       odd(s(0())) -> true()
       odd(s(s(x))) -> odd(x)
      interpretation:
       [cond#](x0, x1) = -5x0 + x1 + 0,
       
       [s](x0) = 1x0 + 2,
       
       [false] = 1,
       
       [0] = 0,
       
       [p](x0) = -1x0 + 0,
       
       [odd](x0) = 4x0,
       
       [true] = 6
      orientation:
       cond#(true(),x) = x + 1 >= -1x + 0 = cond#(odd(x),p(p(p(x))))
       
       p(0()) = 0 >= 0 = 0()
       
       p(s(x)) = x + 1 >= x = x
       
       odd(0()) = 4 >= 1 = false()
       
       odd(s(0())) = 6 >= 6 = true()
       
       odd(s(s(x))) = 6x + 7 >= 4x = odd(x)
      problem:
       DPs:
        
       TRS:
        p(0()) -> 0()
        p(s(x)) -> x
        odd(0()) -> false()
        odd(s(0())) -> true()
        odd(s(s(x))) -> odd(x)
      Qed
    
    DPs:
     odd#(s(s(x))) -> odd#(x)
    TRS:
     cond(true(),x) -> cond(odd(x),p(p(p(x))))
     odd(0()) -> false()
     odd(s(0())) -> true()
     odd(s(s(x))) -> odd(x)
     p(0()) -> 0()
     p(s(x)) -> x
    Subterm Criterion Processor:
     simple projection:
      pi(odd#) = 0
     problem:
      DPs:
       
      TRS:
       cond(true(),x) -> cond(odd(x),p(p(p(x))))
       odd(0()) -> false()
       odd(s(0())) -> true()
       odd(s(s(x))) -> odd(x)
       p(0()) -> 0()
       p(s(x)) -> x
     Qed