Average Error: 0.0 → 0.0
Time: 629.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 r168975 = x;
        double r168976 = y;
        double r168977 = r168975 + r168976;
        double r168978 = r168975 - r168976;
        double r168979 = r168977 * r168978;
        return r168979;
}
↓
double f(double x, double y) {
        double r168980 = x;
        double r168981 = y;
        double r168982 = r168980 + r168981;
        double r168983 = r168980 - r168981;
        double r168984 = r168982 * r168983;
        return r168984;
}

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