Haskell 2019-04-01 06.52 pair #433316779

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.05736 seconds
cpu usage	10.1902
user time	9.89571
system time	0.294486
max virtual memory	1.828352E7
max residence set size	545932.0

stage attributes

key	value
starexec-result	YES

output

8.26/3.52	YES
10.02/3.99	proof of /export/starexec/sandbox/benchmark/theBenchmark.hs
10.02/3.99	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
10.02/3.99	
10.02/3.99	
10.02/3.99	H-Termination with start terms of the given HASKELL could be proven:
10.02/3.99	
10.02/3.99	(0) HASKELL
10.02/3.99	(1) BR [EQUIVALENT, 0 ms]
10.02/3.99	(2) HASKELL
10.02/3.99	(3) COR [EQUIVALENT, 0 ms]
10.02/3.99	(4) HASKELL
10.02/3.99	(5) Narrow [EQUIVALENT, 0 ms]
10.02/3.99	(6) YES
10.02/3.99	
10.02/3.99	
10.02/3.99	----------------------------------------
10.02/3.99	
10.02/3.99	(0)
10.02/3.99	Obligation:
10.02/3.99	mainModule Main 
10.02/3.99	module Main where {
10.02/3.99	import qualified Prelude;
10.02/3.99	}
10.02/3.99	
10.02/3.99	----------------------------------------
10.02/3.99	
10.02/3.99	(1) BR (EQUIVALENT)
10.02/3.99	Replaced joker patterns by fresh variables and removed binding patterns.
10.02/3.99	----------------------------------------
10.02/3.99	
10.02/3.99	(2)
10.02/3.99	Obligation:
10.02/3.99	mainModule Main 
10.02/3.99	module Main where {
10.02/3.99	import qualified Prelude;
10.02/3.99	}
10.02/3.99	
10.02/3.99	----------------------------------------
10.02/3.99	
10.02/3.99	(3) COR (EQUIVALENT)
10.02/3.99	Cond Reductions:
10.02/3.99	The following Function with conditions
10.02/3.99	"compare x y|x == yEQ|x <= yLT|otherwiseGT;
10.02/3.99	"
10.02/3.99	is transformed to
10.02/3.99	"compare x y = compare3 x y;
10.02/3.99	"
10.02/3.99	"compare0 x y True = GT;
10.02/3.99	"
10.02/3.99	"compare2 x y True = EQ;
10.02/3.99	compare2 x y False = compare1 x y (x <= y);
10.02/3.99	"
10.02/3.99	"compare1 x y True = LT;
10.02/3.99	compare1 x y False = compare0 x y otherwise;
10.02/3.99	"
10.02/3.99	"compare3 x y = compare2 x y (x == y);
10.02/3.99	"
10.02/3.99	The following Function with conditions
10.02/3.99	"undefined |Falseundefined;
10.02/3.99	"
10.02/3.99	is transformed to
10.02/3.99	"undefined  = undefined1;
10.02/3.99	"
10.02/3.99	"undefined0 True = undefined;
10.02/3.99	"
10.02/3.99	"undefined1  = undefined0 False;
10.02/3.99	"
10.02/3.99	
10.02/3.99	----------------------------------------
10.02/3.99	
10.02/3.99	(4)
10.02/3.99	Obligation:
10.02/3.99	mainModule Main 
10.02/3.99	module Main where {
10.02/3.99	import qualified Prelude;
10.02/3.99	}
10.02/3.99	
10.02/3.99	----------------------------------------
10.02/3.99	
10.02/3.99	(5) Narrow (EQUIVALENT)
10.02/3.99	Haskell To QDPs
10.02/3.99	
10.02/3.99	digraph dp_graph {
10.02/3.99	node [outthreshold=100, inthreshold=100];1[label="compare",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3];
10.02/3.99	3[label="compare vx3",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", weight=3];
10.02/3.99	4[label="compare vx3 vx4",fontsize=16,color="black",shape="triangle"];4 -> 5[label="",style="solid", color="black", weight=3];
10.02/3.99	5[label="compare3 vx3 vx4",fontsize=16,color="black",shape="box"];5 -> 6[label="",style="solid", color="black", weight=3];
10.02/3.99	6[label="compare2 vx3 vx4 (vx3 == vx4)",fontsize=16,color="burlywood",shape="box"];55[label="vx3/LT",fontsize=10,color="white",style="solid",shape="box"];6 -> 55[label="",style="solid", color="burlywood", weight=9];
10.02/3.99	55 -> 7[label="",style="solid", color="burlywood", weight=3];
10.02/3.99	56[label="vx3/EQ",fontsize=10,color="white",style="solid",shape="box"];6 -> 56[label="",style="solid", color="burlywood", weight=9];
10.02/3.99	56 -> 8[label="",style="solid", color="burlywood", weight=3];
10.02/3.99	57[label="vx3/GT",fontsize=10,color="white",style="solid",shape="box"];6 -> 57[label="",style="solid", color="burlywood", weight=9];
10.02/3.99	57 -> 9[label="",style="solid", color="burlywood", weight=3];
10.02/3.99	7[label="compare2 LT vx4 (LT == vx4)",fontsize=16,color="burlywood",shape="box"];58[label="vx4/LT",fontsize=10,color="white",style="solid",shape="box"];7 -> 58[label="",style="solid", color="burlywood", weight=9];
10.02/3.99	58 -> 10[label="",style="solid", color="burlywood", weight=3];
10.02/3.99	59[label="vx4/EQ",fontsize=10,color="white",style="solid",shape="box"];7 -> 59[label="",style="solid", color="burlywood", weight=9];
10.02/3.99	59 -> 11[label="",style="solid", color="burlywood", weight=3];
10.02/3.99	60[label="vx4/GT",fontsize=10,color="white",style="solid",shape="box"];7 -> 60[label="",style="solid", color="burlywood", weight=9];
10.02/3.99	60 -> 12[label="",style="solid", color="burlywood", 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