Average Error: 0.1 → 0.1
Time: 786.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 r127490 = x;
        double r127491 = 3.0;
        double r127492 = 8.0;
        double r127493 = r127491 / r127492;
        double r127494 = y;
        double r127495 = r127493 * r127494;
        double r127496 = r127490 - r127495;
        return r127496;
}
↓
double f(double x, double y) {
        double r127497 = x;
        double r127498 = 3.0;
        double r127499 = 8.0;
        double r127500 = r127498 / r127499;
        double r127501 = y;
        double r127502 = r127500 * r127501;
        double r127503 = r127497 - r127502;
        return r127503;
}

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