Average Error: 0.0 → 0.0
Time: 725.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 r219953 = x;
        double r219954 = y;
        double r219955 = r219953 + r219954;
        double r219956 = r219953 - r219954;
        double r219957 = r219955 * r219956;
        return r219957;
}
↓
double f(double x, double y) {
        double r219958 = x;
        double r219959 = y;
        double r219960 = r219958 + r219959;
        double r219961 = r219958 - r219959;
        double r219962 = r219960 * r219961;
        return r219962;
}

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