Average Error: 16.7 → 12.6
Time: 8.7s
Precision: binary64
\[\]
\[\]
double code(double F, double l) {
	return ((double) (((double) (((double) M_PI) * l)) - ((double) (((double) (1.0 / ((double) (F * F)))) * ((double) tan(((double) (((double) M_PI) * l))))))));
}
double code(double F, double l) {
	return ((double) (((double) (((double) M_PI) * l)) + ((double) (1.0 * ((double) (((double) (-1.0 / ((double) (F / ((double) tan(((double) (((double) M_PI) * l)))))))) / F))))));
}

Error

Bits error versus F

Bits error versus l

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 16.7

    \[\]
  2. Simplified16.5

    \[\leadsto \]
  3. Using strategy rm
  4. Applied associate-/r*12.6

    \[\leadsto \]
  5. Using strategy rm
  6. Applied clear-num12.6

    \[\leadsto \]
  7. Final simplification12.6

    \[\leadsto \]

Reproduce

herbie shell --seed 2020192 
(FPCore (F l)
  :name "VandenBroeck and Keller, Equation (6)"
  :precision binary64
  (- (* PI l) (* (/ 1.0 (* F F)) (tan (* PI l)))))