Average Error: 0.1 → 0.1
Time: 5.8s
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 r303918 = x;
        double r303919 = 3.0;
        double r303920 = 8.0;
        double r303921 = r303919 / r303920;
        double r303922 = y;
        double r303923 = r303921 * r303922;
        double r303924 = r303918 - r303923;
        return r303924;
}

double f(double x, double y) {
        double r303925 = x;
        double r303926 = 3.0;
        double r303927 = 8.0;
        double r303928 = r303926 / r303927;
        double r303929 = y;
        double r303930 = r303928 * r303929;
        double r303931 = r303925 - r303930;
        return r303931;
}

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