Average Error: 0.0 → 0.0
Time: 658.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 r180010 = x;
        double r180011 = y;
        double r180012 = r180010 + r180011;
        double r180013 = r180010 - r180011;
        double r180014 = r180012 * r180013;
        return r180014;
}
↓
double f(double x, double y) {
        double r180015 = x;
        double r180016 = y;
        double r180017 = r180015 + r180016;
        double r180018 = r180015 - r180016;
        double r180019 = r180017 * r180018;
        return r180019;
}

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