Haskell 2019-04-01 06.52 pair #433317106

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.21349 seconds
cpu usage	10.2651
user time	9.99582
system time	0.269254
max virtual memory	1.828548E7
max residence set size	577128.0

stage attributes

key	value
starexec-result	YES

output

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