Expression 1, p15

Percentage Accurate: 99.4% → 99.6%

Time: 7.3s

Alternatives: 7

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(d + c\right) + \left(e + \left(b + a\right)\right) \end{array} \]

FPCore

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

C

double code(double a, double b, double c, double d, double e) {
	return (d + c) + (e + (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 = (d + c) + (e + (b + a))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.4%

   \[\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. associate-+l+ N/A

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

   4. +-commutative N/A

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

   5. lift-+.f64 N/A

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

   6. lift-+.f64 N/A

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

   7. associate-+l+ N/A

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

   8. associate-+r+ N/A

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

   9. lower-+.f64 N/A

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

   10. lower-+.f64 N/A

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

   11. +-commutative N/A

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

   12. lower-+.f64 N/A

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

   13. +-commutative N/A

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

   14. lower-+.f64 99.6

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

4. Applied rewrites 99.6%

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

5. Final simplification 99.6%

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

Alternative 2: 99.6% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double a, double b, double c, double d, double e) {
	return (c + e) + (d + (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 = (c + e) + (d + (b + a))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.4%

   \[\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. associate-+l+ N/A

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

   4. +-commutative N/A

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

   5. lift-+.f64 N/A

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

   6. lift-+.f64 N/A

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

   7. +-commutative N/A

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

   8. associate-+l+ N/A

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

   9. associate-+r+ N/A

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

   10. lower-+.f64 N/A

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

   11. lower-+.f64 N/A

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

   12. +-commutative N/A

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

   13. lower-+.f64 N/A

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

   14. lower-+.f64 99.6

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

4. Applied rewrites 99.6%

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

5. Final simplification 99.6%

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

Alternative 3: 99.6% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double a, double b, double c, double d, double e) {
	return ((c + e) + b) + (d + 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 = ((c + e) + b) + (d + a)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.4%

   \[\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. +-commutative N/A

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

   3. lift-+.f64 N/A

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

   4. lift-+.f64 N/A

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

   5. associate-+l+ N/A

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

   6. lift-+.f64 N/A

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

   7. +-commutative N/A

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

   8. associate-+l+ N/A

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

   9. associate-+r+ N/A

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

   10. lower-+.f64 N/A

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

   11. lower-+.f64 N/A

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

   12. associate-+r+ N/A

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

   13. lower-+.f64 N/A

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

   14. lower-+.f64 99.6

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

4. Applied rewrites 99.6%

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

5. Final simplification 99.6%

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

Alternative 4: 99.6% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double a, double b, double c, double d, double e) {
	return (((c + b) + a) + 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 = (((c + b) + a) + e) + d
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.4%

   \[\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(\left(c + b\right) + a\right) + e\right) + d \]
6. Add Preprocessing

Alternative 5: 25.7% accurate, 1.3× speedup

Math

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

FPCore

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

C

double code(double a, double b, double c, double d, double e) {
	return ((d + c) + 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) + b) + e
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.4%

   \[\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. +-commutative N/A

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

   4. lower-+.f64 N/A

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

   5. lower-+.f64 25.7

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

5. Applied rewrites 25.7%

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

7. Applied rewrites 25.7%

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

8. Final simplification 25.7%

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

Alternative 6: 23.2% accurate, 1.9× speedup

Math

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

FPCore

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

C

double code(double a, double b, double c, double d, double e) {
	return (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 = (d + c) + e
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.4%

   \[\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. +-commutative N/A

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

   4. lower-+.f64 N/A

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

   5. lower-+.f64 25.7

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

5. Applied rewrites 25.7%

   \[\leadsto \color{blue}{\left(\left(d + e\right) + c\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 \left(d + e\right) + \color{blue}{c} \]
9. Step-by-step derivation

10. Applied rewrites 23.2%

    \[\leadsto \left(c + d\right) + e \]

11. Final simplification 23.2%

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

Alternative 7: 19.9% accurate, 3.3× speedup

Math

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

FPCore

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

C

double code(double a, double b, double c, double d, double e) {
	return 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 = c + e
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.4%

   \[\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. +-commutative N/A

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

   4. lower-+.f64 N/A

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

   5. lower-+.f64 25.7

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

5. Applied rewrites 25.7%

   \[\leadsto \color{blue}{\left(\left(d + e\right) + c\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 \left(d + e\right) + \color{blue}{c} \]

9. Taylor expanded in d around 0

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

11. Applied rewrites 19.9%

    \[\leadsto e + c \]

12. Final simplification 19.9%

    \[\leadsto c + e \]
13. 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 2024295 
(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))