Average Error: 0.0 → 0.0
Time: 624.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 r230887 = x;
        double r230888 = y;
        double r230889 = r230887 + r230888;
        double r230890 = r230887 - r230888;
        double r230891 = r230889 * r230890;
        return r230891;
}
↓
double f(double x, double y) {
        double r230892 = x;
        double r230893 = y;
        double r230894 = r230892 + r230893;
        double r230895 = r230892 - r230893;
        double r230896 = r230894 * r230895;
        return r230896;
}

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