Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell pair #487599402
details
property
value
status
complete
benchmark
Prelude_GTGTEQ__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.13514399529 seconds
cpu usage
10.021453186
max memory
5.6428544E8
stage attributes
key
value
output-size
9679
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) AND (7) QDP (8) QDPSizeChangeProof [EQUIVALENT, 0 ms] (9) YES (10) QDP (11) QDPSizeChangeProof [EQUIVALENT, 0 ms] (12) 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="blue",shape="box"];43[label=">>= :: (Maybe a) -> (a -> Maybe b) -> Maybe b",fontsize=10,color="white",style="solid",shape="box"];4 -> 43[label="",style="solid", color="blue", weight=9]; 43 -> 5[label="",style="solid", color="blue", weight=3]; 44[label=">>= :: ([] a) -> (a -> [] b) -> [] b",fontsize=10,color="white",style="solid",shape="box"];4 -> 44[label="",style="solid", color="blue", weight=9]; 44 -> 6[label="",style="solid", color="blue", weight=3]; 45[label=">>= :: (IO a) -> (a -> IO b) -> IO b",fontsize=10,color="white",style="solid",shape="box"];4 -> 45[label="",style="solid", color="blue", weight=9]; 45 -> 7[label="",style="solid", color="blue", weight=3]; 5[label="(>>=) vx3 vx4",fontsize=16,color="burlywood",shape="box"];46[label="vx3/Nothing",fontsize=10,color="white",style="solid",shape="box"];5 -> 46[label="",style="solid", color="burlywood", weight=9]; 46 -> 8[label="",style="solid", color="burlywood", weight=3]; 47[label="vx3/Just vx30",fontsize=10,color="white",style="solid",shape="box"];5 -> 47[label="",style="solid", color="burlywood", weight=9]; 47 -> 9[label="",style="solid", color="burlywood", weight=3]; 6[label="(>>=) vx3 vx4",fontsize=16,color="burlywood",shape="triangle"];48[label="vx3/vx30 : vx31",fontsize=10,color="white",style="solid",shape="box"];6 -> 48[label="",style="solid", color="burlywood", weight=9]; 48 -> 10[label="",style="solid", color="burlywood", weight=3]; 49[label="vx3/[]",fontsize=10,color="white",style="solid",shape="box"];6 -> 49[label="",style="solid", color="burlywood", weight=9]; 49 -> 11[label="",style="solid", color="burlywood", weight=3]; 7[label="(>>=) vx3 vx4",fontsize=16,color="black",shape="box"];7 -> 12[label="",style="solid", color="black", weight=3]; 8[label="(>>=) Nothing vx4",fontsize=16,color="black",shape="box"];8 -> 13[label="",style="solid", color="black", weight=3]; 9[label="(>>=) Just vx30 vx4",fontsize=16,color="black",shape="box"];9 -> 14[label="",style="solid", color="black", weight=3]; 10[label="(>>=) vx30 : vx31 vx4",fontsize=16,color="black",shape="box"];10 -> 15[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