Average Error: 0.0 → 0.0
Time: 3.8s
Precision: 64
\[\left(x + y\right) \cdot \left(x - y\right)\]
↓
\[x \cdot x - y \cdot y\]
\left(x + y\right) \cdot \left(x - y\right)
↓
x \cdot x - y \cdot y
double f(double x, double y) {
        double r134959 = x;
        double r134960 = y;
        double r134961 = r134959 + r134960;
        double r134962 = r134959 - r134960;
        double r134963 = r134961 * r134962;
        return r134963;
}
↓
double f(double x, double y) {
        double r134964 = x;
        double r134965 = r134964 * r134964;
        double r134966 = y;
        double r134967 = r134966 * r134966;
        double r134968 = r134965 - r134967;
        return r134968;
}

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. Simplified0.0

    \[\leadsto \color{blue}{x \cdot x - y \cdot y}\]

  3. Final simplification0.0

    \[\leadsto x \cdot x - y \cdot y\]

Reproduce

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