Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell pair #487598687
details
property
value
status
complete
benchmark
List_insert_8.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n108.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
5.14103317261 seconds
cpu usage
12.782341303
max memory
7.21821696E8
stage attributes
key
value
output-size
12726
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) CR [EQUIVALENT, 0 ms] (2) HASKELL (3) BR [EQUIVALENT, 0 ms] (4) HASKELL (5) COR [EQUIVALENT, 25 ms] (6) HASKELL (7) Narrow [SOUND, 0 ms] (8) QDP (9) QDPSizeChangeProof [EQUIVALENT, 0 ms] (10) YES ---------------------------------------- (0) Obligation: mainModule Main module Maybe where { import qualified List; import qualified Main; import qualified Prelude; } module List where { import qualified Main; import qualified Maybe; import qualified Prelude; insert :: Ord a => a -> [a] -> [a]; insert e ls = insertBy compare e ls; insertBy :: (a -> a -> Ordering) -> a -> [a] -> [a]; insertBy _ x [] = x : []; insertBy cmp x ys@(y : ys') = case cmp x y of { GT-> y : insertBy cmp x ys'; _-> x : ys; } ; } module Main where { import qualified List; import qualified Maybe; import qualified Prelude; } ---------------------------------------- (1) CR (EQUIVALENT) Case Reductions: The following Case expression "case cmp x y of { GT -> y : insertBy cmp x ys'; _ -> x : ys} " is transformed to "insertBy0 y cmp x ys' ys GT = y : insertBy cmp x ys'; insertBy0 y cmp x ys' ys _ = x : ys; " ---------------------------------------- (2) Obligation: mainModule Main module Maybe where { import qualified List; import qualified Main; import qualified Prelude; } module List where { import qualified Main; import qualified Maybe; import qualified Prelude; insert :: Ord a => a -> [a] -> [a]; insert e ls = insertBy compare e ls; insertBy :: (a -> a -> Ordering) -> a -> [a] -> [a]; insertBy _ x [] = x : []; insertBy cmp x ys@(y : ys') = insertBy0 y cmp x ys' ys (cmp x y); insertBy0 y cmp x ys' ys GT = y : insertBy cmp x ys'; insertBy0 y cmp x ys' ys _ = x : ys; } module Main where { import qualified List; import qualified Maybe; import qualified Prelude;
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell