details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	13.6351 seconds
cpu usage	28.9696
user time	27.7236
system time	1.24599
max virtual memory	1.8288436E7
max residence set size	3961228.0

stage attributes

key	value
starexec-result	YES

output

26.19/12.82 YES 28.52/13.51 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 28.52/13.51 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 28.52/13.51 28.52/13.51 28.52/13.51 H-Termination with start terms of the given HASKELL could be proven: 28.52/13.51 28.52/13.51 (0) HASKELL 28.52/13.51 (1) CR [EQUIVALENT, 0 ms] 28.52/13.51 (2) HASKELL 28.52/13.51 (3) IFR [EQUIVALENT, 0 ms] 28.52/13.51 (4) HASKELL 28.52/13.51 (5) BR [EQUIVALENT, 0 ms] 28.52/13.51 (6) HASKELL 28.52/13.51 (7) COR [EQUIVALENT, 10 ms] 28.52/13.51 (8) HASKELL 28.52/13.51 (9) LetRed [EQUIVALENT, 0 ms] 28.52/13.51 (10) HASKELL 28.52/13.51 (11) NumRed [SOUND, 0 ms] 28.52/13.51 (12) HASKELL 28.52/13.51 (13) Narrow [SOUND, 0 ms] 28.52/13.51 (14) AND 28.52/13.51 (15) QDP 28.52/13.51 (16) QDPSizeChangeProof [EQUIVALENT, 0 ms] 28.52/13.51 (17) YES 28.52/13.51 (18) QDP 28.52/13.51 (19) DependencyGraphProof [EQUIVALENT, 0 ms] 28.52/13.51 (20) QDP 28.52/13.51 (21) QDPSizeChangeProof [EQUIVALENT, 0 ms] 28.52/13.51 (22) YES 28.52/13.51 (23) QDP 28.52/13.51 (24) QDPSizeChangeProof [EQUIVALENT, 11 ms] 28.52/13.51 (25) YES 28.52/13.51 (26) QDP 28.52/13.51 (27) QDPSizeChangeProof [EQUIVALENT, 0 ms] 28.52/13.51 (28) YES 28.52/13.51 (29) QDP 28.52/13.51 (30) QDPSizeChangeProof [EQUIVALENT, 0 ms] 28.52/13.51 (31) YES 28.52/13.51 (32) QDP 28.52/13.51 (33) QDPSizeChangeProof [EQUIVALENT, 0 ms] 28.52/13.51 (34) YES 28.52/13.51 (35) QDP 28.52/13.51 (36) QDPSizeChangeProof [EQUIVALENT, 0 ms] 28.52/13.51 (37) YES 28.52/13.51 28.52/13.51 28.52/13.51 ---------------------------------------- 28.52/13.51 28.52/13.51 (0) 28.52/13.51 Obligation: 28.52/13.51 mainModule Main 28.52/13.51 module Main where { 28.52/13.51 import qualified Prelude; 28.52/13.51 } 28.52/13.51 28.52/13.51 ---------------------------------------- 28.52/13.51 28.52/13.51 (1) CR (EQUIVALENT) 28.52/13.51 Case Reductions: 28.52/13.51 The following Case expression 28.52/13.51 "case compare x y of { 28.52/13.51 EQ -> o; 28.52/13.51 LT -> LT; 28.52/13.51 GT -> GT} 28.52/13.51 " 28.52/13.51 is transformed to 28.52/13.51 "primCompAux0 o EQ = o; 28.52/13.51 primCompAux0 o LT = LT; 28.52/13.51 primCompAux0 o GT = GT; 28.52/13.51 " 28.52/13.51 28.52/13.51 ---------------------------------------- 28.52/13.51 28.52/13.51 (2) 28.52/13.51 Obligation: 28.52/13.51 mainModule Main 28.52/13.51 module Main where { 28.52/13.51 import qualified Prelude; 28.52/13.51 } 28.52/13.51 28.52/13.51 ---------------------------------------- 28.52/13.51 28.52/13.51 (3) IFR (EQUIVALENT) 28.52/13.51 If Reductions: 28.52/13.51 The following If expression 28.52/13.51 "if primGEqNatS x y then Succ (primDivNatS (primMinusNatS x y) (Succ y)) else Zero" 28.52/13.51 is transformed to 28.52/13.51 "primDivNatS0 x y True = Succ (primDivNatS (primMinusNatS x y) (Succ y)); 28.52/13.51 primDivNatS0 x y False = Zero; 28.52/13.51 " 28.52/13.51 The following If expression 28.52/13.51 "if primGEqNatS x y then primModNatS (primMinusNatS x y) (Succ y) else Succ x" 28.52/13.51 is transformed to 28.52/13.51 "primModNatS0 x y True = primModNatS (primMinusNatS x y) (Succ y); 28.52/13.51 primModNatS0 x y False = Succ x; 28.52/13.51 " 28.52/13.51 28.52/13.51 ---------------------------------------- 28.52/13.51 popout

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52