Average Error: 0.0 → 0.0
Time: 600.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 r211501 = x;
        double r211502 = y;
        double r211503 = r211501 + r211502;
        double r211504 = r211501 - r211502;
        double r211505 = r211503 * r211504;
        return r211505;
}
↓
double f(double x, double y) {
        double r211506 = x;
        double r211507 = y;
        double r211508 = r211506 + r211507;
        double r211509 = r211506 - r211507;
        double r211510 = r211508 * r211509;
        return r211510;
}

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