Average Error: 0.0 → 0.0
Time: 2.0s
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 r135193 = x;
        double r135194 = y;
        double r135195 = r135193 + r135194;
        double r135196 = r135193 - r135194;
        double r135197 = r135195 * r135196;
        return r135197;
}
↓
double f(double x, double y) {
        double r135198 = x;
        double r135199 = y;
        double r135200 = r135198 + r135199;
        double r135201 = r135198 - r135199;
        double r135202 = r135200 * r135201;
        return r135202;
}

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 2019304 
(FPCore (x y)
  :name "Examples.Basics.BasicTests:f1 from sbv-4.4"
  :precision binary64
  (* (+ x y) (- x y)))