Average Error: 0.0 → 0.0
Time: 658.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 r98923 = a;
        double r98924 = r98923 * r98923;
        double r98925 = b;
        double r98926 = r98925 * r98925;
        double r98927 = r98924 - r98926;
        return r98927;
}
↓
double f(double a, double b) {
        double r98928 = a;
        double r98929 = r98928 * r98928;
        double r98930 = b;
        double r98931 = r98930 * r98930;
        double r98932 = r98929 - r98931;
        return r98932;
}

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

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

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