Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell pair #487599021
details
property
value
status
complete
benchmark
Prelude_showSigned_1.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n099.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
7.67114806175 seconds
cpu usage
12.418719637
max memory
6.85244416E8
stage attributes
key
value
output-size
95590
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) CR [EQUIVALENT, 0 ms] (2) HASKELL (3) IFR [EQUIVALENT, 0 ms] (4) HASKELL (5) BR [EQUIVALENT, 0 ms] (6) HASKELL (7) COR [EQUIVALENT, 11 ms] (8) HASKELL (9) LetRed [EQUIVALENT, 0 ms] (10) HASKELL (11) NumRed [SOUND, 0 ms] (12) HASKELL (13) Narrow [SOUND, 0 ms] (14) QDP (15) QDPSizeChangeProof [EQUIVALENT, 0 ms] (16) YES ---------------------------------------- (0) Obligation: mainModule Main module Main where { import qualified Prelude; } ---------------------------------------- (1) CR (EQUIVALENT) Case Reductions: The following Case expression "case compare x y of { EQ -> o; LT -> LT; GT -> GT} " is transformed to "primCompAux0 o EQ = o; primCompAux0 o LT = LT; primCompAux0 o GT = GT; " ---------------------------------------- (2) Obligation: mainModule Main module Main where { import qualified Prelude; } ---------------------------------------- (3) IFR (EQUIVALENT) If Reductions: The following If expression "if primGEqNatS x y then Succ (primDivNatS (primMinusNatS x y) (Succ y)) else Zero" is transformed to "primDivNatS0 x y True = Succ (primDivNatS (primMinusNatS x y) (Succ y)); primDivNatS0 x y False = Zero; " The following If expression "if primGEqNatS x y then primModNatS (primMinusNatS x y) (Succ y) else Succ x" is transformed to "primModNatS0 x y True = primModNatS (primMinusNatS x y) (Succ y); primModNatS0 x y False = Succ x; " The following If expression "if x < 0 then showParen (p > 6) ((showChar '-') . showPos (`negate` x)) else showPos x" is transformed to "showSigned0 p showPos x True = showParen (p > 6) ((showChar '-') . showPos (`negate` x)); showSigned0 p showPos x False = showPos x; " The following If expression "if b then (showChar '(') . p . showChar ')' else p" is transformed to "showParen0 p True = (showChar '(') . p . showChar ')'; showParen0 p False = p; " ---------------------------------------- (4) Obligation: mainModule Main
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell