7.50/3.48	YES
9.39/3.99	proof of /export/starexec/sandbox/benchmark/theBenchmark.hs
9.39/3.99	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
9.39/3.99	
9.39/3.99	
9.39/3.99	H-Termination with start terms of the given HASKELL could be proven:
9.39/3.99	
9.39/3.99	(0) HASKELL
9.39/3.99	(1) BR [EQUIVALENT, 0 ms]
9.39/3.99	(2) HASKELL
9.39/3.99	(3) COR [EQUIVALENT, 0 ms]
9.39/3.99	(4) HASKELL
9.39/3.99	(5) Narrow [SOUND, 0 ms]
9.39/3.99	(6) QDP
9.39/3.99	(7) QDPSizeChangeProof [EQUIVALENT, 0 ms]
9.39/3.99	(8) YES
9.39/3.99	
9.39/3.99	
9.39/3.99	----------------------------------------
9.39/3.99	
9.39/3.99	(0)
9.39/3.99	Obligation:
9.39/3.99	mainModule Main 
9.39/3.99	module Main where {
9.39/3.99	import qualified Prelude;
9.39/3.99	data List a = Cons a (List a)  | Nil ;
9.39/3.99	
9.39/3.99	data MyBool = MyTrue  | MyFalse ;
9.39/3.99	
9.39/3.99	any :: (a  ->  MyBool)  ->  List a  ->  MyBool;
9.39/3.99	any p = pt or (map p);
9.39/3.99	
9.39/3.99	foldr :: (a  ->  b  ->  b)  ->  b  ->  List a  ->  b;
9.39/3.99	foldr f z Nil = z;
9.39/3.99	foldr f z (Cons x xs) = f x (foldr f z xs);
9.39/3.99	
9.39/3.99	map :: (a  ->  b)  ->  List a  ->  List b;
9.39/3.99	map f Nil = Nil;
9.39/3.99	map f (Cons x xs) = Cons (f x) (map f xs);
9.39/3.99	
9.39/3.99	or :: List MyBool  ->  MyBool;
9.39/3.99	or = foldr pePe MyFalse;
9.39/3.99	
9.39/3.99	pePe :: MyBool  ->  MyBool  ->  MyBool;
9.39/3.99	pePe MyFalse x = x;
9.39/3.99	pePe MyTrue x = MyTrue;
9.39/3.99	
9.39/3.99	pt :: (c  ->  a)  ->  (b  ->  c)  ->  b  ->  a;
9.39/3.99	pt f g x = f (g x);
9.39/3.99	
9.39/3.99	}
9.39/3.99	
9.39/3.99	----------------------------------------
9.39/3.99	
9.39/3.99	(1) BR (EQUIVALENT)
9.39/3.99	Replaced joker patterns by fresh variables and removed binding patterns.
9.39/3.99	----------------------------------------
9.39/3.99	
9.39/3.99	(2)
9.39/3.99	Obligation:
9.39/3.99	mainModule Main 
9.39/3.99	module Main where {
9.39/3.99	import qualified Prelude;
9.39/3.99	data List a = Cons a (List a)  | Nil ;
9.39/3.99	
9.39/3.99	data MyBool = MyTrue  | MyFalse ;
9.39/3.99	
9.39/3.99	any :: (a  ->  MyBool)  ->  List a  ->  MyBool;
9.39/3.99	any p = pt or (map p);
9.39/3.99	
9.39/3.99	foldr :: (a  ->  b  ->  b)  ->  b  ->  List a  ->  b;
9.39/3.99	foldr f z Nil = z;
9.39/3.99	foldr f z (Cons x xs) = f x (foldr f z xs);
9.39/3.99	
9.39/3.99	map :: (a  ->  b)  ->  List a  ->  List b;
9.39/3.99	map f Nil = Nil;
9.39/3.99	map f (Cons x xs) = Cons (f x) (map f xs);
9.39/3.99	
9.39/3.99	or :: List MyBool  ->  MyBool;
9.39/3.99	or = foldr pePe MyFalse;
9.39/3.99	
9.39/3.99	pePe :: MyBool  ->  MyBool  ->  MyBool;
9.39/3.99	pePe MyFalse x = x;
9.39/3.99	pePe MyTrue x = MyTrue;
9.39/3.99	
9.39/3.99	pt :: (b  ->  a)  ->  (c  ->  b)  ->  c  ->  a;
9.39/3.99	pt f g x = f (g x);
9.39/3.99	
9.39/3.99	}
9.39/3.99	
9.39/3.99	----------------------------------------
9.39/3.99	
9.39/3.99	(3) COR (EQUIVALENT)
9.39/3.99	Cond Reductions:
9.39/3.99	The following Function with conditions
9.39/3.99	"undefined |Falseundefined;
9.39/3.99	"
9.39/3.99	is transformed to
9.39/3.99	"undefined  = undefined1;
9.39/3.99	"
9.39/3.99	"undefined0 True = undefined;
9.39/3.99	"
9.39/3.99	"undefined1  = undefined0 False;
9.39/3.99	"
9.39/3.99	
9.39/3.99	----------------------------------------
9.39/3.99	
9.39/3.99	(4)
9.39/3.99	Obligation:
9.39/3.99	mainModule Main 
9.39/3.99	module Main where {
9.39/3.99	import qualified Prelude;
9.39/3.99	data List a = Cons a (List a)  | Nil ;
9.39/3.99	
9.39/3.99	data MyBool = MyTrue  | MyFalse ;
9.39/3.99	
9.39/3.99	any :: (a  ->  MyBool)  ->  List a  ->  MyBool;
9.39/3.99	any p = pt or (map p);
9.39/3.99	
9.39/3.99	foldr :: (a  ->  b  ->  b)  ->  b  ->  List a  ->  b;
9.39/3.99	foldr f z Nil = z;
9.39/3.99	foldr f z (Cons x xs) = f x (foldr f z xs);
9.39/3.99	
9.39/3.99	map :: (a  ->  b)  ->  List a  ->  List b;
9.39/3.99	map f Nil = Nil;
9.39/3.99	map f (Cons x xs) = Cons (f x) (map f xs);
9.39/3.99	
9.39/3.99	or :: List MyBool  ->  MyBool;
9.39/3.99	or = foldr pePe MyFalse;
9.39/3.99	
9.39/3.99	pePe :: MyBool  ->  MyBool  ->  MyBool;
9.39/3.99	pePe MyFalse x = x;
9.39/3.99	pePe MyTrue x = MyTrue;
9.39/3.99	
9.39/3.99	pt :: (b  ->  c)  ->  (a  ->  b)  ->  a  ->  c;
9.39/3.99	pt f g x = f (g x);
9.39/3.99	
9.39/3.99	}
9.39/3.99	
9.39/3.99	----------------------------------------
9.39/3.99	
9.39/3.99	(5) Narrow (SOUND)
9.39/3.99	Haskell To QDPs
9.39/3.99	
9.39/3.99	digraph dp_graph {
9.39/3.99	node [outthreshold=100, inthreshold=100];1[label="any",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3];
9.39/3.99	3[label="any vx3",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", weight=3];
9.39/3.99	4[label="any vx3 vx4",fontsize=16,color="black",shape="triangle"];4 -> 5[label="",style="solid", color="black", weight=3];
9.39/3.99	5[label="pt or (map vx3) vx4",fontsize=16,color="black",shape="box"];5 -> 6[label="",style="solid", color="black", weight=3];
9.39/3.99	6[label="or (map vx3 vx4)",fontsize=16,color="black",shape="box"];6 -> 7[label="",style="solid", color="black", weight=3];
9.39/3.99	7[label="foldr pePe MyFalse (map vx3 vx4)",fontsize=16,color="burlywood",shape="triangle"];28[label="vx4/Cons vx40 vx41",fontsize=10,color="white",style="solid",shape="box"];7 -> 28[label="",style="solid", color="burlywood", weight=9];
9.39/3.99	28 -> 8[label="",style="solid", color="burlywood", weight=3];
9.39/3.99	29[label="vx4/Nil",fontsize=10,color="white",style="solid",shape="box"];7 -> 29[label="",style="solid", color="burlywood", weight=9];
9.39/3.99	29 -> 9[label="",style="solid", color="burlywood", weight=3];
9.39/3.99	8[label="foldr pePe MyFalse (map vx3 (Cons vx40 vx41))",fontsize=16,color="black",shape="box"];8 -> 10[label="",style="solid", color="black", weight=3];
9.39/3.99	9[label="foldr pePe MyFalse (map vx3 Nil)",fontsize=16,color="black",shape="box"];9 -> 11[label="",style="solid", color="black", weight=3];
9.39/3.99	10[label="foldr pePe MyFalse (Cons (vx3 vx40) (map vx3 vx41))",fontsize=16,color="black",shape="box"];10 -> 12[label="",style="solid", color="black", weight=3];
9.39/3.99	11[label="foldr pePe MyFalse Nil",fontsize=16,color="black",shape="box"];11 -> 13[label="",style="solid", color="black", weight=3];
9.39/3.99	12 -> 17[label="",style="dashed", color="red", weight=0];
9.39/3.99	12[label="pePe (vx3 vx40) (foldr pePe MyFalse (map vx3 vx41))",fontsize=16,color="magenta"];12 -> 18[label="",style="dashed", color="magenta", weight=3];
9.39/3.99	12 -> 19[label="",style="dashed", color="magenta", weight=3];
9.39/3.99	13[label="MyFalse",fontsize=16,color="green",shape="box"];18 -> 7[label="",style="dashed", color="red", weight=0];
9.39/3.99	18[label="foldr pePe MyFalse (map vx3 vx41)",fontsize=16,color="magenta"];18 -> 21[label="",style="dashed", color="magenta", weight=3];
9.39/3.99	19[label="vx3 vx40",fontsize=16,color="green",shape="box"];19 -> 22[label="",style="dashed", color="green", weight=3];
9.39/3.99	17[label="pePe vx6 vx5",fontsize=16,color="burlywood",shape="triangle"];30[label="vx6/MyTrue",fontsize=10,color="white",style="solid",shape="box"];17 -> 30[label="",style="solid", color="burlywood", weight=9];
9.39/3.99	30 -> 23[label="",style="solid", color="burlywood", weight=3];
9.39/3.99	31[label="vx6/MyFalse",fontsize=10,color="white",style="solid",shape="box"];17 -> 31[label="",style="solid", color="burlywood", weight=9];
9.39/3.99	31 -> 24[label="",style="solid", color="burlywood", weight=3];
9.39/3.99	21[label="vx41",fontsize=16,color="green",shape="box"];22[label="vx40",fontsize=16,color="green",shape="box"];23[label="pePe MyTrue vx5",fontsize=16,color="black",shape="box"];23 -> 26[label="",style="solid", color="black", weight=3];
9.39/3.99	24[label="pePe MyFalse vx5",fontsize=16,color="black",shape="box"];24 -> 27[label="",style="solid", color="black", weight=3];
9.39/3.99	26[label="MyTrue",fontsize=16,color="green",shape="box"];27[label="vx5",fontsize=16,color="green",shape="box"];}
9.39/3.99	
9.39/3.99	----------------------------------------
9.39/3.99	
9.39/3.99	(6)
9.39/3.99	Obligation:
9.39/3.99	Q DP problem:
9.39/3.99	The TRS P consists of the following rules:
9.39/3.99	
9.39/3.99	   new_foldr(vx3, Cons(vx40, vx41), h) -> new_foldr(vx3, vx41, h)
9.39/3.99	
9.39/3.99	R is empty.
9.39/3.99	Q is empty.
9.39/3.99	We have to consider all minimal (P,Q,R)-chains.
9.39/3.99	----------------------------------------
9.39/3.99	
9.39/3.99	(7) QDPSizeChangeProof (EQUIVALENT)
9.39/3.99	By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem. 
9.39/3.99	
9.39/3.99	From the DPs we obtained the following set of size-change graphs:
9.39/3.99	*new_foldr(vx3, Cons(vx40, vx41), h) -> new_foldr(vx3, vx41, h)
9.39/3.99	The graph contains the following edges 1 >= 1, 2 > 2, 3 >= 3
9.39/3.99	
9.39/3.99	
9.39/3.99	----------------------------------------
9.39/3.99	
9.39/3.99	(8)
9.39/3.99	YES
9.60/4.03	EOF