Average Error: 0.0 → 0.0
Time: 638.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 r99702 = a;
        double r99703 = r99702 * r99702;
        double r99704 = b;
        double r99705 = r99704 * r99704;
        double r99706 = r99703 - r99705;
        return r99706;
}
↓
double f(double a, double b) {
        double r99707 = a;
        double r99708 = r99707 * r99707;
        double r99709 = b;
        double r99710 = r99709 * r99709;
        double r99711 = r99708 - r99710;
        return r99711;
}

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

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

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