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


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


NO
proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml
# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


Termination of the given GTRS could be disproven:

(0) GTRS
(1) CritRuleProof [COMPLETE, 0 ms]
(2) NO


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

(0)
Obligation:
Generalized rewrite system (where rules with free variables on rhs are allowed):
The TRS R consists of the following rules:

   if(true) -> X
   if(false) -> Y
   fact(X) -> if(zero(X))
   add(0, X) -> X
   add(s(X), Y) -> s(add(X, Y))
   prod(0, X) -> 0
   prod(s(X), Y) -> add(Y, prod(X, Y))
   zero(0) -> true
   zero(s(X)) -> false
   p(s(X)) -> X


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

(1) CritRuleProof (COMPLETE)
The rule if(true) -> X contains free variables in its right-hand side. Hence the TRS is not-terminating.
----------------------------------------

(2)
NO