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


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


YES

Check SN using TTT2 (University of Innsbruck)

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

Proof:
 DP Processor:
  DPs:
   f#(a()) -> b#()
   b#() -> f#(c())
  TRS:
   f(a()) -> b()
   b() -> f(c())
  TDG Processor:
   DPs:
    f#(a()) -> b#()
    b#() -> f#(c())
   TRS:
    f(a()) -> b()
    b() -> f(c())
   graph:
    b#() -> f#(c()) -> f#(a()) -> b#()
    f#(a()) -> b#() -> b#() -> f#(c())
   EDG Processor:
    DPs:
     f#(a()) -> b#()
     b#() -> f#(c())
    TRS:
     f(a()) -> b()
     b() -> f(c())
    graph:
     f#(a()) -> b#() -> b#() -> f#(c())
    SCC Processor:
     #sccs: 0
     #rules: 0
     #arcs: 1/4
     

...

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

Proof:
 DP Processor:
  DPs:
   f#(a()) -> b#()
   b#() -> f#(c())
  TRS:
   f(a()) -> b()
   b() -> f(c())
  TDG Processor:
   DPs:
    f#(a()) -> b#()
    b#() -> f#(c())
   TRS:
    f(a()) -> b()
    b() -> f(c())
   graph:
    b#() -> f#(c()) -> f#(a()) -> b#()
    f#(a()) -> b#() -> b#() -> f#(c())
   EDG Processor:
    DPs:
     f#(a()) -> b#()
     b#() -> f#(c())
    TRS:
     f(a()) -> b()
     b() -> f(c())
    graph:
     f#(a()) -> b#() -> b#() -> f#(c())
    SCC Processor:
     #sccs: 0
     #rules: 0
     #arcs: 1/4
     

******** Signature ********
 f : (A -> B) -> B
 a : B
 b : B
 c : B
******** Computation Rules ********
 (1)  f(x.a) => b
 (2)  b => f(x.c)

YES