details

property	value
status	complete
benchmark	splitAt_1.hs
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n112.star.cs.uiowa.edu
space	basic_haskell

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.26448 seconds
cpu usage	10.3333
user time	10.0298
system time	0.303533
max virtual memory	1.8285568E7
max residence set size	612876.0

stage attributes

key	value
starexec-result	YES

output

8.05/3.65 YES 9.90/4.21 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 9.90/4.21 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 9.90/4.21 9.90/4.21 9.90/4.21 H-Termination with start terms of the given HASKELL could be proven: 9.90/4.21 9.90/4.21 (0) HASKELL 9.90/4.21 (1) BR [EQUIVALENT, 0 ms] 9.90/4.21 (2) HASKELL 9.90/4.21 (3) COR [EQUIVALENT, 0 ms] 9.90/4.21 (4) HASKELL 9.90/4.21 (5) Narrow [SOUND, 0 ms] 9.90/4.21 (6) QDP 9.90/4.21 (7) TransformationProof [EQUIVALENT, 0 ms] 9.90/4.21 (8) QDP 9.90/4.21 (9) DependencyGraphProof [EQUIVALENT, 0 ms] 9.90/4.21 (10) QDP 9.90/4.21 (11) TransformationProof [EQUIVALENT, 0 ms] 9.90/4.21 (12) QDP 9.90/4.21 (13) DependencyGraphProof [EQUIVALENT, 0 ms] 9.90/4.21 (14) QDP 9.90/4.21 (15) UsableRulesProof [EQUIVALENT, 0 ms] 9.90/4.21 (16) QDP 9.90/4.21 (17) QReductionProof [EQUIVALENT, 0 ms] 9.90/4.21 (18) QDP 9.90/4.21 (19) QDPSizeChangeProof [EQUIVALENT, 0 ms] 9.90/4.21 (20) YES 9.90/4.21 9.90/4.21 9.90/4.21 ---------------------------------------- 9.90/4.21 9.90/4.21 (0) 9.90/4.21 Obligation: 9.90/4.21 mainModule Main 9.90/4.21 module Main where { 9.90/4.21 import qualified Prelude; 9.90/4.21 data List a = Cons a (List a) | Nil ; 9.90/4.21 9.90/4.21 data MyBool = MyTrue | MyFalse ; 9.90/4.21 9.90/4.21 data MyInt = Pos Main.Nat | Neg Main.Nat ; 9.90/4.21 9.90/4.21 data Main.Nat = Succ Main.Nat | Zero ; 9.90/4.21 9.90/4.21 data Ordering = LT | EQ | GT ; 9.90/4.21 9.90/4.21 data Tup2 a b = Tup2 a b ; 9.90/4.21 9.90/4.21 compareMyInt :: MyInt -> MyInt -> Ordering; 9.90/4.21 compareMyInt = primCmpInt; 9.90/4.21 9.90/4.21 esEsOrdering :: Ordering -> Ordering -> MyBool; 9.90/4.21 esEsOrdering LT LT = MyTrue; 9.90/4.21 esEsOrdering LT EQ = MyFalse; 9.90/4.21 esEsOrdering LT GT = MyFalse; 9.90/4.21 esEsOrdering EQ LT = MyFalse; 9.90/4.21 esEsOrdering EQ EQ = MyTrue; 9.90/4.21 esEsOrdering EQ GT = MyFalse; 9.90/4.21 esEsOrdering GT LT = MyFalse; 9.90/4.21 esEsOrdering GT EQ = MyFalse; 9.90/4.21 esEsOrdering GT GT = MyTrue; 9.90/4.21 9.90/4.21 fsEsOrdering :: Ordering -> Ordering -> MyBool; 9.90/4.21 fsEsOrdering x y = not (esEsOrdering x y); 9.90/4.21 9.90/4.21 ltEsMyInt :: MyInt -> MyInt -> MyBool; 9.90/4.21 ltEsMyInt x y = fsEsOrdering (compareMyInt x y) GT; 9.90/4.21 9.90/4.21 msMyInt :: MyInt -> MyInt -> MyInt; 9.90/4.21 msMyInt = primMinusInt; 9.90/4.21 9.90/4.21 not :: MyBool -> MyBool; 9.90/4.21 not MyTrue = MyFalse; 9.90/4.21 not MyFalse = MyTrue; 9.90/4.21 9.90/4.21 primCmpInt :: MyInt -> MyInt -> Ordering; 9.90/4.21 primCmpInt (Main.Pos Main.Zero) (Main.Pos Main.Zero) = EQ; 9.90/4.21 primCmpInt (Main.Pos Main.Zero) (Main.Neg Main.Zero) = EQ; 9.90/4.21 primCmpInt (Main.Neg Main.Zero) (Main.Pos Main.Zero) = EQ; 9.90/4.21 primCmpInt (Main.Neg Main.Zero) (Main.Neg Main.Zero) = EQ; 9.90/4.21 primCmpInt (Main.Pos x) (Main.Pos y) = primCmpNat x y; 9.90/4.21 primCmpInt (Main.Pos x) (Main.Neg y) = GT; 9.90/4.21 primCmpInt (Main.Neg x) (Main.Pos y) = LT; 9.90/4.21 primCmpInt (Main.Neg x) (Main.Neg y) = primCmpNat y x; 9.90/4.21 9.90/4.21 primCmpNat :: Main.Nat -> Main.Nat -> Ordering; 9.90/4.21 primCmpNat Main.Zero Main.Zero = EQ; 9.90/4.21 primCmpNat Main.Zero (Main.Succ y) = LT; 9.90/4.21 primCmpNat (Main.Succ x) Main.Zero = GT; 9.90/4.21 primCmpNat (Main.Succ x) (Main.Succ y) = primCmpNat x y; 9.90/4.21 9.90/4.21 primMinusInt :: MyInt -> MyInt -> MyInt; 9.90/4.21 primMinusInt (Main.Pos x) (Main.Neg y) = Main.Pos (primPlusNat x y); 9.90/4.21 primMinusInt (Main.Neg x) (Main.Pos y) = Main.Neg (primPlusNat x y); 9.90/4.21 primMinusInt (Main.Neg x) (Main.Neg y) = primMinusNat y x; 9.90/4.21 primMinusInt (Main.Pos x) (Main.Pos y) = primMinusNat x y; 9.90/4.21 9.90/4.21 primMinusNat :: Main.Nat -> Main.Nat -> MyInt; 9.90/4.21 primMinusNat Main.Zero Main.Zero = Main.Pos Main.Zero; popout

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52