Average Error: 0.1 → 0.1
Time: 5.1s
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 r162109 = x;
        double r162110 = 3.0;
        double r162111 = 8.0;
        double r162112 = r162110 / r162111;
        double r162113 = y;
        double r162114 = r162112 * r162113;
        double r162115 = r162109 - r162114;
        return r162115;
}

double f(double x, double y) {
        double r162116 = x;
        double r162117 = 3.0;
        double r162118 = 8.0;
        double r162119 = r162117 / r162118;
        double r162120 = y;
        double r162121 = r162119 * r162120;
        double r162122 = r162116 - r162121;
        return r162122;
}

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