Average Error: 0.0 → 0.0
Time: 1.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 r140005 = x;
        double r140006 = y;
        double r140007 = r140005 + r140006;
        double r140008 = r140005 - r140006;
        double r140009 = r140007 * r140008;
        return r140009;
}
↓
double f(double x, double y) {
        double r140010 = x;
        double r140011 = y;
        double r140012 = r140010 + r140011;
        double r140013 = r140010 - r140011;
        double r140014 = r140012 * r140013;
        return r140014;
}

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