details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.24363 seconds
cpu usage	10.0002
user time	9.69437
system time	0.305784
max virtual memory	1.8286248E7
max residence set size	575596.0

stage attributes

key	value
starexec-result	YES

output

8.02/3.62 YES 9.71/4.13 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 9.71/4.13 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 9.71/4.13 9.71/4.13 9.71/4.13 H-Termination with start terms of the given HASKELL could be proven: 9.71/4.13 9.71/4.13 (0) HASKELL 9.71/4.13 (1) BR [EQUIVALENT, 0 ms] 9.71/4.13 (2) HASKELL 9.71/4.13 (3) COR [EQUIVALENT, 0 ms] 9.71/4.13 (4) HASKELL 9.71/4.13 (5) Narrow [SOUND, 0 ms] 9.71/4.13 (6) AND 9.71/4.13 (7) QDP 9.71/4.13 (8) QDPSizeChangeProof [EQUIVALENT, 0 ms] 9.71/4.13 (9) YES 9.71/4.13 (10) QDP 9.71/4.13 (11) QDPSizeChangeProof [EQUIVALENT, 0 ms] 9.71/4.13 (12) YES 9.71/4.13 9.71/4.13 9.71/4.13 ---------------------------------------- 9.71/4.13 9.71/4.13 (0) 9.71/4.13 Obligation: 9.71/4.13 mainModule Main 9.71/4.13 module Main where { 9.71/4.13 import qualified Prelude; 9.71/4.13 data MyInt = Pos Main.Nat | Neg Main.Nat ; 9.71/4.13 9.71/4.13 data Main.Nat = Succ Main.Nat | Zero ; 9.71/4.13 9.71/4.13 flip :: (b -> a -> c) -> a -> b -> c; 9.71/4.13 flip f x y = f y x; 9.71/4.13 9.71/4.13 msMyInt :: MyInt -> MyInt -> MyInt; 9.71/4.13 msMyInt = primMinusInt; 9.71/4.13 9.71/4.13 primMinusInt :: MyInt -> MyInt -> MyInt; 9.71/4.13 primMinusInt (Main.Pos x) (Main.Neg y) = Main.Pos (primPlusNat x y); 9.71/4.13 primMinusInt (Main.Neg x) (Main.Pos y) = Main.Neg (primPlusNat x y); 9.71/4.13 primMinusInt (Main.Neg x) (Main.Neg y) = primMinusNat y x; 9.71/4.13 primMinusInt (Main.Pos x) (Main.Pos y) = primMinusNat x y; 9.71/4.13 9.71/4.13 primMinusNat :: Main.Nat -> Main.Nat -> MyInt; 9.71/4.13 primMinusNat Main.Zero Main.Zero = Main.Pos Main.Zero; 9.71/4.13 primMinusNat Main.Zero (Main.Succ y) = Main.Neg (Main.Succ y); 9.71/4.13 primMinusNat (Main.Succ x) Main.Zero = Main.Pos (Main.Succ x); 9.71/4.13 primMinusNat (Main.Succ x) (Main.Succ y) = primMinusNat x y; 9.71/4.13 9.71/4.13 primPlusNat :: Main.Nat -> Main.Nat -> Main.Nat; 9.71/4.13 primPlusNat Main.Zero Main.Zero = Main.Zero; 9.71/4.13 primPlusNat Main.Zero (Main.Succ y) = Main.Succ y; 9.71/4.13 primPlusNat (Main.Succ x) Main.Zero = Main.Succ x; 9.71/4.13 primPlusNat (Main.Succ x) (Main.Succ y) = Main.Succ (Main.Succ (primPlusNat x y)); 9.71/4.13 9.71/4.13 subtractMyInt :: MyInt -> MyInt -> MyInt; 9.71/4.13 subtractMyInt = flip msMyInt; 9.71/4.13 9.71/4.13 } 9.71/4.13 9.71/4.13 ---------------------------------------- 9.71/4.13 9.71/4.13 (1) BR (EQUIVALENT) 9.71/4.13 Replaced joker patterns by fresh variables and removed binding patterns. 9.71/4.13 ---------------------------------------- 9.71/4.13 9.71/4.13 (2) 9.71/4.13 Obligation: 9.71/4.13 mainModule Main 9.71/4.13 module Main where { 9.71/4.13 import qualified Prelude; 9.71/4.13 data MyInt = Pos Main.Nat | Neg Main.Nat ; 9.71/4.13 9.71/4.13 data Main.Nat = Succ Main.Nat | Zero ; 9.71/4.13 9.71/4.13 flip :: (b -> a -> c) -> a -> b -> c; 9.71/4.13 flip f x y = f y x; 9.71/4.13 9.71/4.13 msMyInt :: MyInt -> MyInt -> MyInt; 9.71/4.13 msMyInt = primMinusInt; 9.71/4.13 9.71/4.13 primMinusInt :: MyInt -> MyInt -> MyInt; 9.71/4.13 primMinusInt (Main.Pos x) (Main.Neg y) = Main.Pos (primPlusNat x y); 9.71/4.13 primMinusInt (Main.Neg x) (Main.Pos y) = Main.Neg (primPlusNat x y); 9.71/4.13 primMinusInt (Main.Neg x) (Main.Neg y) = primMinusNat y x; 9.71/4.13 primMinusInt (Main.Pos x) (Main.Pos y) = primMinusNat x y; 9.71/4.13 9.71/4.13 primMinusNat :: Main.Nat -> Main.Nat -> MyInt; 9.71/4.13 primMinusNat Main.Zero Main.Zero = Main.Pos Main.Zero; 9.71/4.13 primMinusNat Main.Zero (Main.Succ y) = Main.Neg (Main.Succ y); 9.71/4.13 primMinusNat (Main.Succ x) Main.Zero = Main.Pos (Main.Succ x); 9.71/4.13 primMinusNat (Main.Succ x) (Main.Succ y) = primMinusNat x y; 9.71/4.13 9.71/4.13 primPlusNat :: Main.Nat -> Main.Nat -> Main.Nat; 9.71/4.13 primPlusNat Main.Zero Main.Zero = Main.Zero; 9.71/4.13 primPlusNat Main.Zero (Main.Succ y) = Main.Succ y; 9.71/4.13 primPlusNat (Main.Succ x) Main.Zero = Main.Succ x; 9.71/4.13 primPlusNat (Main.Succ x) (Main.Succ y) = Main.Succ (Main.Succ (primPlusNat x y)); popout

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

job log

popout

actions

all output return to Haskell 2019-04-01 06.52