Average Error: 0.0 → 0.0
Time: 610.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 r208155 = x;
        double r208156 = y;
        double r208157 = r208155 + r208156;
        double r208158 = r208155 - r208156;
        double r208159 = r208157 * r208158;
        return r208159;
}
↓
double f(double x, double y) {
        double r208160 = x;
        double r208161 = y;
        double r208162 = r208160 + r208161;
        double r208163 = r208160 - r208161;
        double r208164 = r208162 * r208163;
        return r208164;
}

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