Average Error: 0.0 → 0.0
Time: 6.7s
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 r107067 = x;
        double r107068 = y;
        double r107069 = r107067 + r107068;
        double r107070 = r107067 - r107068;
        double r107071 = r107069 * r107070;
        return r107071;
}
↓
double f(double x, double y) {
        double r107072 = x;
        double r107073 = y;
        double r107074 = r107072 + r107073;
        double r107075 = r107072 - r107073;
        double r107076 = r107074 * r107075;
        return r107076;
}

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