Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell 2019-04-01 06.52 pair #433317122
details
property
value
status
complete
benchmark
BANGBANG_1.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n167.star.cs.uiowa.edu
space
basic_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.50929 seconds
cpu usage
10.4769
user time
10.167
system time
0.309913
max virtual memory
1.8285568E7
max residence set size
577964.0
stage attributes
key
value
starexec-result
YES
output
8.36/3.69 YES 10.22/4.23 proof of /export/starexec/sandbox/benchmark/theBenchmark.hs 10.22/4.23 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 10.22/4.23 10.22/4.23 10.22/4.23 H-Termination with start terms of the given HASKELL could be proven: 10.22/4.23 10.22/4.23 (0) HASKELL 10.22/4.23 (1) BR [EQUIVALENT, 0 ms] 10.22/4.23 (2) HASKELL 10.22/4.23 (3) COR [EQUIVALENT, 0 ms] 10.22/4.23 (4) HASKELL 10.22/4.23 (5) Narrow [SOUND, 0 ms] 10.22/4.23 (6) QDP 10.22/4.23 (7) TransformationProof [EQUIVALENT, 0 ms] 10.22/4.23 (8) QDP 10.22/4.23 (9) DependencyGraphProof [EQUIVALENT, 0 ms] 10.22/4.23 (10) QDP 10.22/4.23 (11) UsableRulesProof [EQUIVALENT, 0 ms] 10.22/4.23 (12) QDP 10.22/4.23 (13) QReductionProof [EQUIVALENT, 0 ms] 10.22/4.23 (14) QDP 10.22/4.23 (15) QDPSizeChangeProof [EQUIVALENT, 1 ms] 10.22/4.23 (16) YES 10.22/4.23 10.22/4.23 10.22/4.23 ---------------------------------------- 10.22/4.23 10.22/4.23 (0) 10.22/4.23 Obligation: 10.22/4.23 mainModule Main 10.22/4.23 module Main where { 10.22/4.23 import qualified Prelude; 10.22/4.23 data List a = Cons a (List a) | Nil ; 10.22/4.23 10.22/4.23 data MyBool = MyTrue | MyFalse ; 10.22/4.23 10.22/4.23 data MyInt = Pos Main.Nat | Neg Main.Nat ; 10.22/4.23 10.22/4.23 data Main.Nat = Succ Main.Nat | Zero ; 10.22/4.23 10.22/4.23 data Ordering = LT | EQ | GT ; 10.22/4.23 10.22/4.23 compareMyInt :: MyInt -> MyInt -> Ordering; 10.22/4.23 compareMyInt = primCmpInt; 10.22/4.23 10.22/4.23 emEm :: List a -> MyInt -> a; 10.22/4.23 emEm (Cons x vv) xz = emEm5 (Cons x vv) xz; 10.22/4.23 emEm (Cons vw xs) n = emEm3 (Cons vw xs) n; 10.22/4.23 emEm (Cons vx vy) vz = emEm1 (Cons vx vy) vz; 10.22/4.23 emEm Nil wu = emEm0 Nil wu; 10.22/4.23 10.22/4.23 emEm0 Nil wu = Main.error; 10.22/4.23 10.22/4.23 emEm1 (Cons vx vy) vz = Main.error; 10.22/4.23 emEm1 wz xu = emEm0 wz xu; 10.22/4.23 10.22/4.23 emEm2 vw xs n MyTrue = emEm xs (msMyInt n (Main.Pos (Main.Succ Main.Zero))); 10.22/4.23 emEm2 vw xs n MyFalse = emEm1 (Cons vw xs) n; 10.22/4.23 10.22/4.23 emEm3 (Cons vw xs) n = emEm2 vw xs n (gtMyInt n (Main.Pos Main.Zero)); 10.22/4.23 emEm3 xw xx = emEm1 xw xx; 10.22/4.23 10.22/4.23 emEm4 MyTrue (Cons x vv) xz = x; 10.22/4.23 emEm4 yu yv yw = emEm3 yv yw; 10.22/4.23 10.22/4.23 emEm5 (Cons x vv) xz = emEm4 (esEsMyInt xz (Main.Pos Main.Zero)) (Cons x vv) xz; 10.22/4.23 emEm5 yx yy = emEm3 yx yy; 10.22/4.23 10.22/4.23 error :: a; 10.22/4.23 error = stop MyTrue; 10.22/4.23 10.22/4.23 esEsMyInt :: MyInt -> MyInt -> MyBool; 10.22/4.23 esEsMyInt = primEqInt; 10.22/4.23 10.22/4.23 esEsOrdering :: Ordering -> Ordering -> MyBool; 10.22/4.23 esEsOrdering LT LT = MyTrue; 10.22/4.23 esEsOrdering LT EQ = MyFalse; 10.22/4.23 esEsOrdering LT GT = MyFalse; 10.22/4.23 esEsOrdering EQ LT = MyFalse; 10.22/4.23 esEsOrdering EQ EQ = MyTrue; 10.22/4.23 esEsOrdering EQ GT = MyFalse; 10.22/4.23 esEsOrdering GT LT = MyFalse; 10.22/4.23 esEsOrdering GT EQ = MyFalse; 10.22/4.23 esEsOrdering GT GT = MyTrue; 10.22/4.23 10.22/4.23 gtMyInt :: MyInt -> MyInt -> MyBool; 10.22/4.23 gtMyInt x y = esEsOrdering (compareMyInt x y) GT; 10.22/4.23 10.22/4.23 msMyInt :: MyInt -> MyInt -> MyInt; 10.22/4.23 msMyInt = primMinusInt; 10.22/4.23 10.22/4.23 primCmpInt :: MyInt -> MyInt -> Ordering; 10.22/4.23 primCmpInt (Main.Pos Main.Zero) (Main.Pos Main.Zero) = EQ; 10.22/4.23 primCmpInt (Main.Pos Main.Zero) (Main.Neg Main.Zero) = EQ; 10.22/4.23 primCmpInt (Main.Neg Main.Zero) (Main.Pos Main.Zero) = EQ; 10.22/4.23 primCmpInt (Main.Neg Main.Zero) (Main.Neg Main.Zero) = EQ; 10.22/4.23 primCmpInt (Main.Pos x) (Main.Pos y) = primCmpNat x y; 10.22/4.23 primCmpInt (Main.Pos x) (Main.Neg y) = GT; 10.22/4.23 primCmpInt (Main.Neg x) (Main.Pos y) = LT;
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell 2019-04-01 06.52