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 r23907443 = x;
        double r23907444 = y;
        double r23907445 = r23907443 + r23907444;
        double r23907446 = r23907443 - r23907444;
        double r23907447 = r23907445 * r23907446;
        return r23907447;
}
↓
double f(double x, double y) {
        double r23907448 = x;
        double r23907449 = y;
        double r23907450 = r23907448 + r23907449;
        double r23907451 = r23907448 - r23907449;
        double r23907452 = r23907450 * r23907451;
        return r23907452;
}

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