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	n078.star.cs.uiowa.edu
space	basic_haskell

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	7.24556 seconds
cpu usage	20.5687
user time	20.065
system time	0.503641
max virtual memory	1.8353612E7
max residence set size	1273100.0

stage attributes

key	value
starexec-result	YES

output

17.97/6.52 YES 20.21/7.19 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 20.21/7.19 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 20.21/7.19 20.21/7.19 20.21/7.19 H-Termination with start terms of the given HASKELL could be proven: 20.21/7.19 20.21/7.19 (0) HASKELL 20.21/7.19 (1) BR [EQUIVALENT, 0 ms] 20.21/7.19 (2) HASKELL 20.21/7.19 (3) COR [EQUIVALENT, 0 ms] 20.21/7.19 (4) HASKELL 20.21/7.19 (5) Narrow [SOUND, 0 ms] 20.21/7.19 (6) AND 20.21/7.19 (7) QDP 20.21/7.19 (8) QDPOrderProof [EQUIVALENT, 17 ms] 20.21/7.19 (9) QDP 20.21/7.19 (10) DependencyGraphProof [EQUIVALENT, 0 ms] 20.21/7.19 (11) QDP 20.21/7.19 (12) QDPSizeChangeProof [EQUIVALENT, 0 ms] 20.21/7.19 (13) YES 20.21/7.19 (14) QDP 20.21/7.19 (15) QDPSizeChangeProof [EQUIVALENT, 0 ms] 20.21/7.19 (16) YES 20.21/7.19 (17) QDP 20.21/7.19 (18) DependencyGraphProof [EQUIVALENT, 0 ms] 20.21/7.19 (19) QDP 20.21/7.19 (20) QDPOrderProof [EQUIVALENT, 10 ms] 20.21/7.19 (21) QDP 20.21/7.19 (22) DependencyGraphProof [EQUIVALENT, 0 ms] 20.21/7.19 (23) QDP 20.21/7.19 (24) QDPSizeChangeProof [EQUIVALENT, 0 ms] 20.21/7.19 (25) YES 20.21/7.19 20.21/7.19 20.21/7.19 ---------------------------------------- 20.21/7.19 20.21/7.19 (0) 20.21/7.19 Obligation: 20.21/7.19 mainModule Main 20.21/7.19 module Main where { 20.21/7.19 import qualified Prelude; 20.21/7.19 data Integer = Integer MyInt ; 20.21/7.19 20.21/7.19 data MyBool = MyTrue | MyFalse ; 20.21/7.19 20.21/7.19 data MyInt = Pos Main.Nat | Neg Main.Nat ; 20.21/7.19 20.21/7.19 data Main.Nat = Succ Main.Nat | Zero ; 20.21/7.19 20.21/7.19 data Ordering = LT | EQ | GT ; 20.21/7.19 20.21/7.19 data Ratio a = CnPc a a ; 20.21/7.19 20.21/7.19 data Tup2 a b = Tup2 a b ; 20.21/7.19 20.21/7.19 ceilingCeiling0 xv MyTrue = psMyInt (ceilingN xv) (fromIntMyInt (Main.Pos (Main.Succ Main.Zero))); 20.21/7.19 ceilingCeiling0 xv MyFalse = ceilingN xv; 20.21/7.19 20.21/7.19 ceilingN xv = ceilingN0 xv (ceilingVu8 xv); 20.21/7.19 20.21/7.19 ceilingN0 xv (Tup2 n vw) = n; 20.21/7.19 20.21/7.19 ceilingR xv = ceilingR0 xv (ceilingVu8 xv); 20.21/7.19 20.21/7.19 ceilingR0 xv (Tup2 vv r) = r; 20.21/7.19 20.21/7.19 ceilingRatio :: Ratio MyInt -> MyInt; 20.21/7.19 ceilingRatio x = ceilingCeiling0 x (gtRatio (ceilingR x) (fromIntRatio (Main.Pos Main.Zero))); 20.21/7.19 20.21/7.19 ceilingVu8 xv = properFractionRatio xv; 20.21/7.19 20.21/7.19 compareMyInt :: MyInt -> MyInt -> Ordering; 20.21/7.19 compareMyInt = primCmpInt; 20.21/7.19 20.21/7.19 compareRatio :: Ratio MyInt -> Ratio MyInt -> Ordering; 20.21/7.19 compareRatio (CnPc x y) (CnPc x' y') = compareMyInt (srMyInt x y') (srMyInt x' y); 20.21/7.19 20.21/7.19 error :: a; 20.21/7.19 error = stop MyTrue; 20.21/7.19 20.21/7.19 esEsOrdering :: Ordering -> Ordering -> MyBool; 20.21/7.19 esEsOrdering LT LT = MyTrue; 20.21/7.19 esEsOrdering LT EQ = MyFalse; 20.21/7.19 esEsOrdering LT GT = MyFalse; 20.21/7.19 esEsOrdering EQ LT = MyFalse; 20.21/7.19 esEsOrdering EQ EQ = MyTrue; 20.21/7.19 esEsOrdering EQ GT = MyFalse; 20.21/7.19 esEsOrdering GT LT = MyFalse; 20.21/7.19 esEsOrdering GT EQ = MyFalse; 20.21/7.19 esEsOrdering GT GT = MyTrue; 20.21/7.19 20.21/7.19 fromIntMyInt :: MyInt -> MyInt; 20.21/7.19 fromIntMyInt x = x; 20.21/7.19 20.21/7.19 fromIntRatio :: MyInt -> Ratio MyInt; 20.21/7.19 fromIntRatio = intToRatio; 20.21/7.19 20.21/7.19 fromIntegerMyInt :: Integer -> MyInt; 20.21/7.19 fromIntegerMyInt (Integer x) = x; popout

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52