Average Error: 0.0 → 0.0
Time: 665.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 r78780 = a;
        double r78781 = r78780 * r78780;
        double r78782 = b;
        double r78783 = r78782 * r78782;
        double r78784 = r78781 - r78783;
        return r78784;
}
↓
double f(double a, double b) {
        double r78785 = a;
        double r78786 = r78785 * r78785;
        double r78787 = b;
        double r78788 = r78787 * r78787;
        double r78789 = r78786 - r78788;
        return r78789;
}

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

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

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