Haskell 2019-04-01 06.52 pair #433316933

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.62501 seconds
cpu usage	11.5725
user time	11.2383
system time	0.334204
max virtual memory	1.828352E7
max residence set size	657776.0

stage attributes

key	value
starexec-result	YES

output

9.57/3.99	YES
11.34/4.47	proof of /export/starexec/sandbox/benchmark/theBenchmark.hs
11.34/4.47	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
11.34/4.47	
11.34/4.47	
11.34/4.47	H-Termination with start terms of the given HASKELL could be proven:
11.34/4.47	
11.34/4.47	(0) HASKELL
11.34/4.47	(1) BR [EQUIVALENT, 0 ms]
11.34/4.47	(2) HASKELL
11.34/4.47	(3) COR [EQUIVALENT, 0 ms]
11.34/4.47	(4) HASKELL
11.34/4.47	(5) Narrow [SOUND, 0 ms]
11.34/4.47	(6) AND
11.34/4.47	    (7) QDP
11.34/4.47	        (8) QDPSizeChangeProof [EQUIVALENT, 0 ms]
11.34/4.47	        (9) YES
11.34/4.47	    (10) QDP
11.34/4.47	        (11) QDPSizeChangeProof [EQUIVALENT, 0 ms]
11.34/4.47	        (12) YES
11.34/4.47	    (13) QDP
11.34/4.47	        (14) QDPSizeChangeProof [EQUIVALENT, 0 ms]
11.34/4.47	        (15) YES
11.34/4.47	    (16) QDP
11.34/4.47	        (17) QDPSizeChangeProof [EQUIVALENT, 0 ms]
11.34/4.47	        (18) YES
11.34/4.47	
11.34/4.47	
11.34/4.47	----------------------------------------
11.34/4.47	
11.34/4.47	(0)
11.34/4.47	Obligation:
11.34/4.47	mainModule Main 
11.34/4.47	module Main where {
11.34/4.47	import qualified Prelude;
11.34/4.47	}
11.34/4.47	
11.34/4.47	----------------------------------------
11.34/4.47	
11.34/4.47	(1) BR (EQUIVALENT)
11.34/4.47	Replaced joker patterns by fresh variables and removed binding patterns.
11.34/4.47	----------------------------------------
11.34/4.47	
11.34/4.47	(2)
11.34/4.47	Obligation:
11.34/4.47	mainModule Main 
11.34/4.47	module Main where {
11.34/4.47	import qualified Prelude;
11.34/4.47	}
11.34/4.47	
11.34/4.47	----------------------------------------
11.34/4.47	
11.34/4.47	(3) COR (EQUIVALENT)
11.34/4.47	Cond Reductions:
11.34/4.47	The following Function with conditions
11.34/4.47	"undefined |Falseundefined;
11.34/4.47	"
11.34/4.47	is transformed to
11.34/4.47	"undefined  = undefined1;
11.34/4.47	"
11.34/4.47	"undefined0 True = undefined;
11.34/4.47	"
11.34/4.47	"undefined1  = undefined0 False;
11.34/4.47	"
11.34/4.47	
11.34/4.47	----------------------------------------
11.34/4.47	
11.34/4.47	(4)
11.34/4.47	Obligation:
11.34/4.47	mainModule Main 
11.34/4.47	module Main where {
11.34/4.47	import qualified Prelude;
11.34/4.47	}
11.34/4.47	
11.34/4.47	----------------------------------------
11.34/4.47	
11.34/4.47	(5) Narrow (SOUND)
11.34/4.47	Haskell To QDPs
11.34/4.47	
11.34/4.47	digraph dp_graph {
11.34/4.47	node [outthreshold=100, inthreshold=100];1[label="(==)",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3];
11.34/4.47	3[label="(==) xv3",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", weight=3];
11.34/4.47	4[label="(==) xv3 xv4",fontsize=16,color="burlywood",shape="triangle"];633[label="xv3/Left xv30",fontsize=10,color="white",style="solid",shape="box"];4 -> 633[label="",style="solid", color="burlywood", weight=9];
11.34/4.47	633 -> 5[label="",style="solid", color="burlywood", weight=3];
11.34/4.47	634[label="xv3/Right xv30",fontsize=10,color="white",style="solid",shape="box"];4 -> 634[label="",style="solid", color="burlywood", weight=9];
11.34/4.47	634 -> 6[label="",style="solid", color="burlywood", weight=3];
11.34/4.47	5[label="(==) Left xv30 xv4",fontsize=16,color="burlywood",shape="box"];635[label="xv4/Left xv40",fontsize=10,color="white",style="solid",shape="box"];5 -> 635[label="",style="solid", color="burlywood", weight=9];
11.34/4.47	635 -> 7[label="",style="solid", color="burlywood", weight=3];
11.34/4.47	636[label="xv4/Right xv40",fontsize=10,color="white",style="solid",shape="box"];5 -> 636[label="",style="solid", color="burlywood", weight=9];
11.34/4.47	636 -> 8[label="",style="solid", color="burlywood", weight=3];
11.34/4.47	6[label="(==) Right xv30 xv4",fontsize=16,color="burlywood",shape="box"];637[label="xv4/Left xv40",fontsize=10,color="white",style="solid",shape="box"];6 -> 637[label="",style="solid", color="burlywood", weight=9];
11.34/4.47	637 -> 9[label="",style="solid", color="burlywood", weight=3];
11.34/4.47	638[label="xv4/Right xv40",fontsize=10,color="white",style="solid",shape="box"];6 -> 638[label="",style="solid", color="burlywood", weight=9];
11.34/4.47	638 -> 10[label="",style="solid", color="burlywood", weight=3];
11.34/4.47	7[label="(==) Left xv30 Left xv40",fontsize=16,color="black",shape="box"];7 -> 11[label="",style="solid", color="black", weight=3];
11.34/4.47	8[label="(==) Left xv30 Right xv40",fontsize=16,color="black",shape="box"];8 -> 12[label="",style="solid", color="black", weight=3];
11.34/4.47	9[label="(==) Right xv30 Left xv40",fontsize=16,color="black",shape="box"];9 -> 13[label="",style="solid", color="black", weight=3];
11.34/4.47	10[label="(==) Right xv30 Right xv40",fontsize=16,color="black",shape="box"];10 -> 14[label="",style="solid", color="black", weight=3];
11.34/4.47	11[label="xv30 == xv40",fontsize=16,color="blue",shape="box"];639[label="== :: Char -> Char -> Bool",fontsize=10,color="white",style="solid",shape="box"];11 -> 639[label="",style="solid", color="blue", weight=9];
11.34/4.47	639 -> 15[label="",style="solid", color="blue", weight=3];

popout

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

job log

popout

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