Average Error: 0.1 → 0.1
Time: 13.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 r220565 = x;
        double r220566 = 3.0;
        double r220567 = 8.0;
        double r220568 = r220566 / r220567;
        double r220569 = y;
        double r220570 = r220568 * r220569;
        double r220571 = r220565 - r220570;
        return r220571;
}
↓
double f(double x, double y) {
        double r220572 = x;
        double r220573 = 3.0;
        double r220574 = 8.0;
        double r220575 = r220573 / r220574;
        double r220576 = y;
        double r220577 = r220575 * r220576;
        double r220578 = r220572 - r220577;
        return r220578;
}

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