Average Error: 0.0 → 0.0
Time: 602.0ms
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 r182221 = x;
        double r182222 = y;
        double r182223 = r182221 + r182222;
        double r182224 = r182221 - r182222;
        double r182225 = r182223 * r182224;
        return r182225;
}
↓
double f(double x, double y) {
        double r182226 = x;
        double r182227 = y;
        double r182228 = r182226 + r182227;
        double r182229 = r182226 - r182227;
        double r182230 = r182228 * r182229;
        return r182230;
}

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