Average Error: 0.0 → 0.0
Time: 1.2s
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 r169499 = x;
        double r169500 = y;
        double r169501 = r169499 + r169500;
        double r169502 = r169499 - r169500;
        double r169503 = r169501 * r169502;
        return r169503;
}
↓
double f(double x, double y) {
        double r169504 = x;
        double r169505 = y;
        double r169506 = r169504 + r169505;
        double r169507 = r169504 - r169505;
        double r169508 = r169506 * r169507;
        return r169508;
}

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