Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell 2019-04-01 06.52 pair #433317011
details
property
value
status
complete
benchmark
Prelude_enumFrom_3.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n130.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
15.9558 seconds
cpu usage
30.8204
user time
29.4115
system time
1.40882
max virtual memory
1.8286028E7
max residence set size
4137604.0
stage attributes
key
value
starexec-result
YES
output
28.46/15.34 YES 30.71/15.90 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 30.71/15.90 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 30.71/15.90 30.71/15.90 30.71/15.90 H-Termination with start terms of the given HASKELL could be proven: 30.71/15.90 30.71/15.90 (0) HASKELL 30.71/15.90 (1) BR [EQUIVALENT, 0 ms] 30.71/15.90 (2) HASKELL 30.71/15.90 (3) COR [EQUIVALENT, 0 ms] 30.71/15.90 (4) HASKELL 30.71/15.90 (5) NumRed [SOUND, 0 ms] 30.71/15.90 (6) HASKELL 30.71/15.90 (7) Narrow [SOUND, 0 ms] 30.71/15.90 (8) QDP 30.71/15.90 (9) QDPPairToRuleProof [EQUIVALENT, 0 ms] 30.71/15.90 (10) AND 30.71/15.90 (11) QDP 30.71/15.90 (12) DependencyGraphProof [EQUIVALENT, 0 ms] 30.71/15.90 (13) QDP 30.71/15.90 (14) TransformationProof [EQUIVALENT, 0 ms] 30.71/15.90 (15) QDP 30.71/15.90 (16) UsableRulesProof [EQUIVALENT, 0 ms] 30.71/15.90 (17) QDP 30.71/15.90 (18) QReductionProof [EQUIVALENT, 0 ms] 30.71/15.90 (19) QDP 30.71/15.90 (20) InductionCalculusProof [EQUIVALENT, 0 ms] 30.71/15.90 (21) QDP 30.71/15.90 (22) NonInfProof [EQUIVALENT, 33 ms] 30.71/15.90 (23) AND 30.71/15.90 (24) QDP 30.71/15.90 (25) DependencyGraphProof [EQUIVALENT, 0 ms] 30.71/15.90 (26) TRUE 30.71/15.90 (27) QDP 30.71/15.90 (28) DependencyGraphProof [EQUIVALENT, 0 ms] 30.71/15.90 (29) TRUE 30.71/15.90 (30) QDP 30.71/15.90 (31) QDPSizeChangeProof [EQUIVALENT, 0 ms] 30.71/15.90 (32) YES 30.71/15.90 30.71/15.90 30.71/15.90 ---------------------------------------- 30.71/15.90 30.71/15.90 (0) 30.71/15.90 Obligation: 30.71/15.90 mainModule Main 30.71/15.90 module Main where { 30.71/15.90 import qualified Prelude; 30.71/15.90 } 30.71/15.90 30.71/15.90 ---------------------------------------- 30.71/15.90 30.71/15.90 (1) BR (EQUIVALENT) 30.71/15.90 Replaced joker patterns by fresh variables and removed binding patterns. 30.71/15.90 ---------------------------------------- 30.71/15.90 30.71/15.90 (2) 30.71/15.90 Obligation: 30.71/15.90 mainModule Main 30.71/15.90 module Main where { 30.71/15.90 import qualified Prelude; 30.71/15.90 } 30.71/15.90 30.71/15.90 ---------------------------------------- 30.71/15.90 30.71/15.90 (3) COR (EQUIVALENT) 30.71/15.90 Cond Reductions: 30.71/15.90 The following Function with conditions 30.71/15.90 "takeWhile p [] = []; 30.71/15.90 takeWhile p (x : xs)|p xx : takeWhile p xs|otherwise[]; 30.71/15.90 " 30.71/15.90 is transformed to 30.71/15.90 "takeWhile p [] = takeWhile3 p []; 30.71/15.90 takeWhile p (x : xs) = takeWhile2 p (x : xs); 30.71/15.90 " 30.71/15.90 "takeWhile1 p x xs True = x : takeWhile p xs; 30.71/15.90 takeWhile1 p x xs False = takeWhile0 p x xs otherwise; 30.71/15.90 " 30.71/15.90 "takeWhile0 p x xs True = []; 30.71/15.90 " 30.71/15.90 "takeWhile2 p (x : xs) = takeWhile1 p x xs (p x); 30.71/15.90 " 30.71/15.90 "takeWhile3 p [] = []; 30.71/15.90 takeWhile3 vz wu = takeWhile2 vz wu; 30.71/15.90 " 30.71/15.90 The following Function with conditions 30.71/15.90 "undefined |Falseundefined; 30.71/15.90 " 30.71/15.90 is transformed to 30.71/15.90 "undefined = undefined1; 30.71/15.90 " 30.71/15.90 "undefined0 True = undefined; 30.71/15.90 " 30.71/15.90 "undefined1 = undefined0 False; 30.71/15.90 " 30.71/15.90 30.71/15.90 ---------------------------------------- 30.71/15.90 30.71/15.90 (4)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell 2019-04-01 06.52