Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell 2019-04-01 06.52 pair #433316466
details
property
value
status
complete
benchmark
List_insert_12.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n177.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
10.3936 seconds
cpu usage
23.6916
user time
22.4646
system time
1.22701
max virtual memory
1.8285568E7
max residence set size
3934184.0
stage attributes
key
value
starexec-result
YES
output
20.84/9.61 YES 23.51/10.31 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 23.51/10.31 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 23.51/10.31 23.51/10.31 23.51/10.31 H-Termination with start terms of the given HASKELL could be proven: 23.51/10.31 23.51/10.31 (0) HASKELL 23.51/10.31 (1) CR [EQUIVALENT, 0 ms] 23.51/10.31 (2) HASKELL 23.51/10.31 (3) IFR [EQUIVALENT, 0 ms] 23.51/10.31 (4) HASKELL 23.51/10.31 (5) BR [EQUIVALENT, 0 ms] 23.51/10.31 (6) HASKELL 23.51/10.31 (7) COR [EQUIVALENT, 0 ms] 23.51/10.31 (8) HASKELL 23.51/10.31 (9) LetRed [EQUIVALENT, 0 ms] 23.51/10.31 (10) HASKELL 23.51/10.31 (11) NumRed [SOUND, 0 ms] 23.51/10.31 (12) HASKELL 23.51/10.31 (13) Narrow [SOUND, 0 ms] 23.51/10.31 (14) AND 23.51/10.31 (15) QDP 23.51/10.31 (16) QDPSizeChangeProof [EQUIVALENT, 0 ms] 23.51/10.31 (17) YES 23.51/10.31 (18) QDP 23.51/10.31 (19) QDPSizeChangeProof [EQUIVALENT, 0 ms] 23.51/10.31 (20) YES 23.51/10.31 (21) QDP 23.51/10.31 (22) QDPSizeChangeProof [EQUIVALENT, 0 ms] 23.51/10.31 (23) YES 23.51/10.31 (24) QDP 23.51/10.31 (25) QDPSizeChangeProof [EQUIVALENT, 0 ms] 23.51/10.31 (26) YES 23.51/10.31 (27) QDP 23.51/10.31 (28) QDPSizeChangeProof [EQUIVALENT, 0 ms] 23.51/10.31 (29) YES 23.51/10.31 (30) QDP 23.51/10.31 (31) QDPSizeChangeProof [EQUIVALENT, 0 ms] 23.51/10.31 (32) YES 23.51/10.31 (33) QDP 23.51/10.31 (34) QDPSizeChangeProof [EQUIVALENT, 0 ms] 23.51/10.31 (35) YES 23.51/10.31 23.51/10.31 23.51/10.31 ---------------------------------------- 23.51/10.31 23.51/10.31 (0) 23.51/10.31 Obligation: 23.51/10.31 mainModule Main 23.51/10.31 module Maybe where { 23.51/10.31 import qualified List; 23.51/10.31 import qualified Main; 23.51/10.31 import qualified Prelude; 23.51/10.31 } 23.51/10.31 module List where { 23.51/10.31 import qualified Main; 23.51/10.31 import qualified Maybe; 23.51/10.31 import qualified Prelude; 23.51/10.31 insert :: Ord a => a -> [a] -> [a]; 23.51/10.31 insert e ls = insertBy compare e ls; 23.51/10.31 23.51/10.31 insertBy :: (a -> a -> Ordering) -> a -> [a] -> [a]; 23.51/10.31 insertBy _ x [] = x : []; 23.51/10.31 insertBy cmp x ys@(y : ys') = case cmp x y of { 23.51/10.31 GT-> y : insertBy cmp x ys'; 23.51/10.31 _-> x : ys; 23.51/10.31 } ; 23.51/10.31 23.51/10.31 } 23.51/10.31 module Main where { 23.51/10.31 import qualified List; 23.51/10.31 import qualified Maybe; 23.51/10.31 import qualified Prelude; 23.51/10.31 } 23.51/10.31 23.51/10.31 ---------------------------------------- 23.51/10.31 23.51/10.31 (1) CR (EQUIVALENT) 23.51/10.31 Case Reductions: 23.51/10.31 The following Case expression 23.51/10.31 "case compare x y of { 23.51/10.31 EQ -> o; 23.51/10.31 LT -> LT; 23.51/10.31 GT -> GT} 23.51/10.31 " 23.51/10.31 is transformed to 23.51/10.31 "primCompAux0 o EQ = o; 23.51/10.31 primCompAux0 o LT = LT; 23.51/10.31 primCompAux0 o GT = GT; 23.51/10.31 " 23.51/10.31 The following Case expression 23.51/10.31 "case cmp x y of { 23.51/10.31 GT -> y : insertBy cmp x ys'; 23.51/10.31 _ -> x : ys} 23.51/10.31 " 23.51/10.31 is transformed to 23.51/10.31 "insertBy0 y cmp x ys' ys GT = y : insertBy cmp x ys'; 23.51/10.31 insertBy0 y cmp x ys' ys _ = x : ys; 23.51/10.31 "
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell 2019-04-01 06.52