Haskell 2019-04-01 06.52 pair #433317373

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	16.4045 seconds
cpu usage	33.2324
user time	31.5793
system time	1.65313
max virtual memory	1.8353612E7
max residence set size	4314032.0

stage attributes

key	value
starexec-result	MAYBE

output

30.60/15.72	MAYBE
33.10/16.34	proof of /export/starexec/sandbox/benchmark/theBenchmark.hs
33.10/16.34	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
33.10/16.34	
33.10/16.34	
33.10/16.34	H-Termination with start terms of the given HASKELL could not be shown:
33.10/16.34	
33.10/16.34	(0) HASKELL
33.10/16.34	(1) BR [EQUIVALENT, 0 ms]
33.10/16.34	(2) HASKELL
33.10/16.34	(3) COR [EQUIVALENT, 0 ms]
33.10/16.34	(4) HASKELL
33.10/16.34	(5) Narrow [SOUND, 0 ms]
33.10/16.34	(6) AND
33.10/16.34	    (7) QDP
33.10/16.34	        (8) QDPSizeChangeProof [EQUIVALENT, 0 ms]
33.10/16.34	        (9) YES
33.10/16.34	    (10) QDP
33.10/16.34	        (11) QDPOrderProof [EQUIVALENT, 19 ms]
33.10/16.34	        (12) QDP
33.10/16.34	        (13) DependencyGraphProof [EQUIVALENT, 0 ms]
33.10/16.34	        (14) QDP
33.10/16.34	        (15) QDPSizeChangeProof [EQUIVALENT, 0 ms]
33.10/16.34	        (16) YES
33.10/16.34	    (17) QDP
33.10/16.34	        (18) DependencyGraphProof [EQUIVALENT, 0 ms]
33.10/16.34	        (19) QDP
33.10/16.34	        (20) QDPOrderProof [EQUIVALENT, 12 ms]
33.10/16.34	        (21) QDP
33.10/16.34	        (22) DependencyGraphProof [EQUIVALENT, 0 ms]
33.10/16.34	        (23) QDP
33.10/16.34	        (24) QDPSizeChangeProof [EQUIVALENT, 0 ms]
33.10/16.34	        (25) YES
33.10/16.34	    (26) QDP
33.10/16.34	        (27) DependencyGraphProof [EQUIVALENT, 0 ms]
33.10/16.34	        (28) QDP
33.10/16.34	        (29) TransformationProof [EQUIVALENT, 0 ms]
33.10/16.35	        (30) QDP
33.10/16.35	        (31) UsableRulesProof [EQUIVALENT, 0 ms]
33.10/16.35	        (32) QDP
33.10/16.35	        (33) QReductionProof [EQUIVALENT, 0 ms]
33.10/16.35	        (34) QDP
33.10/16.35	        (35) MNOCProof [EQUIVALENT, 0 ms]
33.10/16.35	        (36) QDP
33.10/16.35	        (37) InductionCalculusProof [EQUIVALENT, 0 ms]
33.10/16.35	        (38) QDP
33.10/16.35	        (39) TransformationProof [EQUIVALENT, 0 ms]
33.10/16.35	        (40) QDP
33.10/16.35	            (41) DependencyGraphProof [EQUIVALENT, 0 ms]
33.10/16.35	            (42) QDP
33.10/16.35	            (43) TransformationProof [EQUIVALENT, 0 ms]
33.10/16.35	            (44) QDP
33.10/16.35	            (45) DependencyGraphProof [EQUIVALENT, 0 ms]
33.10/16.35	            (46) QDP
33.10/16.35	            (47) TransformationProof [EQUIVALENT, 0 ms]
33.10/16.35	            (48) QDP
33.10/16.35	            (49) DependencyGraphProof [EQUIVALENT, 0 ms]
33.10/16.35	            (50) QDP
33.10/16.35	            (51) TransformationProof [EQUIVALENT, 0 ms]
33.10/16.35	            (52) QDP
33.10/16.35	            (53) DependencyGraphProof [EQUIVALENT, 0 ms]
33.10/16.35	            (54) QDP
33.10/16.35	            (55) MNOCProof [EQUIVALENT, 0 ms]
33.10/16.35	            (56) QDP
33.10/16.35	            (57) InductionCalculusProof [EQUIVALENT, 0 ms]
33.10/16.35	            (58) QDP
33.10/16.35	(59) Narrow [COMPLETE, 0 ms]
33.10/16.35	(60) QDP
33.10/16.35	    (61) DependencyGraphProof [EQUIVALENT, 0 ms]
33.10/16.35	    (62) TRUE
33.10/16.35	
33.10/16.35	
33.10/16.35	----------------------------------------
33.10/16.35	
33.10/16.35	(0)
33.10/16.35	Obligation:
33.10/16.35	mainModule Main 
33.10/16.35	module Main where {
33.10/16.35	import qualified Prelude;
33.10/16.35	data Main.Char = Char MyInt ;
33.10/16.35	
33.10/16.35	data List a = Cons a (List a)  | Nil ;
33.10/16.35	
33.10/16.35	data MyBool = MyTrue  | MyFalse ;
33.10/16.35	
33.10/16.35	data MyInt = Pos Main.Nat  | Neg Main.Nat ;
33.10/16.35	
33.10/16.35	data Main.Nat = Succ Main.Nat  | Zero ;
33.10/16.35	
33.10/16.35	divMyInt :: MyInt  ->  MyInt  ->  MyInt;
33.10/16.35	divMyInt = primDivInt;
33.10/16.35	
33.10/16.35	error :: a;
33.10/16.35	error = stop MyTrue;
33.10/16.35	
33.10/16.35	modMyInt :: MyInt  ->  MyInt  ->  MyInt;
33.10/16.35	modMyInt = primModInt;
33.10/16.35	
33.10/16.35	primDivInt :: MyInt  ->  MyInt  ->  MyInt;
33.10/16.35	primDivInt (Main.Pos x) (Main.Pos (Main.Succ y)) = Main.Pos (primDivNatS x (Main.Succ 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