Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell pair #487598406
details
property
value
status
complete
benchmark
enumFromThen_7.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n077.star.cs.uiowa.edu
space
basic_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
5.26475811005 seconds
cpu usage
14.002760292
max memory
7.62056704E8
stage attributes
key
value
output-size
245517
starexec-result
NO
output
/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.hs /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO 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 disproven: (0) HASKELL (1) BR [EQUIVALENT, 0 ms] (2) HASKELL (3) COR [EQUIVALENT, 0 ms] (4) HASKELL (5) Narrow [COMPLETE, 0 ms] (6) AND (7) QDP (8) PisEmptyProof [EQUIVALENT, 0 ms] (9) YES (10) QDP (11) NonTerminationLoopProof [COMPLETE, 0 ms] (12) NO (13) QDP ---------------------------------------- (0) Obligation: mainModule Main module Main where { import qualified Prelude; 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 ; compareMyInt :: MyInt -> MyInt -> Ordering; compareMyInt = primCmpInt; enumFromThenOrdering :: Ordering -> Ordering -> List Ordering; enumFromThenOrdering x y = enumFromThenToOrdering x y GT; enumFromThenToMyInt :: MyInt -> MyInt -> MyInt -> List MyInt; enumFromThenToMyInt = numericEnumFromThenTo; enumFromThenToOrdering :: Ordering -> Ordering -> Ordering -> List Ordering; enumFromThenToOrdering x y z = map toEnumOrdering (enumFromThenToMyInt (fromEnumOrdering x) (fromEnumOrdering y) (fromEnumOrdering z)); esEsMyInt :: MyInt -> MyInt -> MyBool; esEsMyInt = primEqInt; 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; flip :: (a -> c -> b) -> c -> a -> b; flip f x y = f y x; fromEnumOrdering :: Ordering -> MyInt; fromEnumOrdering LT = Main.Pos Main.Zero; fromEnumOrdering EQ = Main.Pos (Main.Succ Main.Zero); fromEnumOrdering GT = Main.Pos (Main.Succ (Main.Succ Main.Zero)); fsEsOrdering :: Ordering -> Ordering -> MyBool; fsEsOrdering x y = not (esEsOrdering x y); gtEsMyInt :: MyInt -> MyInt -> MyBool; gtEsMyInt x y = fsEsOrdering (compareMyInt x y) LT; iterate :: (a -> a) -> a -> List a; iterate f x = Cons x (iterate f (f x)); ltEsMyInt :: MyInt -> MyInt -> MyBool; ltEsMyInt x y = fsEsOrdering (compareMyInt x y) GT; map :: (b -> a) -> List b -> List a; map f Nil = Nil; map f (Cons x xs) = Cons (f x) (map f xs); msMyInt :: MyInt -> MyInt -> MyInt; msMyInt = primMinusInt; not :: MyBool -> MyBool;
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell