Average Error: 0.1 → 0.1
Time: 5.3s
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 r257135 = x;
        double r257136 = 3.0;
        double r257137 = 8.0;
        double r257138 = r257136 / r257137;
        double r257139 = y;
        double r257140 = r257138 * r257139;
        double r257141 = r257135 - r257140;
        return r257141;
}
↓
double f(double x, double y) {
        double r257142 = x;
        double r257143 = 3.0;
        double r257144 = 8.0;
        double r257145 = r257143 / r257144;
        double r257146 = y;
        double r257147 = r257145 * r257146;
        double r257148 = r257142 - r257147;
        return r257148;
}

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