details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.96467 seconds
cpu usage	12.7128
user time	12.4082
system time	0.304614
max virtual memory	1.8351476E7
max residence set size	692088.0

stage attributes

key	value
starexec-result	YES

output

10.12/4.20 YES 12.48/4.87 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 12.48/4.87 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 12.48/4.87 12.48/4.87 12.48/4.87 H-Termination with start terms of the given HASKELL could be proven: 12.48/4.87 12.48/4.87 (0) HASKELL 12.48/4.87 (1) LR [EQUIVALENT, 0 ms] 12.48/4.87 (2) HASKELL 12.48/4.87 (3) IFR [EQUIVALENT, 0 ms] 12.48/4.87 (4) HASKELL 12.48/4.87 (5) BR [EQUIVALENT, 0 ms] 12.48/4.87 (6) HASKELL 12.48/4.87 (7) COR [EQUIVALENT, 0 ms] 12.48/4.87 (8) HASKELL 12.48/4.87 (9) LetRed [EQUIVALENT, 0 ms] 12.48/4.87 (10) HASKELL 12.48/4.87 (11) NumRed [SOUND, 0 ms] 12.48/4.87 (12) HASKELL 12.48/4.87 (13) Narrow [SOUND, 0 ms] 12.48/4.87 (14) AND 12.48/4.87 (15) QDP 12.48/4.87 (16) QDPSizeChangeProof [EQUIVALENT, 0 ms] 12.48/4.87 (17) YES 12.48/4.87 (18) QDP 12.48/4.87 (19) DependencyGraphProof [EQUIVALENT, 0 ms] 12.48/4.87 (20) AND 12.48/4.87 (21) QDP 12.48/4.87 (22) MRRProof [EQUIVALENT, 16 ms] 12.48/4.87 (23) QDP 12.48/4.87 (24) PisEmptyProof [EQUIVALENT, 0 ms] 12.48/4.87 (25) YES 12.48/4.87 (26) QDP 12.48/4.87 (27) QDPOrderProof [EQUIVALENT, 0 ms] 12.48/4.87 (28) QDP 12.48/4.87 (29) DependencyGraphProof [EQUIVALENT, 0 ms] 12.48/4.87 (30) QDP 12.48/4.87 (31) QDPSizeChangeProof [EQUIVALENT, 0 ms] 12.48/4.87 (32) YES 12.48/4.87 (33) QDP 12.48/4.87 (34) QDPSizeChangeProof [EQUIVALENT, 0 ms] 12.48/4.87 (35) YES 12.48/4.87 12.48/4.87 12.48/4.87 ---------------------------------------- 12.48/4.87 12.48/4.87 (0) 12.48/4.87 Obligation: 12.48/4.87 mainModule Main 12.48/4.87 module Main where { 12.48/4.87 import qualified Prelude; 12.48/4.87 } 12.48/4.87 12.48/4.87 ---------------------------------------- 12.48/4.87 12.48/4.87 (1) LR (EQUIVALENT) 12.48/4.87 Lambda Reductions: 12.48/4.87 The following Lambda expression 12.48/4.87 "\(m,_)->m" 12.48/4.87 is transformed to 12.48/4.87 "m0 (m,_) = m; 12.48/4.87 " 12.48/4.87 The following Lambda expression 12.48/4.87 "\(q,_)->q" 12.48/4.87 is transformed to 12.48/4.87 "q1 (q,_) = q; 12.48/4.87 " 12.48/4.87 The following Lambda expression 12.48/4.87 "\(_,r)->r" 12.48/4.87 is transformed to 12.48/4.87 "r0 (_,r) = r; 12.48/4.87 " 12.48/4.87 12.48/4.87 ---------------------------------------- 12.48/4.87 12.48/4.87 (2) 12.48/4.87 Obligation: 12.48/4.87 mainModule Main 12.48/4.87 module Main where { 12.48/4.87 import qualified Prelude; 12.48/4.87 } 12.48/4.87 12.48/4.87 ---------------------------------------- 12.48/4.87 12.48/4.87 (3) IFR (EQUIVALENT) 12.48/4.87 If Reductions: 12.48/4.87 The following If expression 12.48/4.87 "if primGEqNatS x y then Succ (primDivNatS (primMinusNatS x y) (Succ y)) else Zero" 12.48/4.87 is transformed to 12.48/4.87 "primDivNatS0 x y True = Succ (primDivNatS (primMinusNatS x y) (Succ y)); 12.48/4.87 primDivNatS0 x y False = Zero; 12.48/4.87 " 12.48/4.87 The following If expression 12.48/4.87 "if primGEqNatS x y then primModNatS (primMinusNatS x y) (Succ y) else Succ x" 12.48/4.87 is transformed to 12.48/4.87 "primModNatS0 x y True = primModNatS (primMinusNatS x y) (Succ y); 12.48/4.87 primModNatS0 x y False = Succ x; 12.48/4.87 " 12.48/4.87 popout

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52