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


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


./resources/firstorderprover: line 28: 13270 Killed                  java $JAVAOPTS -Xmx3g -jar resources/aprove.jar $PROBLEM $TIMEOUT $QUERY
MAYBE
We consider the system theBenchmark.

  Alphabet:

    c : [a] --> a 
    cons : [d * e] --> e 
    f : [a * a * a] --> a 
    false : [] --> c 
    filter : [d -> c * e] --> e 
    filter2 : [c * d -> c * d * e] --> e 
    g : [b * b] --> b 
    map : [d -> d * e] --> e 
    nil : [] --> e 
    s : [a] --> a 
    true : [] --> c 

  Rules:

    f(x, c(x), c(y)) => f(y, y, f(y, x, y)) 
    f(s(x), y, z) => f(x, s(c(y)), c(z)) 
    f(c(x), x, y) => c(y) 
    g(x, y) => x 
    g(x, y) => y 
    map(h, nil) => nil 
    map(h, cons(x, y)) => cons(h x, map(h, y)) 
    filter(h, nil) => nil 
    filter(h, cons(x, y)) => filter2(h x, h, x, y) 
    filter2(true, h, x, y) => cons(x, filter(h, y)) 
    filter2(false, h, x, y) => filter(h, y) 

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