Average Error: 0.0 → 0.0
Time: 842.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 r174875 = x;
        double r174876 = y;
        double r174877 = r174875 + r174876;
        double r174878 = r174875 - r174876;
        double r174879 = r174877 * r174878;
        return r174879;
}
↓
double f(double x, double y) {
        double r174880 = x;
        double r174881 = y;
        double r174882 = r174880 + r174881;
        double r174883 = r174880 - r174881;
        double r174884 = r174882 * r174883;
        return r174884;
}

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