Haskell 2019-04-01 06.52 pair #433316119

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.27309 seconds
cpu usage	10.2405
user time	9.92305
system time	0.317435
max virtual memory	1.8285568E7
max residence set size	609988.0

stage attributes

key	value
starexec-result	YES

output

7.99/3.64	YES
10.19/4.23	proof of /export/starexec/sandbox/benchmark/theBenchmark.hs
10.19/4.23	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
10.19/4.23	
10.19/4.23	
10.19/4.23	H-Termination with start terms of the given HASKELL could be proven:
10.19/4.23	
10.19/4.23	(0) HASKELL
10.19/4.23	(1) LR [EQUIVALENT, 0 ms]
10.19/4.23	(2) HASKELL
10.19/4.23	(3) BR [EQUIVALENT, 0 ms]
10.19/4.23	(4) HASKELL
10.19/4.23	(5) COR [EQUIVALENT, 0 ms]
10.19/4.23	(6) HASKELL
10.19/4.23	(7) LetRed [EQUIVALENT, 0 ms]
10.19/4.23	(8) HASKELL
10.19/4.23	(9) Narrow [SOUND, 0 ms]
10.19/4.23	(10) QDP
10.19/4.23	(11) MRRProof [EQUIVALENT, 28 ms]
10.19/4.23	(12) QDP
10.19/4.23	(13) DependencyGraphProof [EQUIVALENT, 0 ms]
10.19/4.23	(14) TRUE
10.19/4.23	
10.19/4.23	
10.19/4.23	----------------------------------------
10.19/4.23	
10.19/4.23	(0)
10.19/4.23	Obligation:
10.19/4.23	mainModule Main 
10.19/4.23	module Main where {
10.19/4.23	import qualified Prelude;
10.19/4.23	}
10.19/4.23	
10.19/4.23	----------------------------------------
10.19/4.23	
10.19/4.23	(1) LR (EQUIVALENT)
10.19/4.23	Lambda Reductions:
10.19/4.23	The following Lambda expression
10.19/4.23	"\(q : _)->q"
10.19/4.23	is transformed to
10.19/4.23	"q1 (q : _) = q;
10.19/4.23	"
10.19/4.23	The following Lambda expression
10.19/4.23	"\qs->qs"
10.19/4.23	is transformed to
10.19/4.23	"qs0 qs = qs;
10.19/4.23	"
10.19/4.23	
10.19/4.23	----------------------------------------
10.19/4.23	
10.19/4.23	(2)
10.19/4.23	Obligation:
10.19/4.23	mainModule Main 
10.19/4.23	module Main where {
10.19/4.23	import qualified Prelude;
10.19/4.23	}
10.19/4.23	
10.19/4.23	----------------------------------------
10.19/4.23	
10.19/4.23	(3) BR (EQUIVALENT)
10.19/4.23	Replaced joker patterns by fresh variables and removed binding patterns.
10.19/4.23	----------------------------------------
10.19/4.23	
10.19/4.23	(4)
10.19/4.23	Obligation:
10.19/4.23	mainModule Main 
10.19/4.23	module Main where {
10.19/4.23	import qualified Prelude;
10.19/4.23	}
10.19/4.23	
10.19/4.23	----------------------------------------
10.19/4.23	
10.19/4.23	(5) COR (EQUIVALENT)
10.19/4.23	Cond Reductions:
10.19/4.23	The following Function with conditions
10.19/4.23	"undefined |Falseundefined;
10.19/4.23	"
10.19/4.23	is transformed to
10.19/4.23	"undefined  = undefined1;
10.19/4.23	"
10.19/4.23	"undefined0 True = undefined;
10.19/4.23	"
10.19/4.23	"undefined1  = undefined0 False;
10.19/4.23	"
10.19/4.23	
10.19/4.23	----------------------------------------
10.19/4.23	
10.19/4.23	(6)
10.19/4.23	Obligation:
10.19/4.23	mainModule Main 
10.19/4.23	module Main where {
10.19/4.23	import qualified Prelude;
10.19/4.23	}
10.19/4.23	
10.19/4.23	----------------------------------------
10.19/4.23	
10.19/4.23	(7) LetRed (EQUIVALENT)
10.19/4.23	Let/Where Reductions:
10.19/4.23	The bindings of the following Let/Where expression
10.19/4.23	"f x q : qs where {

popout

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

job log

popout

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