Haskell 2019-04-01 06.52 pair #433317354

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.20854 seconds
cpu usage	10.1818
user time	9.85597
system time	0.325853
max virtual memory	1.828848E7
max residence set size	619120.0

stage attributes

key	value
starexec-result	NO

output

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