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


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


MAYBE

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: g(U) -> true()
    2: not(true()) -> false()
    3: not(false()) -> true()
    4: _(X1,X2) -> X1
    5: _(X1,X2) -> X2
Number of strict rules: 5
Direct POLO(bPol) ... removes: 4 1 3 5 2
      false	w: 4947
      _ 	w: 2 * x1 + 2 * x2 + 1
      true	w: 2474
      g 	w: x1 + 2475
      not	w: 2 * x1
Number of strict rules: 0

...
Input TRS:
    1: g(U) -> true()
    2: not(true()) -> false()
    3: not(false()) -> true()
    4: _(X1,X2) -> X1
    5: _(X1,X2) -> X2
Number of strict rules: 5
Direct POLO(bPol) ... removes: 4 1 3 5 2
      false	w: 4947
      _ 	w: 2 * x1 + 2 * x2 + 1
      true	w: 2474
      g 	w: x1 + 2475
      not	w: 2 * x1
Number of strict rules: 0
>>YES

******** Signature ********
 rec : (((N,(N -> B),N) -> B),B,N) -> B
 0 : N
 h : (N,(N -> B),N) -> B
 not : B -> B
 even : (N,N) -> B
 g : N -> B
******** Computation rules ********
 (1)  rec(F,Z[0]) => Z
 (3)  h(V,I,P) => not(I[P])
 (6)  even(X1,Y1) => rec(h,g(X1),Y1)


******** General Schema criterion ********
Found constructors: 0, false, true
Checking type order >>OK
Checking positivity of constructors >>OK
Checking function dependency >>OK
Checking  (1) rec(F,Z[0]) => Z
 (meta Z)[is acc in F,Z[0]] [is acc in Z[0]]  >>False

Try again using status RL
Checking  (1) rec(F,Z[0]) => Z
 (meta Z)[is acc in F,Z[0]] [is acc in Z[0]]  >>False

Try again using status Mul
Checking  (1) rec(F,Z[0]) => Z
 (meta Z)[is acc in F,Z[0]] [is acc in Z[0]]  >>False
Found constructors: 0, not, g
Checking type order >>OK
Checking positivity of constructors >>OK
Checking function dependency >>OK
Checking  (1) rec(F,Z[0]) => Z
 (meta Z)[is acc in F,Z[0]] [is acc in Z[0]]  >>False

Try again using status RL
Checking  (1) rec(F,Z[0]) => Z
 (meta Z)[is acc in F,Z[0]] [is acc in Z[0]]  >>False

Try again using status Mul
Checking  (1) rec(F,Z[0]) => Z
 (meta Z)[is acc in F,Z[0]] [is acc in Z[0]]  >>False
#No idea..
******** Signature ********
 0 : N
 even : (N,N) -> B
 false : B
 g : N -> B
 h : (N,(N -> B),N) -> B
 not : B -> B
 rec : (((N,(N -> B),N) -> B),B,N) -> B
 true : B
******** Computation Rules ********
 (1)  rec(F,Z[0]) => Z
 (2)  g(U) => true
 (3)  h(V,I,P) => not(I[P])
 (4)  not(true) => false
 (5)  not(false) => true
 (6)  even(X1,Y1) => rec(h,g(X1),Y1)

MAYBE