Expression, p6

Percentage Accurate: 94.3% → 100.0%

Time: 6.7s

Alternatives: 6

Speedup: 1.0×

Specification

\[\left(\left(\left(-14 \leq a \land a \leq -13\right) \land \left(-3 \leq b \land b \leq -2\right)\right) \land \left(3 \leq c \land c \leq 3.5\right)\right) \land \left(12.5 \leq d \land d \leq 13.5\right)\]

Math

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

FPCore

(FPCore (a b c d) :precision binary64 (* (+ a (+ b (+ c d))) 2.0))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 94.3% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (a b c d) :precision binary64 (* (+ a (+ b (+ c d))) 2.0))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (a b c d) :precision binary64 (* (+ (+ c b) (+ d a)) 2.0))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 94.2%

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

   1. lift-+.f64 N/A

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

   2. +-commutative N/A

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

   3. lift-+.f64 N/A

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

   4. lift-+.f64 N/A

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

   5. associate-+r+ N/A

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

   6. associate-+l+ N/A

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

   7. lower-+.f64 N/A

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

   8. +-commutative N/A

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

   9. lower-+.f64 N/A

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

   10. lower-+.f64 100.0

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

4. Applied rewrites 100.0%

   \[\leadsto \color{blue}{\left(\left(c + b\right) + \left(d + a\right)\right)} \cdot 2 \]
5. Add Preprocessing

Alternative 2: 17.0% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\left(a + \left(b + \left(c + d\right)\right)\right) \cdot 2 \leq -0.005:\\ \;\;\;\;\left(d + a\right) \cdot 2\\ \mathbf{else}:\\ \;\;\;\;\left(\left(c + a\right) + d\right) \cdot 2\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c d)
 :precision binary64
 (if (<= (* (+ a (+ b (+ c d))) 2.0) -0.005)
   (* (+ d a) 2.0)
   (* (+ (+ c a) d) 2.0)))

C

double code(double a, double b, double c, double d) {
	double tmp;
	if (((a + (b + (c + d))) * 2.0) <= -0.005) {
		tmp = (d + a) * 2.0;
	} else {
		tmp = ((c + a) + d) * 2.0;
	}
	return tmp;
}

Fortran

real(8) function code(a, b, c, d)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: d
    real(8) :: tmp
    if (((a + (b + (c + d))) * 2.0d0) <= (-0.005d0)) then
        tmp = (d + a) * 2.0d0
    else
        tmp = ((c + a) + d) * 2.0d0
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c, double d) {
	double tmp;
	if (((a + (b + (c + d))) * 2.0) <= -0.005) {
		tmp = (d + a) * 2.0;
	} else {
		tmp = ((c + a) + d) * 2.0;
	}
	return tmp;
}

Python

def code(a, b, c, d):
	tmp = 0
	if ((a + (b + (c + d))) * 2.0) <= -0.005:
		tmp = (d + a) * 2.0
	else:
		tmp = ((c + a) + d) * 2.0
	return tmp

Julia

function code(a, b, c, d)
	tmp = 0.0
	if (Float64(Float64(a + Float64(b + Float64(c + d))) * 2.0) <= -0.005)
		tmp = Float64(Float64(d + a) * 2.0);
	else
		tmp = Float64(Float64(Float64(c + a) + d) * 2.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c, d)
	tmp = 0.0;
	if (((a + (b + (c + d))) * 2.0) <= -0.005)
		tmp = (d + a) * 2.0;
	else
		tmp = ((c + a) + d) * 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_, d_] := If[LessEqual[N[(N[(a + N[(b + N[(c + d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision], -0.005], N[(N[(d + a), $MachinePrecision] * 2.0), $MachinePrecision], N[(N[(N[(c + a), $MachinePrecision] + d), $MachinePrecision] * 2.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (+.f64 a (+.f64 b (+.f64 c d))) #s(literal 2 binary64)) < -0.0050000000000000001

   1. Initial program 93.5%

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

   3. Taylor expanded in b around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 1.6

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

   5. Applied rewrites 1.6%

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

   6. Taylor expanded in b around 0

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

      1. +-commutative N/A

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

      2. associate-+r+ N/A

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

      3. lower-+.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-+.f64 1.6

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

   8. Applied rewrites 1.6%

      \[\leadsto \color{blue}{\left(\left(d + a\right) + c\right)} \cdot 2 \]
   9. Step-by-step derivation

   10. Applied rewrites 1.6%

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

   11. Taylor expanded in c around 0

       \[\leadsto \left(a + \color{blue}{d}\right) \cdot 2 \]
   12. Step-by-step derivation

   13. Applied rewrites 18.0%

       \[\leadsto \left(d + \color{blue}{a}\right) \cdot 2 \]

   if -0.0050000000000000001 < (*.f64 (+.f64 a (+.f64 b (+.f64 c d))) #s(literal 2 binary64))

   1. Initial program 94.5%

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

   3. Taylor expanded in b around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 16.5

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

   5. Applied rewrites 16.5%

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

   6. Taylor expanded in b around 0

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

      1. +-commutative N/A

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

      2. associate-+r+ N/A

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

      3. lower-+.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-+.f64 16.5

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

   8. Applied rewrites 16.5%

      \[\leadsto \color{blue}{\left(\left(d + a\right) + c\right)} \cdot 2 \]
   9. Step-by-step derivation

   10. Applied rewrites 16.5%

       \[\leadsto \left(\left(c + a\right) + \color{blue}{d}\right) \cdot 2 \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 3: 16.9% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\left(a + \left(b + \left(c + d\right)\right)\right) \cdot 2 \leq -0.005:\\ \;\;\;\;\left(d + a\right) \cdot 2\\ \mathbf{else}:\\ \;\;\;\;c + c\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c d)
 :precision binary64
 (if (<= (* (+ a (+ b (+ c d))) 2.0) -0.005) (* (+ d a) 2.0) (+ c c)))

C

double code(double a, double b, double c, double d) {
	double tmp;
	if (((a + (b + (c + d))) * 2.0) <= -0.005) {
		tmp = (d + a) * 2.0;
	} else {
		tmp = c + c;
	}
	return tmp;
}

Fortran

real(8) function code(a, b, c, d)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: d
    real(8) :: tmp
    if (((a + (b + (c + d))) * 2.0d0) <= (-0.005d0)) then
        tmp = (d + a) * 2.0d0
    else
        tmp = c + c
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c, double d) {
	double tmp;
	if (((a + (b + (c + d))) * 2.0) <= -0.005) {
		tmp = (d + a) * 2.0;
	} else {
		tmp = c + c;
	}
	return tmp;
}

Python

def code(a, b, c, d):
	tmp = 0
	if ((a + (b + (c + d))) * 2.0) <= -0.005:
		tmp = (d + a) * 2.0
	else:
		tmp = c + c
	return tmp

Julia

function code(a, b, c, d)
	tmp = 0.0
	if (Float64(Float64(a + Float64(b + Float64(c + d))) * 2.0) <= -0.005)
		tmp = Float64(Float64(d + a) * 2.0);
	else
		tmp = Float64(c + c);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c, d)
	tmp = 0.0;
	if (((a + (b + (c + d))) * 2.0) <= -0.005)
		tmp = (d + a) * 2.0;
	else
		tmp = c + c;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_, d_] := If[LessEqual[N[(N[(a + N[(b + N[(c + d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision], -0.005], N[(N[(d + a), $MachinePrecision] * 2.0), $MachinePrecision], N[(c + c), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (+.f64 a (+.f64 b (+.f64 c d))) #s(literal 2 binary64)) < -0.0050000000000000001

   1. Initial program 93.5%

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

   3. Taylor expanded in b around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 1.6

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

   5. Applied rewrites 1.6%

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

   6. Taylor expanded in b around 0

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

      1. +-commutative N/A

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

      2. associate-+r+ N/A

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

      3. lower-+.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-+.f64 1.6

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

   8. Applied rewrites 1.6%

      \[\leadsto \color{blue}{\left(\left(d + a\right) + c\right)} \cdot 2 \]
   9. Step-by-step derivation

   10. Applied rewrites 1.6%

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

   11. Taylor expanded in c around 0

       \[\leadsto \left(a + \color{blue}{d}\right) \cdot 2 \]
   12. Step-by-step derivation

   13. Applied rewrites 18.0%

       \[\leadsto \left(d + \color{blue}{a}\right) \cdot 2 \]

   if -0.0050000000000000001 < (*.f64 (+.f64 a (+.f64 b (+.f64 c d))) #s(literal 2 binary64))

   1. Initial program 94.5%

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

   3. Taylor expanded in c around inf

      \[\leadsto \color{blue}{2 \cdot c} \]
   4. Step-by-step derivation

      1. lower-*.f64 16.4

         \[\leadsto \color{blue}{2 \cdot c} \]

   5. Applied rewrites 16.4%

      \[\leadsto \color{blue}{2 \cdot c} \]
   6. Step-by-step derivation

   7. Applied rewrites 16.4%

      \[\leadsto c + \color{blue}{c} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 4: 16.3% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\left(a + \left(b + \left(c + d\right)\right)\right) \cdot 2 \leq -0.005:\\ \;\;\;\;b + b\\ \mathbf{else}:\\ \;\;\;\;c + c\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c d)
 :precision binary64
 (if (<= (* (+ a (+ b (+ c d))) 2.0) -0.005) (+ b b) (+ c c)))

C

double code(double a, double b, double c, double d) {
	double tmp;
	if (((a + (b + (c + d))) * 2.0) <= -0.005) {
		tmp = b + b;
	} else {
		tmp = c + c;
	}
	return tmp;
}

Fortran

real(8) function code(a, b, c, d)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: d
    real(8) :: tmp
    if (((a + (b + (c + d))) * 2.0d0) <= (-0.005d0)) then
        tmp = b + b
    else
        tmp = c + c
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c, double d) {
	double tmp;
	if (((a + (b + (c + d))) * 2.0) <= -0.005) {
		tmp = b + b;
	} else {
		tmp = c + c;
	}
	return tmp;
}

Python

def code(a, b, c, d):
	tmp = 0
	if ((a + (b + (c + d))) * 2.0) <= -0.005:
		tmp = b + b
	else:
		tmp = c + c
	return tmp

Julia

function code(a, b, c, d)
	tmp = 0.0
	if (Float64(Float64(a + Float64(b + Float64(c + d))) * 2.0) <= -0.005)
		tmp = Float64(b + b);
	else
		tmp = Float64(c + c);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c, d)
	tmp = 0.0;
	if (((a + (b + (c + d))) * 2.0) <= -0.005)
		tmp = b + b;
	else
		tmp = c + c;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_, d_] := If[LessEqual[N[(N[(a + N[(b + N[(c + d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision], -0.005], N[(b + b), $MachinePrecision], N[(c + c), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (+.f64 a (+.f64 b (+.f64 c d))) #s(literal 2 binary64)) < -0.0050000000000000001

   1. Initial program 93.5%

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

   3. Taylor expanded in b around inf

      \[\leadsto \color{blue}{2 \cdot b} \]
   4. Step-by-step derivation

      1. lower-*.f64 16.0

         \[\leadsto \color{blue}{2 \cdot b} \]

   5. Applied rewrites 16.0%

      \[\leadsto \color{blue}{2 \cdot b} \]
   6. Step-by-step derivation

   7. Applied rewrites 16.0%

      \[\leadsto b + \color{blue}{b} \]

   if -0.0050000000000000001 < (*.f64 (+.f64 a (+.f64 b (+.f64 c d))) #s(literal 2 binary64))

   1. Initial program 94.5%

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

   3. Taylor expanded in c around inf

      \[\leadsto \color{blue}{2 \cdot c} \]
   4. Step-by-step derivation

      1. lower-*.f64 16.4

         \[\leadsto \color{blue}{2 \cdot c} \]

   5. Applied rewrites 16.4%

      \[\leadsto \color{blue}{2 \cdot c} \]
   6. Step-by-step derivation

   7. Applied rewrites 16.4%

      \[\leadsto c + \color{blue}{c} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 5: 94.3% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (a b c d) :precision binary64 (* (+ a (+ b (+ c d))) 2.0))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 94.2%

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

Alternative 6: 6.2% accurate, 3.8× speedup

Math

\[\begin{array}{l} \\ b + b \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 94.2%

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

3. Taylor expanded in b around inf

   \[\leadsto \color{blue}{2 \cdot b} \]
4. Step-by-step derivation

   1. lower-*.f64 6.0

      \[\leadsto \color{blue}{2 \cdot b} \]

5. Applied rewrites 6.0%

   \[\leadsto \color{blue}{2 \cdot b} \]
6. Step-by-step derivation

7. Applied rewrites 6.0%

   \[\leadsto b + \color{blue}{b} \]
8. Add Preprocessing

Developer Target 1: 94.0% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (a b c d) :precision binary64 (+ (* (+ a b) 2.0) (* (+ c d) 2.0)))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2024337 
(FPCore (a b c d)
  :name "Expression, p6"
  :precision binary64
  :pre (and (and (and (and (<= -14.0 a) (<= a -13.0)) (and (<= -3.0 b) (<= b -2.0))) (and (<= 3.0 c) (<= c 3.5))) (and (<= 12.5 d) (<= d 13.5)))

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

  (* (+ a (+ b (+ c d))) 2.0))