Average Error: 0.0 → 0.0

Time: 716.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 r80337 = a;
        double r80338 = r80337 * r80337;
        double r80339 = b;
        double r80340 = r80339 * r80339;
        double r80341 = r80338 - r80340;
        return r80341;
}

↓

double f(double a, double b) {
        double r80342 = a;
        double r80343 = r80342 * r80342;
        double r80344 = b;
        double r80345 = r80344 * r80344;
        double r80346 = r80343 - r80345;
        return r80346;
}

Error

The X axis uses an exponential scale — Bits error versus `a`

Try it out

In
Out

Enter valid numbers for all inputs

Target

Original	0.0
Target	0.0
Herbie	0.0

\[\left(a + b\right) \cdot \left(a - b\right)\]

Derivation

Initial program 0.0
\[a \cdot a - b \cdot b\]
Final simplification0.0
\[\leadsto a \cdot a - b \cdot b\]

Reproduce

herbie shell --seed 2020060 
(FPCore (a b)
  :name "Difference of squares"
  :precision binary64

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

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