details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	9.63474 seconds
cpu usage	19.8067
user time	19.0207
system time	0.786048
max virtual memory	1.8285568E7
max residence set size	2408396.0

stage attributes

key	value
starexec-result	YES

output

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