Average Error: 0.0 → 0.0
Time: 9.7s
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 r242403 = a;
        double r242404 = r242403 * r242403;
        double r242405 = b;
        double r242406 = r242405 * r242405;
        double r242407 = r242404 - r242406;
        return r242407;
}
↓
double f(double a, double b) {
        double r242408 = a;
        double r242409 = r242408 * r242408;
        double r242410 = b;
        double r242411 = r242410 * r242410;
        double r242412 = r242409 - r242411;
        return r242412;
}

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

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

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