Average Error: 0.0 → 0.0
Time: 13.3s
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 r17107 = x;
        double r17108 = y;
        double r17109 = r17107 + r17108;
        double r17110 = r17107 - r17108;
        double r17111 = r17109 * r17110;
        return r17111;
}
↓
double f(double x, double y) {
        double r17112 = x;
        double r17113 = y;
        double r17114 = r17112 + r17113;
        double r17115 = r17112 - r17113;
        double r17116 = r17114 * r17115;
        return r17116;
}

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