Average Error: 0.0 → 0.0
Time: 1.6s
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 r188332 = x;
        double r188333 = y;
        double r188334 = r188332 + r188333;
        double r188335 = r188332 - r188333;
        double r188336 = r188334 * r188335;
        return r188336;
}
↓
double f(double x, double y) {
        double r188337 = x;
        double r188338 = y;
        double r188339 = r188337 + r188338;
        double r188340 = r188337 - r188338;
        double r188341 = r188339 * r188340;
        return r188341;
}

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