Average Error: 0.0 → 0.0
Time: 12.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 r69908 = a;
        double r69909 = r69908 * r69908;
        double r69910 = b;
        double r69911 = r69910 * r69910;
        double r69912 = r69909 - r69911;
        return r69912;
}
↓
double f(double a, double b) {
        double r69913 = a;
        double r69914 = r69913 * r69913;
        double r69915 = b;
        double r69916 = r69915 * r69915;
        double r69917 = r69914 - r69916;
        return r69917;
}

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

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

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