Average Error: 0.1 → 0.1
Time: 5.4s
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 r318327 = x;
        double r318328 = 3.0;
        double r318329 = 8.0;
        double r318330 = r318328 / r318329;
        double r318331 = y;
        double r318332 = r318330 * r318331;
        double r318333 = r318327 - r318332;
        return r318333;
}

double f(double x, double y) {
        double r318334 = x;
        double r318335 = 3.0;
        double r318336 = 8.0;
        double r318337 = r318335 / r318336;
        double r318338 = y;
        double r318339 = r318337 * r318338;
        double r318340 = r318334 - r318339;
        return r318340;
}

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