/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, 18 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; join :: Monad b => b (b a) -> b a; join x = x >>= id; } ---------------------------------------- (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; join :: Monad a => a (a b) -> a b; join x = x >>= id; } ---------------------------------------- (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; join :: Monad b => b (b a) -> b a; join x = x >>= id; } ---------------------------------------- (5) Narrow (EQUIVALENT) Haskell To QDPs digraph dp_graph { node [outthreshold=100, inthreshold=100];1[label="Monad.join",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3]; 3[label="Monad.join vy3",fontsize=16,color="black",shape="triangle"];3 -> 4[label="",style="solid", color="black", weight=3]; 4[label="vy3 >>= id",fontsize=16,color="black",shape="box"];4 -> 5[label="",style="solid", color="black", weight=3]; 5[label="primbindIO vy3 id",fontsize=16,color="burlywood",shape="box"];15[label="vy3/IO vy30",fontsize=10,color="white",style="solid",shape="box"];5 -> 15[label="",style="solid", color="burlywood", weight=9]; 15 -> 6[label="",style="solid", color="burlywood", weight=3]; 16[label="vy3/AProVE_IO vy30",fontsize=10,color="white",style="solid",shape="box"];5 -> 16[label="",style="solid", color="burlywood", weight=9]; 16 -> 7[label="",style="solid", color="burlywood", weight=3]; 17[label="vy3/AProVE_Exception vy30",fontsize=10,color="white",style="solid",shape="box"];5 -> 17[label="",style="solid", color="burlywood", weight=9]; 17 -> 8[label="",style="solid", color="burlywood", weight=3]; 18[label="vy3/AProVE_Error vy30",fontsize=10,color="white",style="solid",shape="box"];5 -> 18[label="",style="solid", color="burlywood", weight=9]; 18 -> 9[label="",style="solid", color="burlywood", weight=3]; 6[label="primbindIO (IO vy30) id",fontsize=16,color="black",shape="box"];6 -> 10[label="",style="solid", color="black", weight=3]; 7[label="primbindIO (AProVE_IO vy30) id",fontsize=16,color="black",shape="box"];7 -> 11[label="",style="solid", color="black", weight=3]; 8[label="primbindIO (AProVE_Exception vy30) id",fontsize=16,color="black",shape="box"];8 -> 12[label="",style="solid", color="black", weight=3]; 9[label="primbindIO (AProVE_Error vy30) id",fontsize=16,color="black",shape="box"];9 -> 13[label="",style="solid", color="black", weight=3]; 10[label="error []",fontsize=16,color="red",shape="box"];11[label="id vy30",fontsize=16,color="black",shape="box"];11 -> 14[label="",style="solid", color="black", weight=3]; 12[label="AProVE_Exception vy30",fontsize=16,color="green",shape="box"];13[label="AProVE_Error vy30",fontsize=16,color="green",shape="box"];14[label="vy30",fontsize=16,color="green",shape="box"];} ---------------------------------------- (6) YES