Average Error: 0.0 → 0.0
Time: 5.1s
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 r128129 = x;
        double r128130 = y;
        double r128131 = r128129 + r128130;
        double r128132 = r128129 - r128130;
        double r128133 = r128131 * r128132;
        return r128133;
}
↓
double f(double x, double y) {
        double r128134 = x;
        double r128135 = y;
        double r128136 = r128134 + r128135;
        double r128137 = r128134 - r128135;
        double r128138 = r128136 * r128137;
        return r128138;
}

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