Average Error: 0.0 → 0.0
Time: 4.2s
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 r198198 = x;
        double r198199 = y;
        double r198200 = r198198 + r198199;
        double r198201 = r198198 - r198199;
        double r198202 = r198200 * r198201;
        return r198202;
}
↓
double f(double x, double y) {
        double r198203 = x;
        double r198204 = y;
        double r198205 = r198203 + r198204;
        double r198206 = r198203 - r198204;
        double r198207 = r198205 * r198206;
        return r198207;
}

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)))