Average Error: 0.0 → 0.0
Time: 15.8s
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 r114233 = x;
        double r114234 = y;
        double r114235 = r114233 + r114234;
        double r114236 = r114233 - r114234;
        double r114237 = r114235 * r114236;
        return r114237;
}
↓
double f(double x, double y) {
        double r114238 = x;
        double r114239 = y;
        double r114240 = r114238 + r114239;
        double r114241 = r114238 - r114239;
        double r114242 = r114240 * r114241;
        return r114242;
}

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