Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell pair #487598373
details
property
value
status
complete
benchmark
encodeFloat_1.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n150.star.cs.uiowa.edu
space
basic_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
5.81009602547 seconds
cpu usage
11.635865697
max memory
6.1814784E8
stage attributes
key
value
output-size
54123
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) AND (7) QDP (8) QDPSizeChangeProof [EQUIVALENT, 0 ms] (9) YES (10) QDP (11) QDPSizeChangeProof [EQUIVALENT, 0 ms] (12) YES (13) QDP (14) DependencyGraphProof [EQUIVALENT, 0 ms] (15) QDP (16) QDPSizeChangeProof [EQUIVALENT, 0 ms] (17) YES ---------------------------------------- (0) Obligation: mainModule Main module Main where { import qualified Prelude; data Double = Double MyInt MyInt ; data Float = Float MyInt MyInt ; data Integer = Integer MyInt ; 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; doubleToFloat :: Double -> Float; doubleToFloat (Double x y) = Float x y; encodeFloatFloat :: Integer -> MyInt -> Float; encodeFloatFloat = primFloatEncode; 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; fromDoubleFloat :: Double -> Float; fromDoubleFloat = doubleToFloat; fromIntFloat :: MyInt -> Float; fromIntFloat = primIntToFloat; fromIntegerFloat :: Integer -> Float; fromIntegerFloat = primIntegerToFloat; fsEsOrdering :: Ordering -> Ordering -> MyBool; fsEsOrdering x y = not (esEsOrdering x y); fsFloat :: Float -> Float -> Float; fsFloat = primDivFloat; gtEsMyInt :: MyInt -> MyInt -> MyBool; gtEsMyInt x y = fsEsOrdering (compareMyInt x y) LT; msMyInt :: MyInt -> MyInt -> MyInt; msMyInt = primMinusInt; negateMyInt :: MyInt -> MyInt; negateMyInt = primNegInt;
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell