Expression 1, p15

Percentage Accurate: 99.4% → 99.6%

Time: 7.9s

Alternatives: 6

Speedup: 1.0×

Specification

\[\left(\left(\left(\left(\left(\left(\left(\left(1 \leq a \land a \leq 2\right) \land 2 \leq b\right) \land b \leq 4\right) \land 4 \leq c\right) \land c \leq 8\right) \land 8 \leq d\right) \land d \leq 16\right) \land 16 \leq e\right) \land e \leq 32\]

Math

\[\begin{array}{l} \\ \left(\left(\left(e + d\right) + c\right) + b\right) + a \end{array} \]

FPCore

(FPCore (a b c d e) :precision binary64 (+ (+ (+ (+ e d) c) b) a))

C

double code(double a, double b, double c, double d, double e) {
	return (((e + d) + c) + b) + a;
}

Fortran

real(8) function code(a, b, c, d, e)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: d
    real(8), intent (in) :: e
    code = (((e + d) + c) + b) + a
end function

Java

public static double code(double a, double b, double c, double d, double e) {
	return (((e + d) + c) + b) + a;
}

Python

def code(a, b, c, d, e):
	return (((e + d) + c) + b) + a

Julia

function code(a, b, c, d, e)
	return Float64(Float64(Float64(Float64(e + d) + c) + b) + a)
end

MATLAB

function tmp = code(a, b, c, d, e)
	tmp = (((e + d) + c) + b) + a;
end

Wolfram

code[a_, b_, c_, d_, e_] := N[(N[(N[(N[(e + d), $MachinePrecision] + c), $MachinePrecision] + b), $MachinePrecision] + a), $MachinePrecision]

Initial Program: 99.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(\left(\left(e + d\right) + c\right) + b\right) + a \end{array} \]

FPCore

(FPCore (a b c d e) :precision binary64 (+ (+ (+ (+ e d) c) b) a))

C

double code(double a, double b, double c, double d, double e) {
	return (((e + d) + c) + b) + a;
}

Fortran

real(8) function code(a, b, c, d, e)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: d
    real(8), intent (in) :: e
    code = (((e + d) + c) + b) + a
end function

Java

public static double code(double a, double b, double c, double d, double e) {
	return (((e + d) + c) + b) + a;
}

Python

def code(a, b, c, d, e):
	return (((e + d) + c) + b) + a

Julia

function code(a, b, c, d, e)
	return Float64(Float64(Float64(Float64(e + d) + c) + b) + a)
end

MATLAB

function tmp = code(a, b, c, d, e)
	tmp = (((e + d) + c) + b) + a;
end

Wolfram

code[a_, b_, c_, d_, e_] := N[(N[(N[(N[(e + d), $MachinePrecision] + c), $MachinePrecision] + b), $MachinePrecision] + a), $MachinePrecision]

Alternative 1: 99.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(\left(a + \left(c + b\right)\right) + e\right) + d \end{array} \]

FPCore

(FPCore (a b c d e) :precision binary64 (+ (+ (+ a (+ c b)) e) d))

C

double code(double a, double b, double c, double d, double e) {
	return ((a + (c + b)) + e) + d;
}

Fortran

real(8) function code(a, b, c, d, e)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: d
    real(8), intent (in) :: e
    code = ((a + (c + b)) + e) + d
end function

Java

public static double code(double a, double b, double c, double d, double e) {
	return ((a + (c + b)) + e) + d;
}

Python

def code(a, b, c, d, e):
	return ((a + (c + b)) + e) + d

Julia

function code(a, b, c, d, e)
	return Float64(Float64(Float64(a + Float64(c + b)) + e) + d)
end

MATLAB

function tmp = code(a, b, c, d, e)
	tmp = ((a + (c + b)) + e) + d;
end

Wolfram

code[a_, b_, c_, d_, e_] := N[(N[(N[(a + N[(c + b), $MachinePrecision]), $MachinePrecision] + e), $MachinePrecision] + d), $MachinePrecision]

Derivation

1. Initial program 99.3%

   \[\left(\left(\left(e + d\right) + c\right) + b\right) + a \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift-+.f64 N/A

      \[\leadsto \color{blue}{\left(\left(\left(e + d\right) + c\right) + b\right) + a} \]

   2. lift-+.f64 N/A

      \[\leadsto \color{blue}{\left(\left(\left(e + d\right) + c\right) + b\right)} + a \]

   3. lift-+.f64 N/A

      \[\leadsto \left(\color{blue}{\left(\left(e + d\right) + c\right)} + b\right) + a \]

   4. associate-+l+ N/A

      \[\leadsto \color{blue}{\left(\left(e + d\right) + \left(c + b\right)\right)} + a \]

   5. associate-+l+ N/A

      \[\leadsto \color{blue}{\left(e + d\right) + \left(\left(c + b\right) + a\right)} \]

   6. lift-+.f64 N/A

      \[\leadsto \color{blue}{\left(e + d\right)} + \left(\left(c + b\right) + a\right) \]

   7. +-commutative N/A

      \[\leadsto \color{blue}{\left(d + e\right)} + \left(\left(c + b\right) + a\right) \]

   8. associate-+l+ N/A

      \[\leadsto \color{blue}{d + \left(e + \left(\left(c + b\right) + a\right)\right)} \]

   9. lower-+.f64 N/A

      \[\leadsto \color{blue}{d + \left(e + \left(\left(c + b\right) + a\right)\right)} \]

   10. lower-+.f64 N/A

       \[\leadsto d + \color{blue}{\left(e + \left(\left(c + b\right) + a\right)\right)} \]

   11. lower-+.f64 N/A

       \[\leadsto d + \left(e + \color{blue}{\left(\left(c + b\right) + a\right)}\right) \]

   12. +-commutative N/A

       \[\leadsto d + \left(e + \left(\color{blue}{\left(b + c\right)} + a\right)\right) \]

   13. lower-+.f64 99.6

       \[\leadsto d + \left(e + \left(\color{blue}{\left(b + c\right)} + a\right)\right) \]

4. Applied rewrites 99.6%

   \[\leadsto \color{blue}{d + \left(e + \left(\left(b + c\right) + a\right)\right)} \]

5. Final simplification 99.6%

   \[\leadsto \left(\left(a + \left(c + b\right)\right) + e\right) + d \]
6. Add Preprocessing

Alternative 2: 99.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(\left(b + e\right) + \left(a + d\right)\right) + c \end{array} \]

FPCore

(FPCore (a b c d e) :precision binary64 (+ (+ (+ b e) (+ a d)) c))

C

double code(double a, double b, double c, double d, double e) {
	return ((b + e) + (a + d)) + c;
}

Fortran

real(8) function code(a, b, c, d, e)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: d
    real(8), intent (in) :: e
    code = ((b + e) + (a + d)) + c
end function

Java

public static double code(double a, double b, double c, double d, double e) {
	return ((b + e) + (a + d)) + c;
}

Python

def code(a, b, c, d, e):
	return ((b + e) + (a + d)) + c

Julia

function code(a, b, c, d, e)
	return Float64(Float64(Float64(b + e) + Float64(a + d)) + c)
end

MATLAB

function tmp = code(a, b, c, d, e)
	tmp = ((b + e) + (a + d)) + c;
end

Wolfram

code[a_, b_, c_, d_, e_] := N[(N[(N[(b + e), $MachinePrecision] + N[(a + d), $MachinePrecision]), $MachinePrecision] + c), $MachinePrecision]

Derivation

1. Initial program 99.3%

   \[\left(\left(\left(e + d\right) + c\right) + b\right) + a \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift-+.f64 N/A

      \[\leadsto \color{blue}{\left(\left(\left(e + d\right) + c\right) + b\right) + a} \]

   2. lift-+.f64 N/A

      \[\leadsto \color{blue}{\left(\left(\left(e + d\right) + c\right) + b\right)} + a \]

   3. lift-+.f64 N/A

      \[\leadsto \left(\color{blue}{\left(\left(e + d\right) + c\right)} + b\right) + a \]

   4. associate-+l+ N/A

      \[\leadsto \color{blue}{\left(\left(e + d\right) + \left(c + b\right)\right)} + a \]

   5. associate-+l+ N/A

      \[\leadsto \color{blue}{\left(e + d\right) + \left(\left(c + b\right) + a\right)} \]

   6. lift-+.f64 N/A

      \[\leadsto \color{blue}{\left(e + d\right)} + \left(\left(c + b\right) + a\right) \]

   7. +-commutative N/A

      \[\leadsto \color{blue}{\left(d + e\right)} + \left(\left(c + b\right) + a\right) \]

   8. associate-+l+ N/A

      \[\leadsto \color{blue}{d + \left(e + \left(\left(c + b\right) + a\right)\right)} \]

   9. lower-+.f64 N/A

      \[\leadsto \color{blue}{d + \left(e + \left(\left(c + b\right) + a\right)\right)} \]

   10. lower-+.f64 N/A

       \[\leadsto d + \color{blue}{\left(e + \left(\left(c + b\right) + a\right)\right)} \]

   11. lower-+.f64 N/A

       \[\leadsto d + \left(e + \color{blue}{\left(\left(c + b\right) + a\right)}\right) \]

   12. +-commutative N/A

       \[\leadsto d + \left(e + \left(\color{blue}{\left(b + c\right)} + a\right)\right) \]

   13. lower-+.f64 99.6

       \[\leadsto d + \left(e + \left(\color{blue}{\left(b + c\right)} + a\right)\right) \]

4. Applied rewrites 99.6%

   \[\leadsto \color{blue}{d + \left(e + \left(\left(b + c\right) + a\right)\right)} \]
5. Step-by-step derivation

   1. lift-+.f64 N/A

      \[\leadsto \color{blue}{d + \left(e + \left(\left(b + c\right) + a\right)\right)} \]

   2. +-commutative N/A

      \[\leadsto \color{blue}{\left(e + \left(\left(b + c\right) + a\right)\right) + d} \]

   3. lift-+.f64 N/A

      \[\leadsto \color{blue}{\left(e + \left(\left(b + c\right) + a\right)\right)} + d \]

   4. lift-+.f64 N/A

      \[\leadsto \left(e + \color{blue}{\left(\left(b + c\right) + a\right)}\right) + d \]

   5. associate-+r+ N/A

      \[\leadsto \color{blue}{\left(\left(e + \left(b + c\right)\right) + a\right)} + d \]

   6. associate-+l+ N/A

      \[\leadsto \color{blue}{\left(e + \left(b + c\right)\right) + \left(a + d\right)} \]

   7. +-commutative N/A

      \[\leadsto \left(e + \left(b + c\right)\right) + \color{blue}{\left(d + a\right)} \]

   8. lift-+.f64 N/A

      \[\leadsto \left(e + \color{blue}{\left(b + c\right)}\right) + \left(d + a\right) \]

   9. associate-+r+ N/A

      \[\leadsto \color{blue}{\left(\left(e + b\right) + c\right)} + \left(d + a\right) \]

   10. +-commutative N/A

       \[\leadsto \left(\color{blue}{\left(b + e\right)} + c\right) + \left(d + a\right) \]

   11. lift-+.f64 N/A

       \[\leadsto \left(\color{blue}{\left(b + e\right)} + c\right) + \left(d + a\right) \]

   12. associate-+r+ N/A

       \[\leadsto \color{blue}{\left(b + e\right) + \left(c + \left(d + a\right)\right)} \]

   13. associate-+l+ N/A

       \[\leadsto \left(b + e\right) + \color{blue}{\left(\left(c + d\right) + a\right)} \]

   14. lift-+.f64 N/A

       \[\leadsto \left(b + e\right) + \left(\color{blue}{\left(c + d\right)} + a\right) \]

   15. lift-+.f64 N/A

       \[\leadsto \left(b + e\right) + \color{blue}{\left(\left(c + d\right) + a\right)} \]

   16. +-commutative N/A

       \[\leadsto \color{blue}{\left(\left(c + d\right) + a\right) + \left(b + e\right)} \]

   17. lift-+.f64 N/A

       \[\leadsto \color{blue}{\left(\left(c + d\right) + a\right)} + \left(b + e\right) \]

   18. lift-+.f64 N/A

       \[\leadsto \left(\color{blue}{\left(c + d\right)} + a\right) + \left(b + e\right) \]

   19. associate-+l+ N/A

       \[\leadsto \color{blue}{\left(c + \left(d + a\right)\right)} + \left(b + e\right) \]

   20. associate-+l+ N/A

       \[\leadsto \color{blue}{c + \left(\left(d + a\right) + \left(b + e\right)\right)} \]

   21. lower-+.f64 N/A

       \[\leadsto \color{blue}{c + \left(\left(d + a\right) + \left(b + e\right)\right)} \]

   22. lower-+.f64 N/A

       \[\leadsto c + \color{blue}{\left(\left(d + a\right) + \left(b + e\right)\right)} \]

   23. +-commutative N/A

       \[\leadsto c + \left(\color{blue}{\left(a + d\right)} + \left(b + e\right)\right) \]

   24. lower-+.f64 99.5

       \[\leadsto c + \left(\color{blue}{\left(a + d\right)} + \left(b + e\right)\right) \]

6. Applied rewrites 99.5%

   \[\leadsto \color{blue}{c + \left(\left(a + d\right) + \left(b + e\right)\right)} \]

7. Final simplification 99.5%

   \[\leadsto \left(\left(b + e\right) + \left(a + d\right)\right) + c \]
8. Add Preprocessing

Alternative 3: 25.7% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \left(\left(b + e\right) + d\right) + c \end{array} \]

FPCore

(FPCore (a b c d e) :precision binary64 (+ (+ (+ b e) d) c))

C

double code(double a, double b, double c, double d, double e) {
	return ((b + e) + d) + c;
}

Fortran

real(8) function code(a, b, c, d, e)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: d
    real(8), intent (in) :: e
    code = ((b + e) + d) + c
end function

Java

public static double code(double a, double b, double c, double d, double e) {
	return ((b + e) + d) + c;
}

Python

def code(a, b, c, d, e):
	return ((b + e) + d) + c

Julia

function code(a, b, c, d, e)
	return Float64(Float64(Float64(b + e) + d) + c)
end

MATLAB

function tmp = code(a, b, c, d, e)
	tmp = ((b + e) + d) + c;
end

Wolfram

code[a_, b_, c_, d_, e_] := N[(N[(N[(b + e), $MachinePrecision] + d), $MachinePrecision] + c), $MachinePrecision]

Derivation

1. Initial program 99.3%

   \[\left(\left(\left(e + d\right) + c\right) + b\right) + a \]
2. Add Preprocessing

3. Taylor expanded in a around 0

   \[\leadsto \color{blue}{b + \left(c + \left(d + e\right)\right)} \]
4. Step-by-step derivation

   1. +-commutative N/A

      \[\leadsto \color{blue}{\left(c + \left(d + e\right)\right) + b} \]

   2. lower-+.f64 N/A

      \[\leadsto \color{blue}{\left(c + \left(d + e\right)\right) + b} \]

   3. lower-+.f64 N/A

      \[\leadsto \color{blue}{\left(c + \left(d + e\right)\right)} + b \]

   4. +-commutative N/A

      \[\leadsto \left(c + \color{blue}{\left(e + d\right)}\right) + b \]

   5. lower-+.f64 25.7

      \[\leadsto \left(c + \color{blue}{\left(e + d\right)}\right) + b \]

5. Applied rewrites 25.7%

   \[\leadsto \color{blue}{\left(c + \left(e + d\right)\right) + b} \]
6. Step-by-step derivation

7. Applied rewrites 25.7%

   \[\leadsto \left(\left(b + e\right) + d\right) + \color{blue}{c} \]
8. Add Preprocessing

Alternative 4: 25.7% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \left(b + d\right) + \left(c + e\right) \end{array} \]

FPCore

(FPCore (a b c d e) :precision binary64 (+ (+ b d) (+ c e)))

C

double code(double a, double b, double c, double d, double e) {
	return (b + d) + (c + e);
}

Fortran

real(8) function code(a, b, c, d, e)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: d
    real(8), intent (in) :: e
    code = (b + d) + (c + e)
end function

Java

public static double code(double a, double b, double c, double d, double e) {
	return (b + d) + (c + e);
}

Python

def code(a, b, c, d, e):
	return (b + d) + (c + e)

Julia

function code(a, b, c, d, e)
	return Float64(Float64(b + d) + Float64(c + e))
end

MATLAB

function tmp = code(a, b, c, d, e)
	tmp = (b + d) + (c + e);
end

Wolfram

code[a_, b_, c_, d_, e_] := N[(N[(b + d), $MachinePrecision] + N[(c + e), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.3%

   \[\left(\left(\left(e + d\right) + c\right) + b\right) + a \]
2. Add Preprocessing

3. Taylor expanded in a around 0

   \[\leadsto \color{blue}{b + \left(c + \left(d + e\right)\right)} \]
4. Step-by-step derivation

   1. +-commutative N/A

      \[\leadsto \color{blue}{\left(c + \left(d + e\right)\right) + b} \]

   2. lower-+.f64 N/A

      \[\leadsto \color{blue}{\left(c + \left(d + e\right)\right) + b} \]

   3. lower-+.f64 N/A

      \[\leadsto \color{blue}{\left(c + \left(d + e\right)\right)} + b \]

   4. +-commutative N/A

      \[\leadsto \left(c + \color{blue}{\left(e + d\right)}\right) + b \]

   5. lower-+.f64 25.7

      \[\leadsto \left(c + \color{blue}{\left(e + d\right)}\right) + b \]

5. Applied rewrites 25.7%

   \[\leadsto \color{blue}{\left(c + \left(e + d\right)\right) + b} \]
6. Step-by-step derivation

7. Applied rewrites 25.7%

   \[\leadsto \left(c + e\right) + \color{blue}{\left(d + b\right)} \]

8. Final simplification 25.7%

   \[\leadsto \left(b + d\right) + \left(c + e\right) \]
9. Add Preprocessing

Alternative 5: 23.2% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \left(e + d\right) + c \end{array} \]

FPCore

(FPCore (a b c d e) :precision binary64 (+ (+ e d) c))

C

double code(double a, double b, double c, double d, double e) {
	return (e + d) + c;
}

Fortran

real(8) function code(a, b, c, d, e)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: d
    real(8), intent (in) :: e
    code = (e + d) + c
end function

Java

public static double code(double a, double b, double c, double d, double e) {
	return (e + d) + c;
}

Python

def code(a, b, c, d, e):
	return (e + d) + c

Julia

function code(a, b, c, d, e)
	return Float64(Float64(e + d) + c)
end

MATLAB

function tmp = code(a, b, c, d, e)
	tmp = (e + d) + c;
end

Wolfram

code[a_, b_, c_, d_, e_] := N[(N[(e + d), $MachinePrecision] + c), $MachinePrecision]

Derivation

1. Initial program 99.3%

   \[\left(\left(\left(e + d\right) + c\right) + b\right) + a \]
2. Add Preprocessing

3. Taylor expanded in a around 0

   \[\leadsto \color{blue}{b + \left(c + \left(d + e\right)\right)} \]
4. Step-by-step derivation

   1. +-commutative N/A

      \[\leadsto \color{blue}{\left(c + \left(d + e\right)\right) + b} \]

   2. lower-+.f64 N/A

      \[\leadsto \color{blue}{\left(c + \left(d + e\right)\right) + b} \]

   3. lower-+.f64 N/A

      \[\leadsto \color{blue}{\left(c + \left(d + e\right)\right)} + b \]

   4. +-commutative N/A

      \[\leadsto \left(c + \color{blue}{\left(e + d\right)}\right) + b \]

   5. lower-+.f64 25.7

      \[\leadsto \left(c + \color{blue}{\left(e + d\right)}\right) + b \]

5. Applied rewrites 25.7%

   \[\leadsto \color{blue}{\left(c + \left(e + d\right)\right) + b} \]

6. Taylor expanded in b around 0

   \[\leadsto c + \color{blue}{\left(d + e\right)} \]
7. Step-by-step derivation

8. Applied rewrites 23.2%

   \[\leadsto c + \color{blue}{\left(e + d\right)} \]

9. Final simplification 23.2%

   \[\leadsto \left(e + d\right) + c \]
10. Add Preprocessing

Alternative 6: 21.2% accurate, 3.3× speedup

Math

\[\begin{array}{l} \\ e + d \end{array} \]

FPCore

(FPCore (a b c d e) :precision binary64 (+ e d))

C

double code(double a, double b, double c, double d, double e) {
	return e + d;
}

Fortran

real(8) function code(a, b, c, d, e)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: d
    real(8), intent (in) :: e
    code = e + d
end function

Java

public static double code(double a, double b, double c, double d, double e) {
	return e + d;
}

Python

def code(a, b, c, d, e):
	return e + d

Julia

function code(a, b, c, d, e)
	return Float64(e + d)
end

MATLAB

function tmp = code(a, b, c, d, e)
	tmp = e + d;
end

Wolfram

code[a_, b_, c_, d_, e_] := N[(e + d), $MachinePrecision]

Derivation

1. Initial program 99.3%

   \[\left(\left(\left(e + d\right) + c\right) + b\right) + a \]
2. Add Preprocessing

3. Taylor expanded in a around 0

   \[\leadsto \color{blue}{b + \left(c + \left(d + e\right)\right)} \]
4. Step-by-step derivation

   1. +-commutative N/A

      \[\leadsto \color{blue}{\left(c + \left(d + e\right)\right) + b} \]

   2. lower-+.f64 N/A

      \[\leadsto \color{blue}{\left(c + \left(d + e\right)\right) + b} \]

   3. lower-+.f64 N/A

      \[\leadsto \color{blue}{\left(c + \left(d + e\right)\right)} + b \]

   4. +-commutative N/A

      \[\leadsto \left(c + \color{blue}{\left(e + d\right)}\right) + b \]

   5. lower-+.f64 25.7

      \[\leadsto \left(c + \color{blue}{\left(e + d\right)}\right) + b \]

5. Applied rewrites 25.7%

   \[\leadsto \color{blue}{\left(c + \left(e + d\right)\right) + b} \]

6. Taylor expanded in b around 0

   \[\leadsto c + \color{blue}{\left(d + e\right)} \]
7. Step-by-step derivation

8. Applied rewrites 23.2%

   \[\leadsto c + \color{blue}{\left(e + d\right)} \]

9. Taylor expanded in c around 0

   \[\leadsto d + e \]
10. Step-by-step derivation

11. Applied rewrites 21.1%

    \[\leadsto e + d \]
12. Add Preprocessing

Developer Target 1: 99.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(d + \left(c + \left(a + b\right)\right)\right) + e \end{array} \]

FPCore

(FPCore (a b c d e) :precision binary64 (+ (+ d (+ c (+ a b))) e))

C

double code(double a, double b, double c, double d, double e) {
	return (d + (c + (a + b))) + e;
}

Fortran

real(8) function code(a, b, c, d, e)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: d
    real(8), intent (in) :: e
    code = (d + (c + (a + b))) + e
end function

Java

public static double code(double a, double b, double c, double d, double e) {
	return (d + (c + (a + b))) + e;
}

Python

def code(a, b, c, d, e):
	return (d + (c + (a + b))) + e

Julia

function code(a, b, c, d, e)
	return Float64(Float64(d + Float64(c + Float64(a + b))) + e)
end

MATLAB

function tmp = code(a, b, c, d, e)
	tmp = (d + (c + (a + b))) + e;
end

Wolfram

code[a_, b_, c_, d_, e_] := N[(N[(d + N[(c + N[(a + b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + e), $MachinePrecision]

Reproduce

herbie shell --seed 2024273 
(FPCore (a b c d e)
  :name "Expression 1, p15"
  :precision binary64
  :pre (and (and (and (and (and (and (and (and (and (<= 1.0 a) (<= a 2.0)) (<= 2.0 b)) (<= b 4.0)) (<= 4.0 c)) (<= c 8.0)) (<= 8.0 d)) (<= d 16.0)) (<= 16.0 e)) (<= e 32.0))

  :alt
  (! :herbie-platform default (+ (+ d (+ c (+ a b))) e))

  (+ (+ (+ (+ e d) c) b) a))