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


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


NO

We split firstr-order part and higher-order part, and do modular checking by a general modularity.

******** FO SN check ********
Check SN using NaTT (Nagoya Termination Tool)
Input TRS:
    1: f(0()) -> f(0())
    2: 0() -> 1()
Trivially nonterminating rule 1.

...
Input TRS:
    1: f(0()) -> f(0())
    2: 0() -> 1()
Trivially nonterminating rule 1.
>>NO


******** Signature ********
 0 : b
 1 : b
 cons : (d,e) -> e
 f : b -> a
 false : c
 filter : ((d -> c),e) -> e
 filter2 : (c,(d -> c),d,e) -> e
 map : ((d -> d),e) -> e
 nil : e
 true : c
******** Computation Rules ********
 (1)  f(0) => f(0)
 (2)  0 => 1
 (3)  map(F,nil) => nil
 (4)  map(Z,cons(U,V)) => cons(Z[U],map(Z,V))
 (5)  filter(I,nil) => nil
 (6)  filter(J,cons(X1,Y1)) => filter2(J[X1],J,X1,Y1)
 (7)  filter2(true,G1,V1,W1) => cons(V1,filter(G1,W1))
 (8)  filter2(false,J1,X2,Y2) => filter(J1,Y2)

NO