/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) BR [EQUIVALENT, 0 ms]
(2) HASKELL
(3) COR [EQUIVALENT, 0 ms]
(4) HASKELL
(5) Narrow [EQUIVALENT, 23 ms]
(6) YES


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

(0)
Obligation:
mainModule Main 
module Maybe where {
import qualified Main;
import qualified Monad;
import qualified Prelude;
}
module Main where {
import qualified Maybe;
import qualified Monad;
import qualified Prelude;
}
module Monad where {
import qualified Main;
import qualified Maybe;
import qualified Prelude;
class Monad a => MonadPlus a where {
mzero :: MonadPlus a => a b;
}
instance MonadPlus Maybe where { 
mzero = Nothing;
}
instance MonadPlus [] where { 
mzero = [];
}
}

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

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

(2)
Obligation:
mainModule Main 
module Maybe where {
import qualified Main;
import qualified Monad;
import qualified Prelude;
}
module Main where {
import qualified Maybe;
import qualified Monad;
import qualified Prelude;
}
module Monad where {
import qualified Main;
import qualified Maybe;
import qualified Prelude;
class Monad a => MonadPlus a where {
mzero :: MonadPlus a => a b;
}
instance MonadPlus Maybe where { 
mzero = Nothing;
}
instance MonadPlus [] where { 
mzero = [];
}
}

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

(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 Maybe where {
import qualified Main;
import qualified Monad;
import qualified Prelude;
}
module Main where {
import qualified Maybe;
import qualified Monad;
import qualified Prelude;
}
module Monad where {
import qualified Main;
import qualified Maybe;
import qualified Prelude;
class Monad a => MonadPlus a where {
mzero :: MonadPlus a => a b;
}
instance MonadPlus Maybe where { 
mzero = Nothing;
}
instance MonadPlus [] where { 
mzero = [];
}
}

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

(5) Narrow (EQUIVALENT)
Haskell To QDPs

digraph dp_graph {
node [outthreshold=100, inthreshold=100];1[label="Monad.mzero",fontsize=16,color="blue",shape="box"];7[label="Monad.mzero :: [] a",fontsize=10,color="white",style="solid",shape="box"];1 -> 7[label="",style="solid", color="blue", weight=9];
7 -> 3[label="",style="solid", color="blue", weight=3];
8[label="Monad.mzero :: Maybe a",fontsize=10,color="white",style="solid",shape="box"];1 -> 8[label="",style="solid", color="blue", weight=9];
8 -> 4[label="",style="solid", color="blue", weight=3];
3[label="Monad.mzero",fontsize=16,color="black",shape="box"];3 -> 5[label="",style="solid", color="black", weight=3];
4[label="Monad.mzero",fontsize=16,color="black",shape="box"];4 -> 6[label="",style="solid", color="black", weight=3];
5[label="[]",fontsize=16,color="green",shape="box"];6[label="Nothing",fontsize=16,color="green",shape="box"];}

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

(6)
YES