details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	7.57139 seconds
cpu usage	21.0898
user time	20.4874
system time	0.602388
max virtual memory	1.8285568E7
max residence set size	1573720.0

stage attributes

key	value
starexec-result	YES

output

17.90/6.73 YES 20.81/7.50 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 20.81/7.50 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 20.81/7.50 20.81/7.50 20.81/7.50 H-Termination with start terms of the given HASKELL could be proven: 20.81/7.50 20.81/7.50 (0) HASKELL 20.81/7.50 (1) LR [EQUIVALENT, 0 ms] 20.81/7.50 (2) HASKELL 20.81/7.50 (3) CR [EQUIVALENT, 0 ms] 20.81/7.50 (4) HASKELL 20.81/7.50 (5) IFR [EQUIVALENT, 0 ms] 20.81/7.50 (6) HASKELL 20.81/7.50 (7) BR [EQUIVALENT, 0 ms] 20.81/7.50 (8) HASKELL 20.81/7.50 (9) COR [EQUIVALENT, 15 ms] 20.81/7.50 (10) HASKELL 20.81/7.50 (11) NumRed [SOUND, 0 ms] 20.81/7.50 (12) HASKELL 20.81/7.50 (13) Narrow [SOUND, 0 ms] 20.81/7.50 (14) AND 20.81/7.50 (15) QDP 20.81/7.50 (16) QDPSizeChangeProof [EQUIVALENT, 0 ms] 20.81/7.50 (17) YES 20.81/7.50 (18) QDP 20.81/7.50 (19) DependencyGraphProof [EQUIVALENT, 0 ms] 20.81/7.50 (20) QDP 20.81/7.50 (21) QDPSizeChangeProof [EQUIVALENT, 0 ms] 20.81/7.50 (22) YES 20.81/7.50 (23) QDP 20.81/7.50 (24) QDPSizeChangeProof [EQUIVALENT, 0 ms] 20.81/7.50 (25) YES 20.81/7.50 (26) QDP 20.81/7.50 (27) QDPSizeChangeProof [EQUIVALENT, 0 ms] 20.81/7.50 (28) YES 20.81/7.50 (29) QDP 20.81/7.50 (30) QDPSizeChangeProof [EQUIVALENT, 0 ms] 20.81/7.50 (31) YES 20.81/7.50 (32) QDP 20.81/7.50 (33) QDPSizeChangeProof [EQUIVALENT, 0 ms] 20.81/7.50 (34) YES 20.81/7.50 (35) QDP 20.81/7.50 (36) QDPSizeChangeProof [EQUIVALENT, 0 ms] 20.81/7.50 (37) YES 20.81/7.50 (38) QDP 20.81/7.50 (39) QDPSizeChangeProof [EQUIVALENT, 0 ms] 20.81/7.50 (40) YES 20.81/7.50 (41) QDP 20.81/7.50 (42) QDPSizeChangeProof [EQUIVALENT, 0 ms] 20.81/7.50 (43) YES 20.81/7.50 (44) QDP 20.81/7.50 (45) DependencyGraphProof [EQUIVALENT, 0 ms] 20.81/7.50 (46) QDP 20.81/7.50 (47) QDPSizeChangeProof [EQUIVALENT, 0 ms] 20.81/7.50 (48) YES 20.81/7.50 (49) QDP 20.81/7.50 (50) QDPSizeChangeProof [EQUIVALENT, 0 ms] 20.81/7.50 (51) YES 20.81/7.50 20.81/7.50 20.81/7.50 ---------------------------------------- 20.81/7.50 20.81/7.50 (0) 20.81/7.50 Obligation: 20.81/7.50 mainModule Main 20.81/7.50 module Maybe where { 20.81/7.50 import qualified List; 20.81/7.50 import qualified Main; 20.81/7.50 import qualified Prelude; 20.81/7.50 listToMaybe :: [a] -> Maybe a; 20.81/7.50 listToMaybe [] = Nothing; 20.81/7.50 listToMaybe (a : _) = Just a; 20.81/7.50 20.81/7.50 } 20.81/7.50 module List where { 20.81/7.50 import qualified Main; 20.81/7.50 import qualified Maybe; 20.81/7.50 import qualified Prelude; 20.81/7.50 elemIndex :: Eq a => a -> [a] -> Maybe Int; 20.81/7.50 elemIndex x = findIndex (== x); 20.81/7.50 20.81/7.50 findIndex :: (a -> Bool) -> [a] -> Maybe Int; 20.81/7.50 findIndex p = Maybe.listToMaybe . findIndices p; 20.81/7.50 20.81/7.50 findIndices :: (a -> Bool) -> [a] -> [Int]; 20.81/7.50 findIndices p xs = concatMap (\vv1 ->case vv1 of { 20.81/7.50 (x,i)-> if p x then i : [] else []; 20.81/7.50 _-> []; 20.81/7.50 } ) (zip xs (enumFrom 0)); 20.81/7.50 20.81/7.50 } 20.81/7.50 module Main where { 20.81/7.50 import qualified List; 20.81/7.50 import qualified Maybe; 20.81/7.50 import qualified Prelude; 20.81/7.50 } 20.81/7.50 20.81/7.50 ---------------------------------------- 20.81/7.50 popout

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52