Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell pair #487599367
details
property
value
status
complete
benchmark
Prelude_GT_8.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.08640408516 seconds
cpu usage
9.726989887
max memory
5.607424E8
stage attributes
key
value
output-size
6642
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 [EQUIVALENT, 11 ms] (6) 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; " The following Function with conditions "compare x y|x == yEQ|x <= yLT|otherwiseGT; " is transformed to "compare x y = compare3 x y; " "compare0 x y True = GT; " "compare1 x y True = LT; compare1 x y False = compare0 x y otherwise; " "compare2 x y True = EQ; compare2 x y False = compare1 x y (x <= y); " "compare3 x y = compare2 x y (x == y); " ---------------------------------------- (4) Obligation: mainModule Main module Main where { import qualified Prelude; } ---------------------------------------- (5) Narrow (EQUIVALENT) 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="compare3 vx3 vx4 == GT",fontsize=16,color="black",shape="box"];6 -> 7[label="",style="solid", color="black", weight=3]; 7[label="compare2 vx3 vx4 (vx3 == vx4) == GT",fontsize=16,color="burlywood",shape="box"];31[label="vx3/False",fontsize=10,color="white",style="solid",shape="box"];7 -> 31[label="",style="solid", color="burlywood", weight=9]; 31 -> 8[label="",style="solid", color="burlywood", weight=3]; 32[label="vx3/True",fontsize=10,color="white",style="solid",shape="box"];7 -> 32[label="",style="solid", color="burlywood", weight=9]; 32 -> 9[label="",style="solid", color="burlywood", weight=3]; 8[label="compare2 False vx4 (False == vx4) == GT",fontsize=16,color="burlywood",shape="box"];33[label="vx4/False",fontsize=10,color="white",style="solid",shape="box"];8 -> 33[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