Average Error: 0.1 → 0.1
Time: 4.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 r217434 = x;
        double r217435 = 3.0;
        double r217436 = 8.0;
        double r217437 = r217435 / r217436;
        double r217438 = y;
        double r217439 = r217437 * r217438;
        double r217440 = r217434 - r217439;
        return r217440;
}
↓
double f(double x, double y) {
        double r217441 = x;
        double r217442 = 3.0;
        double r217443 = 8.0;
        double r217444 = r217442 / r217443;
        double r217445 = y;
        double r217446 = r217444 * r217445;
        double r217447 = r217441 - r217446;
        return r217447;
}

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