Haskell 2019-04-01 06.52 pair #433317001

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	9.88551 seconds
cpu usage	16.7763
user time	16.2407
system time	0.535601
max virtual memory	1.8285568E7
max residence set size	1445220.0

stage attributes

key	value
starexec-result	YES

output

14.48/6.65	YES
16.57/7.23	proof of /export/starexec/sandbox/benchmark/theBenchmark.hs
16.57/7.23	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
16.57/7.23	
16.57/7.23	
16.57/7.23	H-Termination with start terms of the given HASKELL could be proven:
16.57/7.23	
16.57/7.23	(0) HASKELL
16.57/7.23	(1) IFR [EQUIVALENT, 0 ms]
16.57/7.23	(2) HASKELL
16.57/7.23	(3) BR [EQUIVALENT, 0 ms]
16.57/7.23	(4) HASKELL
16.57/7.23	(5) COR [EQUIVALENT, 16 ms]
16.57/7.23	(6) HASKELL
16.57/7.23	(7) Narrow [SOUND, 0 ms]
16.57/7.23	(8) AND
16.57/7.23	    (9) QDP
16.57/7.23	        (10) QDPSizeChangeProof [EQUIVALENT, 0 ms]
16.57/7.23	        (11) YES
16.57/7.23	    (12) QDP
16.57/7.23	        (13) QDPSizeChangeProof [EQUIVALENT, 0 ms]
16.57/7.23	        (14) YES
16.57/7.23	    (15) QDP
16.57/7.23	        (16) QDPSizeChangeProof [EQUIVALENT, 0 ms]
16.57/7.23	        (17) YES
16.57/7.23	    (18) QDP
16.57/7.23	        (19) QDPSizeChangeProof [EQUIVALENT, 0 ms]
16.57/7.23	        (20) YES
16.57/7.23	    (21) QDP
16.57/7.23	        (22) QDPSizeChangeProof [EQUIVALENT, 0 ms]
16.57/7.23	        (23) YES
16.57/7.23	    (24) QDP
16.57/7.23	        (25) QDPSizeChangeProof [EQUIVALENT, 0 ms]
16.57/7.23	        (26) YES
16.57/7.23	
16.57/7.23	
16.57/7.23	----------------------------------------
16.57/7.23	
16.57/7.23	(0)
16.57/7.23	Obligation:
16.57/7.23	mainModule Main 
16.57/7.23	module Maybe where {
16.57/7.23	import qualified List;
16.57/7.23	import qualified Main;
16.57/7.23	import qualified Prelude;
16.57/7.23	}
16.57/7.23	module List where {
16.57/7.23	import qualified Main;
16.57/7.23	import qualified Maybe;
16.57/7.23	import qualified Prelude;
16.57/7.23	infix 5 \\;
16.57/7.23	(\\) :: Eq a => [a]  ->  [a]  ->  [a];
16.57/7.23	(\\) = foldl (flip delete);
16.57/7.23	
16.57/7.23	delete :: Eq a => a  ->  [a]  ->  [a];
16.57/7.23	delete = deleteBy (==);
16.57/7.23	
16.57/7.23	deleteBy :: (a  ->  a  ->  Bool)  ->  a  ->  [a]  ->  [a];
16.57/7.23	deleteBy _ _ [] = [];
16.57/7.23	deleteBy eq x (y : ys) =  if x `eq` y then ys else y : deleteBy eq x ys;
16.57/7.23	
16.57/7.23	}
16.57/7.23	module Main where {
16.57/7.23	import qualified List;
16.57/7.23	import qualified Maybe;
16.57/7.23	import qualified Prelude;
16.57/7.23	}
16.57/7.23	
16.57/7.23	----------------------------------------
16.57/7.23	
16.57/7.23	(1) IFR (EQUIVALENT)
16.57/7.23	If Reductions:
16.57/7.23	The following If expression
16.57/7.23	"if eq x y then ys else y : deleteBy eq x ys"
16.57/7.23	is transformed to
16.57/7.23	"deleteBy0 ys y eq x True = ys;
16.57/7.23	deleteBy0 ys y eq x False = y : deleteBy eq x ys;
16.57/7.23	"
16.57/7.23	
16.57/7.23	----------------------------------------
16.57/7.23	
16.57/7.23	(2)
16.57/7.23	Obligation:
16.57/7.23	mainModule Main 
16.57/7.23	module Maybe where {
16.57/7.23	import qualified List;
16.57/7.23	import qualified Main;
16.57/7.23	import qualified Prelude;
16.57/7.23	}
16.57/7.23	module List where {
16.57/7.23	import qualified Main;
16.57/7.23	import qualified Maybe;
16.57/7.23	import qualified Prelude;
16.57/7.23	infix 5 \\;
16.57/7.23	(\\) :: Eq a => [a]  ->  [a]  ->  [a];
16.57/7.23	(\\) = foldl (flip delete);
16.57/7.23	
16.57/7.23	delete :: Eq a => a  ->  [a]  ->  [a];
16.57/7.23	delete = deleteBy (==);
16.57/7.23

popout

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

job log

popout

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