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