details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	6.59551 seconds
cpu usage	18.5058
user time	17.9605
system time	0.545324
max virtual memory	1.8285568E7
max residence set size	1301828.0

stage attributes

key	value
starexec-result	YES

output

15.85/5.86 YES 18.21/6.52 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 18.21/6.52 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 18.21/6.52 18.21/6.52 18.21/6.52 H-Termination with start terms of the given HASKELL could be proven: 18.21/6.52 18.21/6.52 (0) HASKELL 18.21/6.52 (1) BR [EQUIVALENT, 0 ms] 18.21/6.52 (2) HASKELL 18.21/6.52 (3) COR [EQUIVALENT, 0 ms] 18.21/6.52 (4) HASKELL 18.21/6.52 (5) Narrow [SOUND, 0 ms] 18.21/6.52 (6) AND 18.21/6.52 (7) QDP 18.21/6.52 (8) TransformationProof [EQUIVALENT, 0 ms] 18.21/6.52 (9) QDP 18.21/6.52 (10) QDPSizeChangeProof [EQUIVALENT, 0 ms] 18.21/6.52 (11) YES 18.21/6.52 (12) QDP 18.21/6.52 (13) QDPSizeChangeProof [EQUIVALENT, 0 ms] 18.21/6.52 (14) YES 18.21/6.52 (15) QDP 18.21/6.52 (16) QDPSizeChangeProof [EQUIVALENT, 0 ms] 18.21/6.52 (17) YES 18.21/6.52 (18) QDP 18.21/6.52 (19) TransformationProof [EQUIVALENT, 0 ms] 18.21/6.52 (20) QDP 18.21/6.52 (21) UsableRulesProof [EQUIVALENT, 0 ms] 18.21/6.52 (22) QDP 18.21/6.52 (23) QReductionProof [EQUIVALENT, 0 ms] 18.21/6.52 (24) QDP 18.21/6.52 (25) TransformationProof [EQUIVALENT, 0 ms] 18.21/6.52 (26) QDP 18.21/6.52 (27) UsableRulesProof [EQUIVALENT, 0 ms] 18.21/6.52 (28) QDP 18.21/6.52 (29) QReductionProof [EQUIVALENT, 0 ms] 18.21/6.52 (30) QDP 18.21/6.52 (31) TransformationProof [EQUIVALENT, 0 ms] 18.21/6.52 (32) QDP 18.21/6.52 (33) TransformationProof [EQUIVALENT, 0 ms] 18.21/6.52 (34) QDP 18.21/6.52 (35) QDPSizeChangeProof [EQUIVALENT, 0 ms] 18.21/6.52 (36) YES 18.21/6.52 (37) QDP 18.21/6.52 (38) QDPSizeChangeProof [EQUIVALENT, 0 ms] 18.21/6.52 (39) YES 18.21/6.52 (40) QDP 18.21/6.52 (41) QDPSizeChangeProof [EQUIVALENT, 0 ms] 18.21/6.52 (42) YES 18.21/6.52 (43) QDP 18.21/6.52 (44) QDPSizeChangeProof [EQUIVALENT, 0 ms] 18.21/6.52 (45) YES 18.21/6.52 18.21/6.52 18.21/6.52 ---------------------------------------- 18.21/6.52 18.21/6.52 (0) 18.21/6.52 Obligation: 18.21/6.52 mainModule Main 18.21/6.52 module Main where { 18.21/6.52 import qualified Prelude; 18.21/6.52 data Main.Char = Char MyInt ; 18.21/6.52 18.21/6.52 data Integer = Integer MyInt ; 18.21/6.52 18.21/6.52 data List a = Cons a (List a) | Nil ; 18.21/6.52 18.21/6.52 data MyBool = MyTrue | MyFalse ; 18.21/6.52 18.21/6.52 data MyInt = Pos Main.Nat | Neg Main.Nat ; 18.21/6.52 18.21/6.52 data Main.Nat = Succ Main.Nat | Zero ; 18.21/6.52 18.21/6.52 data Ordering = LT | EQ | GT ; 18.21/6.52 18.21/6.52 data Tup2 b a = Tup2 b a ; 18.21/6.52 18.21/6.52 asAs :: MyBool -> MyBool -> MyBool; 18.21/6.52 asAs MyFalse x = MyFalse; 18.21/6.52 asAs MyTrue x = x; 18.21/6.52 18.21/6.52 compareChar :: Main.Char -> Main.Char -> Ordering; 18.21/6.52 compareChar = primCmpChar; 18.21/6.52 18.21/6.52 concat :: List (List a) -> List a; 18.21/6.52 concat = foldr psPs Nil; 18.21/6.52 18.21/6.52 concatMap :: (b -> List a) -> List b -> List a; 18.21/6.52 concatMap f = pt concat (map f); 18.21/6.52 18.21/6.52 esEsOrdering :: Ordering -> Ordering -> MyBool; 18.21/6.52 esEsOrdering LT LT = MyTrue; 18.21/6.52 esEsOrdering LT EQ = MyFalse; 18.21/6.52 esEsOrdering LT GT = MyFalse; 18.21/6.52 esEsOrdering EQ LT = MyFalse; 18.21/6.52 esEsOrdering EQ EQ = MyTrue; 18.21/6.52 esEsOrdering EQ GT = MyFalse; 18.21/6.52 esEsOrdering GT LT = MyFalse; 18.21/6.52 esEsOrdering GT EQ = MyFalse; popout

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52