/export/starexec/sandbox2/solver/bin/starexec_run_default /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: noabs(v(X)) -> v(X)
    2: _(X1,X2) -> X1
    3: _(X1,X2) -> X2
Number of strict rules: 3
Direct POLO(bPol) ... removes: 1 3 2
      v 	w: 2 * x1 + 1
      noabs	w: 2 * x1
      _ 	w: 2 * x1 + 2 * x2 + 1
Number of strict rules: 0

...
Input TRS:
    1: noabs(v(X)) -> v(X)
    2: _(X1,X2) -> X1
    3: _(X1,X2) -> X2
Number of strict rules: 3
Direct POLO(bPol) ... removes: 1 3 2
      v 	w: 2 * x1 + 1
      noabs	w: 2 * x1
      _ 	w: 2 * x1 + 2 * x2 + 1
Number of strict rules: 0
>>YES

******** Signature ********
 noabs : term -> term
 a : (term,term) -> term
 l : (term -> term) -> term
******** Computation rules ********
 (1)  noabs(a(X,Y)) => a(noabs(X),noabs(Y))
 (3)  a(l(Z),Y) => Z[noabs(Y)]


******** General Schema criterion ********
Found constructors: l, v
Checking type order >>OK
Checking positivity of constructors >>NO
Checking  (1) noabs(a(X,Y)) => a(noabs(X),noabs(Y))
 (fun noabs=a) subterm comparison of args w. LR LR >>False
#No idea..
******** Signature ********
 a : (term,term) -> term
 l : (term -> term) -> term
 v : term -> term
 noabs : term -> term
******** Computation Rules ********
 (1)  noabs(a(X,Y)) => a(noabs(X),noabs(Y))
 (2)  noabs(v(X)) => v(X)
 (3)  a(l(Z),Y) => Z[noabs(Y)]

MAYBE