Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell pair #487599526
details
property
value
status
complete
benchmark
Prelude_toRational_3.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n095.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
9.36370301247 seconds
cpu usage
20.130921917
max memory
1.441144832E9
stage attributes
key
value
output-size
379335
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) IFR [EQUIVALENT, 0 ms] (2) HASKELL (3) BR [EQUIVALENT, 0 ms] (4) HASKELL (5) COR [EQUIVALENT, 0 ms] (6) HASKELL (7) LetRed [EQUIVALENT, 0 ms] (8) HASKELL (9) NumRed [SOUND, 0 ms] (10) HASKELL (11) Narrow [SOUND, 0 ms] (12) AND (13) QDP (14) DependencyGraphProof [EQUIVALENT, 0 ms] (15) QDP (16) QDPOrderProof [EQUIVALENT, 43 ms] (17) QDP (18) DependencyGraphProof [EQUIVALENT, 0 ms] (19) QDP (20) QDPSizeChangeProof [EQUIVALENT, 0 ms] (21) YES (22) QDP (23) DependencyGraphProof [EQUIVALENT, 0 ms] (24) QDP (25) QDPOrderProof [EQUIVALENT, 15 ms] (26) QDP (27) QDPOrderProof [EQUIVALENT, 0 ms] (28) QDP (29) DependencyGraphProof [EQUIVALENT, 0 ms] (30) QDP (31) QDPOrderProof [EQUIVALENT, 0 ms] (32) QDP (33) DependencyGraphProof [EQUIVALENT, 0 ms] (34) QDP (35) InductionCalculusProof [EQUIVALENT, 0 ms] (36) QDP (37) NonInfProof [EQUIVALENT, 19 ms] (38) QDP (39) QDPSizeChangeProof [EQUIVALENT, 0 ms] (40) YES (41) QDP (42) DependencyGraphProof [EQUIVALENT, 0 ms] (43) QDP (44) QDPOrderProof [EQUIVALENT, 12 ms] (45) QDP (46) QDPOrderProof [EQUIVALENT, 0 ms] (47) QDP (48) DependencyGraphProof [EQUIVALENT, 0 ms] (49) QDP (50) QDPOrderProof [EQUIVALENT, 0 ms] (51) QDP (52) DependencyGraphProof [EQUIVALENT, 0 ms] (53) QDP (54) InductionCalculusProof [EQUIVALENT, 0 ms] (55) QDP (56) NonInfProof [EQUIVALENT, 0 ms] (57) QDP (58) QDPSizeChangeProof [EQUIVALENT, 0 ms] (59) YES (60) QDP (61) QDPSizeChangeProof [EQUIVALENT, 0 ms] (62) YES (63) QDP (64) QDPSizeChangeProof [EQUIVALENT, 0 ms] (65) YES (66) QDP (67) QDPSizeChangeProof [EQUIVALENT, 0 ms] (68) YES ---------------------------------------- (0) Obligation: mainModule Main module Main where { import qualified Prelude; } ---------------------------------------- (1) 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
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell