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


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


YES
proof of /export/starexec/sandbox/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) IFR [EQUIVALENT, 0 ms]
(2) HASKELL
(3) BR [EQUIVALENT, 0 ms]
(4) HASKELL
(5) COR [EQUIVALENT, 21 ms]
(6) HASKELL
(7) Narrow [EQUIVALENT, 34 ms]
(8) YES


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

(0)
Obligation:
mainModule Main 
module Maybe where {
import qualified List;
import qualified Main;
import qualified Prelude;
}
module List where {
import qualified Main;
import qualified Maybe;
import qualified Prelude;
delete :: Eq a => a  ->  [a]  ->  [a];
delete = deleteBy (==);

deleteBy :: (a  ->  a  ->  Bool)  ->  a  ->  [a]  ->  [a];
deleteBy _ _ [] = [];
deleteBy eq x (y : ys) =  if x `eq` y then ys else y : deleteBy eq x ys;

}
module Main where {
import qualified List;
import qualified Maybe;
import qualified Prelude;
}

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

(1) IFR (EQUIVALENT)
If Reductions:
The following If expression
"if eq x y then ys else y : deleteBy eq x ys"
is transformed to
"deleteBy0 ys y eq x True = ys;
deleteBy0 ys y eq x False = y : deleteBy eq x ys;
"

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

(2)
Obligation:
mainModule Main 
module Maybe where {
import qualified List;
import qualified Main;
import qualified Prelude;
}
module List where {
import qualified Main;
import qualified Maybe;
import qualified Prelude;
delete :: Eq a => a  ->  [a]  ->  [a];
delete = deleteBy (==);

deleteBy :: (a  ->  a  ->  Bool)  ->  a  ->  [a]  ->  [a];
deleteBy _ _ [] = [];
deleteBy eq x (y : ys) = deleteBy0 ys y eq x (x `eq` y);

deleteBy0 ys y eq x True = ys;
deleteBy0 ys y eq x False = y : deleteBy eq x ys;

}
module Main where {
import qualified List;
import qualified Maybe;
import qualified Prelude;
}

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

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

(4)
Obligation:
mainModule Main 
module Maybe where {
import qualified List;
import qualified Main;
import qualified Prelude;
}
module List where {
import qualified Main;
import qualified Maybe;
import qualified Prelude;
delete :: Eq a => a  ->  [a]  ->  [a];
delete = deleteBy (==);

deleteBy :: (a  ->  a  ->  Bool)  ->  a  ->  [a]  ->  [a];
deleteBy vy vz [] = [];
deleteBy eq x (y : ys) = deleteBy0 ys y eq x (x `eq` y);

deleteBy0 ys y eq x True = ys;
deleteBy0 ys y eq x False = y : deleteBy eq x ys;

}
module Main where {
import qualified List;
import qualified Maybe;
import qualified Prelude;
}

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

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

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

(6)
Obligation:
mainModule Main 
module Maybe where {
import qualified List;
import qualified Main;
import qualified Prelude;
}
module List where {
import qualified Main;
import qualified Maybe;
import qualified Prelude;
delete :: Eq a => a  ->  [a]  ->  [a];
delete = deleteBy (==);

deleteBy :: (a  ->  a  ->  Bool)  ->  a  ->  [a]  ->  [a];
deleteBy vy vz [] = [];
deleteBy eq x (y : ys) = deleteBy0 ys y eq x (x `eq` y);

deleteBy0 ys y eq x True = ys;
deleteBy0 ys y eq x False = y : deleteBy eq x ys;

}
module Main where {
import qualified List;
import qualified Maybe;
import qualified Prelude;
}

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

(7) Narrow (EQUIVALENT)
Haskell To QDPs

digraph dp_graph {
node [outthreshold=100, inthreshold=100];1[label="List.delete",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3];
3[label="List.delete wu3",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", weight=3];
4[label="List.delete wu3 wu4",fontsize=16,color="black",shape="triangle"];4 -> 5[label="",style="solid", color="black", weight=3];
5[label="List.deleteBy (==) wu3 wu4",fontsize=16,color="burlywood",shape="box"];14[label="wu4/wu40 : wu41",fontsize=10,color="white",style="solid",shape="box"];5 -> 14[label="",style="solid", color="burlywood", weight=9];
14 -> 6[label="",style="solid", color="burlywood", weight=3];
15[label="wu4/[]",fontsize=10,color="white",style="solid",shape="box"];5 -> 15[label="",style="solid", color="burlywood", weight=9];
15 -> 7[label="",style="solid", color="burlywood", weight=3];
6[label="List.deleteBy (==) wu3 (wu40 : wu41)",fontsize=16,color="black",shape="box"];6 -> 8[label="",style="solid", color="black", weight=3];
7[label="List.deleteBy (==) wu3 []",fontsize=16,color="black",shape="box"];7 -> 9[label="",style="solid", color="black", weight=3];
8[label="List.deleteBy0 wu41 wu40 (==) wu3 ((==) wu3 wu40)",fontsize=16,color="burlywood",shape="box"];16[label="wu3/()",fontsize=10,color="white",style="solid",shape="box"];8 -> 16[label="",style="solid", color="burlywood", weight=9];
16 -> 10[label="",style="solid", color="burlywood", weight=3];
9[label="[]",fontsize=16,color="green",shape="box"];10[label="List.deleteBy0 wu41 wu40 (==) () ((==) () wu40)",fontsize=16,color="burlywood",shape="box"];17[label="wu40/()",fontsize=10,color="white",style="solid",shape="box"];10 -> 17[label="",style="solid", color="burlywood", weight=9];
17 -> 11[label="",style="solid", color="burlywood", weight=3];
11[label="List.deleteBy0 wu41 () (==) () ((==) () ())",fontsize=16,color="black",shape="box"];11 -> 12[label="",style="solid", color="black", weight=3];
12[label="List.deleteBy0 wu41 () (==) () True",fontsize=16,color="black",shape="box"];12 -> 13[label="",style="solid", color="black", weight=3];
13[label="wu41",fontsize=16,color="green",shape="box"];}

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

(8)
YES