MAYBE

Problem:
 f(x,x) -> f(a(),b())
 b() -> c()

Proof:
 Complexity Transformation Processor:
  strict:
   f(x,x) -> f(a(),b())
   b() -> c()
  weak:
   
  Matrix Interpretation Processor:
   dimension: 1
   max_matrix:
    1
    interpretation:
     [c] = 0,
     
     [b] = 1,
     
     [a] = 0,
     
     [f](x0, x1) = x0 + x1
    orientation:
     f(x,x) = 2x >= 1 = f(a(),b())
     
     b() = 1 >= 0 = c()
    problem:
     strict:
      f(x,x) -> f(a(),b())
     weak:
      b() -> c()
    Open