details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	16.5594 seconds
cpu usage	34.5899
user time	33.2237
system time	1.36627
max virtual memory	1.8353612E7
max residence set size	4134868.0

stage attributes

key	value
starexec-result	YES

output

32.30/15.98 YES 34.28/16.51 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 34.28/16.51 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 34.28/16.51 34.28/16.51 34.28/16.51 H-Termination with start terms of the given HASKELL could be proven: 34.28/16.51 34.28/16.51 (0) HASKELL 34.28/16.51 (1) BR [EQUIVALENT, 0 ms] 34.28/16.51 (2) HASKELL 34.28/16.51 (3) COR [EQUIVALENT, 0 ms] 34.28/16.51 (4) HASKELL 34.28/16.51 (5) NumRed [SOUND, 0 ms] 34.28/16.51 (6) HASKELL 34.28/16.51 (7) Narrow [SOUND, 0 ms] 34.28/16.51 (8) QDP 34.28/16.51 (9) DependencyGraphProof [EQUIVALENT, 0 ms] 34.28/16.51 (10) AND 34.28/16.51 (11) QDP 34.28/16.51 (12) QDPSizeChangeProof [EQUIVALENT, 4 ms] 34.28/16.51 (13) YES 34.28/16.51 (14) QDP 34.28/16.51 (15) QDPSizeChangeProof [EQUIVALENT, 0 ms] 34.28/16.51 (16) YES 34.28/16.51 (17) QDP 34.28/16.51 (18) QDPPairToRuleProof [EQUIVALENT, 0 ms] 34.28/16.51 (19) AND 34.28/16.51 (20) QDP 34.28/16.51 (21) TransformationProof [EQUIVALENT, 0 ms] 34.28/16.51 (22) QDP 34.28/16.51 (23) DependencyGraphProof [EQUIVALENT, 0 ms] 34.28/16.51 (24) QDP 34.28/16.51 (25) UsableRulesProof [EQUIVALENT, 0 ms] 34.28/16.51 (26) QDP 34.28/16.51 (27) QReductionProof [EQUIVALENT, 0 ms] 34.28/16.51 (28) QDP 34.28/16.51 (29) InductionCalculusProof [EQUIVALENT, 0 ms] 34.28/16.51 (30) QDP 34.28/16.51 (31) NonInfProof [EQUIVALENT, 275 ms] 34.28/16.51 (32) AND 34.28/16.51 (33) QDP 34.28/16.51 (34) DependencyGraphProof [EQUIVALENT, 0 ms] 34.28/16.51 (35) TRUE 34.28/16.51 (36) QDP 34.28/16.51 (37) DependencyGraphProof [EQUIVALENT, 0 ms] 34.28/16.51 (38) TRUE 34.28/16.51 (39) QDP 34.28/16.51 (40) QDPSizeChangeProof [EQUIVALENT, 0 ms] 34.28/16.51 (41) YES 34.28/16.51 (42) QDP 34.28/16.51 (43) QDPSizeChangeProof [EQUIVALENT, 0 ms] 34.28/16.51 (44) YES 34.28/16.51 34.28/16.51 34.28/16.51 ---------------------------------------- 34.28/16.51 34.28/16.51 (0) 34.28/16.51 Obligation: 34.28/16.51 mainModule Main 34.28/16.51 module Main where { 34.28/16.51 import qualified Prelude; 34.28/16.51 } 34.28/16.51 34.28/16.51 ---------------------------------------- 34.28/16.51 34.28/16.51 (1) BR (EQUIVALENT) 34.28/16.51 Replaced joker patterns by fresh variables and removed binding patterns. 34.28/16.51 ---------------------------------------- 34.28/16.51 34.28/16.51 (2) 34.28/16.51 Obligation: 34.28/16.51 mainModule Main 34.28/16.51 module Main where { 34.28/16.51 import qualified Prelude; 34.28/16.51 } 34.28/16.51 34.28/16.51 ---------------------------------------- 34.28/16.51 34.28/16.51 (3) COR (EQUIVALENT) 34.28/16.51 Cond Reductions: 34.28/16.51 The following Function with conditions 34.28/16.51 "takeWhile p [] = []; 34.28/16.51 takeWhile p (x : xs)|p xx : takeWhile p xs|otherwise[]; 34.28/16.51 " 34.28/16.51 is transformed to 34.28/16.51 "takeWhile p [] = takeWhile3 p []; 34.28/16.51 takeWhile p (x : xs) = takeWhile2 p (x : xs); 34.28/16.51 " 34.28/16.51 "takeWhile0 p x xs True = []; 34.28/16.51 " 34.28/16.51 "takeWhile1 p x xs True = x : takeWhile p xs; 34.28/16.51 takeWhile1 p x xs False = takeWhile0 p x xs otherwise; 34.28/16.51 " 34.28/16.51 "takeWhile2 p (x : xs) = takeWhile1 p x xs (p x); 34.28/16.51 " 34.28/16.51 "takeWhile3 p [] = []; 34.28/16.51 takeWhile3 vz wu = takeWhile2 vz wu; 34.28/16.51 " 34.28/16.51 The following Function with conditions 34.28/16.51 "undefined |Falseundefined; popout

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52