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


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


NO

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

Proof:
 Extended Uncurrying Processor:
  application symbol: f
  symbol table:
   b ==> b0/0
   c ==> c0/0
   a ==> a0/0 a1/1
   
  uncurry-rules:
   f(a0(),x1) -> a1(x1)
  eta-rules:
   
  problem:
   a1(X) -> f(X,X)
   c0() -> a0()
   c0() -> b0()
   f(a0(),x1) -> a1(x1)
  Unfolding Processor:
   loop length: 2
   terms:
    f(a0(),a0())
    a1(a0())
   context: []
   substitution:
    
   Qed