Average Error: 0.0 → 0.0

Time: 4.6s

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 r91148 = a;
        double r91149 = r91148 * r91148;
        double r91150 = b;
        double r91151 = r91150 * r91150;
        double r91152 = r91149 - r91151;
        return r91152;
}

↓

double f(double a, double b) {
        double r91153 = a;
        double r91154 = r91153 * r91153;
        double r91155 = b;
        double r91156 = r91155 * r91155;
        double r91157 = r91154 - r91156;
        return r91157;
}

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

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

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