details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.27073 seconds
cpu usage	10.498
user time	10.2018
system time	0.296166
max virtual memory	1.8285568E7
max residence set size	569000.0

stage attributes

key	value
starexec-result	YES

output

8.53/3.69 YES 10.16/4.22 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 10.16/4.22 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 10.16/4.22 10.16/4.22 10.16/4.22 H-Termination with start terms of the given HASKELL could be proven: 10.16/4.22 10.16/4.22 (0) HASKELL 10.16/4.22 (1) BR [EQUIVALENT, 0 ms] 10.16/4.22 (2) HASKELL 10.16/4.22 (3) COR [EQUIVALENT, 0 ms] 10.16/4.22 (4) HASKELL 10.16/4.22 (5) Narrow [SOUND, 0 ms] 10.16/4.22 (6) AND 10.16/4.22 (7) QDP 10.16/4.22 (8) QDPSizeChangeProof [EQUIVALENT, 0 ms] 10.16/4.22 (9) YES 10.16/4.22 (10) QDP 10.16/4.22 (11) QDPSizeChangeProof [EQUIVALENT, 0 ms] 10.16/4.22 (12) YES 10.16/4.22 (13) QDP 10.16/4.22 (14) QDPSizeChangeProof [EQUIVALENT, 0 ms] 10.16/4.22 (15) YES 10.16/4.22 10.16/4.22 10.16/4.22 ---------------------------------------- 10.16/4.22 10.16/4.22 (0) 10.16/4.22 Obligation: 10.16/4.22 mainModule Main 10.16/4.22 module Main where { 10.16/4.22 import qualified Prelude; 10.16/4.22 data MyInt = Pos Main.Nat | Neg Main.Nat ; 10.16/4.22 10.16/4.22 data Main.Nat = Succ Main.Nat | Zero ; 10.16/4.22 10.16/4.22 data Ordering = LT | EQ | GT ; 10.16/4.22 10.16/4.22 data Ratio a = CnPc a a ; 10.16/4.22 10.16/4.22 compareMyInt :: MyInt -> MyInt -> Ordering; 10.16/4.22 compareMyInt = primCmpInt; 10.16/4.22 10.16/4.22 compareRatio :: Ratio MyInt -> Ratio MyInt -> Ordering; 10.16/4.22 compareRatio (CnPc x y) (CnPc x' y') = compareMyInt (srMyInt x y') (srMyInt x' y); 10.16/4.22 10.16/4.22 primCmpInt :: MyInt -> MyInt -> Ordering; 10.16/4.22 primCmpInt (Main.Pos Main.Zero) (Main.Pos Main.Zero) = EQ; 10.16/4.22 primCmpInt (Main.Pos Main.Zero) (Main.Neg Main.Zero) = EQ; 10.16/4.22 primCmpInt (Main.Neg Main.Zero) (Main.Pos Main.Zero) = EQ; 10.16/4.22 primCmpInt (Main.Neg Main.Zero) (Main.Neg Main.Zero) = EQ; 10.16/4.22 primCmpInt (Main.Pos x) (Main.Pos y) = primCmpNat x y; 10.16/4.22 primCmpInt (Main.Pos x) (Main.Neg y) = GT; 10.16/4.22 primCmpInt (Main.Neg x) (Main.Pos y) = LT; 10.16/4.22 primCmpInt (Main.Neg x) (Main.Neg y) = primCmpNat y x; 10.16/4.22 10.16/4.22 primCmpNat :: Main.Nat -> Main.Nat -> Ordering; 10.16/4.22 primCmpNat Main.Zero Main.Zero = EQ; 10.16/4.22 primCmpNat Main.Zero (Main.Succ y) = LT; 10.16/4.22 primCmpNat (Main.Succ x) Main.Zero = GT; 10.16/4.22 primCmpNat (Main.Succ x) (Main.Succ y) = primCmpNat x y; 10.16/4.22 10.16/4.22 primMulInt :: MyInt -> MyInt -> MyInt; 10.16/4.22 primMulInt (Main.Pos x) (Main.Pos y) = Main.Pos (primMulNat x y); 10.16/4.22 primMulInt (Main.Pos x) (Main.Neg y) = Main.Neg (primMulNat x y); 10.16/4.22 primMulInt (Main.Neg x) (Main.Pos y) = Main.Neg (primMulNat x y); 10.16/4.22 primMulInt (Main.Neg x) (Main.Neg y) = Main.Pos (primMulNat x y); 10.16/4.22 10.16/4.22 primMulNat :: Main.Nat -> Main.Nat -> Main.Nat; 10.16/4.22 primMulNat Main.Zero Main.Zero = Main.Zero; 10.16/4.22 primMulNat Main.Zero (Main.Succ y) = Main.Zero; 10.16/4.22 primMulNat (Main.Succ x) Main.Zero = Main.Zero; 10.16/4.22 primMulNat (Main.Succ x) (Main.Succ y) = primPlusNat (primMulNat x (Main.Succ y)) (Main.Succ y); 10.16/4.22 10.16/4.22 primPlusNat :: Main.Nat -> Main.Nat -> Main.Nat; 10.16/4.22 primPlusNat Main.Zero Main.Zero = Main.Zero; 10.16/4.22 primPlusNat Main.Zero (Main.Succ y) = Main.Succ y; 10.16/4.22 primPlusNat (Main.Succ x) Main.Zero = Main.Succ x; 10.16/4.22 primPlusNat (Main.Succ x) (Main.Succ y) = Main.Succ (Main.Succ (primPlusNat x y)); 10.16/4.22 10.16/4.22 srMyInt :: MyInt -> MyInt -> MyInt; 10.16/4.22 srMyInt = primMulInt; 10.16/4.22 10.16/4.22 } 10.16/4.22 10.16/4.22 ---------------------------------------- 10.16/4.22 10.16/4.22 (1) BR (EQUIVALENT) 10.16/4.22 Replaced joker patterns by fresh variables and removed binding patterns. 10.16/4.22 ---------------------------------------- 10.16/4.22 10.16/4.22 (2) 10.16/4.22 Obligation: 10.16/4.22 mainModule Main 10.16/4.22 module Main where { 10.16/4.22 import qualified Prelude; 10.16/4.22 data MyInt = Pos Main.Nat | Neg Main.Nat ; 10.16/4.22 10.16/4.22 data Main.Nat = Succ Main.Nat | Zero ; 10.16/4.22 popout

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52