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


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


MAYBE
We consider the system theBenchmark.

  Alphabet:

    !plus : [nat * nat] --> nat 
    0 : [] --> nat 
    dec : [nat * nat] --> nat 
    p : [nat * nat] --> nat 
    quad : [nat] --> nat 
    rec : [nat * nat * nat * nat -> nat -> nat] --> nat 
    s : [nat] --> nat 
    sqr : [nat] --> nat 
    sumsqr : [nat] --> nat 

  Rules:

    dec(0, x) => 0 
    dec(x, 0) => x 
    dec(s(x), s(y)) => dec(x, y) 
    rec(0, x, y, f) => y 
    rec(s(x), s(y), z, f) => rec(dec(x, y), s(y), f z x, f) 
    sumsqr(x) => rec(x, s(0), 0, /\y./\z.!plus(sqr(p(s(z), 0)), y)) 
    !plus(0, x) => x 
    !plus(s(x), y) => s(!plus(x, y)) 
    quad(0) => 0 
    quad(s(x)) => s(s(s(s(quad(x))))) 
    sqr(p(0, 0)) => 0 
    sqr(p(s(s(x)), y)) => sqr(p(x, s(y))) 
    sqr(p(s(0), x)) => !plus(quad(sqr(p(x, 0))), s(quad(x))) 
    sqr(p(0, s(x))) => quad(sqr(p(s(x), 0))) 

This AFS is converted to an AFSM simply by replacing all free variables by meta-variables (with arity 0).