Average Error: 0.0 → 0.0
Time: 727.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 r155823 = x;
        double r155824 = y;
        double r155825 = r155823 + r155824;
        double r155826 = r155823 - r155824;
        double r155827 = r155825 * r155826;
        return r155827;
}
↓
double f(double x, double y) {
        double r155828 = x;
        double r155829 = y;
        double r155830 = r155828 + r155829;
        double r155831 = r155828 - r155829;
        double r155832 = r155830 * r155831;
        return r155832;
}

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