Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Haskell pair #487598230
details
property
value
status
complete
benchmark
realToFrac_1.hs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n078.star.cs.uiowa.edu
space
basic_haskell
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.1455321312 seconds
cpu usage
9.502719244
max memory
5.67967744E8
stage attributes
key
value
output-size
5405
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.hs /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/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 [EQUIVALENT, 32 ms] (6) YES ---------------------------------------- (0) Obligation: mainModule Main module Main where { import qualified Prelude; data Float = Float MyInt MyInt ; data Integer = Integer MyInt ; data MyInt = Pos Main.Nat | Neg Main.Nat ; data Main.Nat = Succ Main.Nat | Zero ; data Ratio a = CnPc a a ; fromRationalFloat :: Ratio Integer -> Float; fromRationalFloat = primRationalToFloat; primRationalToFloat :: Ratio Integer -> Float; primRationalToFloat = rationalToFloat; pt :: (b -> a) -> (c -> b) -> c -> a; pt f g x = f (g x); rationalToFloat :: Ratio Integer -> Float; rationalToFloat (CnPc (Integer x) (Integer y)) = Float x y; realToFrac = pt fromRationalFloat toRational; toIntegerMyInt :: MyInt -> Integer; toIntegerMyInt x = Integer x; toRational (CnPc x y) = CnPc (toIntegerMyInt x) (toIntegerMyInt y); } ---------------------------------------- (1) BR (EQUIVALENT) Replaced joker patterns by fresh variables and removed binding patterns. ---------------------------------------- (2) Obligation: mainModule Main module Main where { import qualified Prelude; data Float = Float MyInt MyInt ; data Integer = Integer MyInt ; data MyInt = Pos Main.Nat | Neg Main.Nat ; data Main.Nat = Succ Main.Nat | Zero ; data Ratio a = CnPc a a ; fromRationalFloat :: Ratio Integer -> Float; fromRationalFloat = primRationalToFloat; primRationalToFloat :: Ratio Integer -> Float; primRationalToFloat = rationalToFloat; pt :: (b -> a) -> (c -> b) -> c -> a; pt f g x = f (g x); rationalToFloat :: Ratio Integer -> Float; rationalToFloat (CnPc (Integer x) (Integer y)) = Float x y; realToFrac = pt fromRationalFloat toRational; toIntegerMyInt :: MyInt -> Integer; toIntegerMyInt x = Integer x; toRational (CnPc x y) = CnPc (toIntegerMyInt x) (toIntegerMyInt y);
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Haskell