details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.05897 seconds
cpu usage	9.7639
user time	9.46102
system time	0.302884
max virtual memory	1.828352E7
max residence set size	569600.0

stage attributes

key	value
starexec-result	YES

output

7.73/3.51 YES 9.59/4.02 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 9.59/4.02 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 9.59/4.02 9.59/4.02 9.59/4.02 H-Termination with start terms of the given HASKELL could be proven: 9.59/4.02 9.59/4.02 (0) HASKELL 9.59/4.02 (1) BR [EQUIVALENT, 0 ms] 9.59/4.02 (2) HASKELL 9.59/4.02 (3) COR [EQUIVALENT, 0 ms] 9.59/4.02 (4) HASKELL 9.59/4.02 (5) Narrow [SOUND, 0 ms] 9.59/4.02 (6) QDP 9.59/4.02 (7) QDPSizeChangeProof [EQUIVALENT, 0 ms] 9.59/4.02 (8) YES 9.59/4.02 9.59/4.02 9.59/4.02 ---------------------------------------- 9.59/4.02 9.59/4.02 (0) 9.59/4.02 Obligation: 9.59/4.02 mainModule Main 9.59/4.02 module Main where { 9.59/4.02 import qualified Prelude; 9.59/4.02 data MyInt = Pos Main.Nat | Neg Main.Nat ; 9.59/4.02 9.59/4.02 data Main.Nat = Succ Main.Nat | Zero ; 9.59/4.02 9.59/4.02 data Ordering = LT | EQ | GT ; 9.59/4.02 9.59/4.02 compareMyInt :: MyInt -> MyInt -> Ordering; 9.59/4.02 compareMyInt = primCmpInt; 9.59/4.02 9.59/4.02 primCmpInt :: MyInt -> MyInt -> Ordering; 9.59/4.02 primCmpInt (Main.Pos Main.Zero) (Main.Pos Main.Zero) = EQ; 9.59/4.02 primCmpInt (Main.Pos Main.Zero) (Main.Neg Main.Zero) = EQ; 9.59/4.02 primCmpInt (Main.Neg Main.Zero) (Main.Pos Main.Zero) = EQ; 9.59/4.02 primCmpInt (Main.Neg Main.Zero) (Main.Neg Main.Zero) = EQ; 9.59/4.02 primCmpInt (Main.Pos x) (Main.Pos y) = primCmpNat x y; 9.59/4.02 primCmpInt (Main.Pos x) (Main.Neg y) = GT; 9.59/4.02 primCmpInt (Main.Neg x) (Main.Pos y) = LT; 9.59/4.02 primCmpInt (Main.Neg x) (Main.Neg y) = primCmpNat y x; 9.59/4.02 9.59/4.02 primCmpNat :: Main.Nat -> Main.Nat -> Ordering; 9.59/4.02 primCmpNat Main.Zero Main.Zero = EQ; 9.59/4.02 primCmpNat Main.Zero (Main.Succ y) = LT; 9.59/4.02 primCmpNat (Main.Succ x) Main.Zero = GT; 9.59/4.02 primCmpNat (Main.Succ x) (Main.Succ y) = primCmpNat x y; 9.59/4.02 9.59/4.02 } 9.59/4.02 9.59/4.02 ---------------------------------------- 9.59/4.02 9.59/4.02 (1) BR (EQUIVALENT) 9.59/4.02 Replaced joker patterns by fresh variables and removed binding patterns. 9.59/4.02 ---------------------------------------- 9.59/4.02 9.59/4.02 (2) 9.59/4.02 Obligation: 9.59/4.02 mainModule Main 9.59/4.02 module Main where { 9.59/4.02 import qualified Prelude; 9.59/4.02 data MyInt = Pos Main.Nat | Neg Main.Nat ; 9.59/4.02 9.59/4.02 data Main.Nat = Succ Main.Nat | Zero ; 9.59/4.02 9.59/4.02 data Ordering = LT | EQ | GT ; 9.59/4.02 9.59/4.02 compareMyInt :: MyInt -> MyInt -> Ordering; 9.59/4.02 compareMyInt = primCmpInt; 9.59/4.02 9.59/4.02 primCmpInt :: MyInt -> MyInt -> Ordering; 9.59/4.02 primCmpInt (Main.Pos Main.Zero) (Main.Pos Main.Zero) = EQ; 9.59/4.02 primCmpInt (Main.Pos Main.Zero) (Main.Neg Main.Zero) = EQ; 9.59/4.02 primCmpInt (Main.Neg Main.Zero) (Main.Pos Main.Zero) = EQ; 9.59/4.02 primCmpInt (Main.Neg Main.Zero) (Main.Neg Main.Zero) = EQ; 9.59/4.02 primCmpInt (Main.Pos x) (Main.Pos y) = primCmpNat x y; 9.59/4.02 primCmpInt (Main.Pos x) (Main.Neg y) = GT; 9.59/4.02 primCmpInt (Main.Neg x) (Main.Pos y) = LT; 9.59/4.02 primCmpInt (Main.Neg x) (Main.Neg y) = primCmpNat y x; 9.59/4.02 9.59/4.02 primCmpNat :: Main.Nat -> Main.Nat -> Ordering; 9.59/4.02 primCmpNat Main.Zero Main.Zero = EQ; 9.59/4.02 primCmpNat Main.Zero (Main.Succ y) = LT; 9.59/4.02 primCmpNat (Main.Succ x) Main.Zero = GT; 9.59/4.02 primCmpNat (Main.Succ x) (Main.Succ y) = primCmpNat x y; 9.59/4.02 9.59/4.02 } 9.59/4.02 9.59/4.02 ---------------------------------------- 9.59/4.02 9.59/4.02 (3) COR (EQUIVALENT) 9.59/4.02 Cond Reductions: 9.59/4.02 The following Function with conditions 9.59/4.02 "undefined |Falseundefined; 9.59/4.02 " 9.59/4.02 is transformed to 9.59/4.02 "undefined = undefined1; 9.59/4.02 " popout

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52