Average Error: 0.0 → 0.0
Time: 9.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 r14550729 = x;
        double r14550730 = y;
        double r14550731 = r14550729 + r14550730;
        double r14550732 = r14550729 - r14550730;
        double r14550733 = r14550731 * r14550732;
        return r14550733;
}
↓
double f(double x, double y) {
        double r14550734 = x;
        double r14550735 = y;
        double r14550736 = r14550734 + r14550735;
        double r14550737 = r14550734 - r14550735;
        double r14550738 = r14550736 * r14550737;
        return r14550738;
}

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