Average Error: 0.1 → 0.1
Time: 9.6s
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 r129411 = x;
        double r129412 = 3.0;
        double r129413 = 8.0;
        double r129414 = r129412 / r129413;
        double r129415 = y;
        double r129416 = r129414 * r129415;
        double r129417 = r129411 - r129416;
        return r129417;
}

double f(double x, double y) {
        double r129418 = x;
        double r129419 = 3.0;
        double r129420 = 8.0;
        double r129421 = r129419 / r129420;
        double r129422 = y;
        double r129423 = r129421 * r129422;
        double r129424 = r129418 - r129423;
        return r129424;
}

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