Average Error: 0.0 → 0.0
Time: 10.8s
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 r20990875 = x;
        double r20990876 = y;
        double r20990877 = r20990875 + r20990876;
        double r20990878 = r20990875 - r20990876;
        double r20990879 = r20990877 * r20990878;
        return r20990879;
}
↓
double f(double x, double y) {
        double r20990880 = x;
        double r20990881 = y;
        double r20990882 = r20990880 + r20990881;
        double r20990883 = r20990880 - r20990881;
        double r20990884 = r20990882 * r20990883;
        return r20990884;
}

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 2019173 +o rules:numerics
(FPCore (x y)
  :name "Examples.Basics.BasicTests:f1 from sbv-4.4"
  (* (+ x y) (- x y)))