/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.hs /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


YES
proof of /export/starexec/sandbox2/benchmark/theBenchmark.hs
# AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


H-Termination with start terms of the given HASKELL could be proven:

(0) HASKELL
(1) BR [EQUIVALENT, 0 ms]
(2) HASKELL
(3) COR [EQUIVALENT, 0 ms]
(4) HASKELL
(5) Narrow [SOUND, 0 ms]
(6) QDP
(7) QDPSizeChangeProof [EQUIVALENT, 0 ms]
(8) YES


----------------------------------------

(0)
Obligation:
mainModule Main 
module Main where {
import qualified Prelude;
data List a = Cons a (List a)  | Nil ;

data MyBool = MyTrue  | MyFalse ;

data Tup0 = Tup0 ;

all :: (a  ->  MyBool)  ->  List a  ->  MyBool;
all p = pt and (map p);

and :: List MyBool  ->  MyBool;
and = foldr asAs MyTrue;

asAs :: MyBool  ->  MyBool  ->  MyBool;
asAs MyFalse x = MyFalse;
asAs MyTrue x = x;

esEsTup0 :: Tup0  ->  Tup0  ->  MyBool;
esEsTup0 Tup0 Tup0 = MyTrue;

foldr :: (b  ->  a  ->  a)  ->  a  ->  List b  ->  a;
foldr f z Nil = z;
foldr f z (Cons x xs) = f x (foldr f z xs);

fsEsTup0 :: Tup0  ->  Tup0  ->  MyBool;
fsEsTup0 x y = not (esEsTup0 x y);

map :: (a  ->  b)  ->  List a  ->  List b;
map f Nil = Nil;
map f (Cons x xs) = Cons (f x) (map f xs);

not :: MyBool  ->  MyBool;
not MyTrue = MyFalse;
not MyFalse = MyTrue;

notElemTup0 :: Tup0  ->  List Tup0  ->  MyBool;
notElemTup0 = pt all fsEsTup0;

pt :: (b  ->  c)  ->  (a  ->  b)  ->  a  ->  c;
pt f g x = f (g x);

}

----------------------------------------

(1) BR (EQUIVALENT)
Replaced joker patterns by fresh variables and removed binding patterns.
----------------------------------------

(2)
Obligation:
mainModule Main 
module Main where {
import qualified Prelude;
data List a = Cons a (List a)  | Nil ;

data MyBool = MyTrue  | MyFalse ;

data Tup0 = Tup0 ;

all :: (a  ->  MyBool)  ->  List a  ->  MyBool;
all p = pt and (map p);

and :: List MyBool  ->  MyBool;
and = foldr asAs MyTrue;

asAs :: MyBool  ->  MyBool  ->  MyBool;
asAs MyFalse x = MyFalse;
asAs MyTrue x = x;

esEsTup0 :: Tup0  ->  Tup0  ->  MyBool;
esEsTup0 Tup0 Tup0 = MyTrue;

foldr :: (a  ->  b  ->  b)  ->  b  ->  List a  ->  b;
foldr f z Nil = z;
foldr f z (Cons x xs) = f x (foldr f z xs);

fsEsTup0 :: Tup0  ->  Tup0  ->  MyBool;
fsEsTup0 x y = not (esEsTup0 x y);

map :: (b  ->  a)  ->  List b  ->  List a;
map f Nil = Nil;
map f (Cons x xs) = Cons (f x) (map f xs);

not :: MyBool  ->  MyBool;
not MyTrue = MyFalse;
not MyFalse = MyTrue;

notElemTup0 :: Tup0  ->  List Tup0  ->  MyBool;
notElemTup0 = pt all fsEsTup0;

pt :: (c  ->  a)  ->  (b  ->  c)  ->  b  ->  a;
pt f g x = f (g x);

}

----------------------------------------

(3) COR (EQUIVALENT)
Cond Reductions:
The following Function with conditions
"undefined |Falseundefined;
"
is transformed to
"undefined  = undefined1;
"
"undefined0 True = undefined;
"
"undefined1  = undefined0 False;
"

----------------------------------------

(4)
Obligation:
mainModule Main 
module Main where {
import qualified Prelude;
data List a = Cons a (List a)  | Nil ;

data MyBool = MyTrue  | MyFalse ;

data Tup0 = Tup0 ;

all :: (a  ->  MyBool)  ->  List a  ->  MyBool;
all p = pt and (map p);

and :: List MyBool  ->  MyBool;
and = foldr asAs MyTrue;

asAs :: MyBool  ->  MyBool  ->  MyBool;
asAs MyFalse x = MyFalse;
asAs MyTrue x = x;

esEsTup0 :: Tup0  ->  Tup0  ->  MyBool;
esEsTup0 Tup0 Tup0 = MyTrue;

foldr :: (a  ->  b  ->  b)  ->  b  ->  List a  ->  b;
foldr f z Nil = z;
foldr f z (Cons x xs) = f x (foldr f z xs);

fsEsTup0 :: Tup0  ->  Tup0  ->  MyBool;
fsEsTup0 x y = not (esEsTup0 x y);

map :: (a  ->  b)  ->  List a  ->  List b;
map f Nil = Nil;
map f (Cons x xs) = Cons (f x) (map f xs);

not :: MyBool  ->  MyBool;
not MyTrue = MyFalse;
not MyFalse = MyTrue;

notElemTup0 :: Tup0  ->  List Tup0  ->  MyBool;
notElemTup0 = pt all fsEsTup0;

pt :: (b  ->  a)  ->  (c  ->  b)  ->  c  ->  a;
pt f g x = f (g x);

}

----------------------------------------

(5) Narrow (SOUND)
Haskell To QDPs

digraph dp_graph {
node [outthreshold=100, inthreshold=100];1[label="notElemTup0",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3];
3[label="notElemTup0 vx3",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", weight=3];
4[label="notElemTup0 vx3 vx4",fontsize=16,color="black",shape="triangle"];4 -> 5[label="",style="solid", color="black", weight=3];
5[label="pt all fsEsTup0 vx3 vx4",fontsize=16,color="black",shape="box"];5 -> 6[label="",style="solid", color="black", weight=3];
6[label="all (fsEsTup0 vx3) vx4",fontsize=16,color="black",shape="box"];6 -> 7[label="",style="solid", color="black", weight=3];
7[label="pt and (map (fsEsTup0 vx3)) vx4",fontsize=16,color="black",shape="box"];7 -> 8[label="",style="solid", color="black", weight=3];
8[label="and (map (fsEsTup0 vx3) vx4)",fontsize=16,color="black",shape="box"];8 -> 9[label="",style="solid", color="black", weight=3];
9[label="foldr asAs MyTrue (map (fsEsTup0 vx3) vx4)",fontsize=16,color="burlywood",shape="triangle"];25[label="vx4/Cons vx40 vx41",fontsize=10,color="white",style="solid",shape="box"];9 -> 25[label="",style="solid", color="burlywood", weight=9];
25 -> 10[label="",style="solid", color="burlywood", weight=3];
26[label="vx4/Nil",fontsize=10,color="white",style="solid",shape="box"];9 -> 26[label="",style="solid", color="burlywood", weight=9];
26 -> 11[label="",style="solid", color="burlywood", weight=3];
10[label="foldr asAs MyTrue (map (fsEsTup0 vx3) (Cons vx40 vx41))",fontsize=16,color="black",shape="box"];10 -> 12[label="",style="solid", color="black", weight=3];
11[label="foldr asAs MyTrue (map (fsEsTup0 vx3) Nil)",fontsize=16,color="black",shape="box"];11 -> 13[label="",style="solid", color="black", weight=3];
12[label="foldr asAs MyTrue (Cons (fsEsTup0 vx3 vx40) (map (fsEsTup0 vx3) vx41))",fontsize=16,color="black",shape="box"];12 -> 14[label="",style="solid", color="black", weight=3];
13[label="foldr asAs MyTrue Nil",fontsize=16,color="black",shape="box"];13 -> 15[label="",style="solid", color="black", weight=3];
14 -> 16[label="",style="dashed", color="red", weight=0];
14[label="asAs (fsEsTup0 vx3 vx40) (foldr asAs MyTrue (map (fsEsTup0 vx3) vx41))",fontsize=16,color="magenta"];14 -> 17[label="",style="dashed", color="magenta", weight=3];
15[label="MyTrue",fontsize=16,color="green",shape="box"];17 -> 9[label="",style="dashed", color="red", weight=0];
17[label="foldr asAs MyTrue (map (fsEsTup0 vx3) vx41)",fontsize=16,color="magenta"];17 -> 18[label="",style="dashed", color="magenta", weight=3];
16[label="asAs (fsEsTup0 vx3 vx40) vx5",fontsize=16,color="black",shape="triangle"];16 -> 19[label="",style="solid", color="black", weight=3];
18[label="vx41",fontsize=16,color="green",shape="box"];19[label="asAs (not (esEsTup0 vx3 vx40)) vx5",fontsize=16,color="burlywood",shape="box"];27[label="vx3/Tup0",fontsize=10,color="white",style="solid",shape="box"];19 -> 27[label="",style="solid", color="burlywood", weight=9];
27 -> 20[label="",style="solid", color="burlywood", weight=3];
20[label="asAs (not (esEsTup0 Tup0 vx40)) vx5",fontsize=16,color="burlywood",shape="box"];28[label="vx40/Tup0",fontsize=10,color="white",style="solid",shape="box"];20 -> 28[label="",style="solid", color="burlywood", weight=9];
28 -> 21[label="",style="solid", color="burlywood", weight=3];
21[label="asAs (not (esEsTup0 Tup0 Tup0)) vx5",fontsize=16,color="black",shape="box"];21 -> 22[label="",style="solid", color="black", weight=3];
22[label="asAs (not MyTrue) vx5",fontsize=16,color="black",shape="box"];22 -> 23[label="",style="solid", color="black", weight=3];
23[label="asAs MyFalse vx5",fontsize=16,color="black",shape="box"];23 -> 24[label="",style="solid", color="black", weight=3];
24[label="MyFalse",fontsize=16,color="green",shape="box"];}

----------------------------------------

(6)
Obligation:
Q DP problem:
The TRS P consists of the following rules:

   new_foldr(vx3, Cons(vx40, vx41)) -> new_foldr(vx3, vx41)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
----------------------------------------

(7) QDPSizeChangeProof (EQUIVALENT)
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. 

From the DPs we obtained the following set of size-change graphs:
*new_foldr(vx3, Cons(vx40, vx41)) -> new_foldr(vx3, vx41)
The graph contains the following edges 1 >= 1, 2 > 2


----------------------------------------

(8)
YES