Average Error: 0.0 → 0.0
Time: 672.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 r168778 = x;
        double r168779 = y;
        double r168780 = r168778 + r168779;
        double r168781 = r168778 - r168779;
        double r168782 = r168780 * r168781;
        return r168782;
}
↓
double f(double x, double y) {
        double r168783 = x;
        double r168784 = y;
        double r168785 = r168783 + r168784;
        double r168786 = r168783 - r168784;
        double r168787 = r168785 * r168786;
        return r168787;
}

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