Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell pair #487599019
details
property
value
status
complete
benchmark
Prelude_properFraction_3.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n149.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.68710112572 seconds
cpu usage
12.080107846
max memory
6.62913024E8
stage attributes
key
value
output-size
59788
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) LR [EQUIVALENT, 0 ms] (2) HASKELL (3) IFR [EQUIVALENT, 0 ms] (4) HASKELL (5) BR [EQUIVALENT, 0 ms] (6) HASKELL (7) COR [EQUIVALENT, 0 ms] (8) HASKELL (9) LetRed [EQUIVALENT, 0 ms] (10) HASKELL (11) Narrow [SOUND, 0 ms] (12) AND (13) QDP (14) DependencyGraphProof [EQUIVALENT, 0 ms] (15) AND (16) QDP (17) MRRProof [EQUIVALENT, 0 ms] (18) QDP (19) PisEmptyProof [EQUIVALENT, 0 ms] (20) YES (21) QDP (22) QDPSizeChangeProof [EQUIVALENT, 0 ms] (23) YES (24) QDP (25) DependencyGraphProof [EQUIVALENT, 0 ms] (26) AND (27) QDP (28) MRRProof [EQUIVALENT, 0 ms] (29) QDP (30) PisEmptyProof [EQUIVALENT, 0 ms] (31) YES (32) QDP (33) QDPOrderProof [EQUIVALENT, 11 ms] (34) QDP (35) DependencyGraphProof [EQUIVALENT, 0 ms] (36) QDP (37) QDPSizeChangeProof [EQUIVALENT, 0 ms] (38) YES (39) QDP (40) QDPSizeChangeProof [EQUIVALENT, 0 ms] (41) YES ---------------------------------------- (0) Obligation: mainModule Main module Main where { import qualified Prelude; } ---------------------------------------- (1) LR (EQUIVALENT) Lambda Reductions: The following Lambda expression "\(q,_)->q" is transformed to "q1 (q,_) = q; " The following Lambda expression "\(_,r)->r" is transformed to "r0 (_,r) = r; " ---------------------------------------- (2) Obligation: mainModule Main module Main where { import qualified Prelude; } ---------------------------------------- (3) IFR (EQUIVALENT) If Reductions: 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; "
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell