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 r69490 = a;
        double r69491 = r69490 * r69490;
        double r69492 = b;
        double r69493 = r69492 * r69492;
        double r69494 = r69491 - r69493;
        return r69494;
}

↓

double f(double a, double b) {
        double r69495 = a;
        double r69496 = r69495 * r69495;
        double r69497 = b;
        double r69498 = r69497 * r69497;
        double r69499 = r69496 - r69498;
        return r69499;
}

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

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

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