/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 
    grec : [nat * nat * nat * nat -> nat -> nat] --> nat 
    log2 : [nat * nat] --> nat 
    s : [nat] --> nat 
    sumlog : [nat] --> nat 

  Rules:

    dec(0, x) => 0 
    dec(x, 0) => x 
    dec(s(x), s(y)) => dec(x, y) 
    grec(0, x, y, f) => y 
    grec(s(x), s(y), z, f) => grec(dec(x, y), s(y), f z x, f) 
    sumlog(x) => grec(x, s(s(0)), 0, /\y./\z.!plus(log2(s(z), 0), y)) 
    !plus(0, x) => x 
    !plus(s(x), y) => s(!plus(x, y)) 
    log2(s(0), 0) => 0 
    log2(0, s(x)) => s(log2(s(x), 0)) 
    log2(s(0), s(x)) => s(log2(s(x), 0)) 
    log2(s(s(x)), y) => log2(x, s(y)) 

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