Average Error: 0.1 → 0.1
Time: 5.8s
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 r246184 = x;
        double r246185 = 3.0;
        double r246186 = 8.0;
        double r246187 = r246185 / r246186;
        double r246188 = y;
        double r246189 = r246187 * r246188;
        double r246190 = r246184 - r246189;
        return r246190;
}
↓
double f(double x, double y) {
        double r246191 = x;
        double r246192 = 3.0;
        double r246193 = 8.0;
        double r246194 = r246192 / r246193;
        double r246195 = y;
        double r246196 = r246194 * r246195;
        double r246197 = r246191 - r246196;
        return r246197;
}

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