Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell pair #487598330
details
property
value
status
complete
benchmark
ceiling_1.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n146.star.cs.uiowa.edu
space
basic_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
7.29910683632 seconds
cpu usage
20.26170287
max memory
1.326997504E9
stage attributes
key
value
output-size
277504
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) QDPOrderProof [EQUIVALENT, 0 ms] (9) QDP (10) DependencyGraphProof [EQUIVALENT, 0 ms] (11) QDP (12) QDPSizeChangeProof [EQUIVALENT, 0 ms] (13) YES (14) QDP (15) QDPSizeChangeProof [EQUIVALENT, 0 ms] (16) YES (17) QDP (18) DependencyGraphProof [EQUIVALENT, 0 ms] (19) QDP (20) QDPOrderProof [EQUIVALENT, 0 ms] (21) QDP (22) DependencyGraphProof [EQUIVALENT, 0 ms] (23) QDP (24) QDPSizeChangeProof [EQUIVALENT, 0 ms] (25) YES ---------------------------------------- (0) Obligation: mainModule Main module Main where { import qualified Prelude; data Integer = Integer MyInt ; data MyBool = MyTrue | MyFalse ; data MyInt = Pos Main.Nat | Neg Main.Nat ; data Main.Nat = Succ Main.Nat | Zero ; data Ordering = LT | EQ | GT ; data Ratio a = CnPc a a ; data Tup2 b a = Tup2 b a ; ceilingCeiling0 xv MyTrue = psMyInt (ceilingN xv) (fromIntMyInt (Main.Pos (Main.Succ Main.Zero))); ceilingCeiling0 xv MyFalse = ceilingN xv; ceilingN xv = ceilingN0 xv (ceilingVu8 xv); ceilingN0 xv (Tup2 n vw) = n; ceilingR xv = ceilingR0 xv (ceilingVu8 xv); ceilingR0 xv (Tup2 vv r) = r; ceilingRatio :: Ratio MyInt -> MyInt; ceilingRatio x = ceilingCeiling0 x (gtRatio (ceilingR x) (fromIntRatio (Main.Pos Main.Zero))); ceilingVu8 xv = properFractionRatio xv; compareMyInt :: MyInt -> MyInt -> Ordering; compareMyInt = primCmpInt; compareRatio :: Ratio MyInt -> Ratio MyInt -> Ordering; compareRatio (CnPc x y) (CnPc x' y') = compareMyInt (srMyInt x y') (srMyInt x' y); error :: a; error = stop MyTrue; 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; fromIntMyInt :: MyInt -> MyInt; fromIntMyInt x = x;
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell