Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell 2019-04-01 06.52 pair #433315930
details
property
value
status
complete
benchmark
List_elemIndex_7.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n053.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
5.49913 seconds
cpu usage
14.3325
user time
13.9835
system time
0.349029
max virtual memory
1.8285568E7
max residence set size
757496.0
stage attributes
key
value
starexec-result
YES
output
11.65/4.74 YES 14.18/5.44 proof of /export/starexec/sandbox2/benchmark/theBenchmark.hs 14.18/5.44 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 14.18/5.44 14.18/5.44 14.18/5.44 H-Termination with start terms of the given HASKELL could be proven: 14.18/5.44 14.18/5.44 (0) HASKELL 14.18/5.44 (1) LR [EQUIVALENT, 0 ms] 14.18/5.44 (2) HASKELL 14.18/5.44 (3) CR [EQUIVALENT, 0 ms] 14.18/5.44 (4) HASKELL 14.18/5.44 (5) IFR [EQUIVALENT, 0 ms] 14.18/5.44 (6) HASKELL 14.18/5.44 (7) BR [EQUIVALENT, 0 ms] 14.18/5.44 (8) HASKELL 14.18/5.44 (9) COR [EQUIVALENT, 10 ms] 14.18/5.44 (10) HASKELL 14.18/5.44 (11) NumRed [SOUND, 0 ms] 14.18/5.44 (12) HASKELL 14.18/5.44 (13) Narrow [SOUND, 0 ms] 14.18/5.44 (14) AND 14.18/5.44 (15) QDP 14.18/5.44 (16) QDPSizeChangeProof [EQUIVALENT, 1 ms] 14.18/5.44 (17) YES 14.18/5.44 (18) QDP 14.18/5.44 (19) TransformationProof [EQUIVALENT, 0 ms] 14.18/5.44 (20) QDP 14.18/5.44 (21) QDPSizeChangeProof [EQUIVALENT, 0 ms] 14.18/5.44 (22) YES 14.18/5.44 (23) QDP 14.18/5.44 (24) QDPSizeChangeProof [EQUIVALENT, 0 ms] 14.18/5.44 (25) YES 14.18/5.44 14.18/5.44 14.18/5.44 ---------------------------------------- 14.18/5.44 14.18/5.44 (0) 14.18/5.44 Obligation: 14.18/5.44 mainModule Main 14.18/5.44 module Maybe where { 14.18/5.44 import qualified List; 14.18/5.44 import qualified Main; 14.18/5.44 import qualified Prelude; 14.18/5.44 listToMaybe :: [a] -> Maybe a; 14.18/5.44 listToMaybe [] = Nothing; 14.18/5.44 listToMaybe (a : _) = Just a; 14.18/5.44 14.18/5.44 } 14.18/5.44 module List where { 14.18/5.44 import qualified Main; 14.18/5.44 import qualified Maybe; 14.18/5.44 import qualified Prelude; 14.18/5.44 elemIndex :: Eq a => a -> [a] -> Maybe Int; 14.18/5.44 elemIndex x = findIndex (== x); 14.18/5.44 14.18/5.44 findIndex :: (a -> Bool) -> [a] -> Maybe Int; 14.18/5.44 findIndex p = Maybe.listToMaybe . findIndices p; 14.18/5.44 14.18/5.44 findIndices :: (a -> Bool) -> [a] -> [Int]; 14.18/5.44 findIndices p xs = concatMap (\vv1 ->case vv1 of { 14.18/5.44 (x,i)-> if p x then i : [] else []; 14.18/5.44 _-> []; 14.18/5.44 } ) (zip xs (enumFrom 0)); 14.18/5.44 14.18/5.44 } 14.18/5.44 module Main where { 14.18/5.44 import qualified List; 14.18/5.44 import qualified Maybe; 14.18/5.44 import qualified Prelude; 14.18/5.44 } 14.18/5.44 14.18/5.44 ---------------------------------------- 14.18/5.44 14.18/5.44 (1) LR (EQUIVALENT) 14.18/5.44 Lambda Reductions: 14.18/5.44 The following Lambda expression 14.18/5.44 "\ab->(a,b)" 14.18/5.44 is transformed to 14.18/5.44 "zip0 a b = (a,b); 14.18/5.44 " 14.18/5.44 The following Lambda expression 14.18/5.44 "\vv1->case vv1 of { 14.18/5.44 (x,i) -> if p x then i : [] else []; 14.18/5.44 _ -> []} 14.18/5.44 " 14.18/5.44 is transformed to 14.18/5.44 "findIndices0 p vv1 = case vv1 of { 14.18/5.44 (x,i) -> if p x then i : [] else []; 14.18/5.44 _ -> []} 14.18/5.44 ; 14.18/5.44 " 14.18/5.44 14.18/5.44 ---------------------------------------- 14.18/5.44 14.18/5.44 (2) 14.18/5.44 Obligation: 14.18/5.44 mainModule Main 14.18/5.44 module Maybe where { 14.18/5.44 import qualified List;
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell 2019-04-01 06.52