details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.2711 seconds
cpu usage	10.5653
user time	10.2653
system time	0.29999
max virtual memory	1.828352E7
max residence set size	581548.0

stage attributes

key	value
starexec-result	YES

output

8.28/3.66 YES 10.31/4.23 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 10.31/4.23 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 10.31/4.23 10.31/4.23 10.31/4.23 H-Termination with start terms of the given HASKELL could be proven: 10.31/4.23 10.31/4.23 (0) HASKELL 10.31/4.23 (1) BR [EQUIVALENT, 0 ms] 10.31/4.23 (2) HASKELL 10.31/4.23 (3) COR [EQUIVALENT, 0 ms] 10.31/4.23 (4) HASKELL 10.31/4.23 (5) LetRed [EQUIVALENT, 0 ms] 10.31/4.23 (6) HASKELL 10.31/4.23 (7) NumRed [SOUND, 0 ms] 10.31/4.23 (8) HASKELL 10.31/4.23 (9) Narrow [SOUND, 0 ms] 10.31/4.23 (10) QDP 10.31/4.23 (11) TransformationProof [EQUIVALENT, 3 ms] 10.31/4.23 (12) QDP 10.31/4.23 (13) QDPSizeChangeProof [EQUIVALENT, 0 ms] 10.31/4.23 (14) YES 10.31/4.23 10.31/4.23 10.31/4.23 ---------------------------------------- 10.31/4.23 10.31/4.23 (0) 10.31/4.23 Obligation: 10.31/4.23 mainModule Main 10.31/4.23 module Main where { 10.31/4.23 import qualified Prelude; 10.31/4.23 } 10.31/4.23 10.31/4.23 ---------------------------------------- 10.31/4.23 10.31/4.23 (1) BR (EQUIVALENT) 10.31/4.23 Replaced joker patterns by fresh variables and removed binding patterns. 10.31/4.23 ---------------------------------------- 10.31/4.23 10.31/4.23 (2) 10.31/4.23 Obligation: 10.31/4.23 mainModule Main 10.31/4.23 module Main where { 10.31/4.23 import qualified Prelude; 10.31/4.23 } 10.31/4.23 10.31/4.23 ---------------------------------------- 10.31/4.23 10.31/4.23 (3) COR (EQUIVALENT) 10.31/4.23 Cond Reductions: 10.31/4.23 The following Function with conditions 10.31/4.23 "undefined |Falseundefined; 10.31/4.23 " 10.31/4.23 is transformed to 10.31/4.23 "undefined = undefined1; 10.31/4.23 " 10.31/4.23 "undefined0 True = undefined; 10.31/4.23 " 10.31/4.23 "undefined1 = undefined0 False; 10.31/4.23 " 10.31/4.23 10.31/4.23 ---------------------------------------- 10.31/4.23 10.31/4.23 (4) 10.31/4.23 Obligation: 10.31/4.23 mainModule Main 10.31/4.23 module Main where { 10.31/4.23 import qualified Prelude; 10.31/4.23 } 10.31/4.23 10.31/4.23 ---------------------------------------- 10.31/4.23 10.31/4.23 (5) LetRed (EQUIVALENT) 10.31/4.23 Let/Where Reductions: 10.31/4.23 The bindings of the following Let/Where expression 10.31/4.23 "(showChar '[') . (shows x) . showl xs where { 10.31/4.23 showl [] = showChar ']'; 10.31/4.23 showl (x : xs) = (showChar ',') . (shows x) . showl xs; 10.31/4.23 } 10.31/4.23 " 10.31/4.23 are unpacked to the following functions on top level 10.31/4.23 "showListShowl [] = showChar ']'; 10.31/4.23 showListShowl (x : xs) = (showChar ',') . (shows x) . showListShowl xs; 10.31/4.23 " 10.31/4.23 10.31/4.23 ---------------------------------------- 10.31/4.23 10.31/4.23 (6) 10.31/4.23 Obligation: 10.31/4.23 mainModule Main 10.31/4.23 module Main where { 10.31/4.23 import qualified Prelude; 10.31/4.23 } 10.31/4.23 10.31/4.23 ---------------------------------------- 10.31/4.23 10.31/4.23 (7) NumRed (SOUND) 10.31/4.23 Num Reduction:All numbers are transformed to their corresponding representation with Succ, Pred and Zero. 10.31/4.23 ---------------------------------------- 10.31/4.23 popout

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52