Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell pair #487599685
details
property
value
status
complete
benchmark
Prelude_fmap_1.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.01222586632 seconds
cpu usage
9.666188885
max memory
5.6260608E8
stage attributes
key
value
output-size
8484
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.hs /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/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="fmap",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3]; 3[label="fmap vx3",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", weight=3]; 4[label="fmap vx3 vx4",fontsize=16,color="blue",shape="box"];38[label="fmap :: (a -> b) -> (IO a) -> IO b",fontsize=10,color="white",style="solid",shape="box"];4 -> 38[label="",style="solid", color="blue", weight=9]; 38 -> 5[label="",style="solid", color="blue", weight=3]; 39[label="fmap :: (a -> b) -> (Maybe a) -> Maybe b",fontsize=10,color="white",style="solid",shape="box"];4 -> 39[label="",style="solid", color="blue", weight=9]; 39 -> 6[label="",style="solid", color="blue", weight=3]; 40[label="fmap :: (a -> b) -> ([] a) -> [] b",fontsize=10,color="white",style="solid",shape="box"];4 -> 40[label="",style="solid", color="blue", weight=9]; 40 -> 7[label="",style="solid", color="blue", weight=3]; 5[label="fmap vx3 vx4",fontsize=16,color="black",shape="box"];5 -> 8[label="",style="solid", color="black", weight=3]; 6[label="fmap vx3 vx4",fontsize=16,color="burlywood",shape="box"];41[label="vx4/Nothing",fontsize=10,color="white",style="solid",shape="box"];6 -> 41[label="",style="solid", color="burlywood", weight=9]; 41 -> 9[label="",style="solid", color="burlywood", weight=3]; 42[label="vx4/Just vx40",fontsize=10,color="white",style="solid",shape="box"];6 -> 42[label="",style="solid", color="burlywood", weight=9]; 42 -> 10[label="",style="solid", color="burlywood", weight=3]; 7[label="fmap vx3 vx4",fontsize=16,color="black",shape="box"];7 -> 11[label="",style="solid", color="black", weight=3]; 8[label="vx4 >>= return . vx3",fontsize=16,color="black",shape="box"];8 -> 12[label="",style="solid", color="black", weight=3]; 9[label="fmap vx3 Nothing",fontsize=16,color="black",shape="box"];9 -> 13[label="",style="solid", color="black", weight=3]; 10[label="fmap vx3 (Just vx40)",fontsize=16,color="black",shape="box"];10 -> 14[label="",style="solid", color="black", weight=3]; 11[label="map vx3 vx4",fontsize=16,color="burlywood",shape="triangle"];43[label="vx4/vx40 : vx41",fontsize=10,color="white",style="solid",shape="box"];11 -> 43[label="",style="solid", color="burlywood", weight=9]; 43 -> 15[label="",style="solid", color="burlywood", weight=3]; 44[label="vx4/[]",fontsize=10,color="white",style="solid",shape="box"];11 -> 44[label="",style="solid", color="burlywood", weight=9]; 44 -> 16[label="",style="solid", color="burlywood", weight=3]; 12[label="primbindIO vx4 (return . vx3)",fontsize=16,color="burlywood",shape="box"];45[label="vx4/IO vx40",fontsize=10,color="white",style="solid",shape="box"];12 -> 45[label="",style="solid", color="burlywood", weight=9]; 45 -> 17[label="",style="solid", color="burlywood", weight=3]; 46[label="vx4/AProVE_IO vx40",fontsize=10,color="white",style="solid",shape="box"];12 -> 46[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