Average Error: 0.0 → 0.0
Time: 13.0s
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 r20902 = x;
        double r20903 = y;
        double r20904 = r20902 + r20903;
        double r20905 = r20902 - r20903;
        double r20906 = r20904 * r20905;
        return r20906;
}
↓
double f(double x, double y) {
        double r20907 = x;
        double r20908 = y;
        double r20909 = r20907 + r20908;
        double r20910 = r20907 - r20908;
        double r20911 = r20909 * r20910;
        return r20911;
}

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