Average Error: 0.1 → 0.1
Time: 724.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 r145476 = x;
        double r145477 = 3.0;
        double r145478 = 8.0;
        double r145479 = r145477 / r145478;
        double r145480 = y;
        double r145481 = r145479 * r145480;
        double r145482 = r145476 - r145481;
        return r145482;
}
↓
double f(double x, double y) {
        double r145483 = x;
        double r145484 = 3.0;
        double r145485 = 8.0;
        double r145486 = r145484 / r145485;
        double r145487 = y;
        double r145488 = r145486 * r145487;
        double r145489 = r145483 - r145488;
        return r145489;
}

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)))