Metrics for exp2 (problem 3.3.7)

start0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated; 0ms collecting garbage

analyze0.0ms (0%)

Memory

0.3MiB live, 0.3MiB allocated; 0ms collecting garbage

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	50.4%	49.6%	0%	0%	0%	0
100%	50.4%	0%	49.6%	0%	0%	0%	1

Compiler

Compiled 13 to 11 computations (15.4% saved)

sample3.2s (79.1%)

Memory

117.2MiB live, 3 119.5MiB allocated; 701ms collecting garbage

Samples

2.5s	5 825×	2	valid
312.0ms	2 292×	1	valid
7.0ms	139×	0	valid

Precisions

Click to see histograms. Total time spent on operations: 2.6s

ival-exp: 2.1s (82.5% of total)

adjust: 294.0ms (11.5% of total)

ival-sub!: 64.0ms (2.5% of total)

ival-add!: 50.0ms (2% of total)

ival-neg: 39.0ms (1.5% of total)

Bogosity

preprocess52.0ms (1.3%)

Memory

-21.7MiB live, 23.0MiB allocated; 15ms collecting garbage

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	12	25
1	56	24
2	219	18
3	1305	18

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	51.8%	(+.f64 (-.f64 (exp.f64 x) #s(literal 2 binary64)) (exp.f64 (neg.f64 x)))

Symmetry

(abs x)

Compiler

Compiled 14 to 14 computations (0% saved)

series2.0ms (0.1%)

Memory

1.8MiB live, 1.8MiB allocated; 0ms collecting garbage

Counts

7 → 23

Calls

Call 1

Inputs
(+.f64 (-.f64 (exp.f64 x) #s(literal 2 binary64)) (exp.f64 (neg.f64 x)))
(-.f64 (exp.f64 x) #s(literal 2 binary64))
(exp.f64 x)
x
#s(literal 2 binary64)
(exp.f64 (neg.f64 x))
(neg.f64 x)

Outputs
#s(approx (+ (- (exp x) 2) (exp (neg x))) #s(hole binary64 (pow x 2)))
#s(approx (+ (- (exp x) 2) (exp (neg x))) #s(hole binary64 (* (pow x 2) (+ 1 (* 1/12 (pow x 2))))))
#s(approx (+ (- (exp x) 2) (exp (neg x))) #s(hole binary64 (* (pow x 2) (+ 1 (* (pow x 2) (+ 1/12 (* 1/360 (pow x 2))))))))
#s(approx (+ (- (exp x) 2) (exp (neg x))) #s(hole binary64 (* (pow x 2) (+ 1 (* (pow x 2) (+ 1/12 (* (pow x 2) (+ 1/360 (* 1/20160 (pow x 2))))))))))
#s(approx (- (exp x) 2) #s(hole binary64 -1))
#s(approx (- (exp x) 2) #s(hole binary64 (- x 1)))
#s(approx (- (exp x) 2) #s(hole binary64 (- (* x (+ 1 (* 1/2 x))) 1)))
#s(approx (- (exp x) 2) #s(hole binary64 (- (* x (+ 1 (* x (+ 1/2 (* 1/6 x))))) 1)))
#s(approx (exp x) #s(hole binary64 1))
#s(approx (exp x) #s(hole binary64 (+ 1 x)))
#s(approx (exp x) #s(hole binary64 (+ 1 (* x (+ 1 (* 1/2 x))))))
#s(approx (exp x) #s(hole binary64 (+ 1 (* x (+ 1 (* x (+ 1/2 (* 1/6 x))))))))
#s(approx x #s(hole binary64 x))
#s(approx (exp (neg x)) #s(hole binary64 (+ 1 (* -1 x))))
#s(approx (exp (neg x)) #s(hole binary64 (+ 1 (* x (- (* 1/2 x) 1)))))
#s(approx (exp (neg x)) #s(hole binary64 (+ 1 (* x (- (* x (+ 1/2 (* -1/6 x))) 1)))))
#s(approx (neg x) #s(hole binary64 (* -1 x)))
#s(approx (+ (- (exp x) 2) (exp (neg x))) #s(hole binary64 (- (+ (exp x) (exp (neg x))) 2)))
#s(approx (- (exp x) 2) #s(hole binary64 (- (exp x) 2)))
#s(approx (exp x) #s(hole binary64 (exp x)))
#s(approx (exp (neg x)) #s(hole binary64 (exp (neg x))))
#s(approx (+ (- (exp x) 2) (exp (neg x))) #s(hole binary64 (- (+ (exp x) (exp (* -1 x))) 2)))
#s(approx (exp (neg x)) #s(hole binary64 (exp (* -1 x))))

Calls

3 calls:

Time	Variable		Point	Expression
1.0ms	x	@	-inf	((+ (- (exp x) 2) (exp (neg x))) (- (exp x) 2) (exp x) x 2 (exp (neg x)) (neg x))
1.0ms	x	@	0	((+ (- (exp x) 2) (exp (neg x))) (- (exp x) 2) (exp x) x 2 (exp (neg x)) (neg x))
1.0ms	x	@	inf	((+ (- (exp x) 2) (exp (neg x))) (- (exp x) 2) (exp x) x 2 (exp (neg x)) (neg x))

Time

Variable

Point

Expression

1.0ms

-inf

((+ (- (exp x) 2) (exp (neg x))) (- (exp x) 2) (exp x) x 2 (exp (neg x)) (neg x))

1.0ms

((+ (- (exp x) 2) (exp (neg x))) (- (exp x) 2) (exp x) x 2 (exp (neg x)) (neg x))

1.0ms

inf

((+ (- (exp x) 2) (exp (neg x))) (- (exp x) 2) (exp x) x 2 (exp (neg x)) (neg x))

rewrite270.0ms (6.6%)

Memory

-44.5MiB live, 98.9MiB allocated; 156ms collecting garbage

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	89	307
0	97	299
1	648	284
2	4068	278

Stop Event

1×	iter-limit
1×	unsound
1×	node-limit
1×	iter-limit

Counts

30 → 17

Calls

Call 1

Inputs
(+.f64 (-.f64 (exp.f64 x) #s(literal 2 binary64)) (exp.f64 (neg.f64 x)))
(-.f64 (exp.f64 x) #s(literal 2 binary64))
(exp.f64 x)
x
#s(literal 2 binary64)
(exp.f64 (neg.f64 x))
(neg.f64 x)
#s(approx (+ (- (exp x) 2) (exp (neg x))) #s(hole binary64 (pow x 2)))
#s(approx (+ (- (exp x) 2) (exp (neg x))) #s(hole binary64 (* (pow x 2) (+ 1 (* 1/12 (pow x 2))))))
#s(approx (+ (- (exp x) 2) (exp (neg x))) #s(hole binary64 (* (pow x 2) (+ 1 (* (pow x 2) (+ 1/12 (* 1/360 (pow x 2))))))))
#s(approx (+ (- (exp x) 2) (exp (neg x))) #s(hole binary64 (* (pow x 2) (+ 1 (* (pow x 2) (+ 1/12 (* (pow x 2) (+ 1/360 (* 1/20160 (pow x 2))))))))))
#s(approx (- (exp x) 2) #s(hole binary64 -1))
#s(approx (- (exp x) 2) #s(hole binary64 (- x 1)))
#s(approx (- (exp x) 2) #s(hole binary64 (- (* x (+ 1 (* 1/2 x))) 1)))
#s(approx (- (exp x) 2) #s(hole binary64 (- (* x (+ 1 (* x (+ 1/2 (* 1/6 x))))) 1)))
#s(approx (exp x) #s(hole binary64 1))
#s(approx (exp x) #s(hole binary64 (+ 1 x)))
#s(approx (exp x) #s(hole binary64 (+ 1 (* x (+ 1 (* 1/2 x))))))
#s(approx (exp x) #s(hole binary64 (+ 1 (* x (+ 1 (* x (+ 1/2 (* 1/6 x))))))))
#s(approx x #s(hole binary64 x))
#s(approx (exp (neg x)) #s(hole binary64 (+ 1 (* -1 x))))
#s(approx (exp (neg x)) #s(hole binary64 (+ 1 (* x (- (* 1/2 x) 1)))))
#s(approx (exp (neg x)) #s(hole binary64 (+ 1 (* x (- (* x (+ 1/2 (* -1/6 x))) 1)))))
#s(approx (neg x) #s(hole binary64 (* -1 x)))
#s(approx (+ (- (exp x) 2) (exp (neg x))) #s(hole binary64 (- (+ (exp x) (exp (neg x))) 2)))
#s(approx (- (exp x) 2) #s(hole binary64 (- (exp x) 2)))
#s(approx (exp x) #s(hole binary64 (exp x)))
#s(approx (exp (neg x)) #s(hole binary64 (exp (neg x))))
#s(approx (+ (- (exp x) 2) (exp (neg x))) #s(hole binary64 (- (+ (exp x) (exp (* -1 x))) 2)))
#s(approx (exp (neg x)) #s(hole binary64 (exp (* -1 x))))

Outputs
(+.f64 (-.f64 (exp.f64 x) #s(literal 2 binary64)) (exp.f64 (neg.f64 x)))
(-.f64 (exp.f64 x) #s(literal 2 binary64))
(exp.f64 x)
x
#s(literal 2 binary64)
(exp.f64 (neg.f64 x))
(neg.f64 x)
#s(approx (- (exp x) 2) #s(literal -1 binary64))
#s(approx (exp x) #s(literal 1 binary64))
#s(approx x x)
#s(approx (neg x) (neg.f64 x))
#s(approx (+ (- (exp x) 2) (exp (neg x))) (+.f64 (-.f64 (exp.f64 x) #s(literal 2 binary64)) (exp.f64 (neg.f64 x))))
#s(approx (- (exp x) 2) (-.f64 (exp.f64 x) #s(literal 2 binary64)))
#s(approx (exp x) (exp.f64 x))
#s(approx (exp (neg x)) (exp.f64 (neg.f64 x)))
#s(approx (+ (- (exp x) 2) (exp (neg x))) (+.f64 (-.f64 (exp.f64 x) #s(literal 2 binary64)) (exp.f64 (neg.f64 x))))
#s(approx (exp (neg x)) (exp.f64 (neg.f64 x)))

eval1.0ms (0%)

Memory: 1.4MiB live, 1.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 57 to 37 computations (35.1% saved)

prune1.0ms (0%)

Memory

1.5MiB live, 1.5MiB allocated; 0ms collecting garbage

Pruning

2 alts after pruning (1 fresh and 1 done)

	Pruned	Kept	Total
New	7	1	8
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	7	2	9

Accuracy

52.0%

Counts

9 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	51.8%	(+.f64 (-.f64 (exp.f64 x) #s(literal 2 binary64)) (exp.f64 (neg.f64 x)))
▶	50.0%	(+.f64 #s(approx (- (exp x) 2) #s(literal -1 binary64)) (exp.f64 (neg.f64 x)))

Compiler

Compiled 16 to 16 computations (0% saved)

series1.0ms (0%)

Memory

2.4MiB live, 2.4MiB allocated; 0ms collecting garbage

Counts

6 → 19

Calls

Call 1

Inputs
(+.f64 #s(approx (- (exp x) 2) #s(literal -1 binary64)) (exp.f64 (neg.f64 x)))
#s(approx (- (exp x) 2) #s(literal -1 binary64))
#s(literal -1 binary64)
(exp.f64 (neg.f64 x))
(neg.f64 x)
x

Outputs
#s(approx (+ (- (exp x) 2) (exp (neg x))) #s(hole binary64 (pow x 2)))
#s(approx (+ (- (exp x) 2) (exp (neg x))) #s(hole binary64 (* (pow x 2) (+ 1 (* 1/12 (pow x 2))))))
#s(approx (+ (- (exp x) 2) (exp (neg x))) #s(hole binary64 (* (pow x 2) (+ 1 (* (pow x 2) (+ 1/12 (* 1/360 (pow x 2))))))))
#s(approx (+ (- (exp x) 2) (exp (neg x))) #s(hole binary64 (* (pow x 2) (+ 1 (* (pow x 2) (+ 1/12 (* (pow x 2) (+ 1/360 (* 1/20160 (pow x 2))))))))))
#s(approx (- (exp x) 2) #s(hole binary64 -1))
#s(approx (- (exp x) 2) #s(hole binary64 (- x 1)))
#s(approx (- (exp x) 2) #s(hole binary64 (- (* x (+ 1 (* 1/2 x))) 1)))
#s(approx (- (exp x) 2) #s(hole binary64 (- (* x (+ 1 (* x (+ 1/2 (* 1/6 x))))) 1)))
#s(approx (exp (neg x)) #s(hole binary64 1))
#s(approx (exp (neg x)) #s(hole binary64 (+ 1 (* -1 x))))
#s(approx (exp (neg x)) #s(hole binary64 (+ 1 (* x (- (* 1/2 x) 1)))))
#s(approx (exp (neg x)) #s(hole binary64 (+ 1 (* x (- (* x (+ 1/2 (* -1/6 x))) 1)))))
#s(approx (neg x) #s(hole binary64 (* -1 x)))
#s(approx x #s(hole binary64 x))
#s(approx (+ (- (exp x) 2) (exp (neg x))) #s(hole binary64 (- (+ (exp x) (exp (neg x))) 2)))
#s(approx (- (exp x) 2) #s(hole binary64 (- (exp x) 2)))
#s(approx (exp (neg x)) #s(hole binary64 (exp (neg x))))
#s(approx (+ (- (exp x) 2) (exp (neg x))) #s(hole binary64 (- (+ (exp x) (exp (* -1 x))) 2)))
#s(approx (exp (neg x)) #s(hole binary64 (exp (* -1 x))))

Calls

3 calls:

Time	Variable		Point	Expression
0.0ms	x	@	-inf	((+ (- (exp x) 2) (exp (neg x))) (- (exp x) 2) -1 (exp (neg x)) (neg x) x)
0.0ms	x	@	inf	((+ (- (exp x) 2) (exp (neg x))) (- (exp x) 2) -1 (exp (neg x)) (neg x) x)
0.0ms	x	@	0	((+ (- (exp x) 2) (exp (neg x))) (- (exp x) 2) -1 (exp (neg x)) (neg x) x)

Time

Variable

Point

Expression

0.0ms

-inf

((+ (- (exp x) 2) (exp (neg x))) (- (exp x) 2) -1 (exp (neg x)) (neg x) x)

0.0ms

inf

((+ (- (exp x) 2) (exp (neg x))) (- (exp x) 2) -1 (exp (neg x)) (neg x) x)

0.0ms

((+ (- (exp x) 2) (exp (neg x))) (- (exp x) 2) -1 (exp (neg x)) (neg x) x)

rewrite167.0ms (4.1%)

Memory

15.7MiB live, 62.2MiB allocated; 3ms collecting garbage

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	80	271
0	85	263
1	610	250
2	3885	244

Stop Event

1×	iter-limit
1×	unsound
1×	node-limit
1×	iter-limit

Counts

25 → 12

Calls

Call 1

Inputs
(+.f64 #s(approx (- (exp x) 2) #s(literal -1 binary64)) (exp.f64 (neg.f64 x)))
#s(approx (- (exp x) 2) #s(literal -1 binary64))
#s(literal -1 binary64)
(exp.f64 (neg.f64 x))
(neg.f64 x)
x
#s(approx (+ (- (exp x) 2) (exp (neg x))) #s(hole binary64 (pow x 2)))
#s(approx (+ (- (exp x) 2) (exp (neg x))) #s(hole binary64 (* (pow x 2) (+ 1 (* 1/12 (pow x 2))))))
#s(approx (+ (- (exp x) 2) (exp (neg x))) #s(hole binary64 (* (pow x 2) (+ 1 (* (pow x 2) (+ 1/12 (* 1/360 (pow x 2))))))))
#s(approx (+ (- (exp x) 2) (exp (neg x))) #s(hole binary64 (* (pow x 2) (+ 1 (* (pow x 2) (+ 1/12 (* (pow x 2) (+ 1/360 (* 1/20160 (pow x 2))))))))))
#s(approx (- (exp x) 2) #s(hole binary64 -1))
#s(approx (- (exp x) 2) #s(hole binary64 (- x 1)))
#s(approx (- (exp x) 2) #s(hole binary64 (- (* x (+ 1 (* 1/2 x))) 1)))
#s(approx (- (exp x) 2) #s(hole binary64 (- (* x (+ 1 (* x (+ 1/2 (* 1/6 x))))) 1)))
#s(approx (exp (neg x)) #s(hole binary64 1))
#s(approx (exp (neg x)) #s(hole binary64 (+ 1 (* -1 x))))
#s(approx (exp (neg x)) #s(hole binary64 (+ 1 (* x (- (* 1/2 x) 1)))))
#s(approx (exp (neg x)) #s(hole binary64 (+ 1 (* x (- (* x (+ 1/2 (* -1/6 x))) 1)))))
#s(approx (neg x) #s(hole binary64 (* -1 x)))
#s(approx x #s(hole binary64 x))
#s(approx (+ (- (exp x) 2) (exp (neg x))) #s(hole binary64 (- (+ (exp x) (exp (neg x))) 2)))
#s(approx (- (exp x) 2) #s(hole binary64 (- (exp x) 2)))
#s(approx (exp (neg x)) #s(hole binary64 (exp (neg x))))
#s(approx (+ (- (exp x) 2) (exp (neg x))) #s(hole binary64 (- (+ (exp x) (exp (* -1 x))) 2)))
#s(approx (exp (neg x)) #s(hole binary64 (exp (* -1 x))))

Outputs
(+.f64 #s(approx (- (exp x) 2) #s(literal -1 binary64)) (exp.f64 (neg.f64 x)))
#s(approx (- (exp x) 2) #s(literal -1 binary64))
#s(literal -1 binary64)
(exp.f64 (neg.f64 x))
(neg.f64 x)
x
#s(approx (- (exp x) 2) #s(literal -1 binary64))
#s(approx (exp (neg x)) #s(literal 1 binary64))
#s(approx (neg x) (neg.f64 x))
#s(approx x x)
#s(approx (exp (neg x)) (exp.f64 (neg.f64 x)))
#s(approx (exp (neg x)) (exp.f64 (neg.f64 x)))

eval0.0ms (0%)

Memory: 0.4MiB live, 0.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 26 to 22 computations (15.4% saved)

prune1.0ms (0%)

Memory

1.0MiB live, 1.0MiB allocated; 0ms collecting garbage

Pruning

3 alts after pruning (1 fresh and 2 done)

	Pruned	Kept	Total
New	3	1	4
Fresh	0	0	0
Picked	0	1	1
Done	0	1	1
Total	3	3	6

Accuracy

52.0%

Counts

6 → 3

Alt Table

Click to see full alt table

Status

Accuracy

Program

✓

51.8%

(+.f64 (-.f64 (exp.f64 x) #s(literal 2 binary64)) (exp.f64 (neg.f64 x)))

✓

50.0%

(+.f64 #s(approx (- (exp x) 2) #s(literal -1 binary64)) (exp.f64 (neg.f64 x)))

▶

50.1%

(+.f64 #s(approx (- (exp x) 2) #s(literal -1 binary64)) #s(approx (exp (neg x)) #s(literal 1 binary64)))

Compiler

Compiled 27 to 27 computations (0% saved)

series1.0ms (0%)

Memory

0.6MiB live, 0.6MiB allocated; 0ms collecting garbage

Counts

5 → 17

Calls

Call 1

Inputs
(+.f64 #s(approx (- (exp x) 2) #s(literal -1 binary64)) #s(approx (exp (neg x)) #s(literal 1 binary64)))
#s(approx (- (exp x) 2) #s(literal -1 binary64))
#s(literal -1 binary64)
#s(approx (exp (neg x)) #s(literal 1 binary64))
#s(literal 1 binary64)

Outputs
#s(approx (+ (- (exp x) 2) (exp (neg x))) #s(hole binary64 (pow x 2)))
#s(approx (+ (- (exp x) 2) (exp (neg x))) #s(hole binary64 (* (pow x 2) (+ 1 (* 1/12 (pow x 2))))))
#s(approx (+ (- (exp x) 2) (exp (neg x))) #s(hole binary64 (* (pow x 2) (+ 1 (* (pow x 2) (+ 1/12 (* 1/360 (pow x 2))))))))
#s(approx (+ (- (exp x) 2) (exp (neg x))) #s(hole binary64 (* (pow x 2) (+ 1 (* (pow x 2) (+ 1/12 (* (pow x 2) (+ 1/360 (* 1/20160 (pow x 2))))))))))
#s(approx (- (exp x) 2) #s(hole binary64 -1))
#s(approx (- (exp x) 2) #s(hole binary64 (- x 1)))
#s(approx (- (exp x) 2) #s(hole binary64 (- (* x (+ 1 (* 1/2 x))) 1)))
#s(approx (- (exp x) 2) #s(hole binary64 (- (* x (+ 1 (* x (+ 1/2 (* 1/6 x))))) 1)))
#s(approx (exp (neg x)) #s(hole binary64 1))
#s(approx (exp (neg x)) #s(hole binary64 (+ 1 (* -1 x))))
#s(approx (exp (neg x)) #s(hole binary64 (+ 1 (* x (- (* 1/2 x) 1)))))
#s(approx (exp (neg x)) #s(hole binary64 (+ 1 (* x (- (* x (+ 1/2 (* -1/6 x))) 1)))))
#s(approx (+ (- (exp x) 2) (exp (neg x))) #s(hole binary64 (- (+ (exp x) (exp (neg x))) 2)))
#s(approx (- (exp x) 2) #s(hole binary64 (- (exp x) 2)))
#s(approx (exp (neg x)) #s(hole binary64 (exp (neg x))))
#s(approx (+ (- (exp x) 2) (exp (neg x))) #s(hole binary64 (- (+ (exp x) (exp (* -1 x))) 2)))
#s(approx (exp (neg x)) #s(hole binary64 (exp (* -1 x))))

Calls

3 calls:

Time	Variable		Point	Expression
0.0ms	x	@	0	((+ (- (exp x) 2) (exp (neg x))) (- (exp x) 2) -1 (exp (neg x)) 1)
0.0ms	x	@	inf	((+ (- (exp x) 2) (exp (neg x))) (- (exp x) 2) -1 (exp (neg x)) 1)
0.0ms	x	@	-inf	((+ (- (exp x) 2) (exp (neg x))) (- (exp x) 2) -1 (exp (neg x)) 1)

Time

Variable

Point

Expression

0.0ms

((+ (- (exp x) 2) (exp (neg x))) (- (exp x) 2) -1 (exp (neg x)) 1)

0.0ms

inf

((+ (- (exp x) 2) (exp (neg x))) (- (exp x) 2) -1 (exp (neg x)) 1)

0.0ms

-inf

((+ (- (exp x) 2) (exp (neg x))) (- (exp x) 2) -1 (exp (neg x)) 1)

rewrite224.0ms (5.5%)

Memory

-31.0MiB live, 155.9MiB allocated; 17ms collecting garbage

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	76	264
0	77	257
1	604	244
2	3893	238

Stop Event

1×	iter-limit
1×	unsound
1×	node-limit
1×	iter-limit

Counts

22 → 7

Calls

Call 1

Inputs
(+.f64 #s(approx (- (exp x) 2) #s(literal -1 binary64)) #s(approx (exp (neg x)) #s(literal 1 binary64)))
#s(approx (- (exp x) 2) #s(literal -1 binary64))
#s(literal -1 binary64)
#s(approx (exp (neg x)) #s(literal 1 binary64))
#s(literal 1 binary64)
#s(approx (+ (- (exp x) 2) (exp (neg x))) #s(hole binary64 (pow x 2)))
#s(approx (+ (- (exp x) 2) (exp (neg x))) #s(hole binary64 (* (pow x 2) (+ 1 (* 1/12 (pow x 2))))))
#s(approx (+ (- (exp x) 2) (exp (neg x))) #s(hole binary64 (* (pow x 2) (+ 1 (* (pow x 2) (+ 1/12 (* 1/360 (pow x 2))))))))
#s(approx (+ (- (exp x) 2) (exp (neg x))) #s(hole binary64 (* (pow x 2) (+ 1 (* (pow x 2) (+ 1/12 (* (pow x 2) (+ 1/360 (* 1/20160 (pow x 2))))))))))
#s(approx (- (exp x) 2) #s(hole binary64 -1))
#s(approx (- (exp x) 2) #s(hole binary64 (- x 1)))
#s(approx (- (exp x) 2) #s(hole binary64 (- (* x (+ 1 (* 1/2 x))) 1)))
#s(approx (- (exp x) 2) #s(hole binary64 (- (* x (+ 1 (* x (+ 1/2 (* 1/6 x))))) 1)))
#s(approx (exp (neg x)) #s(hole binary64 1))
#s(approx (exp (neg x)) #s(hole binary64 (+ 1 (* -1 x))))
#s(approx (exp (neg x)) #s(hole binary64 (+ 1 (* x (- (* 1/2 x) 1)))))
#s(approx (exp (neg x)) #s(hole binary64 (+ 1 (* x (- (* x (+ 1/2 (* -1/6 x))) 1)))))
#s(approx (+ (- (exp x) 2) (exp (neg x))) #s(hole binary64 (- (+ (exp x) (exp (neg x))) 2)))
#s(approx (- (exp x) 2) #s(hole binary64 (- (exp x) 2)))
#s(approx (exp (neg x)) #s(hole binary64 (exp (neg x))))
#s(approx (+ (- (exp x) 2) (exp (neg x))) #s(hole binary64 (- (+ (exp x) (exp (* -1 x))) 2)))
#s(approx (exp (neg x)) #s(hole binary64 (exp (* -1 x))))

Outputs
(+.f64 #s(approx (- (exp x) 2) #s(literal -1 binary64)) #s(approx (exp (neg x)) #s(literal 1 binary64)))
#s(approx (- (exp x) 2) #s(literal -1 binary64))
#s(literal -1 binary64)
#s(approx (exp (neg x)) #s(literal 1 binary64))
#s(literal 1 binary64)
#s(approx (- (exp x) 2) #s(literal -1 binary64))
#s(approx (exp (neg x)) #s(literal 1 binary64))

eval0.0ms (0%)

Memory: 0.1MiB live, 0.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 0 to 1 computations (-∞% saved)

prune1.0ms (0%)

Memory

2.0MiB live, 2.0MiB allocated; 0ms collecting garbage

Pruning

3 alts after pruning (0 fresh and 3 done)

	Kept	Total
New	0	0
Fresh	0	0
Picked	1	1
Done	2	2
Total	3	3

Accuracy

52.0%

Counts

3 → 3

Alt Table

Click to see full alt table

Status

Accuracy

Program

✓

51.8%

(+.f64 (-.f64 (exp.f64 x) #s(literal 2 binary64)) (exp.f64 (neg.f64 x)))

✓

50.0%

(+.f64 #s(approx (- (exp x) 2) #s(literal -1 binary64)) (exp.f64 (neg.f64 x)))

✓

50.1%

(+.f64 #s(approx (- (exp x) 2) #s(literal -1 binary64)) #s(approx (exp (neg x)) #s(literal 1 binary64)))

Compiler

Compiled 45 to 45 computations (0% saved)

regimes3.0ms (0.1%)

Memory

5.5MiB live, 5.5MiB allocated; 0ms collecting garbage

Counts

3 → 1

Calls

Call 1

Inputs

(+.f64 #s(approx (- (exp x) 2) #s(literal -1 binary64)) #s(approx (exp (neg x)) #s(literal 1 binary64)))

(+.f64 #s(approx (- (exp x) 2) #s(literal -1 binary64)) (exp.f64 (neg.f64 x)))

(+.f64 (-.f64 (exp.f64 x) #s(literal 2 binary64)) (exp.f64 (neg.f64 x)))

Outputs
(+.f64 (-.f64 (exp.f64 x) #s(literal 2 binary64)) (exp.f64 (neg.f64 x)))

Calls

2 calls:

1.0ms	x
1.0ms	(+.f64 (-.f64 (exp.f64 x) #s(literal 2 binary64)) (exp.f64 (neg.f64 x)))

Results

Accuracy	Segments	Branch
51.8%	1	`(+.f64 (-.f64 (exp.f64 x) #s(literal 2 binary64)) (exp.f64 (neg.f64 x)))`
51.8%	1	`x`

Compiler

Compiled 8 to 8 computations (0% saved)

regimes2.0ms (0.1%)

Memory

4.8MiB live, 4.8MiB allocated; 0ms collecting garbage

Accuracy

Total -0.1b remaining (-0.2%)

Threshold costs -0.1b (-0.2%)

Counts

2 → 1

Calls

Call 1

Inputs
(+.f64 #s(approx (- (exp x) 2) #s(literal -1 binary64)) #s(approx (exp (neg x)) #s(literal 1 binary64)))
(+.f64 #s(approx (- (exp x) 2) #s(literal -1 binary64)) (exp.f64 (neg.f64 x)))

Outputs
(+.f64 #s(approx (- (exp x) 2) #s(literal -1 binary64)) #s(approx (exp (neg x)) #s(literal 1 binary64)))

Calls

2 calls:

1.0ms	x
1.0ms	(+.f64 (-.f64 (exp.f64 x) #s(literal 2 binary64)) (exp.f64 (neg.f64 x)))

Results

Accuracy	Segments	Branch
50.1%	1	`x`
50.1%	1	`(+.f64 (-.f64 (exp.f64 x) #s(literal 2 binary64)) (exp.f64 (neg.f64 x)))`

Compiler

Compiled 8 to 8 computations (0% saved)

derivations23.0ms (0.6%)

Memory

8.0MiB live, 8.0MiB allocated; 0ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 17 to 17 computations (0% saved)

preprocess99.0ms (2.4%)

Memory: -23.3MiB live, 22.6MiB allocated; 5ms collecting garbage
Remove: (abs x)
Compiler: Compiled 70 to 67 computations (4.3% saved)

end0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated; 0ms collecting garbage

start0.0ms (0%)

analyze0.0ms (0%)

sample3.2s (79.1%)

preprocess52.0ms (1.3%)

series2.0ms (0.1%)

rewrite270.0ms (6.6%)

eval1.0ms (0%)

prune1.0ms (0%)

series1.0ms (0%)

rewrite167.0ms (4.1%)

eval0.0ms (0%)

prune1.0ms (0%)

series1.0ms (0%)

rewrite224.0ms (5.5%)

eval0.0ms (0%)

prune1.0ms (0%)

regimes3.0ms (0.1%)

regimes2.0ms (0.1%)

derivations23.0ms (0.6%)

preprocess99.0ms (2.4%)

end0.0ms (0%)

Profiling