Average Error: 0.1 → 0.1
Time: 7.2s
Precision: binary64
\[x - \frac{3}{8} \cdot y\]
↓
\[x + -0.375 \cdot y\]
x - \frac{3}{8} \cdot y
↓
x + -0.375 \cdot y
(FPCore (x y) :precision binary64 (- x (* (/ 3.0 8.0) y)))
↓
(FPCore (x y) :precision binary64 (+ x (* -0.375 y)))
double code(double x, double y) {
	return x - ((3.0 / 8.0) * y);
}
↓
double code(double x, double y) {
	return x + (-0.375 * y);
}

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. Simplified0.1

    \[\leadsto \color{blue}{x - 0.375 \cdot y}\]
  3. Using strategy rm

  4. Applied cancel-sign-sub-inv_binary64_44770.1

    \[\leadsto \color{blue}{x + \left(-0.375\right) \cdot y}\]

  5. Final simplification0.1

    \[\leadsto x + -0.375 \cdot y\]

Reproduce

herbie shell --seed 2021076 
(FPCore (x y)
  :name "Diagrams.Solve.Polynomial:quartForm  from diagrams-solve-0.1, A"
  :precision binary64
  (- x (* (/ 3.0 8.0) y)))