Haskell 2019-04-01 06.52 pair #433317320

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.0897 seconds
cpu usage	9.60162
user time	9.28266
system time	0.318957
max virtual memory	1.828352E7
max residence set size	581892.0

stage attributes

key	value
starexec-result	YES

output

7.58/3.55	YES
9.49/4.02	proof of /export/starexec/sandbox/benchmark/theBenchmark.hs
9.49/4.02	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
9.49/4.02	
9.49/4.02	
9.49/4.02	H-Termination with start terms of the given HASKELL could be proven:
9.49/4.02	
9.49/4.02	(0) HASKELL
9.49/4.02	(1) BR [EQUIVALENT, 0 ms]
9.49/4.02	(2) HASKELL
9.49/4.02	(3) COR [EQUIVALENT, 0 ms]
9.49/4.02	(4) HASKELL
9.49/4.02	(5) Narrow [SOUND, 0 ms]
9.49/4.02	(6) AND
9.49/4.02	    (7) QDP
9.49/4.02	        (8) QDPSizeChangeProof [EQUIVALENT, 0 ms]
9.49/4.02	        (9) YES
9.49/4.02	    (10) QDP
9.49/4.02	        (11) QDPSizeChangeProof [EQUIVALENT, 0 ms]
9.49/4.02	        (12) YES
9.49/4.02	
9.49/4.02	
9.49/4.02	----------------------------------------
9.49/4.02	
9.49/4.02	(0)
9.49/4.02	Obligation:
9.49/4.02	mainModule Main 
9.49/4.02	module Main where {
9.49/4.02	import qualified Prelude;
9.49/4.02	data Main.Char = Char MyInt ;
9.49/4.02	
9.49/4.02	data List a = Cons a (List a)  | Nil ;
9.49/4.02	
9.49/4.02	data MyInt = Pos Main.Nat  | Neg Main.Nat ;
9.49/4.02	
9.49/4.02	data Main.Nat = Succ Main.Nat  | Zero ;
9.49/4.02	
9.49/4.02	psPs :: List a  ->  List a  ->  List a;
9.49/4.02	psPs Nil ys = ys;
9.49/4.02	psPs (Cons x xs) ys = Cons x (psPs xs ys);
9.49/4.02	
9.49/4.02	unlines :: List (List Main.Char)  ->  List Main.Char;
9.49/4.02	unlines Nil = Nil;
9.49/4.02	unlines (Cons l ls) = psPs l (Cons (Main.Char (Main.Pos (Main.Succ (Main.Succ (Main.Succ (Main.Succ (Main.Succ (Main.Succ (Main.Succ (Main.Succ (Main.Succ (Main.Succ Main.Zero)))))))))))) (unlines ls));
9.49/4.02	
9.49/4.02	}
9.49/4.02	
9.49/4.02	----------------------------------------
9.49/4.02	
9.49/4.02	(1) BR (EQUIVALENT)
9.49/4.02	Replaced joker patterns by fresh variables and removed binding patterns.
9.49/4.02	----------------------------------------
9.49/4.02	
9.49/4.02	(2)
9.49/4.02	Obligation:
9.49/4.02	mainModule Main 
9.49/4.02	module Main where {
9.49/4.02	import qualified Prelude;
9.49/4.02	data Main.Char = Char MyInt ;
9.49/4.02	
9.49/4.02	data List a = Cons a (List a)  | Nil ;
9.49/4.02	
9.49/4.02	data MyInt = Pos Main.Nat  | Neg Main.Nat ;
9.49/4.02	
9.49/4.02	data Main.Nat = Succ Main.Nat  | Zero ;
9.49/4.02	
9.49/4.02	psPs :: List a  ->  List a  ->  List a;
9.49/4.02	psPs Nil ys = ys;
9.49/4.02	psPs (Cons x xs) ys = Cons x (psPs xs ys);
9.49/4.02	
9.49/4.02	unlines :: List (List Main.Char)  ->  List Main.Char;
9.49/4.02	unlines Nil = Nil;
9.49/4.02	unlines (Cons l ls) = psPs l (Cons (Main.Char (Main.Pos (Main.Succ (Main.Succ (Main.Succ (Main.Succ (Main.Succ (Main.Succ (Main.Succ (Main.Succ (Main.Succ (Main.Succ Main.Zero)))))))))))) (unlines ls));
9.49/4.02	
9.49/4.02	}
9.49/4.02	
9.49/4.02	----------------------------------------
9.49/4.02	
9.49/4.02	(3) COR (EQUIVALENT)
9.49/4.02	Cond Reductions:
9.49/4.02	The following Function with conditions
9.49/4.02	"undefined |Falseundefined;
9.49/4.02	"
9.49/4.02	is transformed to
9.49/4.02	"undefined  = undefined1;
9.49/4.02	"
9.49/4.02	"undefined0 True = undefined;
9.49/4.02	"
9.49/4.02	"undefined1  = undefined0 False;
9.49/4.02	"
9.49/4.02	
9.49/4.02	----------------------------------------
9.49/4.02	
9.49/4.02	(4)
9.49/4.02	Obligation:
9.49/4.02	mainModule Main 
9.49/4.02	module Main where {
9.49/4.02	import qualified Prelude;
9.49/4.02	data Main.Char = Char MyInt ;
9.49/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