Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell pair #487598357
details
property
value
status
complete
benchmark
readInt_1.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n078.star.cs.uiowa.edu
space
basic_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
7.32405686378 seconds
cpu usage
12.510360976
max memory
6.54516224E8
stage attributes
key
value
output-size
71198
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.hs /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/benchmark/theBenchmark.hs # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty H-Termination with start terms of the given HASKELL could be proven: (0) HASKELL (1) BR [EQUIVALENT, 0 ms] (2) HASKELL (3) COR [EQUIVALENT, 0 ms] (4) HASKELL (5) Narrow [SOUND, 0 ms] (6) AND (7) QDP (8) QDPSizeChangeProof [EQUIVALENT, 0 ms] (9) YES (10) QDP (11) QDPSizeChangeProof [EQUIVALENT, 0 ms] (12) YES (13) QDP (14) QDPSizeChangeProof [EQUIVALENT, 0 ms] (15) YES (16) QDP (17) QDPSizeChangeProof [EQUIVALENT, 0 ms] (18) YES (19) QDP (20) TransformationProof [EQUIVALENT, 0 ms] (21) QDP (22) QDPSizeChangeProof [EQUIVALENT, 0 ms] (23) YES ---------------------------------------- (0) Obligation: mainModule Main module Main where { import qualified Prelude; data Main.Char = Char MyInt ; data Integer = Integer MyInt ; data List a = Cons a (List a) | Nil ; data MyBool = MyTrue | MyFalse ; data MyInt = Pos Main.Nat | Neg Main.Nat ; data Main.Nat = Succ Main.Nat | Zero ; data Tup2 a b = Tup2 a b ; concat :: List (List a) -> List a; concat = foldr psPs Nil; concatMap :: (b -> List a) -> List b -> List a; concatMap f = pt concat (map f); foldl :: (b -> a -> b) -> b -> List a -> b; foldl f z Nil = z; foldl f z (Cons x xs) = foldl f (f z x) xs; foldl1 :: (a -> a -> a) -> List a -> a; foldl1 f (Cons x xs) = foldl f x xs; foldr :: (a -> b -> b) -> b -> List a -> b; foldr f z Nil = z; foldr f z (Cons x xs) = f x (foldr f z xs); fromIntegerMyInt :: Integer -> MyInt; fromIntegerMyInt (Integer x) = x; fromIntegral = pt fromIntegerMyInt toIntegerMyInt; map :: (a -> b) -> List a -> List b; map f Nil = Nil; map f (Cons x xs) = Cons (f x) (map f xs); nonnull :: (Main.Char -> MyBool) -> List Main.Char -> List (Tup2 (List Main.Char) (List Main.Char)); nonnull p s = concatMap nonnull0 (Cons (span p s) Nil); nonnull0 vu68 = nonnull00 vu68; nonnull00 (Tup2 (Cons vy vz) t) = Cons (Tup2 (Cons vy vz) t) Nil; nonnull00 wu = Nil; otherwise :: MyBool; otherwise = MyTrue; primMinusNat :: Main.Nat -> Main.Nat -> MyInt; primMinusNat Main.Zero Main.Zero = Main.Pos Main.Zero; primMinusNat Main.Zero (Main.Succ y) = Main.Neg (Main.Succ y);
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell