/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.hs /export/starexec/sandbox/output/output_files


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


NO
proof of /export/starexec/sandbox/benchmark/theBenchmark.hs
# AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


H-Termination with start terms of the given HASKELL could be disproven:

(0) HASKELL
(1) BR [EQUIVALENT, 0 ms]
(2) HASKELL
(3) COR [EQUIVALENT, 0 ms]
(4) HASKELL
(5) LetRed [EQUIVALENT, 0 ms]
(6) HASKELL
(7) Narrow [COMPLETE, 0 ms]
(8) QDP
(9) NonTerminationLoopProof [COMPLETE, 0 ms]
(10) NO


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

(0)
Obligation:
mainModule Main 
module Main where {
import qualified Prelude;
}

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

(1) BR (EQUIVALENT)
Replaced joker patterns by fresh variables and removed binding patterns.
----------------------------------------

(2)
Obligation:
mainModule Main 
module Main where {
import qualified Prelude;
}

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

(3) COR (EQUIVALENT)
Cond Reductions:
The following Function with conditions
"undefined |Falseundefined;
"
is transformed to
"undefined  = undefined1;
"
"undefined0 True = undefined;
"
"undefined1  = undefined0 False;
"

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

(4)
Obligation:
mainModule Main 
module Main where {
import qualified Prelude;
}

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

(5) LetRed (EQUIVALENT)
Let/Where Reductions:
The bindings of the following Let/Where expression
"xs where {
xs  = x : xs;
} 
"
are unpacked to the following functions on top level
"repeatXs vx = vx : repeatXs vx;
"

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

(6)
Obligation:
mainModule Main 
module Main where {
import qualified Prelude;
}

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

(7) Narrow (COMPLETE)
Haskell To QDPs

digraph dp_graph {
node [outthreshold=100, inthreshold=100];1[label="repeat",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3];
3[label="repeat vy3",fontsize=16,color="black",shape="triangle"];3 -> 4[label="",style="solid", color="black", weight=3];
4[label="repeatXs vy3",fontsize=16,color="black",shape="triangle"];4 -> 5[label="",style="solid", color="black", weight=3];
5[label="vy3 : repeatXs vy3",fontsize=16,color="green",shape="box"];5 -> 6[label="",style="dashed", color="green", weight=3];
6 -> 4[label="",style="dashed", color="red", weight=0];
6[label="repeatXs vy3",fontsize=16,color="magenta"];}

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

(8)
Obligation:
Q DP problem:
The TRS P consists of the following rules:

   new_repeatXs(vy3, h, []) -> new_repeatXs(vy3, h, [])

R is empty.
Q is empty.
We have to consider all (P,Q,R)-chains.
----------------------------------------

(9) NonTerminationLoopProof (COMPLETE)
We used the non-termination processor [FROCOS05] to show that the DP problem is infinite.
Found a loop by semiunifying a rule from P directly.

s = new_repeatXs(vy3, h, []) evaluates to  t =new_repeatXs(vy3, h, [])

Thus s starts an infinite chain as s semiunifies with t with the following substitutions:
* Matcher: [ ]
* Semiunifier: [ ]

--------------------------------------------------------------------------------
Rewriting sequence

The DP semiunifies directly so there is only one rewrite step from new_repeatXs(vy3, h, []) to new_repeatXs(vy3, h, []).




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

(10)
NO