Average Error: 0.1 → 0.1
Time: 5.3s
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 r205475 = x;
        double r205476 = 3.0;
        double r205477 = 8.0;
        double r205478 = r205476 / r205477;
        double r205479 = y;
        double r205480 = r205478 * r205479;
        double r205481 = r205475 - r205480;
        return r205481;
}
↓
double f(double x, double y) {
        double r205482 = x;
        double r205483 = 3.0;
        double r205484 = 8.0;
        double r205485 = r205483 / r205484;
        double r205486 = y;
        double r205487 = r205485 * r205486;
        double r205488 = r205482 - r205487;
        return r205488;
}

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