Haskell pair #487598354

details

property	value
status	complete
benchmark	enumFrom_1.hs
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n076.star.cs.uiowa.edu
space	basic_haskell

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	3.9153380394 seconds
cpu usage	9.410098821
max memory	5.81443584E8

stage attributes

key	value
output-size	2538
starexec-result	YES

output

/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) Narrow [EQUIVALENT, 0 ms]
(6) YES


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

(0)
Obligation:
mainModule Main 
module Main where {
import qualified Prelude;
data List a = Cons a (List a)  | Nil ;

data Tup0 = Tup0 ;

enumFromTup0 :: Tup0  ->  List Tup0;
enumFromTup0 Tup0 = Cons Tup0 Nil;

}

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

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

(2)
Obligation:
mainModule Main 
module Main where {
import qualified Prelude;
data List a = Cons a (List a)  | Nil ;

data Tup0 = Tup0 ;

enumFromTup0 :: Tup0  ->  List Tup0;
enumFromTup0 Tup0 = Cons Tup0 Nil;

}

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

(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 List a = Cons a (List a)  | Nil ;

data Tup0 = Tup0 ;

enumFromTup0 :: Tup0  ->  List Tup0;
enumFromTup0 Tup0 = Cons Tup0 Nil;

}

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

(5) Narrow (EQUIVALENT)
Haskell To QDPs

digraph dp_graph {
node [outthreshold=100, inthreshold=100];1[label="enumFromTup0",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3];
3[label="enumFromTup0 vx3",fontsize=16,color="burlywood",shape="triangle"];6[label="vx3/Tup0",fontsize=10,color="white",style="solid",shape="box"];3 -> 6[label="",style="solid", color="burlywood", weight=9];
6 -> 4[label="",style="solid", color="burlywood", weight=3];
4[label="enumFromTup0 Tup0",fontsize=16,color="black",shape="box"];4 -> 5[label="",style="solid", color="black", weight=3];
5[label="Cons Tup0 Nil",fontsize=16,color="green",shape="box"];}

popout

output may be truncated. 'popout' for the full output.

job log

popout

actions all output return to Haskell