Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell pair #487599686
details
property
value
status
complete
benchmark
Prelude_drop_1.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n080.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.37501788139 seconds
cpu usage
10.270540847
max memory
6.19900928E8
stage attributes
key
value
output-size
14416
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) NumRed [SOUND, 0 ms] (6) HASKELL (7) Narrow [SOUND, 0 ms] (8) QDP (9) TransformationProof [EQUIVALENT, 0 ms] (10) QDP (11) DependencyGraphProof [EQUIVALENT, 0 ms] (12) QDP (13) UsableRulesProof [EQUIVALENT, 0 ms] (14) QDP (15) QReductionProof [EQUIVALENT, 0 ms] (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 "drop n xs|n <= 0xs; drop vv [] = []; drop n (vw : xs) = drop (n - 1) xs; " is transformed to "drop n xs = drop3 n xs; drop vv [] = drop1 vv []; drop n (vw : xs) = drop0 n (vw : xs); " "drop0 n (vw : xs) = drop (n - 1) xs; " "drop1 vv [] = []; drop1 wv ww = drop0 wv ww; " "drop2 n xs True = xs; drop2 n xs False = drop1 n xs; " "drop3 n xs = drop2 n xs (n <= 0); drop3 wx wy = drop1 wx wy; " 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; }
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell