Expression 1, p15

Average Error: 0.4 → 0.2

Time: 9.5s

Precision: binary64

Cost: 576

\[\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

\[\left(\left(\left(e + d\right) + c\right) + b\right) + a \]

↓

\[e + \left(a + \left(c + \left(b + d\right)\right)\right) \]

FPCore

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

↓

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

C

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

↓

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

↓

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 + (a + (c + (b + d)))
end function

Java

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

↓

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

Python

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

↓

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

Julia

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

↓

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

MATLAB

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

↓

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

Wolfram

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

↓

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

Target

Original	0.4
Target	0.2
Herbie	0.2

\[\left(d + \left(c + \left(a + b\right)\right)\right) + e \]

Derivation

1. Initial program 0.4

   \[\left(\left(\left(e + d\right) + c\right) + b\right) + a \]

2. Simplified 0.2

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

   [Start] 0.4	\[ \left(\left(\left(e + d\right) + c\right) + b\right) + a \]
   associate-+l+ [=>] 0.3	\[ \color{blue}{\left(\left(e + d\right) + c\right) + \left(b + a\right)} \]
   associate-+l+ [=>] 0.3	\[ \color{blue}{\left(e + \left(d + c\right)\right)} + \left(b + a\right) \]
   associate-+l+ [=>] 0.2	\[ \color{blue}{e + \left(\left(d + c\right) + \left(b + a\right)\right)} \]

3. Taylor expanded in d around 0 0.2

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

4. Simplified 0.2

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

   [Start] 0.2	\[ e + \left(c + \left(a + \left(d + b\right)\right)\right) \]
   +-commutative [=>] 0.2	\[ e + \color{blue}{\left(\left(a + \left(d + b\right)\right) + c\right)} \]
   associate-+r+ [<=] 0.2	\[ e + \color{blue}{\left(a + \left(\left(d + b\right) + c\right)\right)} \]
   +-commutative [<=] 0.2	\[ e + \left(a + \color{blue}{\left(c + \left(d + b\right)\right)}\right) \]
   +-commutative [=>] 0.2	\[ e + \left(a + \left(c + \color{blue}{\left(b + d\right)}\right)\right) \]

5. Final simplification 0.2

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

Alternatives

Alternative 1
Error	0.3
Cost	576

\[a + \left(e + \left(d + \left(c + b\right)\right)\right) \]

Alternative 2
Error	47.6
Cost	448

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

Alternative 3
Error	47.6
Cost	448

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

Alternative 4
Error	49.2
Cost	320

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

Alternative 5
Error	50.5
Cost	192

\[e + d \]

Alternative 6
Error	51.9
Cost	64

\[e \]

Reproduce

herbie shell --seed 2023053 
(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))

  :herbie-target
  (+ (+ d (+ c (+ a b))) e)

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