Average Error: 0.0 → 0.0
Time: 1.4s
Precision: binary64
\[\left(\left(\left(\left(\left(a + b\right) + c\right) + d\right) + e\right) + f\right) - 6 \cdot n\]
↓
\[\left(\left(\left(\left(\left(a + b\right) + c\right) + d\right) + e\right) + f\right) - 6 \cdot n\]
\left(\left(\left(\left(\left(a + b\right) + c\right) + d\right) + e\right) + f\right) - 6 \cdot n
↓
\left(\left(\left(\left(\left(a + b\right) + c\right) + d\right) + e\right) + f\right) - 6 \cdot n
double code(double a, double b, double c, double d, double e, double f, double n) {
	return ((double) (((double) (((double) (((double) (((double) (((double) (a + b)) + c)) + d)) + e)) + f)) - ((double) (6.0 * n))));
}
↓
double code(double a, double b, double c, double d, double e, double f, double n) {
	return ((double) (((double) (((double) (((double) (((double) (((double) (a + b)) + c)) + d)) + e)) + f)) - ((double) (6.0 * n))));
}

Error

Bits error versus a

Bits error versus b

Bits error versus c

Bits error versus d

Bits error versus e

Bits error versus f

Bits error versus n

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[\left(\left(\left(\left(\left(a + b\right) + c\right) + d\right) + e\right) + f\right) - 6 \cdot n\]

  2. Final simplification0.0

    \[\leadsto \left(\left(\left(\left(\left(a + b\right) + c\right) + d\right) + e\right) + f\right) - 6 \cdot n\]

Reproduce

herbie shell --seed 2020152 
(FPCore (a b c d e f n)
  :name "(- (+ (+ (+ (+ (+ a b) c) d) e) f) (* 6 n))"
  :precision binary64
  (- (+ (+ (+ (+ (+ a b) c) d) e) f) (* 6.0 n)))