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 r303182 = x;
        double r303183 = 3.0;
        double r303184 = 8.0;
        double r303185 = r303183 / r303184;
        double r303186 = y;
        double r303187 = r303185 * r303186;
        double r303188 = r303182 - r303187;
        return r303188;
}
↓
double f(double x, double y) {
        double r303189 = x;
        double r303190 = 3.0;
        double r303191 = 8.0;
        double r303192 = r303190 / r303191;
        double r303193 = y;
        double r303194 = r303192 * r303193;
        double r303195 = r303189 - r303194;
        return r303195;
}

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