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 r203385 = x;
        double r203386 = 3.0;
        double r203387 = 8.0;
        double r203388 = r203386 / r203387;
        double r203389 = y;
        double r203390 = r203388 * r203389;
        double r203391 = r203385 - r203390;
        return r203391;
}
↓
double f(double x, double y) {
        double r203392 = x;
        double r203393 = 3.0;
        double r203394 = 8.0;
        double r203395 = r203393 / r203394;
        double r203396 = y;
        double r203397 = r203395 * r203396;
        double r203398 = r203392 - r203397;
        return r203398;
}

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