/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) NumRed [SOUND, 0 ms] (6) HASKELL (7) Narrow [EQUIVALENT, 10 ms] (8) YES ---------------------------------------- (0) Obligation: mainModule Main module Main where { import qualified Prelude; } ---------------------------------------- (1) BR (EQUIVALENT) Replaced joker patterns by fresh variables and removed binding patterns. ---------------------------------------- (2) Obligation: mainModule Main module Main where { import qualified Prelude; } ---------------------------------------- (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; } ---------------------------------------- (5) NumRed (SOUND) Num Reduction:All numbers are transformed to their corresponding representation with Succ, Pred and Zero. ---------------------------------------- (6) Obligation: mainModule Main module Main where { import qualified Prelude; } ---------------------------------------- (7) Narrow (EQUIVALENT) Haskell To QDPs digraph dp_graph { node [outthreshold=100, inthreshold=100];1[label="pred",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3]; 3[label="pred vx3",fontsize=16,color="black",shape="triangle"];3 -> 4[label="",style="solid", color="black", weight=3]; 4[label="toEnum . (subtract (Pos (Succ Zero))) . fromEnum",fontsize=16,color="black",shape="box"];4 -> 5[label="",style="solid", color="black", weight=3]; 5[label="toEnum ((subtract (Pos (Succ Zero))) . fromEnum)",fontsize=16,color="black",shape="box"];5 -> 6[label="",style="solid", color="black", weight=3]; 6[label="primIntToChar ((subtract (Pos (Succ Zero))) . fromEnum)",fontsize=16,color="black",shape="box"];6 -> 7[label="",style="solid", color="black", weight=3]; 7[label="primIntToChar (subtract (Pos (Succ Zero)) (fromEnum vx3))",fontsize=16,color="black",shape="box"];7 -> 8[label="",style="solid", color="black", weight=3]; 8[label="primIntToChar (flip (-) (Pos (Succ Zero)) (fromEnum vx3))",fontsize=16,color="black",shape="box"];8 -> 9[label="",style="solid", color="black", weight=3]; 9[label="primIntToChar ((-) fromEnum vx3 Pos (Succ Zero))",fontsize=16,color="black",shape="box"];9 -> 10[label="",style="solid", color="black", weight=3]; 10[label="primIntToChar (primMinusInt (fromEnum vx3) (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];10 -> 11[label="",style="solid", color="black", weight=3]; 11[label="primIntToChar (primMinusInt (primCharToInt vx3) (Pos (Succ Zero)))",fontsize=16,color="burlywood",shape="box"];26[label="vx3/Char vx30",fontsize=10,color="white",style="solid",shape="box"];11 -> 26[label="",style="solid", color="burlywood", weight=9]; 26 -> 12[label="",style="solid", color="burlywood", weight=3]; 12[label="primIntToChar (primMinusInt (primCharToInt (Char vx30)) (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];12 -> 13[label="",style="solid", color="black", weight=3]; 13[label="primIntToChar (primMinusInt (Pos vx30) (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];13 -> 14[label="",style="solid", color="black", weight=3]; 14[label="primIntToChar (primMinusNat vx30 (Succ Zero))",fontsize=16,color="burlywood",shape="box"];27[label="vx30/Succ vx300",fontsize=10,color="white",style="solid",shape="box"];14 -> 27[label="",style="solid", color="burlywood", weight=9]; 27 -> 15[label="",style="solid", color="burlywood", weight=3]; 28[label="vx30/Zero",fontsize=10,color="white",style="solid",shape="box"];14 -> 28[label="",style="solid", color="burlywood", weight=9]; 28 -> 16[label="",style="solid", color="burlywood", weight=3]; 15[label="primIntToChar (primMinusNat (Succ vx300) (Succ Zero))",fontsize=16,color="black",shape="box"];15 -> 17[label="",style="solid", color="black", weight=3]; 16[label="primIntToChar (primMinusNat Zero (Succ Zero))",fontsize=16,color="black",shape="box"];16 -> 18[label="",style="solid", color="black", weight=3]; 17[label="primIntToChar (primMinusNat vx300 Zero)",fontsize=16,color="burlywood",shape="box"];29[label="vx300/Succ vx3000",fontsize=10,color="white",style="solid",shape="box"];17 -> 29[label="",style="solid", color="burlywood", weight=9]; 29 -> 19[label="",style="solid", color="burlywood", weight=3]; 30[label="vx300/Zero",fontsize=10,color="white",style="solid",shape="box"];17 -> 30[label="",style="solid", color="burlywood", weight=9]; 30 -> 20[label="",style="solid", color="burlywood", weight=3]; 18[label="primIntToChar (Neg (Succ Zero))",fontsize=16,color="black",shape="box"];18 -> 21[label="",style="solid", color="black", weight=3]; 19[label="primIntToChar (primMinusNat (Succ vx3000) Zero)",fontsize=16,color="black",shape="box"];19 -> 22[label="",style="solid", color="black", weight=3]; 20[label="primIntToChar (primMinusNat Zero Zero)",fontsize=16,color="black",shape="box"];20 -> 23[label="",style="solid", color="black", weight=3]; 21[label="error []",fontsize=16,color="red",shape="box"];22[label="primIntToChar (Pos (Succ vx3000))",fontsize=16,color="black",shape="box"];22 -> 24[label="",style="solid", color="black", weight=3]; 23[label="primIntToChar (Pos Zero)",fontsize=16,color="black",shape="box"];23 -> 25[label="",style="solid", color="black", weight=3]; 24[label="Char (Succ vx3000)",fontsize=16,color="green",shape="box"];25[label="Char Zero",fontsize=16,color="green",shape="box"];} ---------------------------------------- (8) YES