Haskell 2019-04-01 06.52 pair #433317337

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.21461 seconds
cpu usage	10.0465
user time	9.74293
system time	0.303606
max virtual memory	1.8286464E7
max residence set size	582564.0

stage attributes

key	value
starexec-result	YES

output

8.02/3.59	YES
9.79/4.08	proof of /export/starexec/sandbox/benchmark/theBenchmark.hs
9.79/4.08	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
9.79/4.08	
9.79/4.08	
9.79/4.08	H-Termination with start terms of the given HASKELL could be proven:
9.79/4.08	
9.79/4.08	(0) HASKELL
9.79/4.08	(1) BR [EQUIVALENT, 0 ms]
9.79/4.08	(2) HASKELL
9.79/4.08	(3) COR [EQUIVALENT, 0 ms]
9.79/4.08	(4) HASKELL
9.79/4.08	(5) Narrow [SOUND, 0 ms]
9.79/4.08	(6) AND
9.79/4.08	    (7) QDP
9.79/4.08	        (8) QDPSizeChangeProof [EQUIVALENT, 0 ms]
9.79/4.08	        (9) YES
9.79/4.08	    (10) QDP
9.79/4.08	        (11) QDPSizeChangeProof [EQUIVALENT, 0 ms]
9.79/4.08	        (12) YES
9.79/4.08	
9.79/4.08	
9.79/4.08	----------------------------------------
9.79/4.08	
9.79/4.08	(0)
9.79/4.08	Obligation:
9.79/4.08	mainModule Main 
9.79/4.08	module Main where {
9.79/4.08	import qualified Prelude;
9.79/4.08	data MyInt = Pos Main.Nat  | Neg Main.Nat ;
9.79/4.08	
9.79/4.08	data Main.Nat = Succ Main.Nat  | Zero ;
9.79/4.08	
9.79/4.08	primMinusNat :: Main.Nat  ->  Main.Nat  ->  MyInt;
9.79/4.08	primMinusNat Main.Zero Main.Zero = Main.Pos Main.Zero;
9.79/4.08	primMinusNat Main.Zero (Main.Succ y) = Main.Neg (Main.Succ y);
9.79/4.08	primMinusNat (Main.Succ x) Main.Zero = Main.Pos (Main.Succ x);
9.79/4.08	primMinusNat (Main.Succ x) (Main.Succ y) = primMinusNat x y;
9.79/4.08	
9.79/4.08	primPlusInt :: MyInt  ->  MyInt  ->  MyInt;
9.79/4.09	primPlusInt (Main.Pos x) (Main.Neg y) = primMinusNat x y;
9.79/4.09	primPlusInt (Main.Neg x) (Main.Pos y) = primMinusNat y x;
9.79/4.09	primPlusInt (Main.Neg x) (Main.Neg y) = Main.Neg (primPlusNat x y);
9.79/4.09	primPlusInt (Main.Pos x) (Main.Pos y) = Main.Pos (primPlusNat x y);
9.79/4.09	
9.79/4.09	primPlusNat :: Main.Nat  ->  Main.Nat  ->  Main.Nat;
9.79/4.09	primPlusNat Main.Zero Main.Zero = Main.Zero;
9.79/4.09	primPlusNat Main.Zero (Main.Succ y) = Main.Succ y;
9.79/4.09	primPlusNat (Main.Succ x) Main.Zero = Main.Succ x;
9.79/4.09	primPlusNat (Main.Succ x) (Main.Succ y) = Main.Succ (Main.Succ (primPlusNat x y));
9.79/4.09	
9.79/4.09	psMyInt :: MyInt  ->  MyInt  ->  MyInt;
9.79/4.09	psMyInt = primPlusInt;
9.79/4.09	
9.79/4.09	}
9.79/4.09	
9.79/4.09	----------------------------------------
9.79/4.09	
9.79/4.09	(1) BR (EQUIVALENT)
9.79/4.09	Replaced joker patterns by fresh variables and removed binding patterns.
9.79/4.09	----------------------------------------
9.79/4.09	
9.79/4.09	(2)
9.79/4.09	Obligation:
9.79/4.09	mainModule Main 
9.79/4.09	module Main where {
9.79/4.09	import qualified Prelude;
9.79/4.09	data MyInt = Pos Main.Nat  | Neg Main.Nat ;
9.79/4.09	
9.79/4.09	data Main.Nat = Succ Main.Nat  | Zero ;
9.79/4.09	
9.79/4.09	primMinusNat :: Main.Nat  ->  Main.Nat  ->  MyInt;
9.79/4.09	primMinusNat Main.Zero Main.Zero = Main.Pos Main.Zero;
9.79/4.09	primMinusNat Main.Zero (Main.Succ y) = Main.Neg (Main.Succ y);
9.79/4.09	primMinusNat (Main.Succ x) Main.Zero = Main.Pos (Main.Succ x);
9.79/4.09	primMinusNat (Main.Succ x) (Main.Succ y) = primMinusNat x y;
9.79/4.09	
9.79/4.09	primPlusInt :: MyInt  ->  MyInt  ->  MyInt;
9.79/4.09	primPlusInt (Main.Pos x) (Main.Neg y) = primMinusNat x y;
9.79/4.09	primPlusInt (Main.Neg x) (Main.Pos y) = primMinusNat y x;
9.79/4.09	primPlusInt (Main.Neg x) (Main.Neg y) = Main.Neg (primPlusNat x y);
9.79/4.09	primPlusInt (Main.Pos x) (Main.Pos y) = Main.Pos (primPlusNat x y);
9.79/4.09	
9.79/4.09	primPlusNat :: Main.Nat  ->  Main.Nat  ->  Main.Nat;
9.79/4.09	primPlusNat Main.Zero Main.Zero = Main.Zero;
9.79/4.09	primPlusNat Main.Zero (Main.Succ y) = Main.Succ y;
9.79/4.09	primPlusNat (Main.Succ x) Main.Zero = Main.Succ x;
9.79/4.09	primPlusNat (Main.Succ x) (Main.Succ y) = Main.Succ (Main.Succ (primPlusNat x y));
9.79/4.09	
9.79/4.09	psMyInt :: MyInt  ->  MyInt  ->  MyInt;
9.79/4.09	psMyInt = primPlusInt;
9.79/4.09	
9.79/4.09	}
9.79/4.09	
9.79/4.09	----------------------------------------
9.79/4.09	
9.79/4.09	(3) COR (EQUIVALENT)
9.79/4.09	Cond Reductions:
9.79/4.09	The following Function with conditions
9.79/4.09	"undefined |Falseundefined;

popout

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

job log

popout

actions all output return to Haskell 2019-04-01 06.52