/export/starexec/sandbox2/solver/bin/starexec_run_tct_rc /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


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


MAYBE
* Step 1: Failure MAYBE
  + Considered Problem:
      - Strict TRS:
          activate(X) -> X
          activate(n__prod(X1,X2)) -> prod(X1,X2)
          activate(n__s(X)) -> s(X)
          add(0(),X) -> X
          add(s(X),Y) -> s(add(X,Y))
          fact(X) -> if(zero(X),n__s(0()),n__prod(X,fact(p(X))))
          if(false(),X,Y) -> activate(Y)
          if(true(),X,Y) -> activate(X)
          p(s(X)) -> X
          prod(X1,X2) -> n__prod(X1,X2)
          prod(0(),X) -> 0()
          prod(s(X),Y) -> add(Y,prod(X,Y))
          s(X) -> n__s(X)
          zero(0()) -> true()
          zero(s(X)) -> false()
      - Signature:
          {activate/1,add/2,fact/1,if/3,p/1,prod/2,s/1,zero/1} / {0/0,false/0,n__prod/2,n__s/1,true/0}
      - Obligation:
           runtime complexity wrt. defined symbols {activate,add,fact,if,p,prod,s,zero} and constructors {0,false
          ,n__prod,n__s,true}
  + Applied Processor:
      Sum {left = someStrategy, right = someStrategy}
  + Details:
      None
MAYBE