Average Error: 0.0 → 0.0
Time: 12.2s
Precision: 64
\[a \cdot a - b \cdot b\]
↓
\[a \cdot a - b \cdot b\]
a \cdot a - b \cdot b
↓
a \cdot a - b \cdot b
double f(double a, double b) {
        double r77490 = a;
        double r77491 = r77490 * r77490;
        double r77492 = b;
        double r77493 = r77492 * r77492;
        double r77494 = r77491 - r77493;
        return r77494;
}
↓
double f(double a, double b) {
        double r77495 = a;
        double r77496 = r77495 * r77495;
        double r77497 = b;
        double r77498 = r77497 * r77497;
        double r77499 = r77496 - r77498;
        return r77499;
}

Error

Bits error versus a

Bits error versus b

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original0.0
Target0.0
Herbie0.0
\[\left(a + b\right) \cdot \left(a - b\right)\]

Derivation

  1. Initial program 0.0

    \[a \cdot a - b \cdot b\]

  2. Final simplification0.0

    \[\leadsto a \cdot a - b \cdot b\]

Reproduce

herbie shell --seed 2019325 +o rules:numerics
(FPCore (a b)
  :name "Difference of squares"
  :precision binary64

  :herbie-target
  (* (+ a b) (- a b))

  (- (* a a) (* b b)))