Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell 2019-04-01 06.52 pair #433316615
details
property
value
status
complete
benchmark
Prelude_truncate_1.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n019.star.cs.uiowa.edu
space
full_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
8.25219 seconds
cpu usage
11.3175
user time
11.0001
system time
0.317424
max virtual memory
1.8285568E7
max residence set size
649120.0
stage attributes
key
value
starexec-result
YES
output
8.87/3.85 YES 11.09/4.47 proof of /export/starexec/sandbox2/benchmark/theBenchmark.hs 11.09/4.47 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 11.09/4.47 11.09/4.47 11.09/4.47 H-Termination with start terms of the given HASKELL could be proven: 11.09/4.47 11.09/4.47 (0) HASKELL 11.09/4.47 (1) LR [EQUIVALENT, 0 ms] 11.09/4.47 (2) HASKELL 11.09/4.47 (3) IFR [EQUIVALENT, 0 ms] 11.09/4.47 (4) HASKELL 11.09/4.47 (5) BR [EQUIVALENT, 0 ms] 11.09/4.47 (6) HASKELL 11.09/4.47 (7) COR [EQUIVALENT, 0 ms] 11.09/4.47 (8) HASKELL 11.09/4.47 (9) LetRed [EQUIVALENT, 10 ms] 11.09/4.47 (10) HASKELL 11.09/4.47 (11) NumRed [SOUND, 0 ms] 11.09/4.47 (12) HASKELL 11.09/4.47 (13) Narrow [SOUND, 0 ms] 11.09/4.47 (14) AND 11.09/4.47 (15) QDP 11.09/4.47 (16) DependencyGraphProof [EQUIVALENT, 0 ms] 11.09/4.47 (17) AND 11.09/4.47 (18) QDP 11.09/4.47 (19) MRRProof [EQUIVALENT, 4 ms] 11.09/4.47 (20) QDP 11.09/4.47 (21) PisEmptyProof [EQUIVALENT, 0 ms] 11.09/4.47 (22) YES 11.09/4.47 (23) QDP 11.09/4.47 (24) QDPSizeChangeProof [EQUIVALENT, 20 ms] 11.09/4.47 (25) YES 11.09/4.47 (26) QDP 11.09/4.47 (27) QDPSizeChangeProof [EQUIVALENT, 0 ms] 11.09/4.47 (28) YES 11.09/4.47 11.09/4.47 11.09/4.47 ---------------------------------------- 11.09/4.47 11.09/4.47 (0) 11.09/4.47 Obligation: 11.09/4.47 mainModule Main 11.09/4.47 module Main where { 11.09/4.47 import qualified Prelude; 11.09/4.47 } 11.09/4.47 11.09/4.47 ---------------------------------------- 11.09/4.47 11.09/4.47 (1) LR (EQUIVALENT) 11.09/4.47 Lambda Reductions: 11.09/4.47 The following Lambda expression 11.09/4.47 "\(m,_)->m" 11.09/4.47 is transformed to 11.09/4.47 "m0 (m,_) = m; 11.09/4.47 " 11.09/4.47 The following Lambda expression 11.09/4.47 "\(q,_)->q" 11.09/4.47 is transformed to 11.09/4.47 "q1 (q,_) = q; 11.09/4.47 " 11.09/4.47 The following Lambda expression 11.09/4.47 "\(_,r)->r" 11.09/4.47 is transformed to 11.09/4.47 "r0 (_,r) = r; 11.09/4.47 " 11.09/4.47 11.09/4.47 ---------------------------------------- 11.09/4.47 11.09/4.47 (2) 11.09/4.47 Obligation: 11.09/4.47 mainModule Main 11.09/4.47 module Main where { 11.09/4.47 import qualified Prelude; 11.09/4.47 } 11.09/4.47 11.09/4.47 ---------------------------------------- 11.09/4.47 11.09/4.47 (3) IFR (EQUIVALENT) 11.09/4.47 If Reductions: 11.09/4.47 The following If expression 11.09/4.47 "if primGEqNatS x y then Succ (primDivNatS (primMinusNatS x y) (Succ y)) else Zero" 11.09/4.47 is transformed to 11.09/4.47 "primDivNatS0 x y True = Succ (primDivNatS (primMinusNatS x y) (Succ y)); 11.09/4.47 primDivNatS0 x y False = Zero; 11.09/4.47 " 11.09/4.47 The following If expression 11.09/4.47 "if primGEqNatS x y then primModNatS (primMinusNatS x y) (Succ y) else Succ x" 11.09/4.47 is transformed to 11.09/4.47 "primModNatS0 x y True = primModNatS (primMinusNatS x y) (Succ y); 11.09/4.47 primModNatS0 x y False = Succ x; 11.09/4.47 " 11.09/4.47 11.09/4.47 ---------------------------------------- 11.09/4.47 11.09/4.47 (4) 11.09/4.47 Obligation: 11.09/4.47 mainModule Main 11.09/4.47 module Main where { 11.09/4.47 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