Average Error: 0.1 → 0.1
Time: 16.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 r218647 = x;
        double r218648 = 3.0;
        double r218649 = 8.0;
        double r218650 = r218648 / r218649;
        double r218651 = y;
        double r218652 = r218650 * r218651;
        double r218653 = r218647 - r218652;
        return r218653;
}
↓
double f(double x, double y) {
        double r218654 = x;
        double r218655 = 3.0;
        double r218656 = 8.0;
        double r218657 = r218655 / r218656;
        double r218658 = y;
        double r218659 = r218657 * r218658;
        double r218660 = r218654 - r218659;
        return r218660;
}

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