Average Error: 0.1 → 0.1
Time: 6.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 r249203 = x;
        double r249204 = 3.0;
        double r249205 = 8.0;
        double r249206 = r249204 / r249205;
        double r249207 = y;
        double r249208 = r249206 * r249207;
        double r249209 = r249203 - r249208;
        return r249209;
}
↓
double f(double x, double y) {
        double r249210 = x;
        double r249211 = 3.0;
        double r249212 = 8.0;
        double r249213 = r249211 / r249212;
        double r249214 = y;
        double r249215 = r249213 * r249214;
        double r249216 = r249210 - r249215;
        return r249216;
}

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