Average Error: 0.0 → 0.0
Time: 12.9s
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 r77474 = a;
        double r77475 = r77474 * r77474;
        double r77476 = b;
        double r77477 = r77476 * r77476;
        double r77478 = r77475 - r77477;
        return r77478;
}
↓
double f(double a, double b) {
        double r77479 = a;
        double r77480 = r77479 * r77479;
        double r77481 = b;
        double r77482 = r77481 * r77481;
        double r77483 = r77480 - r77482;
        return r77483;
}

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 2019325 +o rules:numerics
(FPCore (a b)
  :name "Difference of squares"
  :precision binary64

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

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