Average Error: 0.1 → 0.1
Time: 11.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 r308384 = x;
        double r308385 = 3.0;
        double r308386 = 8.0;
        double r308387 = r308385 / r308386;
        double r308388 = y;
        double r308389 = r308387 * r308388;
        double r308390 = r308384 - r308389;
        return r308390;
}

double f(double x, double y) {
        double r308391 = x;
        double r308392 = 3.0;
        double r308393 = 8.0;
        double r308394 = r308392 / r308393;
        double r308395 = y;
        double r308396 = r308394 * r308395;
        double r308397 = r308391 - r308396;
        return r308397;
}

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