details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	6.68576 seconds
cpu usage	15.3253
user time	14.8019
system time	0.523362
max virtual memory	1.8288912E7
max residence set size	1403884.0

stage attributes

key	value
starexec-result	YES

output

12.67/4.97 YES 15.07/5.60 proof of /export/starexec/sandbox2/benchmark/theBenchmark.hs 15.07/5.60 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 15.07/5.60 15.07/5.60 15.07/5.60 H-Termination with start terms of the given HASKELL could be proven: 15.07/5.60 15.07/5.60 (0) HASKELL 15.07/5.60 (1) IFR [EQUIVALENT, 0 ms] 15.07/5.60 (2) HASKELL 15.07/5.60 (3) BR [EQUIVALENT, 0 ms] 15.07/5.60 (4) HASKELL 15.07/5.60 (5) COR [EQUIVALENT, 0 ms] 15.07/5.60 (6) HASKELL 15.07/5.60 (7) LetRed [EQUIVALENT, 0 ms] 15.07/5.60 (8) HASKELL 15.07/5.60 (9) NumRed [SOUND, 0 ms] 15.07/5.60 (10) HASKELL 15.07/5.60 (11) Narrow [SOUND, 0 ms] 15.07/5.60 (12) AND 15.07/5.60 (13) QDP 15.07/5.60 (14) DependencyGraphProof [EQUIVALENT, 0 ms] 15.07/5.60 (15) QDP 15.07/5.60 (16) MRRProof [EQUIVALENT, 0 ms] 15.07/5.60 (17) QDP 15.07/5.60 (18) PisEmptyProof [EQUIVALENT, 0 ms] 15.07/5.60 (19) YES 15.07/5.60 (20) QDP 15.07/5.60 (21) QDPSizeChangeProof [EQUIVALENT, 0 ms] 15.07/5.60 (22) YES 15.07/5.60 (23) QDP 15.07/5.60 (24) QDPSizeChangeProof [EQUIVALENT, 0 ms] 15.07/5.60 (25) YES 15.07/5.60 (26) QDP 15.07/5.60 (27) DependencyGraphProof [EQUIVALENT, 0 ms] 15.07/5.60 (28) QDP 15.07/5.60 (29) MRRProof [EQUIVALENT, 12 ms] 15.07/5.60 (30) QDP 15.07/5.60 (31) PisEmptyProof [EQUIVALENT, 0 ms] 15.07/5.60 (32) YES 15.07/5.60 (33) QDP 15.07/5.60 (34) QDPSizeChangeProof [EQUIVALENT, 0 ms] 15.07/5.60 (35) YES 15.07/5.60 15.07/5.60 15.07/5.60 ---------------------------------------- 15.07/5.60 15.07/5.60 (0) 15.07/5.60 Obligation: 15.07/5.60 mainModule Main 15.07/5.60 module Main where { 15.07/5.60 import qualified Prelude; 15.07/5.60 } 15.07/5.60 15.07/5.60 ---------------------------------------- 15.07/5.60 15.07/5.60 (1) IFR (EQUIVALENT) 15.07/5.60 If Reductions: 15.07/5.60 The following If expression 15.07/5.60 "if primGEqNatS x y then Succ (primDivNatS (primMinusNatS x y) (Succ y)) else Zero" 15.07/5.60 is transformed to 15.07/5.60 "primDivNatS0 x y True = Succ (primDivNatS (primMinusNatS x y) (Succ y)); 15.07/5.60 primDivNatS0 x y False = Zero; 15.07/5.60 " 15.07/5.60 The following If expression 15.07/5.60 "if primGEqNatS x y then primModNatS (primMinusNatS x y) (Succ y) else Succ x" 15.07/5.60 is transformed to 15.07/5.60 "primModNatS0 x y True = primModNatS (primMinusNatS x y) (Succ y); 15.07/5.60 primModNatS0 x y False = Succ x; 15.07/5.60 " 15.07/5.60 15.07/5.60 ---------------------------------------- 15.07/5.60 15.07/5.60 (2) 15.07/5.60 Obligation: 15.07/5.60 mainModule Main 15.07/5.60 module Main where { 15.07/5.60 import qualified Prelude; 15.07/5.60 } 15.07/5.60 15.07/5.60 ---------------------------------------- 15.07/5.60 15.07/5.60 (3) BR (EQUIVALENT) 15.07/5.60 Replaced joker patterns by fresh variables and removed binding patterns. 15.07/5.60 ---------------------------------------- 15.07/5.60 15.07/5.60 (4) 15.07/5.60 Obligation: 15.07/5.60 mainModule Main 15.07/5.60 module Main where { 15.07/5.60 import qualified Prelude; 15.07/5.60 } 15.07/5.60 15.07/5.60 ---------------------------------------- 15.07/5.60 15.07/5.60 (5) COR (EQUIVALENT) 15.07/5.60 Cond Reductions: 15.07/5.60 The following Function with conditions 15.07/5.60 "absReal x|x >= 0x|otherwise`negate` x; 15.07/5.60 " popout

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52