Haskell 2019-04-01 06.52 pair #433316095

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	6.26382 seconds
cpu usage	17.0655
user time	16.5768
system time	0.488777
max virtual memory	1.8285568E7
max residence set size	1201620.0

stage attributes

key	value
starexec-result	YES

output

14.84/5.63	YES
16.91/6.21	proof of /export/starexec/sandbox/benchmark/theBenchmark.hs
16.91/6.21	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
16.91/6.21	
16.91/6.21	
16.91/6.21	H-Termination with start terms of the given HASKELL could be proven:
16.91/6.21	
16.91/6.21	(0) HASKELL
16.91/6.21	(1) BR [EQUIVALENT, 0 ms]
16.91/6.21	(2) HASKELL
16.91/6.21	(3) COR [EQUIVALENT, 14 ms]
16.91/6.21	(4) HASKELL
16.91/6.21	(5) LetRed [EQUIVALENT, 0 ms]
16.91/6.21	(6) HASKELL
16.91/6.21	(7) Narrow [SOUND, 0 ms]
16.91/6.21	(8) AND
16.91/6.21	    (9) QDP
16.91/6.21	        (10) QDPSizeChangeProof [EQUIVALENT, 0 ms]
16.91/6.21	        (11) YES
16.91/6.21	    (12) QDP
16.91/6.21	        (13) QDPSizeChangeProof [EQUIVALENT, 0 ms]
16.91/6.21	        (14) YES
16.91/6.21	    (15) QDP
16.91/6.21	        (16) QDPSizeChangeProof [EQUIVALENT, 0 ms]
16.91/6.21	        (17) YES
16.91/6.21	    (18) QDP
16.91/6.21	        (19) QDPSizeChangeProof [EQUIVALENT, 0 ms]
16.91/6.21	        (20) YES
16.91/6.21	    (21) QDP
16.91/6.21	        (22) QDPSizeChangeProof [EQUIVALENT, 0 ms]
16.91/6.21	        (23) YES
16.91/6.21	
16.91/6.21	
16.91/6.21	----------------------------------------
16.91/6.21	
16.91/6.21	(0)
16.91/6.21	Obligation:
16.91/6.21	mainModule Main 
16.91/6.21	module Maybe where {
16.91/6.21	import qualified List;
16.91/6.21	import qualified Main;
16.91/6.21	import qualified Prelude;
16.91/6.21	}
16.91/6.21	module List where {
16.91/6.21	import qualified Main;
16.91/6.21	import qualified Maybe;
16.91/6.21	import qualified Prelude;
16.91/6.21	nub :: Eq a => [a]  ->  [a];
16.91/6.21	nub l = nub' l [] where { 
16.91/6.21	nub' [] _ = [];
16.91/6.21	nub' (x : xs) ls  | x `elem` ls = nub' xs ls
16.91/6.21	 | otherwise = x : nub' xs (x : ls);
16.91/6.21	 };
16.91/6.21	
16.91/6.21	}
16.91/6.21	module Main where {
16.91/6.21	import qualified List;
16.91/6.21	import qualified Maybe;
16.91/6.21	import qualified Prelude;
16.91/6.21	}
16.91/6.21	
16.91/6.21	----------------------------------------
16.91/6.21	
16.91/6.21	(1) BR (EQUIVALENT)
16.91/6.21	Replaced joker patterns by fresh variables and removed binding patterns.
16.91/6.21	----------------------------------------
16.91/6.21	
16.91/6.21	(2)
16.91/6.21	Obligation:
16.91/6.21	mainModule Main 
16.91/6.21	module Maybe where {
16.91/6.21	import qualified List;
16.91/6.21	import qualified Main;
16.91/6.21	import qualified Prelude;
16.91/6.21	}
16.91/6.21	module List where {
16.91/6.21	import qualified Main;
16.91/6.21	import qualified Maybe;
16.91/6.21	import qualified Prelude;
16.91/6.21	nub :: Eq a => [a]  ->  [a];
16.91/6.21	nub l = nub' l [] where { 
16.91/6.21	nub' [] xw = [];
16.91/6.21	nub' (x : xs) ls  | x `elem` ls = nub' xs ls
16.91/6.21	 | otherwise = x : nub' xs (x : ls);
16.91/6.21	 };
16.91/6.21	
16.91/6.21	}
16.91/6.21	module Main where {
16.91/6.21	import qualified List;
16.91/6.21	import qualified Maybe;
16.91/6.21	import qualified Prelude;
16.91/6.21	}
16.91/6.21	
16.91/6.21	----------------------------------------
16.91/6.21	
16.91/6.21	(3) COR (EQUIVALENT)
16.91/6.21	Cond Reductions:
16.91/6.21	The following Function with conditions
16.91/6.21	"undefined |Falseundefined;
16.91/6.21	"

popout

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

job log

popout

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