Average Error: 0.0 → 0.0
Time: 3.4s
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 r179777 = x;
        double r179778 = y;
        double r179779 = r179777 + r179778;
        double r179780 = r179777 - r179778;
        double r179781 = r179779 * r179780;
        return r179781;
}
↓
double f(double x, double y) {
        double r179782 = x;
        double r179783 = y;
        double r179784 = r179782 + r179783;
        double r179785 = r179782 - r179783;
        double r179786 = r179784 * r179785;
        return r179786;
}

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