Average Error: 0.0 → 0.0
Time: 1.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 r241103 = x;
        double r241104 = y;
        double r241105 = r241103 + r241104;
        double r241106 = r241103 - r241104;
        double r241107 = r241105 * r241106;
        return r241107;
}
↓
double f(double x, double y) {
        double r241108 = x;
        double r241109 = y;
        double r241110 = r241108 + r241109;
        double r241111 = r241108 - r241109;
        double r241112 = r241110 * r241111;
        return r241112;
}

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