8.51/4.38	NO
9.95/4.83	proof of /export/starexec/sandbox/benchmark/theBenchmark.hs
9.95/4.83	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
9.95/4.83	
9.95/4.83	
9.95/4.83	H-Termination with start terms of the given HASKELL could be disproven:
9.95/4.83	
9.95/4.83	(0) HASKELL
9.95/4.83	(1) BR [EQUIVALENT, 0 ms]
9.95/4.83	(2) HASKELL
9.95/4.83	(3) COR [EQUIVALENT, 0 ms]
9.95/4.83	(4) HASKELL
9.95/4.83	(5) Narrow [COMPLETE, 0 ms]
9.95/4.83	(6) QDP
9.95/4.83	(7) NonTerminationLoopProof [COMPLETE, 0 ms]
9.95/4.83	(8) NO
9.95/4.83	
9.95/4.83	
9.95/4.83	----------------------------------------
9.95/4.83	
9.95/4.83	(0)
9.95/4.83	Obligation:
9.95/4.83	mainModule Main 
9.95/4.83	module Main where {
9.95/4.83	import qualified Prelude;
9.95/4.83	}
9.95/4.83	
9.95/4.83	----------------------------------------
9.95/4.83	
9.95/4.83	(1) BR (EQUIVALENT)
9.95/4.83	Replaced joker patterns by fresh variables and removed binding patterns.
9.95/4.83	----------------------------------------
9.95/4.83	
9.95/4.83	(2)
9.95/4.83	Obligation:
9.95/4.83	mainModule Main 
9.95/4.83	module Main where {
9.95/4.83	import qualified Prelude;
9.95/4.83	}
9.95/4.83	
9.95/4.83	----------------------------------------
9.95/4.83	
9.95/4.83	(3) COR (EQUIVALENT)
9.95/4.83	Cond Reductions:
9.95/4.83	The following Function with conditions
9.95/4.83	"undefined |Falseundefined;
9.95/4.83	"
9.95/4.83	is transformed to
9.95/4.83	"undefined  = undefined1;
9.95/4.83	"
9.95/4.83	"undefined0 True = undefined;
9.95/4.83	"
9.95/4.83	"undefined1  = undefined0 False;
9.95/4.83	"
9.95/4.83	
9.95/4.83	----------------------------------------
9.95/4.83	
9.95/4.83	(4)
9.95/4.83	Obligation:
9.95/4.83	mainModule Main 
9.95/4.83	module Main where {
9.95/4.83	import qualified Prelude;
9.95/4.83	}
9.95/4.83	
9.95/4.83	----------------------------------------
9.95/4.83	
9.95/4.83	(5) Narrow (COMPLETE)
9.95/4.83	Haskell To QDPs
9.95/4.83	
9.95/4.83	digraph dp_graph {
9.95/4.83	node [outthreshold=100, inthreshold=100];1[label="minBound",fontsize=16,color="black",shape="box"];1 -> 3[label="",style="solid", color="black", weight=3];
9.95/4.83	3[label="primMinInt",fontsize=16,color="black",shape="triangle"];3 -> 4[label="",style="solid", color="black", weight=3];
9.95/4.83	4 -> 3[label="",style="dashed", color="red", weight=0];
9.95/4.83	4[label="primMinInt",fontsize=16,color="magenta"];}
9.95/4.83	
9.95/4.83	----------------------------------------
9.95/4.83	
9.95/4.83	(6)
9.95/4.83	Obligation:
9.95/4.83	Q DP problem:
9.95/4.83	The TRS P consists of the following rules:
9.95/4.83	
9.95/4.83	   new_primMinInt([]) -> new_primMinInt([])
9.95/4.83	
9.95/4.83	R is empty.
9.95/4.83	Q is empty.
9.95/4.83	We have to consider all (P,Q,R)-chains.
9.95/4.83	----------------------------------------
9.95/4.83	
9.95/4.83	(7) NonTerminationLoopProof (COMPLETE)
9.95/4.83	We used the non-termination processor [FROCOS05] to show that the DP problem is infinite.
9.95/4.84	Found a loop by semiunifying a rule from P directly.
9.95/4.84	
9.95/4.84	s = new_primMinInt([]) evaluates to  t =new_primMinInt([])
9.95/4.84	
9.95/4.84	Thus s starts an infinite chain as s semiunifies with t with the following substitutions:
9.95/4.84	* Matcher: [ ]
9.95/4.84	* Semiunifier: [ ]
9.95/4.84	
9.95/4.84	--------------------------------------------------------------------------------
9.95/4.84	Rewriting sequence
9.95/4.84	
9.95/4.84	The DP semiunifies directly so there is only one rewrite step from new_primMinInt([]) to new_primMinInt([]).
9.95/4.84	
9.95/4.84	
9.95/4.84	
9.95/4.84	
9.95/4.84	----------------------------------------
9.95/4.84	
9.95/4.84	(8)
9.95/4.84	NO
10.11/4.90	EOF