Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell 2019-04-01 06.52 pair #433316235
details
property
value
status
complete
benchmark
Prelude_show_5.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n041.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
17.5579 seconds
cpu usage
31.0437
user time
29.5218
system time
1.52194
max virtual memory
1.8351564E7
max residence set size
4308104.0
stage attributes
key
value
starexec-result
MAYBE
output
28.74/16.95 MAYBE 30.83/17.51 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 30.83/17.51 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 30.83/17.51 30.83/17.51 30.83/17.51 H-Termination with start terms of the given HASKELL could not be shown: 30.83/17.51 30.83/17.51 (0) HASKELL 30.83/17.51 (1) IFR [EQUIVALENT, 0 ms] 30.83/17.51 (2) HASKELL 30.83/17.51 (3) BR [EQUIVALENT, 0 ms] 30.83/17.51 (4) HASKELL 30.83/17.51 (5) COR [EQUIVALENT, 0 ms] 30.83/17.51 (6) HASKELL 30.83/17.51 (7) NumRed [SOUND, 2 ms] 30.83/17.51 (8) HASKELL 30.83/17.51 (9) Narrow [SOUND, 0 ms] 30.83/17.51 (10) AND 30.83/17.51 (11) QDP 30.83/17.51 (12) DependencyGraphProof [EQUIVALENT, 0 ms] 30.83/17.51 (13) QDP 30.83/17.51 (14) QDPOrderProof [EQUIVALENT, 10 ms] 30.83/17.51 (15) QDP 30.83/17.51 (16) DependencyGraphProof [EQUIVALENT, 0 ms] 30.83/17.51 (17) QDP 30.83/17.51 (18) QDPSizeChangeProof [EQUIVALENT, 0 ms] 30.83/17.51 (19) YES 30.83/17.51 (20) QDP 30.83/17.51 (21) DependencyGraphProof [EQUIVALENT, 0 ms] 30.83/17.51 (22) QDP 30.83/17.51 (23) QDPOrderProof [EQUIVALENT, 8 ms] 30.83/17.51 (24) QDP 30.83/17.51 (25) DependencyGraphProof [EQUIVALENT, 0 ms] 30.83/17.51 (26) QDP 30.83/17.51 (27) QDPSizeChangeProof [EQUIVALENT, 0 ms] 30.83/17.51 (28) YES 30.83/17.51 (29) QDP 30.83/17.51 (30) QDPSizeChangeProof [EQUIVALENT, 0 ms] 30.83/17.51 (31) YES 30.83/17.51 (32) QDP 30.83/17.51 (33) DependencyGraphProof [EQUIVALENT, 0 ms] 30.83/17.51 (34) QDP 30.83/17.51 (35) TransformationProof [EQUIVALENT, 0 ms] 30.83/17.51 (36) QDP 30.83/17.51 (37) UsableRulesProof [EQUIVALENT, 0 ms] 30.83/17.51 (38) QDP 30.83/17.51 (39) QReductionProof [EQUIVALENT, 0 ms] 30.83/17.51 (40) QDP 30.83/17.51 (41) MNOCProof [EQUIVALENT, 0 ms] 30.83/17.51 (42) QDP 30.83/17.51 (43) InductionCalculusProof [EQUIVALENT, 0 ms] 30.83/17.51 (44) QDP 30.83/17.51 (45) TransformationProof [EQUIVALENT, 0 ms] 30.83/17.51 (46) QDP 30.83/17.51 (47) DependencyGraphProof [EQUIVALENT, 0 ms] 30.83/17.51 (48) QDP 30.83/17.51 (49) TransformationProof [EQUIVALENT, 0 ms] 30.83/17.51 (50) QDP 30.83/17.51 (51) DependencyGraphProof [EQUIVALENT, 0 ms] 30.83/17.51 (52) QDP 30.83/17.51 (53) TransformationProof [EQUIVALENT, 0 ms] 30.83/17.51 (54) QDP 30.83/17.51 (55) DependencyGraphProof [EQUIVALENT, 0 ms] 30.83/17.51 (56) QDP 30.83/17.51 (57) TransformationProof [EQUIVALENT, 0 ms] 30.83/17.51 (58) QDP 30.83/17.51 (59) DependencyGraphProof [EQUIVALENT, 0 ms] 30.83/17.51 (60) QDP 30.83/17.51 (61) MNOCProof [EQUIVALENT, 0 ms] 30.83/17.51 (62) QDP 30.83/17.51 (63) InductionCalculusProof [EQUIVALENT, 0 ms] 30.83/17.51 (64) QDP 30.83/17.51 (65) Narrow [COMPLETE, 0 ms] 30.83/17.51 (66) QDP 30.83/17.51 (67) DependencyGraphProof [EQUIVALENT, 0 ms] 30.83/17.51 (68) TRUE 30.83/17.51 30.83/17.51 30.83/17.51 ---------------------------------------- 30.83/17.51 30.83/17.51 (0) 30.83/17.51 Obligation: 30.83/17.51 mainModule Main 30.83/17.51 module Main where { 30.83/17.51 import qualified Prelude; 30.83/17.51 } 30.83/17.51 30.83/17.51 ---------------------------------------- 30.83/17.51 30.83/17.51 (1) IFR (EQUIVALENT) 30.83/17.51 If Reductions: 30.83/17.51 The following If expression 30.83/17.51 "if primGEqNatS x y then primModNatS (primMinusNatS x y) (Succ y) else Succ x" 30.83/17.51 is transformed to 30.83/17.51 "primModNatS0 x y True = primModNatS (primMinusNatS x y) (Succ y); 30.83/17.51 primModNatS0 x y False = Succ x; 30.83/17.51 " 30.83/17.51 The following If expression 30.83/17.51 "if primGEqNatS x y then primModNatP (primMinusNatS x y) (Succ y) else primMinusNatS y x" 30.83/17.51 is transformed to
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell 2019-04-01 06.52