Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell 2019-04-01 06.52 pair #433317051
details
property
value
status
complete
benchmark
Prelude_LTEQ_1.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n054.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
6.95649 seconds
cpu usage
17.1443
user time
16.3829
system time
0.761389
max virtual memory
1.8285568E7
max residence set size
2402444.0
stage attributes
key
value
starexec-result
YES
output
14.57/6.18 YES 16.99/6.86 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 16.99/6.86 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 16.99/6.86 16.99/6.86 16.99/6.86 H-Termination with start terms of the given HASKELL could be proven: 16.99/6.86 16.99/6.86 (0) HASKELL 16.99/6.86 (1) CR [EQUIVALENT, 0 ms] 16.99/6.86 (2) HASKELL 16.99/6.86 (3) IFR [EQUIVALENT, 0 ms] 16.99/6.86 (4) HASKELL 16.99/6.86 (5) BR [EQUIVALENT, 0 ms] 16.99/6.86 (6) HASKELL 16.99/6.86 (7) COR [EQUIVALENT, 10 ms] 16.99/6.86 (8) HASKELL 16.99/6.86 (9) LetRed [EQUIVALENT, 30 ms] 16.99/6.86 (10) HASKELL 16.99/6.86 (11) NumRed [SOUND, 0 ms] 16.99/6.86 (12) HASKELL 16.99/6.86 (13) Narrow [SOUND, 0 ms] 16.99/6.86 (14) AND 16.99/6.86 (15) QDP 16.99/6.86 (16) QDPSizeChangeProof [EQUIVALENT, 0 ms] 16.99/6.86 (17) YES 16.99/6.86 (18) QDP 16.99/6.86 (19) QDPSizeChangeProof [EQUIVALENT, 0 ms] 16.99/6.86 (20) YES 16.99/6.86 (21) QDP 16.99/6.86 (22) QDPSizeChangeProof [EQUIVALENT, 0 ms] 16.99/6.86 (23) YES 16.99/6.86 (24) QDP 16.99/6.86 (25) QDPSizeChangeProof [EQUIVALENT, 54 ms] 16.99/6.86 (26) YES 16.99/6.86 (27) QDP 16.99/6.86 (28) QDPSizeChangeProof [EQUIVALENT, 0 ms] 16.99/6.86 (29) YES 16.99/6.86 (30) QDP 16.99/6.86 (31) QDPSizeChangeProof [EQUIVALENT, 0 ms] 16.99/6.86 (32) YES 16.99/6.86 16.99/6.86 16.99/6.86 ---------------------------------------- 16.99/6.86 16.99/6.86 (0) 16.99/6.86 Obligation: 16.99/6.86 mainModule Main 16.99/6.86 module Main where { 16.99/6.86 import qualified Prelude; 16.99/6.86 } 16.99/6.86 16.99/6.86 ---------------------------------------- 16.99/6.86 16.99/6.86 (1) CR (EQUIVALENT) 16.99/6.86 Case Reductions: 16.99/6.86 The following Case expression 16.99/6.86 "case compare x y of { 16.99/6.86 EQ -> o; 16.99/6.86 LT -> LT; 16.99/6.86 GT -> GT} 16.99/6.86 " 16.99/6.86 is transformed to 16.99/6.86 "primCompAux0 o EQ = o; 16.99/6.86 primCompAux0 o LT = LT; 16.99/6.86 primCompAux0 o GT = GT; 16.99/6.86 " 16.99/6.86 16.99/6.86 ---------------------------------------- 16.99/6.86 16.99/6.86 (2) 16.99/6.86 Obligation: 16.99/6.86 mainModule Main 16.99/6.86 module Main where { 16.99/6.86 import qualified Prelude; 16.99/6.86 } 16.99/6.86 16.99/6.86 ---------------------------------------- 16.99/6.86 16.99/6.86 (3) IFR (EQUIVALENT) 16.99/6.86 If Reductions: 16.99/6.86 The following If expression 16.99/6.86 "if primGEqNatS x y then Succ (primDivNatS (primMinusNatS x y) (Succ y)) else Zero" 16.99/6.86 is transformed to 16.99/6.86 "primDivNatS0 x y True = Succ (primDivNatS (primMinusNatS x y) (Succ y)); 16.99/6.86 primDivNatS0 x y False = Zero; 16.99/6.86 " 16.99/6.86 The following If expression 16.99/6.86 "if primGEqNatS x y then primModNatS (primMinusNatS x y) (Succ y) else Succ x" 16.99/6.86 is transformed to 16.99/6.86 "primModNatS0 x y True = primModNatS (primMinusNatS x y) (Succ y); 16.99/6.86 primModNatS0 x y False = Succ x; 16.99/6.86 " 16.99/6.86 16.99/6.86 ---------------------------------------- 16.99/6.86 16.99/6.86 (4) 16.99/6.86 Obligation: 16.99/6.86 mainModule Main 16.99/6.86 module Main where { 16.99/6.86 import qualified Prelude;
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell 2019-04-01 06.52