Average Error: 0.1 → 0.1
Time: 10.0s
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 r317629 = x;
        double r317630 = 3.0;
        double r317631 = 8.0;
        double r317632 = r317630 / r317631;
        double r317633 = y;
        double r317634 = r317632 * r317633;
        double r317635 = r317629 - r317634;
        return r317635;
}

double f(double x, double y) {
        double r317636 = x;
        double r317637 = 3.0;
        double r317638 = 8.0;
        double r317639 = r317637 / r317638;
        double r317640 = y;
        double r317641 = r317639 * r317640;
        double r317642 = r317636 - r317641;
        return r317642;
}

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