details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	157.792 seconds
cpu usage	175.3
user time	173.419
system time	1.88104
max virtual memory	1.828352E7
max residence set size	5194808.0

stage attributes

key	value
starexec-result	MAYBE

output

172.64/157.02 MAYBE 174.70/157.60 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 174.70/157.60 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 174.70/157.60 174.70/157.60 174.70/157.60 H-Termination with start terms of the given HASKELL could not be shown: 174.70/157.60 174.70/157.60 (0) HASKELL 174.70/157.60 (1) LR [EQUIVALENT, 0 ms] 174.70/157.60 (2) HASKELL 174.70/157.60 (3) CR [EQUIVALENT, 0 ms] 174.70/157.60 (4) HASKELL 174.70/157.60 (5) IFR [EQUIVALENT, 0 ms] 174.70/157.60 (6) HASKELL 174.70/157.60 (7) BR [EQUIVALENT, 9 ms] 174.70/157.60 (8) HASKELL 174.70/157.60 (9) COR [EQUIVALENT, 0 ms] 174.70/157.60 (10) HASKELL 174.70/157.60 (11) LetRed [EQUIVALENT, 0 ms] 174.70/157.60 (12) HASKELL 174.70/157.60 (13) NumRed [SOUND, 41 ms] 174.70/157.60 (14) HASKELL 174.70/157.60 174.70/157.60 174.70/157.60 ---------------------------------------- 174.70/157.60 174.70/157.60 (0) 174.70/157.60 Obligation: 174.70/157.60 mainModule Main 174.70/157.60 module Main where { 174.70/157.60 import qualified Prelude; 174.70/157.60 } 174.70/157.60 174.70/157.60 ---------------------------------------- 174.70/157.60 174.70/157.60 (1) LR (EQUIVALENT) 174.70/157.60 Lambda Reductions: 174.70/157.60 The following Lambda expression 174.70/157.60 "\vu54->case vu54 of { 174.70/157.60 (ch,''' : t) -> if ch /= ''' : [] then (''' : ch ++ ''' : [],t) : [] else []; 174.70/157.60 _ -> []} 174.70/157.60 " 174.70/157.60 is transformed to 174.70/157.60 "lex0 vu54 = case vu54 of { 174.70/157.60 (ch,''' : t) -> if ch /= ''' : [] then (''' : ch ++ ''' : [],t) : [] else []; 174.70/157.60 _ -> []} 174.70/157.60 ; 174.70/157.60 " 174.70/157.60 The following Lambda expression 174.70/157.60 "\vu56->case vu56 of { 174.70/157.60 (str,u) -> (ch ++ str,u) : []; 174.70/157.60 _ -> []} 174.70/157.60 " 174.70/157.60 is transformed to 174.70/157.60 "lexString0 ch vu56 = case vu56 of { 174.70/157.60 (str,u) -> (ch ++ str,u) : []; 174.70/157.60 _ -> []} 174.70/157.60 ; 174.70/157.60 " 174.70/157.60 The following Lambda expression 174.70/157.60 "\vu57->case vu57 of { 174.70/157.60 (ch,t) -> concatMap (lexString0 ch) (lexString t); 174.70/157.60 _ -> []} 174.70/157.60 " 174.70/157.60 is transformed to 174.70/157.60 "lexString1 vu57 = case vu57 of { 174.70/157.60 (ch,t) -> concatMap (lexString0 ch) (lexString t); 174.70/157.60 _ -> []} 174.70/157.60 ; 174.70/157.60 " 174.70/157.60 The following Lambda expression 174.70/157.60 "\vu58->case vu58 of { 174.70/157.60 '\' : t -> ([],t) : []; 174.70/157.60 _ -> []} 174.70/157.60 " 174.70/157.60 is transformed to 174.70/157.60 "lexStrItem0 vu58 = case vu58 of { 174.70/157.60 '\' : t -> ([],t) : []; 174.70/157.60 _ -> []} 174.70/157.60 ; 174.70/157.60 " 174.70/157.60 The following Lambda expression 174.70/157.60 "\vu55->case vu55 of { 174.70/157.60 (str,t) -> ('"' : str,t) : []; 174.70/157.60 _ -> []} 174.70/157.60 " 174.70/157.60 is transformed to 174.70/157.60 "lex1 vu55 = case vu55 of { 174.70/157.60 (str,t) -> ('"' : str,t) : []; 174.70/157.60 _ -> []} 174.70/157.60 ; 174.70/157.60 " 174.70/157.60 The following Lambda expression 174.70/157.60 "\vu63->case vu63 of { 174.70/157.60 (e,u) -> ('.' : ds ++ e,u) : []; 174.70/157.60 _ -> []} 174.70/157.60 " 174.70/157.60 is transformed to 174.70/157.60 "lexFracExp0 ds vu63 = case vu63 of { 174.70/157.60 (e,u) -> ('.' : ds ++ e,u) : []; popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Haskell 2019-04-01 06.52