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 r252245 = x;
        double r252246 = 3.0;
        double r252247 = 8.0;
        double r252248 = r252246 / r252247;
        double r252249 = y;
        double r252250 = r252248 * r252249;
        double r252251 = r252245 - r252250;
        return r252251;
}
↓
double f(double x, double y) {
        double r252252 = x;
        double r252253 = 3.0;
        double r252254 = 8.0;
        double r252255 = r252253 / r252254;
        double r252256 = y;
        double r252257 = r252255 * r252256;
        double r252258 = r252252 - r252257;
        return r252258;
}

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