Average Error: 0.1 → 0.1
Time: 5.3s
Precision: 64
\[x - \frac{3}{8} \cdot y\]
↓
\[x - \frac{3}{8} \cdot y\]
x - \frac{3}{8} \cdot y
↓
x - \frac{3}{8} \cdot y
double f(double x, double y) {
        double r272555 = x;
        double r272556 = 3.0;
        double r272557 = 8.0;
        double r272558 = r272556 / r272557;
        double r272559 = y;
        double r272560 = r272558 * r272559;
        double r272561 = r272555 - r272560;
        return r272561;
}
↓
double f(double x, double y) {
        double r272562 = x;
        double r272563 = 3.0;
        double r272564 = 8.0;
        double r272565 = r272563 / r272564;
        double r272566 = y;
        double r272567 = r272565 * r272566;
        double r272568 = r272562 - r272567;
        return r272568;
}

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.1

    \[x - \frac{3}{8} \cdot y\]

  2. Final simplification0.1

    \[\leadsto x - \frac{3}{8} \cdot y\]

Reproduce

herbie shell --seed 2020039 
(FPCore (x y)
  :name "Diagrams.Solve.Polynomial:quartForm  from diagrams-solve-0.1, A"
  :precision binary64
  (- x (* (/ 3 8) y)))