Average Error: 0.0 → 0.0
Time: 7.1s
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 r12302707 = x;
        double r12302708 = y;
        double r12302709 = r12302707 + r12302708;
        double r12302710 = r12302707 - r12302708;
        double r12302711 = r12302709 * r12302710;
        return r12302711;
}
↓
double f(double x, double y) {
        double r12302712 = x;
        double r12302713 = y;
        double r12302714 = r12302712 + r12302713;
        double r12302715 = r12302712 - r12302713;
        double r12302716 = r12302714 * r12302715;
        return r12302716;
}

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