Average Error: 0.0 → 0.0
Time: 782.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 r175401 = x;
        double r175402 = y;
        double r175403 = r175401 + r175402;
        double r175404 = r175401 - r175402;
        double r175405 = r175403 * r175404;
        return r175405;
}
↓
double f(double x, double y) {
        double r175406 = x;
        double r175407 = y;
        double r175408 = r175406 + r175407;
        double r175409 = r175406 - r175407;
        double r175410 = r175408 * r175409;
        return r175410;
}

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