Average Error: 0.0 → 0.0
Time: 8.2s
Precision: 64
\[\left(x + y\right) \cdot \left(x - y\right)\]
↓
\[\left(x + y\right) \cdot \left(x - y\right)\]
\left(x + y\right) \cdot \left(x - y\right)
↓
\left(x + y\right) \cdot \left(x - y\right)
double f(double x, double y) {
        double r189939 = x;
        double r189940 = y;
        double r189941 = r189939 + r189940;
        double r189942 = r189939 - r189940;
        double r189943 = r189941 * r189942;
        return r189943;
}
↓
double f(double x, double y) {
        double r189944 = x;
        double r189945 = y;
        double r189946 = r189944 + r189945;
        double r189947 = r189944 - r189945;
        double r189948 = r189946 * r189947;
        return r189948;
}

Error

Bits error versus x

Bits error versus y

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[\left(x + y\right) \cdot \left(x - y\right)\]

  2. Final simplification0.0

    \[\leadsto \left(x + y\right) \cdot \left(x - y\right)\]

Reproduce

herbie shell --seed 2019351 +o rules:numerics
(FPCore (x y)
  :name "Examples.Basics.BasicTests:f1 from sbv-4.4"
  :precision binary64
  (* (+ x y) (- x y)))