Haskell 2019-04-01 06.52 pair #433316019

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.27496 seconds
cpu usage	19.4963
user time	18.895
system time	0.601275
max virtual memory	1.8285844E7
max residence set size	605620.0

stage attributes

key	value
starexec-result	YES

output

7.64/3.66	YES
9.49/4.16	proof of /export/starexec/sandbox2/benchmark/theBenchmark.hs
9.49/4.16	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
9.49/4.16	
9.49/4.16	
9.49/4.16	H-Termination with start terms of the given HASKELL could be proven:
9.49/4.16	
9.49/4.16	(0) HASKELL
9.49/4.16	(1) BR [EQUIVALENT, 0 ms]
9.49/4.16	(2) HASKELL
9.49/4.16	(3) COR [EQUIVALENT, 0 ms]
9.49/4.16	(4) HASKELL
9.49/4.16	(5) Narrow [SOUND, 0 ms]
9.49/4.16	(6) QDP
9.49/4.16	(7) QDPSizeChangeProof [EQUIVALENT, 0 ms]
9.49/4.16	(8) YES
9.49/4.16	
9.49/4.16	
9.49/4.16	----------------------------------------
9.49/4.16	
9.49/4.16	(0)
9.49/4.16	Obligation:
9.49/4.16	mainModule Main 
9.49/4.16	module Main where {
9.49/4.16	import qualified Prelude;
9.49/4.16	import qualified Queue;
9.49/4.16	}
9.49/4.16	module Queue where {
9.49/4.16	import qualified Main;
9.49/4.16	import qualified Prelude;
9.49/4.16	data Queue a = Q [a] [a] [a] ;
9.49/4.16	
9.49/4.16	addToQueue :: Queue a  ->  a  ->  Queue a;
9.49/4.16	addToQueue (Q xs ys xs') y = makeQ xs (y : ys) xs';
9.49/4.16	
9.49/4.16	listToQueue :: [a]  ->  Queue a;
9.49/4.16	listToQueue xs = Q xs [] xs;
9.49/4.16	
9.49/4.16	makeQ :: [a]  ->  [a]  ->  [a]  ->  Queue a;
9.49/4.16	makeQ xs ys [] = listToQueue (rotate xs ys []);
9.49/4.16	makeQ xs ys (_ : xs') = Q xs ys xs';
9.49/4.16	
9.49/4.16	rotate :: [a]  ->  [a]  ->  [a]  ->  [a];
9.49/4.16	rotate [] (y : _) zs = y : zs;
9.49/4.16	rotate (x : xs) (y : ys) zs = x : rotate xs ys (y : zs);
9.49/4.16	
9.49/4.16	}
9.49/4.16	
9.49/4.16	----------------------------------------
9.49/4.16	
9.49/4.16	(1) BR (EQUIVALENT)
9.49/4.16	Replaced joker patterns by fresh variables and removed binding patterns.
9.49/4.16	----------------------------------------
9.49/4.16	
9.49/4.16	(2)
9.49/4.16	Obligation:
9.49/4.16	mainModule Main 
9.49/4.16	module Main where {
9.49/4.16	import qualified Prelude;
9.49/4.16	import qualified Queue;
9.49/4.16	}
9.49/4.16	module Queue where {
9.49/4.16	import qualified Main;
9.49/4.16	import qualified Prelude;
9.49/4.16	data Queue a = Q [a] [a] [a] ;
9.49/4.16	
9.49/4.16	addToQueue :: Queue a  ->  a  ->  Queue a;
9.49/4.16	addToQueue (Q xs ys xs') y = makeQ xs (y : ys) xs';
9.49/4.16	
9.49/4.16	listToQueue :: [a]  ->  Queue a;
9.49/4.16	listToQueue xs = Q xs [] xs;
9.49/4.16	
9.49/4.16	makeQ :: [a]  ->  [a]  ->  [a]  ->  Queue a;
9.49/4.16	makeQ xs ys [] = listToQueue (rotate xs ys []);
9.49/4.16	makeQ xs ys (vy : xs') = Q xs ys xs';
9.49/4.16	
9.49/4.16	rotate :: [a]  ->  [a]  ->  [a]  ->  [a];
9.49/4.16	rotate [] (y : vx) zs = y : zs;
9.49/4.16	rotate (x : xs) (y : ys) zs = x : rotate xs ys (y : zs);
9.49/4.16	
9.49/4.16	}
9.49/4.16	
9.49/4.16	----------------------------------------
9.49/4.16	
9.49/4.16	(3) COR (EQUIVALENT)
9.49/4.16	Cond Reductions:
9.49/4.16	The following Function with conditions
9.49/4.16	"undefined |Falseundefined;
9.49/4.16	"
9.49/4.16	is transformed to
9.49/4.16	"undefined  = undefined1;
9.49/4.16	"
9.49/4.16	"undefined0 True = undefined;
9.49/4.16	"
9.49/4.16	"undefined1  = undefined0 False;
9.49/4.16	"
9.49/4.16	
9.49/4.16	----------------------------------------
9.49/4.16	
9.49/4.16	(4)

popout

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

job log

popout

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