details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.12454 seconds
cpu usage	9.61494
user time	9.27369
system time	0.341246
max virtual memory	1.8288508E7
max residence set size	590140.0

stage attributes

key	value
starexec-result	YES

output

7.50/3.48 YES 9.34/3.98 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 9.34/3.98 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 9.34/3.98 9.34/3.98 9.34/3.98 H-Termination with start terms of the given HASKELL could be proven: 9.34/3.98 9.34/3.98 (0) HASKELL 9.34/3.98 (1) BR [EQUIVALENT, 0 ms] 9.34/3.98 (2) HASKELL 9.34/3.98 (3) COR [EQUIVALENT, 0 ms] 9.34/3.98 (4) HASKELL 9.34/3.98 (5) Narrow [EQUIVALENT, 0 ms] 9.34/3.98 (6) YES 9.34/3.98 9.34/3.98 9.34/3.98 ---------------------------------------- 9.34/3.98 9.34/3.98 (0) 9.34/3.98 Obligation: 9.34/3.98 mainModule Main 9.34/3.98 module Main where { 9.34/3.98 import qualified Prelude; 9.34/3.98 data List a = Cons a (List a) | Nil ; 9.34/3.98 9.34/3.98 data Tup0 = Tup0 ; 9.34/3.98 9.34/3.98 data Tup2 b a = Tup2 b a ; 9.34/3.98 9.34/3.98 rangeTup0 :: Tup2 Tup0 Tup0 -> List Tup0; 9.34/3.98 rangeTup0 (Tup2 Tup0 Tup0) = Cons Tup0 Nil; 9.34/3.98 9.34/3.98 } 9.34/3.98 9.34/3.98 ---------------------------------------- 9.34/3.98 9.34/3.98 (1) BR (EQUIVALENT) 9.34/3.98 Replaced joker patterns by fresh variables and removed binding patterns. 9.34/3.98 ---------------------------------------- 9.34/3.98 9.34/3.98 (2) 9.34/3.98 Obligation: 9.34/3.98 mainModule Main 9.34/3.98 module Main where { 9.34/3.98 import qualified Prelude; 9.34/3.98 data List a = Cons a (List a) | Nil ; 9.34/3.98 9.34/3.98 data Tup0 = Tup0 ; 9.34/3.98 9.34/3.98 data Tup2 b a = Tup2 b a ; 9.34/3.98 9.34/3.98 rangeTup0 :: Tup2 Tup0 Tup0 -> List Tup0; 9.34/3.98 rangeTup0 (Tup2 Tup0 Tup0) = Cons Tup0 Nil; 9.34/3.98 9.34/3.98 } 9.34/3.98 9.34/3.98 ---------------------------------------- 9.34/3.98 9.34/3.98 (3) COR (EQUIVALENT) 9.34/3.98 Cond Reductions: 9.34/3.98 The following Function with conditions 9.34/3.98 "undefined |Falseundefined; 9.34/3.98 " 9.34/3.98 is transformed to 9.34/3.98 "undefined = undefined1; 9.34/3.98 " 9.34/3.98 "undefined0 True = undefined; 9.34/3.98 " 9.34/3.98 "undefined1 = undefined0 False; 9.34/3.98 " 9.34/3.98 9.34/3.98 ---------------------------------------- 9.34/3.98 9.34/3.98 (4) 9.34/3.98 Obligation: 9.34/3.98 mainModule Main 9.34/3.98 module Main where { 9.34/3.98 import qualified Prelude; 9.34/3.98 data List a = Cons a (List a) | Nil ; 9.34/3.98 9.34/3.98 data Tup0 = Tup0 ; 9.34/3.98 9.34/3.98 data Tup2 b a = Tup2 b a ; 9.34/3.98 9.34/3.98 rangeTup0 :: Tup2 Tup0 Tup0 -> List Tup0; 9.34/3.98 rangeTup0 (Tup2 Tup0 Tup0) = Cons Tup0 Nil; 9.34/3.98 9.34/3.98 } 9.34/3.98 9.34/3.98 ---------------------------------------- 9.34/3.98 9.34/3.98 (5) Narrow (EQUIVALENT) 9.34/3.98 Haskell To QDPs 9.34/3.98 9.34/3.98 digraph dp_graph { 9.34/3.98 node [outthreshold=100, inthreshold=100];1[label="rangeTup0",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3]; 9.34/3.98 3[label="rangeTup0 vx3",fontsize=16,color="burlywood",shape="triangle"];8[label="vx3/Tup2 vx30 vx31",fontsize=10,color="white",style="solid",shape="box"];3 -> 8[label="",style="solid", color="burlywood", weight=9]; 9.34/3.98 8 -> 4[label="",style="solid", color="burlywood", weight=3]; 9.34/3.98 4[label="rangeTup0 (Tup2 vx30 vx31)",fontsize=16,color="burlywood",shape="box"];9[label="vx30/Tup0",fontsize=10,color="white",style="solid",shape="box"];4 -> 9[label="",style="solid", color="burlywood", weight=9]; 9.34/3.98 9 -> 5[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