Average Error: 0.0 → 0.0
Time: 631.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 r101014 = a;
        double r101015 = r101014 * r101014;
        double r101016 = b;
        double r101017 = r101016 * r101016;
        double r101018 = r101015 - r101017;
        return r101018;
}
↓
double f(double a, double b) {
        double r101019 = a;
        double r101020 = r101019 * r101019;
        double r101021 = b;
        double r101022 = r101021 * r101021;
        double r101023 = r101020 - r101022;
        return r101023;
}

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

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

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