details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	6.30035 seconds
cpu usage	17.4399
user time	16.9177
system time	0.522191
max virtual memory	1.8351564E7
max residence set size	1258824.0

stage attributes

key	value
starexec-result	YES

output

14.64/5.59 YES 17.21/6.23 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 17.21/6.23 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 17.21/6.23 17.21/6.23 17.21/6.23 H-Termination with start terms of the given HASKELL could be proven: 17.21/6.23 17.21/6.23 (0) HASKELL 17.21/6.23 (1) IFR [EQUIVALENT, 0 ms] 17.21/6.23 (2) HASKELL 17.21/6.23 (3) BR [EQUIVALENT, 0 ms] 17.21/6.23 (4) HASKELL 17.21/6.23 (5) COR [EQUIVALENT, 23 ms] 17.21/6.23 (6) HASKELL 17.21/6.23 (7) LetRed [EQUIVALENT, 0 ms] 17.21/6.23 (8) HASKELL 17.21/6.23 (9) NumRed [SOUND, 0 ms] 17.21/6.23 (10) HASKELL 17.21/6.23 (11) Narrow [SOUND, 0 ms] 17.21/6.23 (12) AND 17.21/6.23 (13) QDP 17.21/6.23 (14) DependencyGraphProof [EQUIVALENT, 0 ms] 17.21/6.23 (15) QDP 17.21/6.23 (16) QDPOrderProof [EQUIVALENT, 0 ms] 17.21/6.23 (17) QDP 17.21/6.23 (18) DependencyGraphProof [EQUIVALENT, 0 ms] 17.21/6.23 (19) QDP 17.21/6.23 (20) QDPSizeChangeProof [EQUIVALENT, 0 ms] 17.21/6.23 (21) YES 17.21/6.23 (22) QDP 17.21/6.23 (23) QDPSizeChangeProof [EQUIVALENT, 0 ms] 17.21/6.23 (24) YES 17.21/6.23 (25) QDP 17.21/6.23 (26) QDPSizeChangeProof [EQUIVALENT, 0 ms] 17.21/6.23 (27) YES 17.21/6.23 (28) QDP 17.21/6.23 (29) DependencyGraphProof [EQUIVALENT, 0 ms] 17.21/6.23 (30) QDP 17.21/6.23 (31) QDPOrderProof [EQUIVALENT, 0 ms] 17.21/6.23 (32) QDP 17.21/6.23 (33) QDPOrderProof [EQUIVALENT, 0 ms] 17.21/6.23 (34) QDP 17.21/6.23 (35) DependencyGraphProof [EQUIVALENT, 0 ms] 17.21/6.23 (36) QDP 17.21/6.23 (37) QDPOrderProof [EQUIVALENT, 10 ms] 17.21/6.23 (38) QDP 17.21/6.23 (39) DependencyGraphProof [EQUIVALENT, 0 ms] 17.21/6.23 (40) QDP 17.21/6.23 (41) InductionCalculusProof [EQUIVALENT, 7 ms] 17.21/6.23 (42) QDP 17.21/6.23 (43) NonInfProof [EQUIVALENT, 0 ms] 17.21/6.23 (44) QDP 17.21/6.23 (45) DependencyGraphProof [EQUIVALENT, 0 ms] 17.21/6.23 (46) QDP 17.21/6.23 (47) QDPSizeChangeProof [EQUIVALENT, 0 ms] 17.21/6.23 (48) YES 17.21/6.23 (49) QDP 17.21/6.23 (50) QDPSizeChangeProof [EQUIVALENT, 0 ms] 17.21/6.23 (51) YES 17.21/6.23 17.21/6.23 17.21/6.23 ---------------------------------------- 17.21/6.23 17.21/6.23 (0) 17.21/6.23 Obligation: 17.21/6.23 mainModule Main 17.21/6.23 module Main where { 17.21/6.23 import qualified Prelude; 17.21/6.23 } 17.21/6.23 17.21/6.23 ---------------------------------------- 17.21/6.23 17.21/6.23 (1) IFR (EQUIVALENT) 17.21/6.23 If Reductions: 17.21/6.23 The following If expression 17.21/6.23 "if primGEqNatS x y then Succ (primDivNatS (primMinusNatS x y) (Succ y)) else Zero" 17.21/6.23 is transformed to 17.21/6.23 "primDivNatS0 x y True = Succ (primDivNatS (primMinusNatS x y) (Succ y)); 17.21/6.23 primDivNatS0 x y False = Zero; 17.21/6.23 " 17.21/6.23 The following If expression 17.21/6.23 "if primGEqNatS x y then primModNatS (primMinusNatS x y) (Succ y) else Succ x" 17.21/6.23 is transformed to 17.21/6.23 "primModNatS0 x y True = primModNatS (primMinusNatS x y) (Succ y); 17.21/6.23 primModNatS0 x y False = Succ x; 17.21/6.23 " 17.21/6.23 17.21/6.23 ---------------------------------------- 17.21/6.23 17.21/6.23 (2) 17.21/6.23 Obligation: 17.21/6.23 mainModule Main 17.21/6.23 module Main where { 17.21/6.23 import qualified Prelude; 17.21/6.23 } 17.21/6.23 17.21/6.23 ---------------------------------------- 17.21/6.23 17.21/6.23 (3) BR (EQUIVALENT) 17.21/6.23 Replaced joker patterns by fresh variables and removed binding patterns. popout

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52