Average Error: 0.0 → 0.0
Time: 635.0ms
Precision: 64
\[\left(x + y\right) \cdot \left(x - y\right)\]
↓
\[\left(x + y\right) \cdot \left(x - y\right)\]
\left(x + y\right) \cdot \left(x - y\right)
↓
\left(x + y\right) \cdot \left(x - y\right)
double f(double x, double y) {
        double r222816 = x;
        double r222817 = y;
        double r222818 = r222816 + r222817;
        double r222819 = r222816 - r222817;
        double r222820 = r222818 * r222819;
        return r222820;
}
↓
double f(double x, double y) {
        double r222821 = x;
        double r222822 = y;
        double r222823 = r222821 + r222822;
        double r222824 = r222821 - r222822;
        double r222825 = r222823 * r222824;
        return r222825;
}

Error

Bits error versus x

Bits error versus y

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[\left(x + y\right) \cdot \left(x - y\right)\]

  2. Final simplification0.0

    \[\leadsto \left(x + y\right) \cdot \left(x - y\right)\]

Reproduce

herbie shell --seed 2020062 +o rules:numerics
(FPCore (x y)
  :name "Examples.Basics.BasicTests:f1 from sbv-4.4"
  :precision binary64
  (* (+ x y) (- x y)))