Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell pair #487598466
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
n112.star.cs.uiowa.edu
space
basic_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.30255508423 seconds
cpu usage
10.652620999
max memory
5.91437824E8
stage attributes
key
value
output-size
26762
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.hs /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/benchmark/theBenchmark.hs # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty H-Termination with start terms of the given HASKELL could be proven: (0) HASKELL (1) BR [EQUIVALENT, 0 ms] (2) HASKELL (3) COR [EQUIVALENT, 0 ms] (4) HASKELL (5) Narrow [SOUND, 0 ms] (6) QDP (7) TransformationProof [EQUIVALENT, 0 ms] (8) QDP (9) DependencyGraphProof [EQUIVALENT, 0 ms] (10) QDP (11) UsableRulesProof [EQUIVALENT, 1 ms] (12) QDP (13) QReductionProof [EQUIVALENT, 0 ms] (14) QDP (15) QDPSizeChangeProof [EQUIVALENT, 0 ms] (16) YES ---------------------------------------- (0) Obligation: mainModule Main module Main where { import qualified Prelude; data List a = Cons a (List a) | Nil ; data MyBool = MyTrue | MyFalse ; data MyInt = Pos Main.Nat | Neg Main.Nat ; data Main.Nat = Succ Main.Nat | Zero ; data Ordering = LT | EQ | GT ; compareMyInt :: MyInt -> MyInt -> Ordering; compareMyInt = primCmpInt; emEm :: List a -> MyInt -> a; emEm (Cons x vv) xz = emEm5 (Cons x vv) xz; emEm (Cons vw xs) n = emEm3 (Cons vw xs) n; emEm (Cons vx vy) vz = emEm1 (Cons vx vy) vz; emEm Nil wu = emEm0 Nil wu; emEm0 Nil wu = Main.error; emEm1 (Cons vx vy) vz = Main.error; emEm1 wz xu = emEm0 wz xu; emEm2 vw xs n MyTrue = emEm xs (msMyInt n (Main.Pos (Main.Succ Main.Zero))); emEm2 vw xs n MyFalse = emEm1 (Cons vw xs) n; emEm3 (Cons vw xs) n = emEm2 vw xs n (gtMyInt n (Main.Pos Main.Zero)); emEm3 xw xx = emEm1 xw xx; emEm4 MyTrue (Cons x vv) xz = x; emEm4 yu yv yw = emEm3 yv yw; emEm5 (Cons x vv) xz = emEm4 (esEsMyInt xz (Main.Pos Main.Zero)) (Cons x vv) xz; emEm5 yx yy = emEm3 yx yy; error :: a; error = stop MyTrue; esEsMyInt :: MyInt -> MyInt -> MyBool; esEsMyInt = primEqInt; esEsOrdering :: Ordering -> Ordering -> MyBool; esEsOrdering LT LT = MyTrue; esEsOrdering LT EQ = MyFalse; esEsOrdering LT GT = MyFalse; esEsOrdering EQ LT = MyFalse; esEsOrdering EQ EQ = MyTrue; esEsOrdering EQ GT = MyFalse; esEsOrdering GT LT = MyFalse; esEsOrdering GT EQ = MyFalse; esEsOrdering GT GT = MyTrue; gtMyInt :: MyInt -> MyInt -> MyBool; gtMyInt x y = esEsOrdering (compareMyInt x y) GT; msMyInt :: MyInt -> MyInt -> MyInt; msMyInt = primMinusInt; primCmpInt :: MyInt -> MyInt -> Ordering; primCmpInt (Main.Pos Main.Zero) (Main.Pos Main.Zero) = EQ;
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell