Average Error: 0.0 → 0.0
Time: 6.3s
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 r143203 = x;
        double r143204 = y;
        double r143205 = r143203 + r143204;
        double r143206 = r143203 - r143204;
        double r143207 = r143205 * r143206;
        return r143207;
}
↓
double f(double x, double y) {
        double r143208 = x;
        double r143209 = y;
        double r143210 = r143208 + r143209;
        double r143211 = r143208 - r143209;
        double r143212 = r143210 * r143211;
        return r143212;
}

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