Haskell 2019-04-01 06.52 pair #433317413

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.1589 seconds
cpu usage	9.64446
user time	9.33202
system time	0.312446
max virtual memory	1.8288448E7
max residence set size	595976.0

stage attributes

key	value
starexec-result	NO

output

7.88/3.60	NO
9.49/4.06	proof of /export/starexec/sandbox/benchmark/theBenchmark.hs
9.49/4.06	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
9.49/4.06	
9.49/4.06	
9.49/4.06	H-Termination with start terms of the given HASKELL could be disproven:
9.49/4.06	
9.49/4.06	(0) HASKELL
9.49/4.06	(1) BR [EQUIVALENT, 0 ms]
9.49/4.06	(2) HASKELL
9.49/4.06	(3) COR [EQUIVALENT, 0 ms]
9.49/4.06	(4) HASKELL
9.49/4.06	(5) Narrow [COMPLETE, 0 ms]
9.49/4.06	(6) QDP
9.49/4.06	(7) NonTerminationLoopProof [COMPLETE, 0 ms]
9.49/4.06	(8) NO
9.49/4.06	
9.49/4.06	
9.49/4.06	----------------------------------------
9.49/4.06	
9.49/4.06	(0)
9.49/4.06	Obligation:
9.49/4.06	mainModule Main 
9.49/4.06	module Main where {
9.49/4.06	import qualified Prelude;
9.49/4.06	data MyInt = Pos Main.Nat  | Neg Main.Nat ;
9.49/4.06	
9.49/4.06	data Main.Nat = Succ Main.Nat  | Zero ;
9.49/4.06	
9.49/4.06	minBoundMyInt :: MyInt;
9.49/4.06	minBoundMyInt = primMinInt;
9.49/4.06	
9.49/4.06	primMinInt :: MyInt;
9.49/4.06	primMinInt = primMinInt;
9.49/4.06	
9.49/4.06	}
9.49/4.06	
9.49/4.06	----------------------------------------
9.49/4.06	
9.49/4.06	(1) BR (EQUIVALENT)
9.49/4.06	Replaced joker patterns by fresh variables and removed binding patterns.
9.49/4.06	----------------------------------------
9.49/4.06	
9.49/4.06	(2)
9.49/4.06	Obligation:
9.49/4.06	mainModule Main 
9.49/4.06	module Main where {
9.49/4.06	import qualified Prelude;
9.49/4.06	data MyInt = Pos Main.Nat  | Neg Main.Nat ;
9.49/4.06	
9.49/4.06	data Main.Nat = Succ Main.Nat  | Zero ;
9.49/4.06	
9.49/4.06	minBoundMyInt :: MyInt;
9.49/4.06	minBoundMyInt = primMinInt;
9.49/4.06	
9.49/4.06	primMinInt :: MyInt;
9.49/4.06	primMinInt = primMinInt;
9.49/4.06	
9.49/4.06	}
9.49/4.06	
9.49/4.06	----------------------------------------
9.49/4.06	
9.49/4.06	(3) COR (EQUIVALENT)
9.49/4.06	Cond Reductions:
9.49/4.06	The following Function with conditions
9.49/4.06	"undefined |Falseundefined;
9.49/4.06	"
9.49/4.06	is transformed to
9.49/4.06	"undefined  = undefined1;
9.49/4.06	"
9.49/4.06	"undefined0 True = undefined;
9.49/4.06	"
9.49/4.06	"undefined1  = undefined0 False;
9.49/4.06	"
9.49/4.06	
9.49/4.06	----------------------------------------
9.49/4.06	
9.49/4.06	(4)
9.49/4.06	Obligation:
9.49/4.06	mainModule Main 
9.49/4.06	module Main where {
9.49/4.06	import qualified Prelude;
9.49/4.06	data MyInt = Pos Main.Nat  | Neg Main.Nat ;
9.49/4.06	
9.49/4.06	data Main.Nat = Succ Main.Nat  | Zero ;
9.49/4.06	
9.49/4.06	minBoundMyInt :: MyInt;
9.49/4.06	minBoundMyInt = primMinInt;
9.49/4.06	
9.49/4.06	primMinInt :: MyInt;
9.49/4.06	primMinInt = primMinInt;
9.49/4.06	
9.49/4.06	}
9.49/4.06	
9.49/4.06	----------------------------------------
9.49/4.06	
9.49/4.06	(5) Narrow (COMPLETE)
9.49/4.06	Haskell To QDPs
9.49/4.06	
9.49/4.06	digraph dp_graph {

popout

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

job log

popout

actions all output return to Haskell 2019-04-01 06.52