Average Error: 0.1 → 0.1
Time: 8.5s
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 r1091 = x;
        double r1092 = 3.0;
        double r1093 = 8.0;
        double r1094 = r1092 / r1093;
        double r1095 = y;
        double r1096 = r1094 * r1095;
        double r1097 = r1091 - r1096;
        return r1097;
}
↓
double f(double x, double y) {
        double r1098 = x;
        double r1099 = 3.0;
        double r1100 = 8.0;
        double r1101 = r1099 / r1100;
        double r1102 = y;
        double r1103 = r1101 * r1102;
        double r1104 = r1098 - r1103;
        return r1104;
}

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