Average Error: 0.1 → 0.1
Time: 17.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 r197015 = x;
        double r197016 = 3.0;
        double r197017 = 8.0;
        double r197018 = r197016 / r197017;
        double r197019 = y;
        double r197020 = r197018 * r197019;
        double r197021 = r197015 - r197020;
        return r197021;
}
↓
double f(double x, double y) {
        double r197022 = x;
        double r197023 = 3.0;
        double r197024 = 8.0;
        double r197025 = r197023 / r197024;
        double r197026 = y;
        double r197027 = r197025 * r197026;
        double r197028 = r197022 - r197027;
        return r197028;
}

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