details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	166.812 seconds
cpu usage	188.589
user time	186.716
system time	1.87278
max virtual memory	1.828352E7
max residence set size	5256072.0

stage attributes

key	value
starexec-result	MAYBE

output

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