details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.21963000298 seconds
cpu usage	9.659722416
max memory	5.970944E8

stage attributes

key	value
output-size	6927
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="not (compare vx3 vx4 == GT)",fontsize=16,color="black",shape="box"];6 -> 7[label="",style="solid", color="black", weight=3]; 7[label="not (primCmpChar vx3 vx4 == GT)",fontsize=16,color="burlywood",shape="box"];28[label="vx3/Char vx30",fontsize=10,color="white",style="solid",shape="box"];7 -> 28[label="",style="solid", color="burlywood", weight=9]; 28 -> 8[label="",style="solid", color="burlywood", weight=3]; 8[label="not (primCmpChar (Char vx30) vx4 == GT)",fontsize=16,color="burlywood",shape="box"];29[label="vx4/Char vx40",fontsize=10,color="white",style="solid",shape="box"];8 -> 29[label="",style="solid", color="burlywood", weight=9]; 29 -> 9[label="",style="solid", color="burlywood", weight=3]; 9[label="not (primCmpChar (Char vx30) (Char vx40) == GT)",fontsize=16,color="black",shape="box"];9 -> 10[label="",style="solid", color="black", weight=3]; 10[label="not (primCmpNat vx30 vx40 == GT)",fontsize=16,color="burlywood",shape="triangle"];30[label="vx30/Succ vx300",fontsize=10,color="white",style="solid",shape="box"];10 -> 30[label="",style="solid", color="burlywood", weight=9]; 30 -> 11[label="",style="solid", color="burlywood", weight=3]; 31[label="vx30/Zero",fontsize=10,color="white",style="solid",shape="box"];10 -> 31[label="",style="solid", color="burlywood", weight=9]; 31 -> 12[label="",style="solid", color="burlywood", weight=3]; 11[label="not (primCmpNat (Succ vx300) vx40 == GT)",fontsize=16,color="burlywood",shape="box"];32[label="vx40/Succ vx400",fontsize=10,color="white",style="solid",shape="box"];11 -> 32[label="",style="solid", color="burlywood", weight=9]; 32 -> 13[label="",style="solid", color="burlywood", weight=3]; 33[label="vx40/Zero",fontsize=10,color="white",style="solid",shape="box"];11 -> 33[label="",style="solid", color="burlywood", weight=9]; 33 -> 14[label="",style="solid", color="burlywood", weight=3]; 12[label="not (primCmpNat Zero vx40 == GT)",fontsize=16,color="burlywood",shape="box"];34[label="vx40/Succ vx400",fontsize=10,color="white",style="solid",shape="box"];12 -> 34[label="",style="solid", color="burlywood", weight=9]; 34 -> 15[label="",style="solid", color="burlywood", weight=3]; 35[label="vx40/Zero",fontsize=10,color="white",style="solid",shape="box"];12 -> 35[label="",style="solid", color="burlywood", weight=9]; 35 -> 16[label="",style="solid", color="burlywood", weight=3]; 13[label="not (primCmpNat (Succ vx300) (Succ vx400) == GT)",fontsize=16,color="black",shape="box"];13 -> 17[label="",style="solid", color="black", weight=3]; 14[label="not (primCmpNat (Succ vx300) Zero == GT)",fontsize=16,color="black",shape="box"];14 -> 18[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