Average Error: 0.0 → 0.0
Time: 1.5s
Precision: 64
\[200 \cdot \left(x - y\right)\]
\[200 \cdot x + 200 \cdot \left(-y\right)\]
200 \cdot \left(x - y\right)
200 \cdot x + 200 \cdot \left(-y\right)
double f(double x, double y) {
        double r307789 = 200.0;
        double r307790 = x;
        double r307791 = y;
        double r307792 = r307790 - r307791;
        double r307793 = r307789 * r307792;
        return r307793;
}

double f(double x, double y) {
        double r307794 = 200.0;
        double r307795 = x;
        double r307796 = r307794 * r307795;
        double r307797 = y;
        double r307798 = -r307797;
        double r307799 = r307794 * r307798;
        double r307800 = r307796 + r307799;
        return r307800;
}

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

    \[200 \cdot \left(x - y\right)\]
  2. Using strategy rm
  3. Applied sub-neg0.0

    \[\leadsto 200 \cdot \color{blue}{\left(x + \left(-y\right)\right)}\]
  4. Applied distribute-lft-in0.0

    \[\leadsto \color{blue}{200 \cdot x + 200 \cdot \left(-y\right)}\]
  5. Final simplification0.0

    \[\leadsto 200 \cdot x + 200 \cdot \left(-y\right)\]

Reproduce

herbie shell --seed 2020083 
(FPCore (x y)
  :name "Data.Colour.CIE:cieLABView from colour-2.3.3, C"
  :precision binary64
  (* 200 (- x y)))