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