Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell 2019-04-01 06.52 pair #433316414
details
property
value
status
complete
benchmark
List_insert_3.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n069.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
5.11989 seconds
cpu usage
13.1494
user time
12.7831
system time
0.366257
max virtual memory
1.8285568E7
max residence set size
674992.0
stage attributes
key
value
starexec-result
YES
output
10.60/4.48 YES 12.84/5.07 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 12.84/5.07 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 12.84/5.07 12.84/5.07 12.84/5.07 H-Termination with start terms of the given HASKELL could be proven: 12.84/5.07 12.84/5.07 (0) HASKELL 12.84/5.07 (1) CR [EQUIVALENT, 0 ms] 12.84/5.07 (2) HASKELL 12.84/5.07 (3) BR [EQUIVALENT, 0 ms] 12.84/5.07 (4) HASKELL 12.84/5.07 (5) COR [EQUIVALENT, 21 ms] 12.84/5.07 (6) HASKELL 12.84/5.07 (7) Narrow [SOUND, 0 ms] 12.84/5.07 (8) QDP 12.84/5.07 (9) QDPSizeChangeProof [EQUIVALENT, 0 ms] 12.84/5.07 (10) YES 12.84/5.07 12.84/5.07 12.84/5.07 ---------------------------------------- 12.84/5.07 12.84/5.07 (0) 12.84/5.07 Obligation: 12.84/5.07 mainModule Main 12.84/5.07 module Maybe where { 12.84/5.07 import qualified List; 12.84/5.07 import qualified Main; 12.84/5.07 import qualified Prelude; 12.84/5.07 } 12.84/5.07 module List where { 12.84/5.07 import qualified Main; 12.84/5.07 import qualified Maybe; 12.84/5.07 import qualified Prelude; 12.84/5.07 insert :: Ord a => a -> [a] -> [a]; 12.84/5.07 insert e ls = insertBy compare e ls; 12.84/5.07 12.84/5.07 insertBy :: (a -> a -> Ordering) -> a -> [a] -> [a]; 12.84/5.07 insertBy _ x [] = x : []; 12.84/5.07 insertBy cmp x ys@(y : ys') = case cmp x y of { 12.84/5.07 GT-> y : insertBy cmp x ys'; 12.84/5.07 _-> x : ys; 12.84/5.07 } ; 12.84/5.07 12.84/5.07 } 12.84/5.07 module Main where { 12.84/5.07 import qualified List; 12.84/5.07 import qualified Maybe; 12.84/5.08 import qualified Prelude; 12.84/5.08 } 12.84/5.08 12.84/5.08 ---------------------------------------- 12.84/5.08 12.84/5.08 (1) CR (EQUIVALENT) 12.84/5.08 Case Reductions: 12.84/5.08 The following Case expression 12.84/5.08 "case cmp x y of { 12.84/5.08 GT -> y : insertBy cmp x ys'; 12.84/5.08 _ -> x : ys} 12.84/5.08 " 12.84/5.08 is transformed to 12.84/5.08 "insertBy0 y cmp x ys' ys GT = y : insertBy cmp x ys'; 12.84/5.08 insertBy0 y cmp x ys' ys _ = x : ys; 12.84/5.08 " 12.84/5.08 12.84/5.08 ---------------------------------------- 12.84/5.08 12.84/5.08 (2) 12.84/5.08 Obligation: 12.84/5.08 mainModule Main 12.84/5.08 module Maybe where { 12.84/5.08 import qualified List; 12.84/5.08 import qualified Main; 12.84/5.08 import qualified Prelude; 12.84/5.08 } 12.84/5.08 module List where { 12.84/5.08 import qualified Main; 12.84/5.08 import qualified Maybe; 12.84/5.08 import qualified Prelude; 12.84/5.08 insert :: Ord a => a -> [a] -> [a]; 12.84/5.08 insert e ls = insertBy compare e ls; 12.84/5.08 12.84/5.08 insertBy :: (a -> a -> Ordering) -> a -> [a] -> [a]; 12.84/5.08 insertBy _ x [] = x : []; 12.84/5.08 insertBy cmp x ys@(y : ys') = insertBy0 y cmp x ys' ys (cmp x y); 12.84/5.08 12.84/5.08 insertBy0 y cmp x ys' ys GT = y : insertBy cmp x ys'; 12.84/5.08 insertBy0 y cmp x ys' ys _ = x : ys; 12.84/5.08 12.84/5.08 } 12.84/5.08 module Main where { 12.84/5.08 import qualified List; 12.84/5.08 import qualified Maybe; 12.84/5.08 import qualified Prelude; 12.84/5.08 } 12.84/5.08 12.84/5.08 ---------------------------------------- 12.84/5.08 12.84/5.08 (3) BR (EQUIVALENT) 12.84/5.08 Replaced joker patterns by fresh variables and removed binding patterns.
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell 2019-04-01 06.52