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


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


MAYBE
* Step 1: Failure MAYBE
  + Considered Problem:
      - Strict TRS:
          and(false(),y) -> false()
          and(true(),y) -> y
          eq(0(),0()) -> true()
          eq(0(),s(x)) -> false()
          eq(s(x),0()) -> false()
          eq(s(x),s(y)) -> eq(x,y)
          if1(false(),x,y,c,i,j) -> if2(le(c,size(j)),x,y,c,i,j)
          if1(true(),x,y,c,i,j) -> true()
          if2(false(),x,y,c,i,j) -> false()
          if2(true(),x,y,c,edge(u,v,i),j) -> or(if2(true(),x,y,c,i,j),and(eq(x,u),reach(v,y,s(c),j,j)))
          if2(true(),x,y,c,empty(),j) -> false()
          le(0(),y) -> true()
          le(s(x),0()) -> false()
          le(s(x),s(y)) -> le(x,y)
          or(false(),y) -> y
          or(true(),y) -> true()
          reach(x,y,c,i,j) -> if1(eq(x,y),x,y,c,i,j)
          reachable(x,y,i) -> reach(x,y,0(),i,i)
          size(edge(x,y,i)) -> s(size(i))
          size(empty()) -> 0()
      - Signature:
          {and/2,eq/2,if1/6,if2/6,le/2,or/2,reach/5,reachable/3,size/1} / {0/0,edge/3,empty/0,false/0,s/1,true/0}
      - Obligation:
          innermost derivational complexity wrt. signature {0,and,edge,empty,eq,false,if1,if2,le,or,reach,reachable,s
          ,size,true}
  + Applied Processor:
      DecomposeCP {onSelectionCP_ = any strict-rules, withBoundCP_ = RelativeComp, withCP_ = NaturalMI {miDimension = 4, miDegree = 4, miKind = Algebraic, uargs = NoUArgs, urules = NoURules, selector = Nothing}}
  + Details:
      The processor is not applicable. The reason is some rule is duplicating.
MAYBE