details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	16.2688 seconds
cpu usage	32.0626
user time	30.6534
system time	1.40921
max virtual memory	1.8353612E7
max residence set size	4131352.0

stage attributes

key	value
starexec-result	YES

output

29.48/15.63 YES 31.93/16.19 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 31.93/16.19 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 31.93/16.19 31.93/16.19 31.93/16.19 H-Termination with start terms of the given HASKELL could be proven: 31.93/16.19 31.93/16.19 (0) HASKELL 31.93/16.19 (1) BR [EQUIVALENT, 0 ms] 31.93/16.19 (2) HASKELL 31.93/16.19 (3) COR [EQUIVALENT, 0 ms] 31.93/16.19 (4) HASKELL 31.93/16.19 (5) Narrow [SOUND, 0 ms] 31.93/16.19 (6) QDP 31.93/16.19 (7) DependencyGraphProof [EQUIVALENT, 0 ms] 31.93/16.19 (8) AND 31.93/16.19 (9) QDP 31.93/16.19 (10) MRRProof [EQUIVALENT, 88 ms] 31.93/16.19 (11) QDP 31.93/16.19 (12) TransformationProof [EQUIVALENT, 0 ms] 31.93/16.19 (13) QDP 31.93/16.19 (14) QReductionProof [EQUIVALENT, 0 ms] 31.93/16.19 (15) QDP 31.93/16.19 (16) TransformationProof [EQUIVALENT, 0 ms] 31.93/16.19 (17) QDP 31.93/16.19 (18) TransformationProof [EQUIVALENT, 0 ms] 31.93/16.19 (19) QDP 31.93/16.19 (20) UsableRulesProof [EQUIVALENT, 0 ms] 31.93/16.19 (21) QDP 31.93/16.19 (22) QReductionProof [EQUIVALENT, 0 ms] 31.93/16.19 (23) QDP 31.93/16.19 (24) TransformationProof [EQUIVALENT, 0 ms] 31.93/16.19 (25) QDP 31.93/16.19 (26) UsableRulesProof [EQUIVALENT, 0 ms] 31.93/16.19 (27) QDP 31.93/16.19 (28) QReductionProof [EQUIVALENT, 0 ms] 31.93/16.19 (29) QDP 31.93/16.19 (30) QDPOrderProof [EQUIVALENT, 20 ms] 31.93/16.19 (31) QDP 31.93/16.19 (32) TransformationProof [EQUIVALENT, 0 ms] 31.93/16.19 (33) QDP 31.93/16.19 (34) DependencyGraphProof [EQUIVALENT, 0 ms] 31.93/16.19 (35) TRUE 31.93/16.19 (36) QDP 31.93/16.19 (37) QDPPairToRuleProof [EQUIVALENT, 0 ms] 31.93/16.19 (38) AND 31.93/16.19 (39) QDP 31.93/16.19 (40) TransformationProof [EQUIVALENT, 1 ms] 31.93/16.19 (41) QDP 31.93/16.19 (42) DependencyGraphProof [EQUIVALENT, 0 ms] 31.93/16.19 (43) QDP 31.93/16.19 (44) UsableRulesProof [EQUIVALENT, 0 ms] 31.93/16.19 (45) QDP 31.93/16.19 (46) QReductionProof [EQUIVALENT, 0 ms] 31.93/16.19 (47) QDP 31.93/16.19 (48) InductionCalculusProof [EQUIVALENT, 0 ms] 31.93/16.19 (49) QDP 31.93/16.19 (50) NonInfProof [EQUIVALENT, 115 ms] 31.93/16.19 (51) QDP 31.93/16.19 (52) DependencyGraphProof [EQUIVALENT, 0 ms] 31.93/16.19 (53) TRUE 31.93/16.19 (54) QDP 31.93/16.19 (55) QDPSizeChangeProof [EQUIVALENT, 0 ms] 31.93/16.19 (56) YES 31.93/16.19 (57) QDP 31.93/16.19 (58) QDPSizeChangeProof [EQUIVALENT, 0 ms] 31.93/16.19 (59) YES 31.93/16.19 (60) QDP 31.93/16.19 (61) QDPSizeChangeProof [EQUIVALENT, 0 ms] 31.93/16.19 (62) YES 31.93/16.19 31.93/16.19 31.93/16.19 ---------------------------------------- 31.93/16.19 31.93/16.19 (0) 31.93/16.19 Obligation: 31.93/16.19 mainModule Main 31.93/16.19 module Main where { 31.93/16.19 import qualified Prelude; 31.93/16.19 data List a = Cons a (List a) | Nil ; 31.93/16.19 31.93/16.19 data MyBool = MyTrue | MyFalse ; 31.93/16.19 31.93/16.19 data MyInt = Pos Main.Nat | Neg Main.Nat ; 31.93/16.19 31.93/16.19 data Main.Nat = Succ Main.Nat | Zero ; 31.93/16.19 31.93/16.19 data Ordering = LT | EQ | GT ; 31.93/16.19 31.93/16.19 data Tup2 a b = Tup2 a b ; 31.93/16.19 31.93/16.19 data Main.WHNF a = WHNF a ; 31.93/16.19 31.93/16.19 compareMyInt :: MyInt -> MyInt -> Ordering; 31.93/16.19 compareMyInt = primCmpInt; 31.93/16.19 31.93/16.19 dsEm :: (b -> a) -> b -> a; 31.93/16.19 dsEm f x = Main.seq x (f x); 31.93/16.19 31.93/16.19 enforceWHNF :: Main.WHNF a -> b -> b; popout

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52