Average Error: 0.0 → 0.0
Time: 2.2m
Precision: 64
$\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 f(double a, double b, double c, double d, double e, double f, double n) {
double r3448521 = a;
double r3448522 = b;
double r3448523 = r3448521 + r3448522;
double r3448524 = c;
double r3448525 = r3448523 + r3448524;
double r3448526 = d;
double r3448527 = r3448525 + r3448526;
double r3448528 = e;
double r3448529 = r3448527 + r3448528;
double r3448530 = f;
double r3448531 = r3448529 + r3448530;
double r3448532 = 6.0;
double r3448533 = n;
double r3448534 = r3448532 * r3448533;
double r3448535 = r3448531 - r3448534;
return r3448535;
}


double f(double a, double b, double c, double d, double e, double f, double n) {
double r3448536 = a;
double r3448537 = b;
double r3448538 = r3448536 + r3448537;
double r3448539 = c;
double r3448540 = r3448538 + r3448539;
double r3448541 = d;
double r3448542 = r3448540 + r3448541;
double r3448543 = e;
double r3448544 = r3448542 + r3448543;
double r3448545 = f;
double r3448546 = r3448544 + r3448545;
double r3448547 = 6.0;
double r3448548 = n;
double r3448549 = r3448547 * r3448548;
double r3448550 = r3448546 - r3448549;
return r3448550;
}



# Try it out

Results

 In Out
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 1
(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 n)))