Average Error: 0.1 → 0.1
Time: 17.8s
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 r218087 = x;
        double r218088 = 3.0;
        double r218089 = 8.0;
        double r218090 = r218088 / r218089;
        double r218091 = y;
        double r218092 = r218090 * r218091;
        double r218093 = r218087 - r218092;
        return r218093;
}
↓
double f(double x, double y) {
        double r218094 = x;
        double r218095 = 3.0;
        double r218096 = 8.0;
        double r218097 = r218095 / r218096;
        double r218098 = y;
        double r218099 = r218097 * r218098;
        double r218100 = r218094 - r218099;
        return r218100;
}

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