Average Error: 0.0 → 0.0
Time: 1.1s
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 r102590 = a;
        double r102591 = r102590 * r102590;
        double r102592 = b;
        double r102593 = r102592 * r102592;
        double r102594 = r102591 - r102593;
        return r102594;
}
↓
double f(double a, double b) {
        double r102595 = a;
        double r102596 = r102595 * r102595;
        double r102597 = b;
        double r102598 = r102597 * r102597;
        double r102599 = r102596 - r102598;
        return r102599;
}

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 2020001 
(FPCore (a b)
  :name "Difference of squares"
  :precision binary64

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

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