Average Error: 0.1 → 0.1
Time: 448.0ms
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 r160969 = x;
        double r160970 = 3.0;
        double r160971 = 8.0;
        double r160972 = r160970 / r160971;
        double r160973 = y;
        double r160974 = r160972 * r160973;
        double r160975 = r160969 - r160974;
        return r160975;
}
↓
double f(double x, double y) {
        double r160976 = x;
        double r160977 = 3.0;
        double r160978 = 8.0;
        double r160979 = r160977 / r160978;
        double r160980 = y;
        double r160981 = r160979 * r160980;
        double r160982 = r160976 - r160981;
        return r160982;
}

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