Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell 2019-04-01 06.52 pair #433317489
details
property
value
status
complete
benchmark
enumFromTo_6.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n073.star.cs.uiowa.edu
space
basic_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
16.1728 seconds
cpu usage
32.4254
user time
31.0068
system time
1.41854
max virtual memory
1.8353612E7
max residence set size
4142180.0
stage attributes
key
value
starexec-result
YES
output
29.56/15.48 YES 32.31/16.10 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 32.31/16.10 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 32.31/16.10 32.31/16.10 32.31/16.10 H-Termination with start terms of the given HASKELL could be proven: 32.31/16.10 32.31/16.10 (0) HASKELL 32.31/16.10 (1) BR [EQUIVALENT, 0 ms] 32.31/16.10 (2) HASKELL 32.31/16.10 (3) COR [EQUIVALENT, 0 ms] 32.31/16.10 (4) HASKELL 32.31/16.10 (5) Narrow [SOUND, 0 ms] 32.31/16.10 (6) QDP 32.31/16.10 (7) DependencyGraphProof [EQUIVALENT, 0 ms] 32.31/16.10 (8) AND 32.31/16.10 (9) QDP 32.31/16.10 (10) MRRProof [EQUIVALENT, 97 ms] 32.31/16.10 (11) QDP 32.31/16.10 (12) TransformationProof [EQUIVALENT, 0 ms] 32.31/16.10 (13) QDP 32.31/16.10 (14) QReductionProof [EQUIVALENT, 0 ms] 32.31/16.10 (15) QDP 32.31/16.10 (16) TransformationProof [EQUIVALENT, 0 ms] 32.31/16.10 (17) QDP 32.31/16.10 (18) TransformationProof [EQUIVALENT, 0 ms] 32.31/16.10 (19) QDP 32.31/16.10 (20) UsableRulesProof [EQUIVALENT, 0 ms] 32.31/16.10 (21) QDP 32.31/16.10 (22) QReductionProof [EQUIVALENT, 0 ms] 32.31/16.10 (23) QDP 32.31/16.10 (24) TransformationProof [EQUIVALENT, 0 ms] 32.31/16.10 (25) QDP 32.31/16.10 (26) UsableRulesProof [EQUIVALENT, 0 ms] 32.31/16.10 (27) QDP 32.31/16.10 (28) QReductionProof [EQUIVALENT, 0 ms] 32.31/16.10 (29) QDP 32.31/16.10 (30) QDPOrderProof [EQUIVALENT, 35 ms] 32.31/16.10 (31) QDP 32.31/16.10 (32) TransformationProof [EQUIVALENT, 0 ms] 32.31/16.10 (33) QDP 32.31/16.10 (34) DependencyGraphProof [EQUIVALENT, 0 ms] 32.31/16.10 (35) TRUE 32.31/16.10 (36) QDP 32.31/16.10 (37) QDPPairToRuleProof [EQUIVALENT, 0 ms] 32.31/16.10 (38) AND 32.31/16.10 (39) QDP 32.31/16.10 (40) TransformationProof [EQUIVALENT, 0 ms] 32.31/16.10 (41) QDP 32.31/16.10 (42) DependencyGraphProof [EQUIVALENT, 0 ms] 32.31/16.10 (43) QDP 32.31/16.10 (44) UsableRulesProof [EQUIVALENT, 0 ms] 32.31/16.10 (45) QDP 32.31/16.10 (46) QReductionProof [EQUIVALENT, 0 ms] 32.31/16.10 (47) QDP 32.31/16.10 (48) InductionCalculusProof [EQUIVALENT, 0 ms] 32.31/16.10 (49) QDP 32.31/16.10 (50) NonInfProof [EQUIVALENT, 116 ms] 32.31/16.10 (51) QDP 32.31/16.10 (52) DependencyGraphProof [EQUIVALENT, 0 ms] 32.31/16.10 (53) TRUE 32.31/16.10 (54) QDP 32.31/16.10 (55) QDPSizeChangeProof [EQUIVALENT, 0 ms] 32.31/16.10 (56) YES 32.31/16.10 (57) QDP 32.31/16.10 (58) QDPSizeChangeProof [EQUIVALENT, 0 ms] 32.31/16.10 (59) YES 32.31/16.10 (60) QDP 32.31/16.10 (61) QDPSizeChangeProof [EQUIVALENT, 0 ms] 32.31/16.10 (62) YES 32.31/16.10 32.31/16.10 32.31/16.10 ---------------------------------------- 32.31/16.10 32.31/16.10 (0) 32.31/16.10 Obligation: 32.31/16.10 mainModule Main 32.31/16.10 module Main where { 32.31/16.10 import qualified Prelude; 32.31/16.10 data List a = Cons a (List a) | Nil ; 32.31/16.10 32.31/16.10 data MyBool = MyTrue | MyFalse ; 32.31/16.10 32.31/16.10 data MyInt = Pos Main.Nat | Neg Main.Nat ; 32.31/16.10 32.31/16.10 data Main.Nat = Succ Main.Nat | Zero ; 32.31/16.10 32.31/16.10 data Ordering = LT | EQ | GT ; 32.31/16.10 32.31/16.10 data Main.WHNF a = WHNF a ; 32.31/16.10 32.31/16.10 compareMyInt :: MyInt -> MyInt -> Ordering; 32.31/16.10 compareMyInt = primCmpInt; 32.31/16.10 32.31/16.10 dsEm :: (a -> b) -> a -> b; 32.31/16.10 dsEm f x = Main.seq x (f x); 32.31/16.10 32.31/16.10 enforceWHNF :: Main.WHNF b -> a -> a; 32.31/16.10 enforceWHNF (Main.WHNF x) y = y; 32.31/16.10
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell 2019-04-01 06.52