Metrics for Logistic function from Lakshay Garg

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

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

Algorithm

1×

Search

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

Compiler

Compiled 12 to 11 computations (8.3% saved)

sample1.7s (66.1%)

Memory

30.1MiB live, 1 832.2MiB allocated; 395ms collecting garbage

Samples

555.0ms	1 619×	2	valid
452.0ms	2 441×	1	valid
252.0ms	4 196×	0	valid

Precisions

Click to see histograms. Total time spent on operations: 983.0ms

ival-exp: 489.0ms (49.8% of total)

adjust: 150.0ms (15.3% of total)

ival-div: 103.0ms (10.5% of total)

ival-mult: 79.0ms (8% of total)

ival-add: 76.0ms (7.7% of total)

ival-sub: 68.0ms (6.9% of total)

exact: 10.0ms (1% of total)

ival-true: 6.0ms (0.6% of total)

ival-assert: 3.0ms (0.3% of total)

Bogosity

explain183.0ms (7.2%)

Memory

8.1MiB live, 201.1MiB allocated; 36ms collecting garbage

FPErrors

Click to see full error table

Ground Truth	Overpredictions	Example	Example	Subexpression
139	0	-	-	`(-.f64 (/.f64 #s(literal 2 binary64) (+.f64 #s(literal 1 binary64) (exp.f64 (*.f64 #s(literal -2 binary64) x)))) #s(literal 1 binary64))`
0	1	(-117.53530214980604)	-	`(exp.f64 (*.f64 #s(literal -2 binary64) x))`
0	0	-	-	`#s(literal 1 binary64)`
0	0	-	-	`(*.f64 #s(literal -2 binary64) x)`
0	0	-	-	`(+.f64 #s(literal 1 binary64) (exp.f64 (*.f64 #s(literal -2 binary64) x)))`
0	0	-	-	`#s(literal -2 binary64)`
0	0	-	-	`#s(literal 2 binary64)`
0	0	-	-	`(/.f64 #s(literal 2 binary64) (+.f64 #s(literal 1 binary64) (exp.f64 (*.f64 #s(literal -2 binary64) x))))`
0	0	-	-	`x`

Explanations

Click to see full explanations table

Operator	Subexpression	Explanation	Count
`-.f64`	`(-.f64 (/.f64 #s(literal 2 binary64) (+.f64 #s(literal 1 binary64) (exp.f64 (*.f64 #s(literal -2 binary64) x)))) #s(literal 1 binary64))`	cancellation	139	0
`exp.f64`	`(exp.f64 (*.f64 #s(literal -2 binary64) x))`	sensitivity	1	0

Confusion

	Predicted +	Predicted -
+	139	0
-	1	116

Precision

0.9928571428571429

Recall

1.0

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	139	0	0
-	1	0	116

Precision?

0.9928571428571429

Recall?

1.0

Freqs

test

number	freq
0	116
1	140

Total Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	1	0	0
-	0	0	0

Precision?

1.0

Recall?

1.0

Samples

40.0ms	98×	2	valid
28.0ms	180×	1	valid
14.0ms	234×	0	valid

Compiler

Compiled 84 to 31 computations (63.1% saved)

Precisions

Click to see histograms. Total time spent on operations: 62.0ms

ival-exp: 28.0ms (45.3% of total)

adjust: 14.0ms (22.7% of total)

ival-div: 6.0ms (9.7% of total)

ival-add: 5.0ms (8.1% of total)

ival-sub: 4.0ms (6.5% of total)

ival-mult: 4.0ms (6.5% of total)

exact: 1.0ms (1.6% of total)

ival-assert: 0.0ms (0% of total)

ival-true: 0.0ms (0% of total)

preprocess127.0ms (5%)

Memory

-9.0MiB live, 90.9MiB allocated; 7ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	11	23
1	23	21
2	54	21
3	168	21
4	720	20
0	9	10
0	9	10
1	12	10
2	16	10
3	27	10
4	76	10
5	372	10
6	3765	10
0	8071	10

Stop Event

1×	saturated
1×	node limit
1×	saturated
1×	node limit

Calls

Call 1

Inputs
(-.f64 (/.f64 #s(literal 2 binary64) (+.f64 #s(literal 1 binary64) (exp.f64 (*.f64 #s(literal -2 binary64) x)))) #s(literal 1 binary64))

Outputs
(-.f64 (/.f64 #s(literal 2 binary64) (+.f64 #s(literal 1 binary64) (exp.f64 (*.f64 #s(literal -2 binary64) x)))) #s(literal 1 binary64))

Compiler

Compiled 10 to 9 computations (10% saved)

eval0.0ms (0%)

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

prune0.0ms (0%)

Memory

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

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	49.3%	(-.f64 (/.f64 #s(literal 2 binary64) (+.f64 #s(literal 1 binary64) (exp.f64 (*.f64 #s(literal -2 binary64) x)))) #s(literal 1 binary64))

Compiler

Compiled 10 to 9 computations (10% saved)

simplify98.0ms (3.9%)

Memory

-2.9MiB live, 43.6MiB allocated; 3ms collecting garbage

Localize:

Found 4 expressions of interest:

New	Metric	Score	Program
cost-diff	0	(exp.f64 (*.f64 #s(literal -2 binary64) x))
cost-diff	0	(+.f64 #s(literal 1 binary64) (exp.f64 (*.f64 #s(literal -2 binary64) x)))
cost-diff	0	(/.f64 #s(literal 2 binary64) (+.f64 #s(literal 1 binary64) (exp.f64 (*.f64 #s(literal -2 binary64) x))))
cost-diff	0	(-.f64 (/.f64 #s(literal 2 binary64) (+.f64 #s(literal 1 binary64) (exp.f64 (*.f64 #s(literal -2 binary64) x)))) #s(literal 1 binary64))

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	9	35
0	9	35
1	12	35
2	16	35
3	27	35
4	76	35
5	372	35
6	3765	35
0	8071	35

Stop Event

1×	saturated
1×	node limit
1×	saturated

Calls

Call 1

Inputs
(-.f64 (/.f64 #s(literal 2 binary64) (+.f64 #s(literal 1 binary64) (exp.f64 (*.f64 #s(literal -2 binary64) x)))) #s(literal 1 binary64))
(/.f64 #s(literal 2 binary64) (+.f64 #s(literal 1 binary64) (exp.f64 (*.f64 #s(literal -2 binary64) x))))
#s(literal 2 binary64)
(+.f64 #s(literal 1 binary64) (exp.f64 (*.f64 #s(literal -2 binary64) x)))
#s(literal 1 binary64)
(exp.f64 (*.f64 #s(literal -2 binary64) x))
(*.f64 #s(literal -2 binary64) x)
#s(literal -2 binary64)
x

Outputs
(-.f64 (/.f64 #s(literal 2 binary64) (+.f64 #s(literal 1 binary64) (exp.f64 (*.f64 #s(literal -2 binary64) x)))) #s(literal 1 binary64))
(/.f64 #s(literal 2 binary64) (+.f64 #s(literal 1 binary64) (exp.f64 (*.f64 #s(literal -2 binary64) x))))
#s(literal 2 binary64)
(+.f64 #s(literal 1 binary64) (exp.f64 (*.f64 #s(literal -2 binary64) x)))
#s(literal 1 binary64)
(exp.f64 (*.f64 #s(literal -2 binary64) x))
(*.f64 #s(literal -2 binary64) x)
#s(literal -2 binary64)
x

localize58.0ms (2.3%)

Memory

-2.4MiB live, 86.0MiB allocated; 14ms collecting garbage

Localize:

Found 4 expressions of interest:

New	Metric	Score
accuracy	0.0	(exp.f64 (*.f64 #s(literal -2 binary64) x))
accuracy	0.00390625	(+.f64 #s(literal 1 binary64) (exp.f64 (*.f64 #s(literal -2 binary64) x)))
accuracy	0.01171875	(/.f64 #s(literal 2 binary64) (+.f64 #s(literal 1 binary64) (exp.f64 (*.f64 #s(literal -2 binary64) x))))
accuracy	32.46659037238725	(-.f64 (/.f64 #s(literal 2 binary64) (+.f64 #s(literal 1 binary64) (exp.f64 (*.f64 #s(literal -2 binary64) x)))) #s(literal 1 binary64))

Samples

24.0ms	90×	1	valid
19.0ms	49×	2	valid
7.0ms	117×	0	valid

Compiler

Compiled 37 to 11 computations (70.3% saved)

Precisions

Click to see histograms. Total time spent on operations: 33.0ms

ival-exp: 15.0ms (46% of total)

ival-div: 6.0ms (18.4% of total)

adjust: 5.0ms (15.3% of total)

ival-sub: 2.0ms (6.1% of total)

ival-add: 2.0ms (6.1% of total)

ival-mult: 2.0ms (6.1% of total)

ival-assert: 0.0ms (0% of total)

ival-true: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

series4.0ms (0.1%)

Memory

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

Counts

4 → 19

Calls

Call 1

Inputs
(-.f64 (/.f64 #s(literal 2 binary64) (+.f64 #s(literal 1 binary64) (exp.f64 (*.f64 #s(literal -2 binary64) x)))) #s(literal 1 binary64))
(/.f64 #s(literal 2 binary64) (+.f64 #s(literal 1 binary64) (exp.f64 (*.f64 #s(literal -2 binary64) x))))
(+.f64 #s(literal 1 binary64) (exp.f64 (*.f64 #s(literal -2 binary64) x)))
(exp.f64 (*.f64 #s(literal -2 binary64) x))

Outputs
x
(* x (+ 1 (* -1/3 (pow x 2))))
(* x (+ 1 (* (pow x 2) (- (* 2/15 (pow x 2)) 1/3))))
(* x (+ 1 (* (pow x 2) (- (* (pow x 2) (+ 2/15 (* -17/315 (pow x 2)))) 1/3))))
1
(+ 1 x)
(+ 1 (* x (+ 1 (* -1/3 (pow x 2)))))
(+ 1 (* x (+ 1 (* (pow x 2) (- (* 2/15 (pow x 2)) 1/3)))))
2
(+ 2 (* -2 x))
(+ 2 (* x (- (* 2 x) 2)))
(+ 2 (* x (- (* x (+ 2 (* -4/3 x))) 2)))
(+ 1 (* -2 x))
(+ 1 (* x (- (* 2 x) 2)))
(+ 1 (* x (- (* x (+ 2 (* -4/3 x))) 2)))
(- (* 2 (/ 1 (+ 1 (exp (* -2 x))))) 1)
(/ 2 (+ 1 (exp (* -2 x))))
(+ 1 (exp (* -2 x)))
(exp (* -2 x))

Calls

3 calls:

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

Time

Variable

Point

Expression

1.0ms

inf

((- (/ 2 (+ 1 (exp (* -2 x)))) 1) (/ 2 (+ 1 (exp (* -2 x)))) (+ 1 (exp (* -2 x))) (exp (* -2 x)))

1.0ms

-inf

((- (/ 2 (+ 1 (exp (* -2 x)))) 1) (/ 2 (+ 1 (exp (* -2 x)))) (+ 1 (exp (* -2 x))) (exp (* -2 x)))

1.0ms

((- (/ 2 (+ 1 (exp (* -2 x)))) 1) (/ 2 (+ 1 (exp (* -2 x)))) (+ 1 (exp (* -2 x))) (exp (* -2 x)))

simplify82.0ms (3.2%)

Memory

-13.2MiB live, 43.6MiB allocated; 29ms collecting garbage

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	49	161
1	146	161
2	444	151
3	1675	151
4	6975	151
0	8507	151

Stop Event

1×	saturated
1×	node limit

Counts

19 → 2

Calls

Call 1

Inputs
x
(* x (+ 1 (* -1/3 (pow x 2))))
(* x (+ 1 (* (pow x 2) (- (* 2/15 (pow x 2)) 1/3))))
(* x (+ 1 (* (pow x 2) (- (* (pow x 2) (+ 2/15 (* -17/315 (pow x 2)))) 1/3))))
1
(+ 1 x)
(+ 1 (* x (+ 1 (* -1/3 (pow x 2)))))
(+ 1 (* x (+ 1 (* (pow x 2) (- (* 2/15 (pow x 2)) 1/3)))))
2
(+ 2 (* -2 x))
(+ 2 (* x (- (* 2 x) 2)))
(+ 2 (* x (- (* x (+ 2 (* -4/3 x))) 2)))
(+ 1 (* -2 x))
(+ 1 (* x (- (* 2 x) 2)))
(+ 1 (* x (- (* x (+ 2 (* -4/3 x))) 2)))
(- (* 2 (/ 1 (+ 1 (exp (* -2 x))))) 1)
(/ 2 (+ 1 (exp (* -2 x))))
(+ 1 (exp (* -2 x)))
(exp (* -2 x))

Outputs
x
(* x (+ 1 (* -1/3 (pow x 2))))
(* x (+ 1 (* (pow x 2) (- (* 2/15 (pow x 2)) 1/3))))
(* x (+ 1 (* (pow x 2) (- (* (pow x 2) (+ 2/15 (* -17/315 (pow x 2)))) 1/3))))
1
#s(literal 1 binary64)
(+ 1 x)
(+ 1 (* x (+ 1 (* -1/3 (pow x 2)))))
(+ 1 (* x (+ 1 (* (pow x 2) (- (* 2/15 (pow x 2)) 1/3)))))
2
#s(literal 2 binary64)
(+ 2 (* -2 x))
(+ 2 (* x (- (* 2 x) 2)))
(+ 2 (* x (- (* x (+ 2 (* -4/3 x))) 2)))
(+ 1 (* -2 x))
(+ 1 (* x (- (* 2 x) 2)))
(+ 1 (* x (- (* x (+ 2 (* -4/3 x))) 2)))
(- (* 2 (/ 1 (+ 1 (exp (* -2 x))))) 1)
(/ 2 (+ 1 (exp (* -2 x))))
(+ 1 (exp (* -2 x)))
(exp (* -2 x))

rewrite24.0ms (0.9%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	9	28
0	9	28
1	13	28
0	27	28

Stop Event

1×	saturated
1×	iter limit
1×	iter limit
1×	unsound
1×	saturated

Counts

4 → 4

Calls

Call 1

Inputs
(-.f64 (/.f64 #s(literal 2 binary64) (+.f64 #s(literal 1 binary64) (exp.f64 (*.f64 #s(literal -2 binary64) x)))) #s(literal 1 binary64))
(/.f64 #s(literal 2 binary64) (+.f64 #s(literal 1 binary64) (exp.f64 (*.f64 #s(literal -2 binary64) x))))
(+.f64 #s(literal 1 binary64) (exp.f64 (*.f64 #s(literal -2 binary64) x)))
(exp.f64 (*.f64 #s(literal -2 binary64) x))

Outputs
(-.f64 (/.f64 #s(literal 2 binary64) (+.f64 #s(literal 1 binary64) (exp.f64 (*.f64 #s(literal -2 binary64) x)))) #s(literal 1 binary64))
(/.f64 #s(literal 2 binary64) (+.f64 #s(literal 1 binary64) (exp.f64 (*.f64 #s(literal -2 binary64) x))))
(+.f64 #s(literal 1 binary64) (exp.f64 (*.f64 #s(literal -2 binary64) x)))
(exp.f64 (*.f64 #s(literal -2 binary64) x))

eval1.0ms (0%)

Memory: 0.8MiB live, 0.8MiB allocated; 0ms collecting garbage
Compiler: Compiled 64 to 21 computations (67.2% saved)

prune1.0ms (0%)

Memory

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

Pruning

2 alts after pruning (1 fresh and 1 done)

	Pruned	Kept	Total
New	5	1	6
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	5	2	7

Accuracy

49.3%

Counts

7 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	49.3%	(-.f64 (/.f64 #s(literal 2 binary64) (+.f64 #s(literal 1 binary64) (exp.f64 (*.f64 #s(literal -2 binary64) x)))) #s(literal 1 binary64))
▶	4.2%	(-.f64 #s(approx (/ 2 (+ 1 (exp (* -2 x)))) #s(literal 1 binary64)) #s(literal 1 binary64))

Status

Accuracy

Program

✓

49.3%

(-.f64 (/.f64 #s(literal 2 binary64) (+.f64 #s(literal 1 binary64) (exp.f64 (*.f64 #s(literal -2 binary64) x)))) #s(literal 1 binary64))

▶

4.2%

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

Compiler

Compiled 22 to 20 computations (9.1% saved)

simplify56.0ms (2.2%)

Memory

-13.5MiB live, 33.0MiB allocated; 4ms collecting garbage

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
cost-diff	0	#s(approx (/ 2 (+ 1 (exp (* -2 x)))) #s(literal 1 binary64))
cost-diff	0	(-.f64 #s(approx (/ 2 (+ 1 (exp (* -2 x)))) #s(literal 1 binary64)) #s(literal 1 binary64))

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	10	23
0	10	23
1	20	23
2	42	23
3	107	23
4	476	23
5	5198	23
0	8281	23

Stop Event

1×	saturated
1×	node limit
1×	saturated

Calls

Call 1

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

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

localize43.0ms (1.7%)

Memory

-11.3MiB live, 34.6MiB allocated; 4ms collecting garbage

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
accuracy	26.52312894652607	#s(approx (/ 2 (+ 1 (exp (* -2 x)))) #s(literal 1 binary64))
accuracy	32.46659037238725	(-.f64 #s(approx (/ 2 (+ 1 (exp (* -2 x)))) #s(literal 1 binary64)) #s(literal 1 binary64))

Samples

15.0ms	49×	2	valid
13.0ms	90×	1	valid
6.0ms	117×	0	valid

Compiler

Compiled 21 to 11 computations (47.6% saved)

Precisions

Click to see histograms. Total time spent on operations: 26.0ms

ival-exp: 12.0ms (45.8% of total)

adjust: 5.0ms (19.1% of total)

ival-div: 3.0ms (11.5% of total)

ival-sub: 2.0ms (7.6% of total)

ival-add: 2.0ms (7.6% of total)

ival-mult: 2.0ms (7.6% of total)

ival-assert: 0.0ms (0% of total)

ival-true: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

series2.0ms (0.1%)

Memory

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

Counts

2 → 10

Calls

Call 1

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

Outputs
x
(* x (+ 1 (* -1/3 (pow x 2))))
(* x (+ 1 (* (pow x 2) (- (* 2/15 (pow x 2)) 1/3))))
(* x (+ 1 (* (pow x 2) (- (* (pow x 2) (+ 2/15 (* -17/315 (pow x 2)))) 1/3))))
1
(+ 1 x)
(+ 1 (* x (+ 1 (* -1/3 (pow x 2)))))
(+ 1 (* x (+ 1 (* (pow x 2) (- (* 2/15 (pow x 2)) 1/3)))))
(- (* 2 (/ 1 (+ 1 (exp (* -2 x))))) 1)
(/ 2 (+ 1 (exp (* -2 x))))

Calls

3 calls:

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

simplify52.0ms (2%)

Memory

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

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	34	96
1	100	96
2	309	86
3	1180	86
4	4672	86
0	8550	86

Stop Event

1×	saturated
1×	node limit

Counts

10 → 1

Calls

Call 1

Inputs
x
(* x (+ 1 (* -1/3 (pow x 2))))
(* x (+ 1 (* (pow x 2) (- (* 2/15 (pow x 2)) 1/3))))
(* x (+ 1 (* (pow x 2) (- (* (pow x 2) (+ 2/15 (* -17/315 (pow x 2)))) 1/3))))
1
(+ 1 x)
(+ 1 (* x (+ 1 (* -1/3 (pow x 2)))))
(+ 1 (* x (+ 1 (* (pow x 2) (- (* 2/15 (pow x 2)) 1/3)))))
(- (* 2 (/ 1 (+ 1 (exp (* -2 x))))) 1)
(/ 2 (+ 1 (exp (* -2 x))))

Outputs
x
(* x (+ 1 (* -1/3 (pow x 2))))
(* x (+ 1 (* (pow x 2) (- (* 2/15 (pow x 2)) 1/3))))
(* x (+ 1 (* (pow x 2) (- (* (pow x 2) (+ 2/15 (* -17/315 (pow x 2)))) 1/3))))
1
#s(literal 1 binary64)
(+ 1 x)
(+ 1 (* x (+ 1 (* -1/3 (pow x 2)))))
(+ 1 (* x (+ 1 (* (pow x 2) (- (* 2/15 (pow x 2)) 1/3)))))
(- (* 2 (/ 1 (+ 1 (exp (* -2 x))))) 1)
(/ 2 (+ 1 (exp (* -2 x))))

rewrite37.0ms (1.5%)

Memory

-27.7MiB live, 18.1MiB allocated; 3ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	10	22
0	10	22
1	37	22
0	260	22

Stop Event

1×	saturated
1×	iter limit
1×	iter limit
1×	unsound
1×	saturated

Counts

2 → 2

Calls

Call 1

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

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

eval0.0ms (0%)

Memory: 0.3MiB live, 0.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 24 to 11 computations (54.2% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

2 alts after pruning (0 fresh and 2 done)

	Pruned	Kept	Total
New	2	0	2
Fresh	0	0	0
Picked	0	1	1
Done	0	1	1
Total	2	2	4

Accuracy

49.3%

Counts

4 → 2

Alt Table

Click to see full alt table

Status

Accuracy

Program

✓

49.3%

(-.f64 (/.f64 #s(literal 2 binary64) (+.f64 #s(literal 1 binary64) (exp.f64 (*.f64 #s(literal -2 binary64) x)))) #s(literal 1 binary64))

✓

4.2%

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

Compiler

Compiled 44 to 38 computations (13.6% saved)

regimes7.0ms (0.3%)

Memory

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

Counts

2 → 1

Calls

Call 1

Inputs

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

(-.f64 (/.f64 #s(literal 2 binary64) (+.f64 #s(literal 1 binary64) (exp.f64 (*.f64 #s(literal -2 binary64) x)))) #s(literal 1 binary64))

Outputs
(-.f64 (/.f64 #s(literal 2 binary64) (+.f64 #s(literal 1 binary64) (exp.f64 (*.f64 #s(literal -2 binary64) x)))) #s(literal 1 binary64))

Calls

6 calls:

1.0ms	(*.f64 #s(literal -2 binary64) x)
1.0ms	x
1.0ms	(-.f64 (/.f64 #s(literal 2 binary64) (+.f64 #s(literal 1 binary64) (exp.f64 (*.f64 #s(literal -2 binary64) x)))) #s(literal 1 binary64))
1.0ms	(/.f64 #s(literal 2 binary64) (+.f64 #s(literal 1 binary64) (exp.f64 (*.f64 #s(literal -2 binary64) x))))
1.0ms	(+.f64 #s(literal 1 binary64) (exp.f64 (*.f64 #s(literal -2 binary64) x)))

Results

Accuracy	Segments	Branch
49.3%	1	`(*.f64 #s(literal -2 binary64) x)`
49.3%	1	`(exp.f64 (*.f64 #s(literal -2 binary64) x))`
49.3%	1	`(+.f64 #s(literal 1 binary64) (exp.f64 (*.f64 #s(literal -2 binary64) x)))`
49.3%	1	`(/.f64 #s(literal 2 binary64) (+.f64 #s(literal 1 binary64) (exp.f64 (*.f64 #s(literal -2 binary64) x))))`
49.3%	1	`(-.f64 (/.f64 #s(literal 2 binary64) (+.f64 #s(literal 1 binary64) (exp.f64 (*.f64 #s(literal -2 binary64) x)))) #s(literal 1 binary64))`
49.3%	1	`x`

Compiler

Compiled 32 to 31 computations (3.1% saved)

regimes6.0ms (0.2%)

Memory

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

Accuracy

Total -0.0b remaining (-0%)

Threshold costs -0b (-0%)

Counts

1 → 1

Calls

Call 1

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

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

Calls

6 calls:

1.0ms	(*.f64 #s(literal -2 binary64) x)
1.0ms	x
1.0ms	(-.f64 (/.f64 #s(literal 2 binary64) (+.f64 #s(literal 1 binary64) (exp.f64 (*.f64 #s(literal -2 binary64) x)))) #s(literal 1 binary64))
1.0ms	(/.f64 #s(literal 2 binary64) (+.f64 #s(literal 1 binary64) (exp.f64 (*.f64 #s(literal -2 binary64) x))))
1.0ms	(+.f64 #s(literal 1 binary64) (exp.f64 (*.f64 #s(literal -2 binary64) x)))

Results

Accuracy	Segments	Branch
4.2%	1	`(*.f64 #s(literal -2 binary64) x)`
4.2%	1	`x`
4.2%	1	`(/.f64 #s(literal 2 binary64) (+.f64 #s(literal 1 binary64) (exp.f64 (*.f64 #s(literal -2 binary64) x))))`
4.2%	1	`(-.f64 (/.f64 #s(literal 2 binary64) (+.f64 #s(literal 1 binary64) (exp.f64 (*.f64 #s(literal -2 binary64) x)))) #s(literal 1 binary64))`
4.2%	1	`(exp.f64 (*.f64 #s(literal -2 binary64) x))`
4.2%	1	`(+.f64 #s(literal 1 binary64) (exp.f64 (*.f64 #s(literal -2 binary64) x)))`

Compiler

Compiled 32 to 31 computations (3.1% saved)

simplify53.0ms (2.1%)

Memory

-22.3MiB live, 25.8MiB allocated; 11ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	15	22
1	28	22
2	54	22
3	136	22
4	560	22
5	5960	22

Stop Event

1×	node limit

Calls

Call 1

Inputs

(-.f64 (/.f64 #s(literal 2 binary64) (+.f64 #s(literal 1 binary64) (exp.f64 (*.f64 #s(literal -2 binary64) x)))) #s(literal 1 binary64))

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

Outputs

(-.f64 (/.f64 #s(literal 2 binary64) (+.f64 #s(literal 1 binary64) (exp.f64 (*.f64 #s(literal -2 binary64) x)))) #s(literal 1 binary64))

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

derivations16.0ms (0.6%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 22 to 18 computations (18.2% saved)

preprocess13.0ms (0.5%)

Memory: 16.3MiB live, 16.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 64 to 54 computations (15.6% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample1.7s (66.1%)

explain183.0ms (7.2%)

preprocess127.0ms (5%)

eval0.0ms (0%)

prune0.0ms (0%)

simplify98.0ms (3.9%)

localize58.0ms (2.3%)

series4.0ms (0.1%)

simplify82.0ms (3.2%)

rewrite24.0ms (0.9%)

eval1.0ms (0%)

prune1.0ms (0%)

simplify56.0ms (2.2%)

localize43.0ms (1.7%)

series2.0ms (0.1%)

simplify52.0ms (2%)

rewrite37.0ms (1.5%)

eval0.0ms (0%)

prune1.0ms (0.1%)

regimes7.0ms (0.3%)

regimes6.0ms (0.2%)

simplify53.0ms (2.1%)

derivations16.0ms (0.6%)

preprocess13.0ms (0.5%)

end0.0ms (0%)

Profiling