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


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


NO

** BEGIN proof argument **
The following rule was generated while unfolding the analyzed TRS:
[iteration = 3] a__f(a__c,a__c,c) -> a__f(a__c,a__c,c)
Let l be the left-hand side and r be the right-hand side of this rule.
Let p = epsilon, theta1 = {} and theta2 = {}.
We have r|p = a__f(a__c,a__c,c) and theta2(theta1(l)) = theta1(r|p).
Hence, the term theta1(l) = a__f(a__c,a__c,c) loops w.r.t. the analyzed TRS.
** END proof argument **

** BEGIN proof description **
## Searching for a generalized rewrite rule
(a rule whose right-hand side contains a variable
that does not occur in the left-hand side)...
No generalized rewrite rule found!

## Applying the DP framework...
## 2 initial DP problems to solve.
## First, we try to decompose these problems into smaller problems.
## Round 1 [2 DP problems]:
  ## DP problem:
  Dependency pairs = [mark^#(f(_0,_1,_2)) -> mark^#(_1)]
  TRS = {a__f(b,_0,c) -> a__f(_0,a__c,_0), a__c -> b, mark(f(_0,_1,_2)) -> a__f(_0,mark(_1),_2), mark(c) -> a__c, mark(b) -> b, a__f(_0,_1,_2) -> f(_0,_1,_2), a__c -> c}
    ## Trying with homeomorphic embeddings... Success!
  This DP problem is finite.
  ## DP problem:
  Dependency pairs = [a__f^#(b,_0,c) -> a__f^#(_0,a__c,_0)]
  TRS = {a__f(b,_0,c) -> a__f(_0,a__c,_0), a__c -> b, mark(f(_0,_1,_2)) -> a__f(_0,mark(_1),_2), mark(c) -> a__c, mark(b) -> b, a__f(_0,_1,_2) -> f(_0,_1,_2), a__c -> c}
    ## Trying with homeomorphic embeddings... Failed!
    ## Trying with polynomial interpretations... This DP problem is too complex! Aborting!
    ## Trying with lexicographic path orders... Failed!
    ## Trying with Knuth-Bendix orders... Failed!
  Don't know whether this DP problem is finite.
## A DP problem could not be proved finite.
## Now, we try to prove that this problem is infinite.
    ## Trying to find a loop (forward=true, backward=true, max=20)
      # max_depth=20, unfold_variables=false:
        # Iteration 0: no loop found, 1 unfolded rule generated.
        # Iteration 1: no loop found, 1 unfolded rule generated.
        # Iteration 2: no loop found, 4 unfolded rules generated.
        # Iteration 3: success, found a loop, 4 unfolded rules generated.
        Here is the successful unfolding. Let IR be the TRS under analysis.
        L0 = a__f^#(b,_0,c) -> a__f^#(_0,a__c,_0) [trans] is in U_IR^0.
        We build a unit triple from L0.
        ==> L1 = a__f^#(b,_0,c) -> a__f^#(_0,a__c,_0) [unit] is in U_IR^1.
        Let p1 = [0].
        We unfold the rule of L1 backwards at position p1
        with the rule a__c -> b.
        ==> L2 = a__f^#(a__c,a__c,c) -> a__f^#(a__c,a__c,a__c) [unit] is in U_IR^2.
        Let p2 = [2].
        We unfold the rule of L2 forwards at position p2
        with the rule a__c -> c.
        ==> L3 = a__f^#(a__c,a__c,c) -> a__f^#(a__c,a__c,c) [unit] is in U_IR^3.
  This DP problem is infinite.
Proof run on Linux version 3.10.0-1160.25.1.el7.x86_64 for amd64
using Java version 1.8.0_292
** END proof description **
Total number of generated unfolded rules = 30