Average Error: 0.0 → 0.0
Time: 8.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 r93762 = a;
        double r93763 = r93762 * r93762;
        double r93764 = b;
        double r93765 = r93764 * r93764;
        double r93766 = r93763 - r93765;
        return r93766;
}
↓
double f(double a, double b) {
        double r93767 = a;
        double r93768 = r93767 * r93767;
        double r93769 = b;
        double r93770 = r93769 * r93769;
        double r93771 = r93768 - r93770;
        return r93771;
}

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

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

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