Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell 2019-04-01 06.52 pair #433316347
details
property
value
status
complete
benchmark
List_intersect_1.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n161.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
6.23324 seconds
cpu usage
16.4165
user time
15.9996
system time
0.416904
max virtual memory
1.8285568E7
max residence set size
1060028.0
stage attributes
key
value
starexec-result
YES
output
13.40/5.33 YES 16.11/6.05 proof of /export/starexec/sandbox2/benchmark/theBenchmark.hs 16.11/6.05 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 16.11/6.05 16.11/6.05 16.11/6.05 H-Termination with start terms of the given HASKELL could be proven: 16.11/6.05 16.11/6.05 (0) HASKELL 16.11/6.05 (1) LR [EQUIVALENT, 0 ms] 16.11/6.05 (2) HASKELL 16.11/6.05 (3) CR [EQUIVALENT, 0 ms] 16.11/6.05 (4) HASKELL 16.11/6.05 (5) IFR [EQUIVALENT, 0 ms] 16.11/6.05 (6) HASKELL 16.11/6.05 (7) BR [EQUIVALENT, 0 ms] 16.11/6.05 (8) HASKELL 16.11/6.05 (9) COR [EQUIVALENT, 11 ms] 16.11/6.05 (10) HASKELL 16.11/6.05 (11) Narrow [SOUND, 0 ms] 16.11/6.05 (12) AND 16.11/6.05 (13) QDP 16.11/6.05 (14) QDPSizeChangeProof [EQUIVALENT, 0 ms] 16.11/6.05 (15) YES 16.11/6.05 (16) QDP 16.11/6.05 (17) QDPSizeChangeProof [EQUIVALENT, 0 ms] 16.11/6.05 (18) YES 16.11/6.05 (19) QDP 16.11/6.05 (20) QDPSizeChangeProof [EQUIVALENT, 0 ms] 16.11/6.05 (21) YES 16.11/6.05 (22) QDP 16.11/6.05 (23) QDPSizeChangeProof [EQUIVALENT, 0 ms] 16.11/6.05 (24) YES 16.11/6.05 (25) QDP 16.11/6.05 (26) QDPSizeChangeProof [EQUIVALENT, 0 ms] 16.11/6.05 (27) YES 16.11/6.05 (28) QDP 16.11/6.05 (29) QDPSizeChangeProof [EQUIVALENT, 0 ms] 16.11/6.05 (30) YES 16.11/6.05 16.11/6.05 16.11/6.05 ---------------------------------------- 16.11/6.05 16.11/6.05 (0) 16.11/6.05 Obligation: 16.11/6.05 mainModule Main 16.11/6.05 module Maybe where { 16.11/6.05 import qualified List; 16.11/6.05 import qualified Main; 16.11/6.05 import qualified Prelude; 16.11/6.05 } 16.11/6.05 module List where { 16.11/6.05 import qualified Main; 16.11/6.05 import qualified Maybe; 16.11/6.05 import qualified Prelude; 16.11/6.05 intersect :: Eq a => [a] -> [a] -> [a]; 16.11/6.05 intersect = intersectBy (==); 16.11/6.05 16.11/6.05 intersectBy :: (a -> a -> Bool) -> [a] -> [a] -> [a]; 16.11/6.05 intersectBy eq xs ys = concatMap (\vv2 ->case vv2 of { 16.11/6.05 x-> if any (eq x) ys then x : [] else []; 16.11/6.05 _-> []; 16.11/6.05 } ) xs; 16.11/6.05 16.11/6.05 } 16.11/6.05 module Main where { 16.11/6.05 import qualified List; 16.11/6.05 import qualified Maybe; 16.11/6.05 import qualified Prelude; 16.11/6.05 } 16.11/6.05 16.11/6.05 ---------------------------------------- 16.11/6.05 16.11/6.05 (1) LR (EQUIVALENT) 16.11/6.05 Lambda Reductions: 16.11/6.05 The following Lambda expression 16.11/6.05 "\vv2->case vv2 of { 16.11/6.05 x -> if any (eq x) ys then x : [] else []; 16.11/6.05 _ -> []} 16.11/6.05 " 16.11/6.05 is transformed to 16.11/6.05 "intersectBy0 eq ys vv2 = case vv2 of { 16.11/6.05 x -> if any (eq x) ys then x : [] else []; 16.11/6.05 _ -> []} 16.11/6.05 ; 16.11/6.05 " 16.11/6.05 16.11/6.05 ---------------------------------------- 16.11/6.05 16.11/6.05 (2) 16.11/6.05 Obligation: 16.11/6.05 mainModule Main 16.11/6.05 module Maybe where { 16.11/6.05 import qualified List; 16.11/6.05 import qualified Main; 16.11/6.05 import qualified Prelude; 16.11/6.05 } 16.11/6.05 module List where { 16.11/6.05 import qualified Main; 16.11/6.05 import qualified Maybe; 16.11/6.05 import qualified Prelude;
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell 2019-04-01 06.52