Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell pair #487598220
details
property
value
status
complete
benchmark
maximum_3.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n109.star.cs.uiowa.edu
space
basic_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
8.74734091759 seconds
cpu usage
10.86903479
max memory
6.44169728E8
stage attributes
key
value
output-size
50446
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.hs /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/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 ---------------------------------------- (0) Obligation: mainModule Main module Main where { import qualified Prelude; data Main.Char = Char 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 Ordering = LT | EQ | GT ; compareChar :: Main.Char -> Main.Char -> Ordering; compareChar = primCmpChar; esEsOrdering :: Ordering -> Ordering -> MyBool; esEsOrdering LT LT = MyTrue; esEsOrdering LT EQ = MyFalse; esEsOrdering LT GT = MyFalse; esEsOrdering EQ LT = MyFalse; esEsOrdering EQ EQ = MyTrue; esEsOrdering EQ GT = MyFalse; esEsOrdering GT LT = MyFalse; esEsOrdering GT EQ = MyFalse; esEsOrdering GT GT = MyTrue; 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; fsEsOrdering :: Ordering -> Ordering -> MyBool; fsEsOrdering x y = not (esEsOrdering x y); ltEsChar :: Main.Char -> Main.Char -> MyBool; ltEsChar x y = fsEsOrdering (compareChar x y) GT; max0 x y MyTrue = x; max1 x y MyTrue = y; max1 x y MyFalse = max0 x y otherwise; max2 x y = max1 x y (ltEsChar x y); maxChar :: Main.Char -> Main.Char -> Main.Char; maxChar x y = max2 x y; maximumChar :: List Main.Char -> Main.Char; maximumChar = foldl1 maxChar; not :: MyBool -> MyBool; not MyTrue = MyFalse; not MyFalse = MyTrue; otherwise :: MyBool; otherwise = MyTrue; primCmpChar :: Main.Char -> Main.Char -> Ordering; primCmpChar (Main.Char x) (Main.Char y) = primCmpInt x y;
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell