details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.44928216934 seconds
cpu usage	11.413072417
max memory	6.51681792E8

stage attributes

key	value
output-size	150738
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.hs /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/benchmark/theBenchmark.hs # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty H-Termination with start terms of the given HASKELL could be proven: (0) HASKELL (1) BR [EQUIVALENT, 0 ms] (2) HASKELL (3) COR [EQUIVALENT, 0 ms] (4) HASKELL (5) Narrow [SOUND, 0 ms] (6) AND (7) QDP (8) QDPSizeChangeProof [EQUIVALENT, 0 ms] (9) YES (10) QDP (11) QDPSizeChangeProof [EQUIVALENT, 0 ms] (12) YES (13) QDP (14) QDPSizeChangeProof [EQUIVALENT, 0 ms] (15) YES (16) QDP (17) QDPSizeChangeProof [EQUIVALENT, 0 ms] (18) YES ---------------------------------------- (0) Obligation: mainModule Main module Main where { import qualified Prelude; } ---------------------------------------- (1) BR (EQUIVALENT) Replaced joker patterns by fresh variables and removed binding patterns. ---------------------------------------- (2) Obligation: mainModule Main module Main where { import qualified Prelude; } ---------------------------------------- (3) COR (EQUIVALENT) Cond Reductions: The following Function with conditions "undefined |Falseundefined; " is transformed to "undefined = undefined1; " "undefined0 True = undefined; " "undefined1 = undefined0 False; " ---------------------------------------- (4) Obligation: mainModule Main module Main where { import qualified Prelude; } ---------------------------------------- (5) Narrow (SOUND) Haskell To QDPs digraph dp_graph { node [outthreshold=100, inthreshold=100];1[label="(/=)",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3]; 3[label="(/=) xv3",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", weight=3]; 4[label="(/=) xv3 xv4",fontsize=16,color="black",shape="triangle"];4 -> 5[label="",style="solid", color="black", weight=3]; 5 -> 18[label="",style="dashed", color="red", weight=0]; 5[label="not (xv3 == xv4)",fontsize=16,color="magenta"];5 -> 19[label="",style="dashed", color="magenta", weight=3]; 19[label="xv3 == xv4",fontsize=16,color="burlywood",shape="triangle"];634[label="xv3/Nothing",fontsize=10,color="white",style="solid",shape="box"];19 -> 634[label="",style="solid", color="burlywood", weight=9]; 634 -> 24[label="",style="solid", color="burlywood", weight=3]; 635[label="xv3/Just xv30",fontsize=10,color="white",style="solid",shape="box"];19 -> 635[label="",style="solid", color="burlywood", weight=9]; 635 -> 25[label="",style="solid", color="burlywood", weight=3]; 18[label="not xv7",fontsize=16,color="burlywood",shape="triangle"];636[label="xv7/False",fontsize=10,color="white",style="solid",shape="box"];18 -> 636[label="",style="solid", color="burlywood", weight=9]; 636 -> 26[label="",style="solid", color="burlywood", weight=3]; 637[label="xv7/True",fontsize=10,color="white",style="solid",shape="box"];18 -> 637[label="",style="solid", color="burlywood", weight=9]; 637 -> 27[label="",style="solid", color="burlywood", weight=3]; 24[label="Nothing == xv4",fontsize=16,color="burlywood",shape="box"];638[label="xv4/Nothing",fontsize=10,color="white",style="solid",shape="box"];24 -> 638[label="",style="solid", color="burlywood", weight=9]; popout

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

job log

popout

actions

all output return to Haskell