Average Error: 0.0 → 0.0
Time: 6.5s
Precision: 64
\[\left(x + y\right) \cdot \left(x - y\right)\]
↓
\[\left(y + x\right) \cdot \left(x - y\right)\]
\left(x + y\right) \cdot \left(x - y\right)
↓
\left(y + x\right) \cdot \left(x - y\right)
double f(double x, double y) {
        double r15457404 = x;
        double r15457405 = y;
        double r15457406 = r15457404 + r15457405;
        double r15457407 = r15457404 - r15457405;
        double r15457408 = r15457406 * r15457407;
        return r15457408;
}
↓
double f(double x, double y) {
        double r15457409 = y;
        double r15457410 = x;
        double r15457411 = r15457409 + r15457410;
        double r15457412 = r15457410 - r15457409;
        double r15457413 = r15457411 * r15457412;
        return r15457413;
}

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(y + x\right) \cdot \left(x - y\right)\]

Reproduce

herbie shell --seed 2019158 
(FPCore (x y)
  :name "Examples.Basics.BasicTests:f1 from sbv-4.4"
  (* (+ x y) (- x y)))