details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	5.42969 seconds
cpu usage	14.2299
user time	13.8533
system time	0.376636
max virtual memory	1.8285568E7
max residence set size	710912.0

stage attributes

key	value
starexec-result	YES

output

11.13/4.59 YES 14.10/5.37 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 14.10/5.37 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 14.10/5.37 14.10/5.37 14.10/5.37 H-Termination with start terms of the given HASKELL could be proven: 14.10/5.37 14.10/5.37 (0) HASKELL 14.10/5.37 (1) LR [EQUIVALENT, 0 ms] 14.10/5.37 (2) HASKELL 14.10/5.37 (3) CR [EQUIVALENT, 0 ms] 14.10/5.37 (4) HASKELL 14.10/5.37 (5) IFR [EQUIVALENT, 0 ms] 14.10/5.37 (6) HASKELL 14.10/5.37 (7) BR [EQUIVALENT, 0 ms] 14.10/5.37 (8) HASKELL 14.10/5.37 (9) COR [EQUIVALENT, 0 ms] 14.10/5.37 (10) HASKELL 14.10/5.37 (11) LetRed [EQUIVALENT, 0 ms] 14.10/5.37 (12) HASKELL 14.10/5.37 (13) NumRed [SOUND, 0 ms] 14.10/5.37 (14) HASKELL 14.10/5.37 (15) Narrow [SOUND, 0 ms] 14.10/5.37 (16) QDP 14.10/5.37 (17) TransformationProof [EQUIVALENT, 0 ms] 14.10/5.37 (18) QDP 14.10/5.37 (19) DependencyGraphProof [EQUIVALENT, 0 ms] 14.10/5.37 (20) QDP 14.10/5.37 (21) TransformationProof [EQUIVALENT, 0 ms] 14.10/5.37 (22) QDP 14.10/5.37 (23) DependencyGraphProof [EQUIVALENT, 0 ms] 14.10/5.37 (24) QDP 14.10/5.37 (25) UsableRulesProof [EQUIVALENT, 0 ms] 14.10/5.37 (26) QDP 14.10/5.37 (27) QReductionProof [EQUIVALENT, 0 ms] 14.10/5.37 (28) QDP 14.10/5.37 (29) QDPSizeChangeProof [EQUIVALENT, 0 ms] 14.10/5.37 (30) YES 14.10/5.37 14.10/5.37 14.10/5.37 ---------------------------------------- 14.10/5.37 14.10/5.37 (0) 14.10/5.37 Obligation: 14.10/5.37 mainModule Main 14.10/5.37 module Maybe where { 14.10/5.37 import qualified List; 14.10/5.38 import qualified Main; 14.10/5.38 import qualified Prelude; 14.10/5.38 } 14.10/5.38 module List where { 14.10/5.38 import qualified Main; 14.10/5.38 import qualified Maybe; 14.10/5.38 import qualified Prelude; 14.10/5.38 genericSplitAt :: Integral a => a -> [b] -> ([b],[b]); 14.10/5.38 genericSplitAt 0 xs = ([],xs); 14.10/5.38 genericSplitAt _ [] = ([],[]); 14.10/5.38 genericSplitAt n (x : xs) | n > 0 = (x : xs',xs'') where { 14.10/5.38 vv9 = genericSplitAt (n - 1) xs; 14.10/5.38 xs' = (\(xs',_) ->xs') vv9; 14.10/5.38 xs'' = (\(_,xs'') ->xs'') vv9; 14.10/5.38 }; 14.10/5.38 genericSplitAt _ _ = error []; 14.10/5.38 14.10/5.38 } 14.10/5.38 module Main where { 14.10/5.38 import qualified List; 14.10/5.38 import qualified Maybe; 14.10/5.38 import qualified Prelude; 14.10/5.38 } 14.10/5.38 14.10/5.38 ---------------------------------------- 14.10/5.38 14.10/5.38 (1) LR (EQUIVALENT) 14.10/5.38 Lambda Reductions: 14.10/5.38 The following Lambda expression 14.10/5.38 "\(_,xs'')->xs''" 14.10/5.38 is transformed to 14.10/5.38 "xs''0 (_,xs'') = xs''; 14.10/5.38 " 14.10/5.38 The following Lambda expression 14.10/5.38 "\(xs',_)->xs'" 14.10/5.38 is transformed to 14.10/5.38 "xs'0 (xs',_) = xs'; 14.10/5.38 " 14.10/5.38 14.10/5.38 ---------------------------------------- 14.10/5.38 14.10/5.38 (2) 14.10/5.38 Obligation: 14.10/5.38 mainModule Main 14.10/5.38 module Maybe where { 14.10/5.38 import qualified List; 14.10/5.38 import qualified Main; 14.10/5.38 import qualified Prelude; 14.10/5.38 } 14.10/5.38 module List where { 14.10/5.38 import qualified Main; 14.10/5.38 import qualified Maybe; 14.10/5.38 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