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


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

(0)
Obligation:
mainModule Main 
module Main where {
import qualified Prelude;
data MyInt = Pos Main.Nat  | Neg Main.Nat ;

data Main.Nat = Succ Main.Nat  | Zero ;

succMyInt :: MyInt  ->  MyInt;
succMyInt (Main.Pos Main.Zero) = Main.Pos (Main.Succ Main.Zero);
succMyInt (Main.Neg Main.Zero) = Main.Pos (Main.Succ Main.Zero);
succMyInt (Main.Pos (Main.Succ x)) = Main.Pos (Main.Succ (Main.Succ x));
succMyInt (Main.Neg (Main.Succ x)) = Main.Neg x;

}

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

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

(2)
Obligation:
mainModule Main 
module Main where {
import qualified Prelude;
data MyInt = Pos Main.Nat  | Neg Main.Nat ;

data Main.Nat = Succ Main.Nat  | Zero ;

succMyInt :: MyInt  ->  MyInt;
succMyInt (Main.Pos Main.Zero) = Main.Pos (Main.Succ Main.Zero);
succMyInt (Main.Neg Main.Zero) = Main.Pos (Main.Succ Main.Zero);
succMyInt (Main.Pos (Main.Succ x)) = Main.Pos (Main.Succ (Main.Succ x));
succMyInt (Main.Neg (Main.Succ x)) = Main.Neg x;

}

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

(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;
data MyInt = Pos Main.Nat  | Neg Main.Nat ;

data Main.Nat = Succ Main.Nat  | Zero ;

succMyInt :: MyInt  ->  MyInt;
succMyInt (Main.Pos Main.Zero) = Main.Pos (Main.Succ Main.Zero);
succMyInt (Main.Neg Main.Zero) = Main.Pos (Main.Succ Main.Zero);
succMyInt (Main.Pos (Main.Succ x)) = Main.Pos (Main.Succ (Main.Succ x));
succMyInt (Main.Neg (Main.Succ x)) = Main.Neg x;

}

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

(5) Narrow (EQUIVALENT)
Haskell To QDPs

digraph dp_graph {
node [outthreshold=100, inthreshold=100];1[label="succMyInt",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3];
3[label="succMyInt vx3",fontsize=16,color="burlywood",shape="triangle"];14[label="vx3/Pos vx30",fontsize=10,color="white",style="solid",shape="box"];3 -> 14[label="",style="solid", color="burlywood", weight=9];
14 -> 4[label="",style="solid", color="burlywood", weight=3];
15[label="vx3/Neg vx30",fontsize=10,color="white",style="solid",shape="box"];3 -> 15[label="",style="solid", color="burlywood", weight=9];
15 -> 5[label="",style="solid", color="burlywood", weight=3];
4[label="succMyInt (Pos vx30)",fontsize=16,color="burlywood",shape="box"];16[label="vx30/Succ vx300",fontsize=10,color="white",style="solid",shape="box"];4 -> 16[label="",style="solid", color="burlywood", weight=9];
16 -> 6[label="",style="solid", color="burlywood", weight=3];
17[label="vx30/Zero",fontsize=10,color="white",style="solid",shape="box"];4 -> 17[label="",style="solid", color="burlywood", weight=9];
17 -> 7[label="",style="solid", color="burlywood", weight=3];
5[label="succMyInt (Neg vx30)",fontsize=16,color="burlywood",shape="box"];18[label="vx30/Succ vx300",fontsize=10,color="white",style="solid",shape="box"];5 -> 18[label="",style="solid", color="burlywood", weight=9];
18 -> 8[label="",style="solid", color="burlywood", weight=3];
19[label="vx30/Zero",fontsize=10,color="white",style="solid",shape="box"];5 -> 19[label="",style="solid", color="burlywood", weight=9];
19 -> 9[label="",style="solid", color="burlywood", weight=3];
6[label="succMyInt (Pos (Succ vx300))",fontsize=16,color="black",shape="box"];6 -> 10[label="",style="solid", color="black", weight=3];
7[label="succMyInt (Pos Zero)",fontsize=16,color="black",shape="box"];7 -> 11[label="",style="solid", color="black", weight=3];
8[label="succMyInt (Neg (Succ vx300))",fontsize=16,color="black",shape="box"];8 -> 12[label="",style="solid", color="black", weight=3];
9[label="succMyInt (Neg Zero)",fontsize=16,color="black",shape="box"];9 -> 13[label="",style="solid", color="black", weight=3];
10[label="Pos (Succ (Succ vx300))",fontsize=16,color="green",shape="box"];11[label="Pos (Succ Zero)",fontsize=16,color="green",shape="box"];12[label="Neg vx300",fontsize=16,color="green",shape="box"];13[label="Pos (Succ Zero)",fontsize=16,color="green",shape="box"];}

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

(6)
YES