Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell 2019-04-01 06.52 pair #433317307
details
property
value
status
complete
benchmark
gcd_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
basic_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
8.25775 seconds
cpu usage
22.3701
user time
21.6428
system time
0.727354
max virtual memory
1.8353612E7
max residence set size
1842164.0
stage attributes
key
value
starexec-result
YES
output
19.86/7.57 YES 22.17/8.19 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 22.17/8.19 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 22.17/8.19 22.17/8.19 22.17/8.19 H-Termination with start terms of the given HASKELL could be proven: 22.17/8.19 22.17/8.19 (0) HASKELL 22.17/8.19 (1) BR [EQUIVALENT, 0 ms] 22.17/8.19 (2) HASKELL 22.17/8.19 (3) COR [EQUIVALENT, 0 ms] 22.17/8.19 (4) HASKELL 22.17/8.19 (5) Narrow [SOUND, 0 ms] 22.17/8.19 (6) QDP 22.17/8.19 (7) DependencyGraphProof [EQUIVALENT, 0 ms] 22.17/8.19 (8) QDP 22.17/8.19 (9) TransformationProof [EQUIVALENT, 0 ms] 22.17/8.19 (10) QDP 22.17/8.19 (11) DependencyGraphProof [EQUIVALENT, 0 ms] 22.17/8.19 (12) AND 22.17/8.19 (13) QDP 22.17/8.19 (14) TransformationProof [EQUIVALENT, 0 ms] 22.17/8.19 (15) QDP 22.17/8.19 (16) QDPOrderProof [EQUIVALENT, 103 ms] 22.17/8.19 (17) QDP 22.17/8.19 (18) DependencyGraphProof [EQUIVALENT, 0 ms] 22.17/8.19 (19) QDP 22.17/8.19 (20) InductionCalculusProof [EQUIVALENT, 0 ms] 22.17/8.19 (21) QDP 22.17/8.19 (22) NonInfProof [EQUIVALENT, 54 ms] 22.17/8.19 (23) QDP 22.17/8.19 (24) DependencyGraphProof [EQUIVALENT, 0 ms] 22.17/8.19 (25) QDP 22.17/8.19 (26) QDPSizeChangeProof [EQUIVALENT, 0 ms] 22.17/8.19 (27) YES 22.17/8.19 (28) QDP 22.17/8.19 (29) TransformationProof [EQUIVALENT, 0 ms] 22.17/8.19 (30) QDP 22.17/8.19 (31) TransformationProof [EQUIVALENT, 0 ms] 22.17/8.19 (32) QDP 22.17/8.19 (33) QDPOrderProof [EQUIVALENT, 0 ms] 22.17/8.19 (34) QDP 22.17/8.19 (35) DependencyGraphProof [EQUIVALENT, 0 ms] 22.17/8.19 (36) QDP 22.17/8.19 (37) QDPOrderProof [EQUIVALENT, 48 ms] 22.17/8.19 (38) QDP 22.17/8.19 (39) DependencyGraphProof [EQUIVALENT, 0 ms] 22.17/8.19 (40) QDP 22.17/8.19 (41) InductionCalculusProof [EQUIVALENT, 0 ms] 22.17/8.19 (42) QDP 22.17/8.19 (43) NonInfProof [EQUIVALENT, 34 ms] 22.17/8.19 (44) QDP 22.17/8.19 (45) DependencyGraphProof [EQUIVALENT, 0 ms] 22.17/8.19 (46) AND 22.17/8.19 (47) QDP 22.17/8.19 (48) QDPSizeChangeProof [EQUIVALENT, 0 ms] 22.17/8.19 (49) YES 22.17/8.19 (50) QDP 22.17/8.19 (51) QDPSizeChangeProof [EQUIVALENT, 0 ms] 22.17/8.19 (52) YES 22.17/8.19 22.17/8.19 22.17/8.19 ---------------------------------------- 22.17/8.19 22.17/8.19 (0) 22.17/8.19 Obligation: 22.17/8.19 mainModule Main 22.17/8.19 module Main where { 22.17/8.19 import qualified Prelude; 22.17/8.19 data MyBool = MyTrue | MyFalse ; 22.17/8.19 22.17/8.19 data MyInt = Pos Main.Nat | Neg Main.Nat ; 22.17/8.19 22.17/8.19 data Main.Nat = Succ Main.Nat | Zero ; 22.17/8.19 22.17/8.19 data Ordering = LT | EQ | GT ; 22.17/8.19 22.17/8.19 abs :: MyInt -> MyInt; 22.17/8.19 abs = absReal; 22.17/8.19 22.17/8.19 absReal x = absReal2 x; 22.17/8.19 22.17/8.19 absReal0 x MyTrue = negate x; 22.17/8.19 22.17/8.19 absReal1 x MyTrue = x; 22.17/8.19 absReal1 x MyFalse = absReal0 x otherwise; 22.17/8.19 22.17/8.19 absReal2 x = absReal1 x (gtEs x (fromInt (Main.Pos Main.Zero))); 22.17/8.19 22.17/8.19 compare :: MyInt -> MyInt -> Ordering; 22.17/8.19 compare = primCmpInt; 22.17/8.19 22.17/8.19 error :: a; 22.17/8.19 error = stop MyTrue; 22.17/8.19 22.17/8.19 esEs :: MyInt -> MyInt -> MyBool; 22.17/8.19 esEs = primEqInt; 22.17/8.19 22.17/8.19 esEsOrdering :: Ordering -> Ordering -> MyBool; 22.17/8.19 esEsOrdering LT LT = MyTrue;
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell 2019-04-01 06.52