details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	5.5519 seconds
cpu usage	11.6093
user time	11.2529
system time	0.356406
max virtual memory	1.8286104E7
max residence set size	661592.0

stage attributes

key	value
starexec-result	YES

output

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

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52