Average Error: 0.0 → 0.0
Time: 1.4s
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 r216002 = x;
        double r216003 = y;
        double r216004 = r216002 + r216003;
        double r216005 = r216002 - r216003;
        double r216006 = r216004 * r216005;
        return r216006;
}
↓
double f(double x, double y) {
        double r216007 = x;
        double r216008 = y;
        double r216009 = r216007 + r216008;
        double r216010 = r216007 - r216008;
        double r216011 = r216009 * r216010;
        return r216011;
}

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