/export/starexec/sandbox/solver/bin/starexec_run_Default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


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


YES
Input TRS:
    1: and(true(),y) -> y
    2: and(false(),y) -> false()
    3: eq(nil(),nil()) -> true()
    4: eq(cons(t,l),nil()) -> false()
    5: eq(nil(),cons(t,l)) -> false()
    6: eq(cons(t,l),cons(t',l')) -> and(eq(t,t'),eq(l,l'))
    7: eq(var(l),var(l')) -> eq(l,l')
    8: eq(var(l),apply(t,s)) -> false()
    9: eq(var(l),lambda(x,t)) -> false()
    10: eq(apply(t,s),var(l)) -> false()
    11: eq(apply(t,s),apply(t',s')) -> and(eq(t,t'),eq(s,s'))
    12: eq(apply(t,s),lambda(x,t)) -> false()
    13: eq(lambda(x,t),var(l)) -> false()
    14: eq(lambda(x,t),apply(t,s)) -> false()
    15: eq(lambda(x,t),lambda(x',t')) -> and(eq(x,x'),eq(t,t'))
    16: if(true(),var(k),var(l')) -> var(k)
    17: if(false(),var(k),var(l')) -> var(l')
    18: ren(var(l),var(k),var(l')) -> if(eq(l,l'),var(k),var(l'))
    19: ren(x,y,apply(t,s)) -> apply(ren(x,y,t),ren(x,y,s))
    20: ren(x,y,lambda(z,t)) -> lambda(var(cons(x,cons(y,cons(lambda(z,t),nil())))),ren(x,y,ren(z,var(cons(x,cons(y,cons(lambda(z,t),nil())))),t)))
Number of strict rules: 20
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #eq(cons(t,l),cons(t',l')) -> #and(eq(t,t'),eq(l,l'))
   #2: #eq(cons(t,l),cons(t',l')) -> #eq(t,t')
   #3: #eq(cons(t,l),cons(t',l')) -> #eq(l,l')
   #4: #eq(apply(t,s),apply(t',s')) -> #and(eq(t,t'),eq(s,s'))
   #5: #eq(apply(t,s),apply(t',s')) -> #eq(t,t')
   #6: #eq(apply(t,s),apply(t',s')) -> #eq(s,s')
   #7: #ren(x,y,lambda(z,t)) -> #ren(x,y,ren(z,var(cons(x,cons(y,cons(lambda(z,t),nil())))),t))
   #8: #ren(x,y,lambda(z,t)) -> #ren(z,var(cons(x,cons(y,cons(lambda(z,t),nil())))),t)
   #9: #eq(var(l),var(l')) -> #eq(l,l')
   #10: #ren(x,y,apply(t,s)) -> #ren(x,y,t)
   #11: #ren(x,y,apply(t,s)) -> #ren(x,y,s)
   #12: #eq(lambda(x,t),lambda(x',t')) -> #and(eq(x,x'),eq(t,t'))
   #13: #eq(lambda(x,t),lambda(x',t')) -> #eq(x,x')
   #14: #eq(lambda(x,t),lambda(x',t')) -> #eq(t,t')
   #15: #ren(var(l),var(k),var(l')) -> #if(eq(l,l'),var(k),var(l'))
   #16: #ren(var(l),var(k),var(l')) -> #eq(l,l')
Number of SCCs: 2, DPs: 11
  SCC { #7 #8 #10 #11 }
POLO(Sum)... succeeded.
      apply	w: x1 + x2 + 2
      ren	w: x3
      and	w: x2 + 4
      eq	w: x1 + x2 + 1
      lambda	w: x1 + x2 + 1
      false	w: 5
      true	w: 4
      #eq	w: 0
      if	w: 0
      nil	w: 1
      #ren	w: x3
      cons	w: 1
      #if	w: 0
      var	w: 0
      #and	w: 0
    USABLE RULES: { 16..20 }
    Removed DPs: #7 #8 #10 #11
Number of SCCs: 1, DPs: 7
  SCC { #2 #3 #5 #6 #9 #13 #14 }
POLO(Sum)... succeeded.
      apply	w: x1 + x2 + 2
      ren	w: x1 + x2 + x3
      and	w: x2 + 4
      eq	w: x1 + x2 + 1
      lambda	w: x1 + x2 + 1
      false	w: 5
      true	w: 4
      #eq	w: x1 + x2
      if	w: x2
      nil	w: 1
      #ren	w: 0
      cons	w: x1 + x2 + 1
      #if	w: 0
      var	w: x1 + 1
      #and	w: 0
    USABLE RULES: { 16 }
    Removed DPs: #2 #3 #5 #6 #9 #13 #14
Number of SCCs: 0, DPs: 0