Average Error: 0.0 → 0.0
Time: 625.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 r177112 = x;
        double r177113 = y;
        double r177114 = r177112 + r177113;
        double r177115 = r177112 - r177113;
        double r177116 = r177114 * r177115;
        return r177116;
}
↓
double f(double x, double y) {
        double r177117 = x;
        double r177118 = y;
        double r177119 = r177117 + r177118;
        double r177120 = r177117 - r177118;
        double r177121 = r177119 * r177120;
        return r177121;
}

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