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


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


YES
proof of /export/starexec/sandbox2/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, 2 ms]
(6) HASKELL
(7) Narrow [EQUIVALENT, 0 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;
"
The following Function with conditions
"toEnum 0 = ();
"
is transformed to
"toEnum vz = toEnum1 vz;
"
"toEnum0 True vz = ();
"
"toEnum1 vz = toEnum0 (vz == 0) vz;
"

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

(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="succ",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3];
3[label="succ wu3",fontsize=16,color="black",shape="triangle"];3 -> 4[label="",style="solid", color="black", weight=3];
4[label="toEnum . (Pos (Succ Zero) +) . fromEnum",fontsize=16,color="black",shape="box"];4 -> 5[label="",style="solid", color="black", weight=3];
5[label="toEnum ((Pos (Succ Zero) +) . fromEnum)",fontsize=16,color="black",shape="box"];5 -> 6[label="",style="solid", color="black", weight=3];
6[label="toEnum1 ((Pos (Succ Zero) +) . fromEnum)",fontsize=16,color="black",shape="box"];6 -> 7[label="",style="solid", color="black", weight=3];
7[label="toEnum0 ((Pos (Succ Zero) +) . fromEnum == Pos Zero) ((Pos (Succ Zero) +) . fromEnum)",fontsize=16,color="black",shape="box"];7 -> 8[label="",style="solid", color="black", weight=3];
8[label="toEnum0 (primEqInt ((Pos (Succ Zero) +) . fromEnum) (Pos Zero)) ((Pos (Succ Zero) +) . fromEnum)",fontsize=16,color="black",shape="box"];8 -> 9[label="",style="solid", color="black", weight=3];
9[label="toEnum0 (primEqInt (Pos (Succ Zero) + fromEnum wu3) (Pos Zero)) (Pos (Succ Zero) + fromEnum wu3)",fontsize=16,color="black",shape="box"];9 -> 10[label="",style="solid", color="black", weight=3];
10[label="toEnum0 (primEqInt (primPlusInt (Pos (Succ Zero)) (fromEnum wu3)) (Pos Zero)) (primPlusInt (Pos (Succ Zero)) (fromEnum wu3))",fontsize=16,color="burlywood",shape="box"];17[label="wu3/()",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="toEnum0 (primEqInt (primPlusInt (Pos (Succ Zero)) (fromEnum ())) (Pos Zero)) (primPlusInt (Pos (Succ Zero)) (fromEnum ()))",fontsize=16,color="black",shape="box"];11 -> 12[label="",style="solid", color="black", weight=3];
12[label="toEnum0 (primEqInt (primPlusInt (Pos (Succ Zero)) (Pos Zero)) (Pos Zero)) (primPlusInt (Pos (Succ Zero)) (Pos Zero))",fontsize=16,color="black",shape="box"];12 -> 13[label="",style="solid", color="black", weight=3];
13[label="toEnum0 (primEqInt (Pos (primPlusNat (Succ Zero) Zero)) (Pos Zero)) (Pos (primPlusNat (Succ Zero) Zero))",fontsize=16,color="black",shape="box"];13 -> 14[label="",style="solid", color="black", weight=3];
14[label="toEnum0 (primEqInt (Pos (Succ Zero)) (Pos Zero)) (Pos (Succ Zero))",fontsize=16,color="black",shape="box"];14 -> 15[label="",style="solid", color="black", weight=3];
15[label="toEnum0 False (Pos (Succ Zero))",fontsize=16,color="black",shape="box"];15 -> 16[label="",style="solid", color="black", weight=3];
16[label="error []",fontsize=16,color="red",shape="box"];}

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

(8)
YES