Average Error: 0.0 → 0.0
Time: 14.0s
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 r87014 = a;
        double r87015 = r87014 * r87014;
        double r87016 = b;
        double r87017 = r87016 * r87016;
        double r87018 = r87015 - r87017;
        return r87018;
}
↓
double f(double a, double b) {
        double r87019 = a;
        double r87020 = r87019 * r87019;
        double r87021 = b;
        double r87022 = r87021 * r87021;
        double r87023 = r87020 - r87022;
        return r87023;
}

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

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

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