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 r292075 = x;
        double r292076 = 3.0;
        double r292077 = 8.0;
        double r292078 = r292076 / r292077;
        double r292079 = y;
        double r292080 = r292078 * r292079;
        double r292081 = r292075 - r292080;
        return r292081;
}
↓
double f(double x, double y) {
        double r292082 = x;
        double r292083 = 3.0;
        double r292084 = 8.0;
        double r292085 = r292083 / r292084;
        double r292086 = y;
        double r292087 = r292085 * r292086;
        double r292088 = r292082 - r292087;
        return r292088;
}

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)))