/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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 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, 0 ms] (6) HASKELL (7) Narrow [EQUIVALENT, 18 ms] (8) 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; unless :: Monad a => Bool -> a () -> a (); unless p s = if p then return () else s; } ---------------------------------------- (1) IFR (EQUIVALENT) If Reductions: The following If expression "if p then return () else s" is transformed to "unless0 s True = return (); unless0 s False = s; " ---------------------------------------- (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; unless :: Monad a => Bool -> a () -> a (); unless p s = unless0 s p; unless0 s True = return (); unless0 s False = s; } ---------------------------------------- (3) BR (EQUIVALENT) Replaced joker patterns by fresh variables and removed binding patterns. ---------------------------------------- (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; unless :: Monad a => Bool -> a () -> a (); unless p s = unless0 s p; unless0 s True = return (); unless0 s False = s; } ---------------------------------------- (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 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; unless :: Monad a => Bool -> a () -> a (); unless p s = unless0 s p; unless0 s True = return (); unless0 s False = s; } ---------------------------------------- (7) Narrow (EQUIVALENT) Haskell To QDPs digraph dp_graph { node [outthreshold=100, inthreshold=100];1[label="Monad.unless",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3]; 3[label="Monad.unless vy3",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", weight=3]; 4[label="Monad.unless vy3 vy4",fontsize=16,color="black",shape="triangle"];4 -> 5[label="",style="solid", color="black", weight=3]; 5[label="Monad.unless0 vy4 vy3",fontsize=16,color="burlywood",shape="box"];11[label="vy3/False",fontsize=10,color="white",style="solid",shape="box"];5 -> 11[label="",style="solid", color="burlywood", weight=9]; 11 -> 6[label="",style="solid", color="burlywood", weight=3]; 12[label="vy3/True",fontsize=10,color="white",style="solid",shape="box"];5 -> 12[label="",style="solid", color="burlywood", weight=9]; 12 -> 7[label="",style="solid", color="burlywood", weight=3]; 6[label="Monad.unless0 vy4 False",fontsize=16,color="black",shape="box"];6 -> 8[label="",style="solid", color="black", weight=3]; 7[label="Monad.unless0 vy4 True",fontsize=16,color="black",shape="box"];7 -> 9[label="",style="solid", color="black", weight=3]; 8[label="vy4",fontsize=16,color="green",shape="box"];9[label="return ()",fontsize=16,color="black",shape="box"];9 -> 10[label="",style="solid", color="black", weight=3]; 10[label="() : []",fontsize=16,color="green",shape="box"];} ---------------------------------------- (8) YES