Average Error: 0.0 → 0.0
Time: 11.8s
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 r51616 = a;
        double r51617 = r51616 * r51616;
        double r51618 = b;
        double r51619 = r51618 * r51618;
        double r51620 = r51617 - r51619;
        return r51620;
}
↓
double f(double a, double b) {
        double r51621 = a;
        double r51622 = r51621 * r51621;
        double r51623 = b;
        double r51624 = r51623 * r51623;
        double r51625 = r51622 - r51624;
        return r51625;
}

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

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

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