Average Error: 0.0 → 0.0
Time: 2.1s
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 r16654026 = a;
        double r16654027 = r16654026 * r16654026;
        double r16654028 = b;
        double r16654029 = r16654028 * r16654028;
        double r16654030 = r16654027 - r16654029;
        return r16654030;
}
↓
double f(double a, double b) {
        double r16654031 = a;
        double r16654032 = r16654031 * r16654031;
        double r16654033 = b;
        double r16654034 = r16654033 * r16654033;
        double r16654035 = r16654032 - r16654034;
        return r16654035;
}

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

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

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