details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.48729 seconds
cpu usage	11.7299
user time	11.3999
system time	0.329967
max virtual memory	1.8288172E7
max residence set size	621176.0

stage attributes

key	value
starexec-result	YES

output

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