Average Error: 0.0 → 0.0
Time: 12.7s
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 r108847 = x;
        double r108848 = y;
        double r108849 = r108847 + r108848;
        double r108850 = r108847 - r108848;
        double r108851 = r108849 * r108850;
        return r108851;
}
↓
double f(double x, double y) {
        double r108852 = x;
        double r108853 = y;
        double r108854 = r108852 + r108853;
        double r108855 = r108852 - r108853;
        double r108856 = r108854 * r108855;
        return r108856;
}

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