Average Error: 0.1 → 0.1
Time: 5.9s
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 r201974 = x;
        double r201975 = 3.0;
        double r201976 = 8.0;
        double r201977 = r201975 / r201976;
        double r201978 = y;
        double r201979 = r201977 * r201978;
        double r201980 = r201974 - r201979;
        return r201980;
}
↓
double f(double x, double y) {
        double r201981 = x;
        double r201982 = 3.0;
        double r201983 = 8.0;
        double r201984 = r201982 / r201983;
        double r201985 = y;
        double r201986 = r201984 * r201985;
        double r201987 = r201981 - r201986;
        return r201987;
}

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 2020062 +o rules:numerics
(FPCore (x y)
  :name "Diagrams.Solve.Polynomial:quartForm  from diagrams-solve-0.1, A"
  :precision binary64
  (- x (* (/ 3 8) y)))