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


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


YES

Problem:
 p(f(f(x))) -> q(f(g(x)))
 p(g(g(x))) -> q(g(f(x)))
 q(f(f(x))) -> p(f(g(x)))
 q(g(g(x))) -> p(g(f(x)))

Proof:
 String Reversal Processor:
  f(f(p(x))) -> g(f(q(x)))
  g(g(p(x))) -> f(g(q(x)))
  f(f(q(x))) -> g(f(p(x)))
  g(g(q(x))) -> f(g(p(x)))
  Bounds Processor:
   bound: 0
   enrichment: match
   automaton:
    final states: {10,7,5,1}
    transitions:
     g0(4) -> 1*
     g0(3) -> 6*
     g0(9) -> 7*
     g0(8) -> 11*
     q0(2) -> 3*
     p0(2) -> 8*
     f40() -> 2*
     f0(6) -> 5*
     f0(3) -> 4*
     f0(8) -> 9*
     f0(11) -> 10*
   problem:
    
   Qed