Haskell 2019-04-01 06.52 pair #433316946

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	9.93523 seconds
cpu usage	15.8501
user time	15.3991
system time	0.450974
max virtual memory	1.8285568E7
max residence set size	969956.0

stage attributes

key	value
starexec-result	YES

output

12.93/5.93	YES
15.53/6.67	proof of /export/starexec/sandbox/benchmark/theBenchmark.hs
15.53/6.67	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
15.53/6.67	
15.53/6.67	
15.53/6.67	H-Termination with start terms of the given HASKELL could be proven:
15.53/6.67	
15.53/6.67	(0) HASKELL
15.53/6.67	(1) LR [EQUIVALENT, 0 ms]
15.53/6.67	(2) HASKELL
15.53/6.67	(3) CR [EQUIVALENT, 0 ms]
15.53/6.67	(4) HASKELL
15.53/6.67	(5) IFR [EQUIVALENT, 0 ms]
15.53/6.67	(6) HASKELL
15.53/6.67	(7) BR [EQUIVALENT, 0 ms]
15.53/6.67	(8) HASKELL
15.53/6.67	(9) COR [EQUIVALENT, 6 ms]
15.53/6.67	(10) HASKELL
15.53/6.67	(11) NumRed [SOUND, 0 ms]
15.53/6.67	(12) HASKELL
15.53/6.67	(13) Narrow [SOUND, 0 ms]
15.53/6.67	(14) AND
15.53/6.67	    (15) QDP
15.53/6.67	        (16) QDPSizeChangeProof [EQUIVALENT, 0 ms]
15.53/6.67	        (17) YES
15.53/6.67	    (18) QDP
15.53/6.67	        (19) TransformationProof [EQUIVALENT, 0 ms]
15.53/6.67	        (20) QDP
15.53/6.67	        (21) QDPSizeChangeProof [EQUIVALENT, 0 ms]
15.53/6.67	        (22) YES
15.53/6.67	    (23) QDP
15.53/6.67	        (24) QDPSizeChangeProof [EQUIVALENT, 0 ms]
15.53/6.67	        (25) YES
15.53/6.67	    (26) QDP
15.53/6.67	        (27) TransformationProof [EQUIVALENT, 0 ms]
15.53/6.67	        (28) QDP
15.53/6.67	        (29) QDPSizeChangeProof [EQUIVALENT, 0 ms]
15.53/6.67	        (30) YES
15.53/6.67	
15.53/6.67	
15.53/6.67	----------------------------------------
15.53/6.67	
15.53/6.67	(0)
15.53/6.67	Obligation:
15.53/6.67	mainModule Main 
15.53/6.67	module Maybe where {
15.53/6.67	import qualified List;
15.53/6.67	import qualified Main;
15.53/6.67	import qualified Prelude;
15.53/6.67	listToMaybe :: [a]  ->  Maybe a;
15.53/6.67	listToMaybe [] = Nothing;
15.53/6.67	listToMaybe (a : _) = Just a;
15.53/6.67	
15.53/6.67	}
15.53/6.67	module List where {
15.53/6.67	import qualified Main;
15.53/6.67	import qualified Maybe;
15.53/6.67	import qualified Prelude;
15.53/6.67	elemIndex :: Eq a => a  ->  [a]  ->  Maybe Int;
15.53/6.67	elemIndex x = findIndex (== x);
15.53/6.67	
15.53/6.67	findIndex :: (a  ->  Bool)  ->  [a]  ->  Maybe Int;
15.53/6.67	findIndex p = Maybe.listToMaybe . findIndices p;
15.53/6.67	
15.53/6.67	findIndices :: (a  ->  Bool)  ->  [a]  ->  [Int];
15.53/6.67	findIndices p xs = concatMap (\vv1 ->case vv1 of { 
15.53/6.67	(x,i)->  if p x then i : [] else []; 
15.53/6.67	_-> []; 
15.53/6.67	 } ) (zip xs (enumFrom 0));
15.53/6.67	
15.53/6.67	}
15.53/6.67	module Main where {
15.53/6.67	import qualified List;
15.53/6.67	import qualified Maybe;
15.53/6.67	import qualified Prelude;
15.53/6.67	}
15.53/6.67	
15.53/6.67	----------------------------------------
15.53/6.67	
15.53/6.67	(1) LR (EQUIVALENT)
15.53/6.67	Lambda Reductions:
15.53/6.67	The following Lambda expression
15.53/6.67	"\ab->(a,b)"
15.53/6.67	is transformed to
15.53/6.67	"zip0 a b = (a,b);
15.53/6.67	"
15.53/6.67	The following Lambda expression
15.53/6.67	"\vv1->case vv1 of {
15.53/6.67	(x,i)  -> if p x then i : [] else [];
15.53/6.67	_  -> []}
15.53/6.67	"
15.53/6.67	is transformed to
15.53/6.67	"findIndices0 p vv1 = case vv1 of {
15.53/6.67	(x,i)  -> if p x then i : [] else [];
15.53/6.67	_  -> []}
15.53/6.67	;
15.53/6.67	"
15.53/6.67	
15.53/6.67	----------------------------------------
15.53/6.67

popout

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

job log

popout

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