Average Error: 0.1 → 0.1
Time: 5.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 r291203 = x;
        double r291204 = 3.0;
        double r291205 = 8.0;
        double r291206 = r291204 / r291205;
        double r291207 = y;
        double r291208 = r291206 * r291207;
        double r291209 = r291203 - r291208;
        return r291209;
}
↓
double f(double x, double y) {
        double r291210 = x;
        double r291211 = 3.0;
        double r291212 = 8.0;
        double r291213 = r291211 / r291212;
        double r291214 = y;
        double r291215 = r291213 * r291214;
        double r291216 = r291210 - r291215;
        return r291216;
}

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