/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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 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 ;

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

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

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);

}

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

(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 ;

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

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

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);

}

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

(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 ;

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

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

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);

}

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

(5) Narrow (SOUND)
Haskell To QDPs

digraph dp_graph {
node [outthreshold=100, inthreshold=100];1[label="and",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3];
3[label="and vx3",fontsize=16,color="black",shape="triangle"];3 -> 4[label="",style="solid", color="black", weight=3];
4[label="foldr asAs MyTrue vx3",fontsize=16,color="burlywood",shape="triangle"];16[label="vx3/Cons vx30 vx31",fontsize=10,color="white",style="solid",shape="box"];4 -> 16[label="",style="solid", color="burlywood", weight=9];
16 -> 5[label="",style="solid", color="burlywood", weight=3];
17[label="vx3/Nil",fontsize=10,color="white",style="solid",shape="box"];4 -> 17[label="",style="solid", color="burlywood", weight=9];
17 -> 6[label="",style="solid", color="burlywood", weight=3];
5[label="foldr asAs MyTrue (Cons vx30 vx31)",fontsize=16,color="black",shape="box"];5 -> 7[label="",style="solid", color="black", weight=3];
6[label="foldr asAs MyTrue Nil",fontsize=16,color="black",shape="box"];6 -> 8[label="",style="solid", color="black", weight=3];
7 -> 9[label="",style="dashed", color="red", weight=0];
7[label="asAs vx30 (foldr asAs MyTrue vx31)",fontsize=16,color="magenta"];7 -> 10[label="",style="dashed", color="magenta", weight=3];
8[label="MyTrue",fontsize=16,color="green",shape="box"];10 -> 4[label="",style="dashed", color="red", weight=0];
10[label="foldr asAs MyTrue vx31",fontsize=16,color="magenta"];10 -> 11[label="",style="dashed", color="magenta", weight=3];
9[label="asAs vx30 vx4",fontsize=16,color="burlywood",shape="triangle"];18[label="vx30/MyTrue",fontsize=10,color="white",style="solid",shape="box"];9 -> 18[label="",style="solid", color="burlywood", weight=9];
18 -> 12[label="",style="solid", color="burlywood", weight=3];
19[label="vx30/MyFalse",fontsize=10,color="white",style="solid",shape="box"];9 -> 19[label="",style="solid", color="burlywood", weight=9];
19 -> 13[label="",style="solid", color="burlywood", weight=3];
11[label="vx31",fontsize=16,color="green",shape="box"];12[label="asAs MyTrue vx4",fontsize=16,color="black",shape="box"];12 -> 14[label="",style="solid", color="black", weight=3];
13[label="asAs MyFalse vx4",fontsize=16,color="black",shape="box"];13 -> 15[label="",style="solid", color="black", weight=3];
14[label="vx4",fontsize=16,color="green",shape="box"];15[label="MyFalse",fontsize=16,color="green",shape="box"];}

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

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

   new_foldr(Cons(vx30, vx31)) -> new_foldr(vx31)

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(Cons(vx30, vx31)) -> new_foldr(vx31)
The graph contains the following edges 1 > 1


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

(8)
YES