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


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


NO
proof of /export/starexec/sandbox2/benchmark/theBenchmark.hs
# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


H-Termination with start terms of the given HASKELL could be disproven:

(0) HASKELL
(1) BR [EQUIVALENT, 0 ms]
(2) HASKELL
(3) COR [EQUIVALENT, 0 ms]
(4) HASKELL
(5) Narrow [COMPLETE, 0 ms]
(6) QDP
(7) NonTerminationLoopProof [COMPLETE, 0 ms]
(8) NO


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

(0)
Obligation:
mainModule Main 
module Main where {
import qualified Prelude;
data Main.Char = Char MyInt ;

data Main.HugsException = HugsException ;

data Main.IO a = IO ((Main.IOError  ->  Main.IOResult)  ->  (a  ->  Main.IOResult)  ->  Main.IOResult) ;

data Main.IOError = IOError Main.IOErrorKind (List Main.Char) (List Main.Char) (Main.Maybe (List Main.Char)) ;

data Main.IOErrorKind = Junk ;

data Main.IOResult = Hugs_ExitWith MyInt  | Hugs_Error Main.IOError  | Hugs_Catch Main.IOResult (Main.HugsException  ->  Main.IOResult) (Main.IOError  ->  Main.IOResult) (Main.Obj  ->  Main.IOResult)  | Hugs_ForkThread Main.IOResult Main.IOResult  | Hugs_DeadThread  | Hugs_YieldThread Main.IOResult  | Hugs_Return Main.Obj  | Hugs_BlockThread (Main.Obj  ->  Main.IOResult) ((Main.Obj  ->  Main.IOResult)  ->  Main.IOResult) ;

data List a = Cons a (List a)  | Nil ;

data Main.Maybe a = Nothing  | Just a ;

data MyInt = Pos Main.Nat  | Neg Main.Nat ;

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

data Main.Obj = Obj ;

data Tup0 = Tup0 ;

blockIO :: ((a  ->  Main.IOResult)  ->  Main.IO Tup0)  ->  Main.IO a;
blockIO m = Main.IO (blockIOBlockIO0 m);

blockIOBlockIO0 vw f s = Main.Hugs_BlockThread (pt s fromObj) (blockIOM' vw);

blockIOM' vw k = threadToIOResult (vw (pt k toObj));

const :: a  ->  b  ->  a;
const k vv = k;

fromObj :: Main.Obj  ->  a;
fromObj = fromObj;

pt :: (b  ->  a)  ->  (c  ->  b)  ->  c  ->  a;
pt f g x = f (g x);

threadToIOResult :: Main.IO a  ->  Main.IOResult;
threadToIOResult (Main.IO m) = m Main.Hugs_Error (const Main.Hugs_DeadThread);

toObj :: a  ->  Main.Obj;
toObj = toObj;

}

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

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

(2)
Obligation:
mainModule Main 
module Main where {
import qualified Prelude;
data Main.Char = Char MyInt ;

data Main.HugsException = HugsException ;

data Main.IO a = IO ((Main.IOError  ->  Main.IOResult)  ->  (a  ->  Main.IOResult)  ->  Main.IOResult) ;

data Main.IOError = IOError Main.IOErrorKind (List Main.Char) (List Main.Char) (Main.Maybe (List Main.Char)) ;

data Main.IOErrorKind = Junk ;

data Main.IOResult = Hugs_ExitWith MyInt  | Hugs_Error Main.IOError  | Hugs_Catch Main.IOResult (Main.HugsException  ->  Main.IOResult) (Main.IOError  ->  Main.IOResult) (Main.Obj  ->  Main.IOResult)  | Hugs_ForkThread Main.IOResult Main.IOResult  | Hugs_DeadThread  | Hugs_YieldThread Main.IOResult  | Hugs_Return Main.Obj  | Hugs_BlockThread (Main.Obj  ->  Main.IOResult) ((Main.Obj  ->  Main.IOResult)  ->  Main.IOResult) ;

data List a = Cons a (List a)  | Nil ;

data Main.Maybe a = Nothing  | Just a ;

data MyInt = Pos Main.Nat  | Neg Main.Nat ;

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

data Main.Obj = Obj ;

data Tup0 = Tup0 ;

blockIO :: ((a  ->  Main.IOResult)  ->  Main.IO Tup0)  ->  Main.IO a;
blockIO m = Main.IO (blockIOBlockIO0 m);

blockIOBlockIO0 vw f s = Main.Hugs_BlockThread (pt s fromObj) (blockIOM' vw);

blockIOM' vw k = threadToIOResult (vw (pt k toObj));

const :: a  ->  b  ->  a;
const k vv = k;

fromObj :: Main.Obj  ->  a;
fromObj = fromObj;

pt :: (a  ->  b)  ->  (c  ->  a)  ->  c  ->  b;
pt f g x = f (g x);

threadToIOResult :: Main.IO a  ->  Main.IOResult;
threadToIOResult (Main.IO m) = m Main.Hugs_Error (const Main.Hugs_DeadThread);

toObj :: a  ->  Main.Obj;
toObj = toObj;

}

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

(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 Main.Char = Char MyInt ;

data Main.HugsException = HugsException ;

data Main.IO a = IO ((Main.IOError  ->  Main.IOResult)  ->  (a  ->  Main.IOResult)  ->  Main.IOResult) ;

data Main.IOError = IOError Main.IOErrorKind (List Main.Char) (List Main.Char) (Main.Maybe (List Main.Char)) ;

data Main.IOErrorKind = Junk ;

data Main.IOResult = Hugs_ExitWith MyInt  | Hugs_Error Main.IOError  | Hugs_Catch Main.IOResult (Main.HugsException  ->  Main.IOResult) (Main.IOError  ->  Main.IOResult) (Main.Obj  ->  Main.IOResult)  | Hugs_ForkThread Main.IOResult Main.IOResult  | Hugs_DeadThread  | Hugs_YieldThread Main.IOResult  | Hugs_Return Main.Obj  | Hugs_BlockThread (Main.Obj  ->  Main.IOResult) ((Main.Obj  ->  Main.IOResult)  ->  Main.IOResult) ;

data List a = Cons a (List a)  | Nil ;

data Main.Maybe a = Nothing  | Just a ;

data MyInt = Pos Main.Nat  | Neg Main.Nat ;

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

data Main.Obj = Obj ;

data Tup0 = Tup0 ;

blockIO :: ((a  ->  Main.IOResult)  ->  Main.IO Tup0)  ->  Main.IO a;
blockIO m = Main.IO (blockIOBlockIO0 m);

blockIOBlockIO0 vw f s = Main.Hugs_BlockThread (pt s fromObj) (blockIOM' vw);

blockIOM' vw k = threadToIOResult (vw (pt k toObj));

const :: b  ->  a  ->  b;
const k vv = k;

fromObj :: Main.Obj  ->  a;
fromObj = fromObj;

pt :: (b  ->  a)  ->  (c  ->  b)  ->  c  ->  a;
pt f g x = f (g x);

threadToIOResult :: Main.IO a  ->  Main.IOResult;
threadToIOResult (Main.IO m) = m Main.Hugs_Error (const Main.Hugs_DeadThread);

toObj :: a  ->  Main.Obj;
toObj = toObj;

}

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

(5) Narrow (COMPLETE)
Haskell To QDPs

digraph dp_graph {
node [outthreshold=100, inthreshold=100];1[label="blockIO",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3];
3[label="blockIO vz3",fontsize=16,color="black",shape="triangle"];3 -> 4[label="",style="solid", color="black", weight=3];
4[label="IO (blockIOBlockIO0 vz3)",fontsize=16,color="green",shape="box"];4 -> 5[label="",style="dashed", color="green", weight=3];
5[label="blockIOBlockIO0 vz3",fontsize=16,color="grey",shape="box"];5 -> 6[label="",style="dashed", color="grey", weight=3];
6[label="blockIOBlockIO0 vz3 vz4",fontsize=16,color="grey",shape="box"];6 -> 7[label="",style="dashed", color="grey", weight=3];
7[label="blockIOBlockIO0 vz3 vz4 vz5",fontsize=16,color="black",shape="triangle"];7 -> 8[label="",style="solid", color="black", weight=3];
8[label="Hugs_BlockThread (pt vz5 fromObj) (blockIOM' vz3)",fontsize=16,color="green",shape="box"];8 -> 9[label="",style="dashed", color="green", weight=3];
8 -> 10[label="",style="dashed", color="green", weight=3];
9[label="pt vz5 fromObj",fontsize=16,color="grey",shape="box"];9 -> 11[label="",style="dashed", color="grey", weight=3];
10[label="blockIOM' vz3",fontsize=16,color="grey",shape="box"];10 -> 12[label="",style="dashed", color="grey", weight=3];
11[label="pt vz5 fromObj vz6",fontsize=16,color="black",shape="triangle"];11 -> 13[label="",style="solid", color="black", weight=3];
12[label="blockIOM' vz3 vz7",fontsize=16,color="black",shape="triangle"];12 -> 14[label="",style="solid", color="black", weight=3];
13[label="vz5 (fromObj vz6)",fontsize=16,color="green",shape="box"];13 -> 15[label="",style="dashed", color="green", weight=3];
14 -> 16[label="",style="dashed", color="red", weight=0];
14[label="threadToIOResult (vz3 (pt vz7 toObj))",fontsize=16,color="magenta"];14 -> 17[label="",style="dashed", color="magenta", weight=3];
15[label="fromObj vz6",fontsize=16,color="black",shape="triangle"];15 -> 18[label="",style="solid", color="black", weight=3];
17[label="vz3 (pt vz7 toObj)",fontsize=16,color="green",shape="box"];17 -> 21[label="",style="dashed", color="green", weight=3];
16[label="threadToIOResult vz8",fontsize=16,color="burlywood",shape="triangle"];33[label="vz8/IO vz80",fontsize=10,color="white",style="solid",shape="box"];16 -> 33[label="",style="solid", color="burlywood", weight=9];
33 -> 20[label="",style="solid", color="burlywood", weight=3];
18 -> 15[label="",style="dashed", color="red", weight=0];
18[label="fromObj vz6",fontsize=16,color="magenta"];21[label="pt vz7 toObj",fontsize=16,color="grey",shape="box"];21 -> 24[label="",style="dashed", color="grey", weight=3];
20[label="threadToIOResult (IO vz80)",fontsize=16,color="black",shape="box"];20 -> 23[label="",style="solid", color="black", weight=3];
24 -> 22[label="",style="dashed", color="red", weight=0];
24[label="pt vz7 toObj vz10",fontsize=16,color="magenta"];24 -> 28[label="",style="dashed", color="magenta", weight=3];
23[label="vz80 Hugs_Error (const Hugs_DeadThread)",fontsize=16,color="green",shape="box"];23 -> 26[label="",style="dashed", color="green", weight=3];
23 -> 27[label="",style="dashed", color="green", weight=3];
28[label="vz10",fontsize=16,color="green",shape="box"];22[label="pt vz7 toObj vz9",fontsize=16,color="black",shape="triangle"];22 -> 25[label="",style="solid", color="black", weight=3];
26[label="Hugs_Error",fontsize=16,color="green",shape="box"];27[label="const Hugs_DeadThread",fontsize=16,color="grey",shape="box"];27 -> 30[label="",style="dashed", color="grey", weight=3];
25[label="vz7 (toObj vz9)",fontsize=16,color="green",shape="box"];25 -> 29[label="",style="dashed", color="green", weight=3];
30[label="const Hugs_DeadThread vz11",fontsize=16,color="black",shape="triangle"];30 -> 32[label="",style="solid", color="black", weight=3];
29[label="toObj vz9",fontsize=16,color="black",shape="triangle"];29 -> 31[label="",style="solid", color="black", weight=3];
32[label="Hugs_DeadThread",fontsize=16,color="green",shape="box"];31 -> 29[label="",style="dashed", color="red", weight=0];
31[label="toObj vz9",fontsize=16,color="magenta"];}

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

(6)
Obligation:
Q DP problem:
The TRS P consists of the following rules:

   new_fromObj(vz6, h, []) -> new_fromObj(vz6, h, [])

R is empty.
Q is empty.
We have to consider all (P,Q,R)-chains.
----------------------------------------

(7) NonTerminationLoopProof (COMPLETE)
We used the non-termination processor [FROCOS05] to show that the DP problem is infinite.
Found a loop by semiunifying a rule from P directly.

s = new_fromObj(vz6, h, []) evaluates to  t =new_fromObj(vz6, h, [])

Thus s starts an infinite chain as s semiunifies with t with the following substitutions:
* Matcher: [ ]
* Semiunifier: [ ]

--------------------------------------------------------------------------------
Rewriting sequence

The DP semiunifies directly so there is only one rewrite step from new_fromObj(vz6, h, []) to new_fromObj(vz6, h, []).




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

(8)
NO