Average Error: 0.0 → 0.0
Time: 10.9s
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 r170535 = x;
        double r170536 = y;
        double r170537 = r170535 + r170536;
        double r170538 = r170535 - r170536;
        double r170539 = r170537 * r170538;
        return r170539;
}
↓
double f(double x, double y) {
        double r170540 = x;
        double r170541 = y;
        double r170542 = r170540 + r170541;
        double r170543 = r170540 - r170541;
        double r170544 = r170542 * r170543;
        return r170544;
}

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