Haskell 2019-04-01 06.52 pair #433317236

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.06262 seconds
cpu usage	9.65267
user time	9.36734
system time	0.285324
max virtual memory	1.828352E7
max residence set size	551760.0

stage attributes

key	value
starexec-result	YES

output

7.89/3.55	YES
9.35/4.02	proof of /export/starexec/sandbox/benchmark/theBenchmark.hs
9.35/4.02	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
9.35/4.02	
9.35/4.02	
9.35/4.02	H-Termination with start terms of the given HASKELL could be proven:
9.35/4.02	
9.35/4.02	(0) HASKELL
9.35/4.02	(1) BR [EQUIVALENT, 0 ms]
9.35/4.02	(2) HASKELL
9.35/4.02	(3) COR [EQUIVALENT, 0 ms]
9.35/4.02	(4) HASKELL
9.35/4.02	(5) Narrow [SOUND, 0 ms]
9.35/4.02	(6) QDP
9.35/4.02	(7) QDPSizeChangeProof [EQUIVALENT, 0 ms]
9.35/4.02	(8) YES
9.35/4.02	
9.35/4.02	
9.35/4.02	----------------------------------------
9.35/4.02	
9.35/4.02	(0)
9.35/4.02	Obligation:
9.35/4.02	mainModule Main 
9.35/4.02	module Main where {
9.35/4.02	import qualified Prelude;
9.35/4.02	data List a = Cons a (List a)  | Nil ;
9.35/4.02	
9.35/4.02	zipWith3 :: (c  ->  d  ->  a  ->  b)  ->  List c  ->  List d  ->  List a  ->  List b;
9.35/4.02	zipWith3 z (Cons a as) (Cons b bs) (Cons c cs) = Cons (z a b c) (zipWith3 z as bs cs);
9.35/4.02	zipWith3 vv vw vx vy = Nil;
9.35/4.02	
9.35/4.02	}
9.35/4.02	
9.35/4.02	----------------------------------------
9.35/4.02	
9.35/4.02	(1) BR (EQUIVALENT)
9.35/4.02	Replaced joker patterns by fresh variables and removed binding patterns.
9.35/4.02	----------------------------------------
9.35/4.02	
9.35/4.02	(2)
9.35/4.02	Obligation:
9.35/4.02	mainModule Main 
9.35/4.02	module Main where {
9.35/4.02	import qualified Prelude;
9.35/4.02	data List a = Cons a (List a)  | Nil ;
9.35/4.02	
9.35/4.02	zipWith3 :: (d  ->  c  ->  a  ->  b)  ->  List d  ->  List c  ->  List a  ->  List b;
9.35/4.02	zipWith3 z (Cons a as) (Cons b bs) (Cons c cs) = Cons (z a b c) (zipWith3 z as bs cs);
9.35/4.02	zipWith3 vv vw vx vy = Nil;
9.35/4.02	
9.35/4.02	}
9.35/4.02	
9.35/4.02	----------------------------------------
9.35/4.02	
9.35/4.02	(3) COR (EQUIVALENT)
9.35/4.02	Cond Reductions:
9.35/4.02	The following Function with conditions
9.35/4.02	"undefined |Falseundefined;
9.35/4.02	"
9.35/4.02	is transformed to
9.35/4.02	"undefined  = undefined1;
9.35/4.02	"
9.35/4.02	"undefined0 True = undefined;
9.35/4.02	"
9.35/4.02	"undefined1  = undefined0 False;
9.35/4.02	"
9.35/4.02	
9.35/4.02	----------------------------------------
9.35/4.02	
9.35/4.02	(4)
9.35/4.02	Obligation:
9.35/4.02	mainModule Main 
9.35/4.02	module Main where {
9.35/4.02	import qualified Prelude;
9.35/4.02	data List a = Cons a (List a)  | Nil ;
9.35/4.02	
9.35/4.02	zipWith3 :: (c  ->  b  ->  d  ->  a)  ->  List c  ->  List b  ->  List d  ->  List a;
9.35/4.02	zipWith3 z (Cons a as) (Cons b bs) (Cons c cs) = Cons (z a b c) (zipWith3 z as bs cs);
9.35/4.02	zipWith3 vv vw vx vy = Nil;
9.35/4.02	
9.35/4.02	}
9.35/4.02	
9.35/4.02	----------------------------------------
9.35/4.02	
9.35/4.02	(5) Narrow (SOUND)
9.35/4.02	Haskell To QDPs
9.35/4.02	
9.35/4.02	digraph dp_graph {
9.35/4.02	node [outthreshold=100, inthreshold=100];1[label="zipWith3",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3];
9.35/4.02	3[label="zipWith3 wv3",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", weight=3];
9.35/4.02	4[label="zipWith3 wv3 wv4",fontsize=16,color="grey",shape="box"];4 -> 5[label="",style="dashed", color="grey", weight=3];
9.35/4.02	5[label="zipWith3 wv3 wv4 wv5",fontsize=16,color="grey",shape="box"];5 -> 6[label="",style="dashed", color="grey", weight=3];
9.35/4.02	6[label="zipWith3 wv3 wv4 wv5 wv6",fontsize=16,color="burlywood",shape="triangle"];25[label="wv4/Cons wv40 wv41",fontsize=10,color="white",style="solid",shape="box"];6 -> 25[label="",style="solid", color="burlywood", weight=9];
9.35/4.02	25 -> 7[label="",style="solid", color="burlywood", weight=3];
9.35/4.02	26[label="wv4/Nil",fontsize=10,color="white",style="solid",shape="box"];6 -> 26[label="",style="solid", color="burlywood", weight=9];
9.35/4.02	26 -> 8[label="",style="solid", color="burlywood", weight=3];
9.35/4.02	7[label="zipWith3 wv3 (Cons wv40 wv41) wv5 wv6",fontsize=16,color="burlywood",shape="box"];27[label="wv5/Cons wv50 wv51",fontsize=10,color="white",style="solid",shape="box"];7 -> 27[label="",style="solid", color="burlywood", weight=9];
9.35/4.02	27 -> 9[label="",style="solid", color="burlywood", weight=3];
9.35/4.02	28[label="wv5/Nil",fontsize=10,color="white",style="solid",shape="box"];7 -> 28[label="",style="solid", color="burlywood", weight=9];
9.35/4.02	28 -> 10[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