Average Error: 0.1 → 0.1
Time: 453.0ms
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 r225232 = x;
        double r225233 = 3.0;
        double r225234 = 8.0;
        double r225235 = r225233 / r225234;
        double r225236 = y;
        double r225237 = r225235 * r225236;
        double r225238 = r225232 - r225237;
        return r225238;
}
↓
double f(double x, double y) {
        double r225239 = x;
        double r225240 = 3.0;
        double r225241 = 8.0;
        double r225242 = r225240 / r225241;
        double r225243 = y;
        double r225244 = r225242 * r225243;
        double r225245 = r225239 - r225244;
        return r225245;
}

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