Average Error: 0.0 → 0.0
Time: 684.0ms
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 r97750 = a;
        double r97751 = r97750 * r97750;
        double r97752 = b;
        double r97753 = r97752 * r97752;
        double r97754 = r97751 - r97753;
        return r97754;
}
↓
double f(double a, double b) {
        double r97755 = a;
        double r97756 = r97755 * r97755;
        double r97757 = b;
        double r97758 = r97757 * r97757;
        double r97759 = r97756 - r97758;
        return r97759;
}

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

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

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