Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell pair #487598599
details
property
value
status
complete
benchmark
Prelude_GTEQ_7.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n110.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.18864393234 seconds
cpu usage
10.358347406
max memory
5.73321216E8
stage attributes
key
value
output-size
48635
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 ---------------------------------------- (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 /= LT",fontsize=16,color="black",shape="box"];5 -> 6[label="",style="solid", color="black", weight=3]; 6[label="not (compare vx3 vx4 == LT)",fontsize=16,color="burlywood",shape="box"];516[label="vx3/vx30 :% vx31",fontsize=10,color="white",style="solid",shape="box"];6 -> 516[label="",style="solid", color="burlywood", weight=9]; 516 -> 7[label="",style="solid", color="burlywood", weight=3]; 7[label="not (compare (vx30 :% vx31) vx4 == LT)",fontsize=16,color="burlywood",shape="box"];517[label="vx4/vx40 :% vx41",fontsize=10,color="white",style="solid",shape="box"];7 -> 517[label="",style="solid", color="burlywood", weight=9]; 517 -> 8[label="",style="solid", color="burlywood", weight=3]; 8[label="not (compare (vx30 :% vx31) (vx40 :% vx41) == LT)",fontsize=16,color="black",shape="box"];8 -> 9[label="",style="solid", color="black", weight=3]; 9[label="not (compare (vx30 * vx41) (vx40 * vx31) == LT)",fontsize=16,color="black",shape="box"];9 -> 10[label="",style="solid", color="black", weight=3]; 10[label="not (primCmpInt (vx30 * vx41) (vx40 * vx31) == LT)",fontsize=16,color="black",shape="box"];10 -> 11[label="",style="solid", color="black", weight=3]; 11[label="not (primCmpInt (primMulInt vx30 vx41) (vx40 * vx31) == LT)",fontsize=16,color="burlywood",shape="box"];518[label="vx30/Pos vx300",fontsize=10,color="white",style="solid",shape="box"];11 -> 518[label="",style="solid", color="burlywood", weight=9]; 518 -> 12[label="",style="solid", color="burlywood", weight=3]; 519[label="vx30/Neg vx300",fontsize=10,color="white",style="solid",shape="box"];11 -> 519[label="",style="solid", color="burlywood", weight=9]; 519 -> 13[label="",style="solid", color="burlywood", weight=3]; 12[label="not (primCmpInt (primMulInt (Pos vx300) vx41) (vx40 * vx31) == LT)",fontsize=16,color="burlywood",shape="box"];520[label="vx41/Pos vx410",fontsize=10,color="white",style="solid",shape="box"];12 -> 520[label="",style="solid", color="burlywood", weight=9]; 520 -> 14[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