8.37/3.58	MAYBE
9.98/4.06	proof of /export/starexec/sandbox/benchmark/theBenchmark.hs
9.98/4.06	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
9.98/4.06	
9.98/4.06	
9.98/4.06	H-Termination with start terms of the given HASKELL could not be shown:
9.98/4.06	
9.98/4.06	(0) HASKELL
9.98/4.06	(1) BR [EQUIVALENT, 0 ms]
9.98/4.06	(2) HASKELL
9.98/4.06	(3) COR [EQUIVALENT, 0 ms]
9.98/4.06	(4) HASKELL
9.98/4.06	(5) NumRed [SOUND, 0 ms]
9.98/4.06	(6) HASKELL
9.98/4.06	(7) Narrow [COMPLETE, 0 ms]
9.98/4.06	(8) QDP
9.98/4.06	(9) NonTerminationLoopProof [COMPLETE, 0 ms]
9.98/4.06	(10) NO
9.98/4.06	
9.98/4.06	
9.98/4.06	----------------------------------------
9.98/4.06	
9.98/4.06	(0)
9.98/4.06	Obligation:
9.98/4.06	mainModule Main 
9.98/4.06	module Main where {
9.98/4.06	import qualified Prelude;
9.98/4.06	}
9.98/4.06	
9.98/4.06	----------------------------------------
9.98/4.06	
9.98/4.06	(1) BR (EQUIVALENT)
9.98/4.06	Replaced joker patterns by fresh variables and removed binding patterns.
9.98/4.06	----------------------------------------
9.98/4.06	
9.98/4.06	(2)
9.98/4.06	Obligation:
9.98/4.06	mainModule Main 
9.98/4.06	module Main where {
9.98/4.06	import qualified Prelude;
9.98/4.06	}
9.98/4.06	
9.98/4.06	----------------------------------------
9.98/4.06	
9.98/4.06	(3) COR (EQUIVALENT)
9.98/4.06	Cond Reductions:
9.98/4.06	The following Function with conditions
9.98/4.06	"undefined |Falseundefined;
9.98/4.06	"
9.98/4.06	is transformed to
9.98/4.06	"undefined  = undefined1;
9.98/4.06	"
9.98/4.06	"undefined0 True = undefined;
9.98/4.06	"
9.98/4.06	"undefined1  = undefined0 False;
9.98/4.06	"
9.98/4.06	
9.98/4.06	----------------------------------------
9.98/4.06	
9.98/4.06	(4)
9.98/4.06	Obligation:
9.98/4.06	mainModule Main 
9.98/4.06	module Main where {
9.98/4.06	import qualified Prelude;
9.98/4.06	}
9.98/4.06	
9.98/4.06	----------------------------------------
9.98/4.06	
9.98/4.06	(5) NumRed (SOUND)
9.98/4.06	Num Reduction:All numbers are transformed to their corresponding representation with Succ, Pred and Zero.
9.98/4.06	----------------------------------------
9.98/4.06	
9.98/4.06	(6)
9.98/4.06	Obligation:
9.98/4.06	mainModule Main 
9.98/4.06	module Main where {
9.98/4.06	import qualified Prelude;
9.98/4.06	}
9.98/4.06	
9.98/4.06	----------------------------------------
9.98/4.06	
9.98/4.06	(7) Narrow (COMPLETE)
9.98/4.06	Haskell To QDPs
9.98/4.06	
9.98/4.06	digraph dp_graph {
9.98/4.06	node [outthreshold=100, inthreshold=100];1[label="maxBound",fontsize=16,color="blue",shape="box"];14[label="maxBound :: Char",fontsize=10,color="white",style="solid",shape="box"];1 -> 14[label="",style="solid", color="blue", weight=9];
9.98/4.06	14 -> 3[label="",style="solid", color="blue", weight=3];
9.98/4.06	15[label="maxBound :: Bool",fontsize=10,color="white",style="solid",shape="box"];1 -> 15[label="",style="solid", color="blue", weight=9];
9.98/4.06	15 -> 4[label="",style="solid", color="blue", weight=3];
9.98/4.06	16[label="maxBound :: Int",fontsize=10,color="white",style="solid",shape="box"];1 -> 16[label="",style="solid", color="blue", weight=9];
9.98/4.06	16 -> 5[label="",style="solid", color="blue", weight=3];
9.98/4.06	17[label="maxBound :: Ordering",fontsize=10,color="white",style="solid",shape="box"];1 -> 17[label="",style="solid", color="blue", weight=9];
9.98/4.06	17 -> 6[label="",style="solid", color="blue", weight=3];
9.98/4.06	18[label="maxBound :: ()",fontsize=10,color="white",style="solid",shape="box"];1 -> 18[label="",style="solid", color="blue", weight=9];
9.98/4.06	18 -> 7[label="",style="solid", color="blue", weight=3];
9.98/4.06	3[label="maxBound",fontsize=16,color="black",shape="box"];3 -> 8[label="",style="solid", color="black", weight=3];
9.98/4.06	4[label="maxBound",fontsize=16,color="black",shape="box"];4 -> 9[label="",style="solid", color="black", weight=3];
9.98/4.06	5[label="maxBound",fontsize=16,color="black",shape="box"];5 -> 10[label="",style="solid", color="black", weight=3];
9.98/4.06	6[label="maxBound",fontsize=16,color="black",shape="box"];6 -> 11[label="",style="solid", color="black", weight=3];
9.98/4.06	7[label="maxBound",fontsize=16,color="black",shape="box"];7 -> 12[label="",style="solid", color="black", weight=3];
9.98/4.06	8[label="Char (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ Zero)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))",fontsize=16,color="green",shape="box"];9[label="True",fontsize=16,color="green",shape="box"];10[label="primMaxInt",fontsize=16,color="black",shape="triangle"];10 -> 13[label="",style="solid", color="black", weight=3];
9.98/4.06	11[label="GT",fontsize=16,color="green",shape="box"];12[label="()",fontsize=16,color="green",shape="box"];13 -> 10[label="",style="dashed", color="red", weight=0];
9.98/4.06	13[label="primMaxInt",fontsize=16,color="magenta"];}
9.98/4.06	
9.98/4.06	----------------------------------------
9.98/4.06	
9.98/4.06	(8)
9.98/4.06	Obligation:
9.98/4.06	Q DP problem:
9.98/4.06	The TRS P consists of the following rules:
9.98/4.06	
9.98/4.06	   new_primMaxInt([]) -> new_primMaxInt([])
9.98/4.06	
9.98/4.06	R is empty.
9.98/4.06	Q is empty.
9.98/4.06	We have to consider all (P,Q,R)-chains.
9.98/4.06	----------------------------------------
9.98/4.06	
9.98/4.06	(9) NonTerminationLoopProof (COMPLETE)
9.98/4.06	We used the non-termination processor [FROCOS05] to show that the DP problem is infinite.
9.98/4.06	Found a loop by semiunifying a rule from P directly.
9.98/4.06	
9.98/4.06	s = new_primMaxInt([]) evaluates to  t =new_primMaxInt([])
9.98/4.06	
9.98/4.06	Thus s starts an infinite chain as s semiunifies with t with the following substitutions:
9.98/4.06	* Matcher: [ ]
9.98/4.06	* Semiunifier: [ ]
9.98/4.06	
9.98/4.06	--------------------------------------------------------------------------------
9.98/4.06	Rewriting sequence
9.98/4.06	
9.98/4.06	The DP semiunifies directly so there is only one rewrite step from new_primMaxInt([]) to new_primMaxInt([]).
9.98/4.06	
9.98/4.06	
9.98/4.06	
9.98/4.06	
9.98/4.06	----------------------------------------
9.98/4.06	
9.98/4.06	(10)
9.98/4.06	NO
10.29/4.11	EOF