Average Error: 0.0 → 0.0
Time: 647.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 r109207 = x;
        double r109208 = y;
        double r109209 = r109207 + r109208;
        double r109210 = r109207 - r109208;
        double r109211 = r109209 * r109210;
        return r109211;
}
↓
double f(double x, double y) {
        double r109212 = x;
        double r109213 = y;
        double r109214 = r109212 + r109213;
        double r109215 = r109212 - r109213;
        double r109216 = r109214 * r109215;
        return r109216;
}

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