Average Error: 0.1 → 0.1
Time: 48.5s
Precision: 64
\[x - \frac{3}{8} \cdot y\]
↓
\[x - y \cdot \frac{3}{8}\]
x - \frac{3}{8} \cdot y
↓
x - y \cdot \frac{3}{8}
double f(double x, double y) {
        double r10601141 = x;
        double r10601142 = 3.0;
        double r10601143 = 8.0;
        double r10601144 = r10601142 / r10601143;
        double r10601145 = y;
        double r10601146 = r10601144 * r10601145;
        double r10601147 = r10601141 - r10601146;
        return r10601147;
}
↓
double f(double x, double y) {
        double r10601148 = x;
        double r10601149 = y;
        double r10601150 = 3.0;
        double r10601151 = 8.0;
        double r10601152 = r10601150 / r10601151;
        double r10601153 = r10601149 * r10601152;
        double r10601154 = r10601148 - r10601153;
        return r10601154;
}

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 - y \cdot \frac{3}{8}\]

Reproduce

herbie shell --seed 2019200 +o rules:numerics
(FPCore (x y)
  :name "Diagrams.Solve.Polynomial:quartForm  from diagrams-solve-0.1, A"
  (- x (* (/ 3.0 8.0) y)))