Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell pair #487598832
details
property
value
status
complete
benchmark
Prelude_SLASHEQ_1.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n154.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
7.71808719635 seconds
cpu usage
11.226402023
max memory
6.14854656E8
stage attributes
key
value
output-size
147870
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 (16) QDP (17) QDPSizeChangeProof [EQUIVALENT, 0 ms] (18) 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="(/=) xv3",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", weight=3]; 4[label="(/=) xv3 xv4",fontsize=16,color="blue",shape="box"];834[label="/= :: Double -> Double -> Bool",fontsize=10,color="white",style="solid",shape="box"];4 -> 834[label="",style="solid", color="blue", weight=9]; 834 -> 5[label="",style="solid", color="blue", weight=3]; 835[label="/= :: ([] a) -> ([] a) -> Bool",fontsize=10,color="white",style="solid",shape="box"];4 -> 835[label="",style="solid", color="blue", weight=9]; 835 -> 6[label="",style="solid", color="blue", weight=3]; 836[label="/= :: ((@3) a b c) -> ((@3) a b c) -> Bool",fontsize=10,color="white",style="solid",shape="box"];4 -> 836[label="",style="solid", color="blue", weight=9]; 836 -> 7[label="",style="solid", color="blue", weight=3]; 837[label="/= :: () -> () -> Bool",fontsize=10,color="white",style="solid",shape="box"];4 -> 837[label="",style="solid", color="blue", weight=9]; 837 -> 8[label="",style="solid", color="blue", weight=3]; 838[label="/= :: Ordering -> Ordering -> Bool",fontsize=10,color="white",style="solid",shape="box"];4 -> 838[label="",style="solid", color="blue", weight=9]; 838 -> 9[label="",style="solid", color="blue", weight=3]; 839[label="/= :: Char -> Char -> Bool",fontsize=10,color="white",style="solid",shape="box"];4 -> 839[label="",style="solid", color="blue", weight=9]; 839 -> 10[label="",style="solid", color="blue", weight=3];
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell