details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.17206716537 seconds
cpu usage	10.123899771
max memory	5.8339328E8

stage attributes

key	value
output-size	16783
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) QDP (7) QDPSizeChangeProof [EQUIVALENT, 0 ms] (8) 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="(>) vx3",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", weight=3]; 4[label="(>) vx3 vx4",fontsize=16,color="black",shape="triangle"];4 -> 5[label="",style="solid", color="black", weight=3]; 5[label="compare vx3 vx4 == GT",fontsize=16,color="black",shape="box"];5 -> 6[label="",style="solid", color="black", weight=3]; 6[label="primCmpInt vx3 vx4 == GT",fontsize=16,color="burlywood",shape="box"];70[label="vx3/Pos vx30",fontsize=10,color="white",style="solid",shape="box"];6 -> 70[label="",style="solid", color="burlywood", weight=9]; 70 -> 7[label="",style="solid", color="burlywood", weight=3]; 71[label="vx3/Neg vx30",fontsize=10,color="white",style="solid",shape="box"];6 -> 71[label="",style="solid", color="burlywood", weight=9]; 71 -> 8[label="",style="solid", color="burlywood", weight=3]; 7[label="primCmpInt (Pos vx30) vx4 == GT",fontsize=16,color="burlywood",shape="box"];72[label="vx30/Succ vx300",fontsize=10,color="white",style="solid",shape="box"];7 -> 72[label="",style="solid", color="burlywood", weight=9]; 72 -> 9[label="",style="solid", color="burlywood", weight=3]; 73[label="vx30/Zero",fontsize=10,color="white",style="solid",shape="box"];7 -> 73[label="",style="solid", color="burlywood", weight=9]; 73 -> 10[label="",style="solid", color="burlywood", weight=3]; 8[label="primCmpInt (Neg vx30) vx4 == GT",fontsize=16,color="burlywood",shape="box"];74[label="vx30/Succ vx300",fontsize=10,color="white",style="solid",shape="box"];8 -> 74[label="",style="solid", color="burlywood", weight=9]; 74 -> 11[label="",style="solid", color="burlywood", weight=3]; 75[label="vx30/Zero",fontsize=10,color="white",style="solid",shape="box"];8 -> 75[label="",style="solid", color="burlywood", weight=9]; 75 -> 12[label="",style="solid", color="burlywood", weight=3]; 9[label="primCmpInt (Pos (Succ vx300)) vx4 == GT",fontsize=16,color="burlywood",shape="box"];76[label="vx4/Pos vx40",fontsize=10,color="white",style="solid",shape="box"];9 -> 76[label="",style="solid", color="burlywood", weight=9]; 76 -> 13[label="",style="solid", color="burlywood", weight=3]; 77[label="vx4/Neg vx40",fontsize=10,color="white",style="solid",shape="box"];9 -> 77[label="",style="solid", color="burlywood", weight=9]; 77 -> 14[label="",style="solid", color="burlywood", weight=3]; 10[label="primCmpInt (Pos Zero) vx4 == GT",fontsize=16,color="burlywood",shape="box"];78[label="vx4/Pos vx40",fontsize=10,color="white",style="solid",shape="box"];10 -> 78[label="",style="solid", color="burlywood", weight=9]; 78 -> 15[label="",style="solid", color="burlywood", weight=3]; 79[label="vx4/Neg vx40",fontsize=10,color="white",style="solid",shape="box"];10 -> 79[label="",style="solid", color="burlywood", weight=9]; 79 -> 16[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