details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	3.97777 seconds
cpu usage	9.14607
user time	8.87903
system time	0.267042
max virtual memory	1.828352E7
max residence set size	553508.0

stage attributes

key	value
starexec-result	YES

output

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