Metrics for Logistic function

analyze27.0ms (0.3%)

Memory

-6.8MiB live, 9.0MiB allocated

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	24.7%	75.3%	0%	0%	0%	0
0%	0%	24.7%	75.3%	0%	0%	0%	1
0%	0%	24.7%	75.3%	0%	0%	0%	2
50%	12.4%	12.4%	75.3%	0%	0%	0%	3
50%	12.4%	12.4%	75.3%	0%	0%	0%	4
75%	18.5%	6.2%	75.3%	0%	0%	0%	5
75%	18.5%	6.2%	75.3%	0%	0%	0%	6
87.5%	21.6%	3.1%	75.3%	0%	0%	0%	7
87.5%	21.6%	3.1%	75.3%	0%	0%	0%	8
93.7%	23.2%	1.5%	75.3%	0%	0%	0%	9
93.7%	23.2%	1.5%	75.3%	0%	0%	0%	10
96.9%	23.9%	0.8%	75.3%	0%	0%	0%	11
96.9%	23.9%	0.8%	75.3%	0%	0%	0%	12

Compiler

Compiled 23 to 19 computations (17.4% saved)

sample8.1s (98.5%)

Memory

27.9MiB live, 1 655.5MiB allocated

Samples

1.5s	8 123×	valid-sollya
545.0ms	8 123×	valid-baseline
482.0ms	8 123×	valid-rival
8.0ms	133×	valid-rival+baseline-zero

Precisions

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

ival-div: 119.0ms (40.4% of total)

ival-exp: 67.0ms (22.7% of total)

ival-neg: 47.0ms (15.9% of total)

ival-add: 46.0ms (15.6% of total)

ival-true: 9.0ms (3.1% of total)

ival-assert: 4.0ms (1.4% of total)

...in/eval/compile.rkt:76:19: 3.0ms (1% of total)

Precisions

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

ival-div: 124.0ms (42% of total)

ival-exp: 68.0ms (23% of total)

ival-neg: 45.0ms (15.3% of total)

ival-add: 44.0ms (14.9% of total)

const: 13.0ms (4.4% of total)

Bogosity

preprocess78.0ms (0.9%)

Memory

-9.7MiB live, 21.0MiB allocated

Algorithm

1×	egg-herbie

Rules

714×	`fma-define`
204×	`exp-prod`
120×	`times-frac`
116×	`exp-sum`
98×	`associate-/r*`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	30	215
1	65	215
2	129	215
3	287	215
4	589	215
5	995	215
6	1153	215
7	1204	215
8	1297	215
9	1302	215
10	1305	215

Stop Event

1×

saturated

Calls

Call 1

Inputs
(/.f32 #s(literal 1 binary32) (+.f32 #s(literal 1 binary32) (exp.f32 (/.f32 (neg.f32 x) s))))
(/.f32 #s(literal 1 binary32) (+.f32 #s(literal 1 binary32) (exp.f32 (/.f32 (neg.f32 x) s))))
(/.f32 #s(literal 1 binary32) (+.f32 #s(literal 1 binary32) (exp.f32 (/.f32 (neg.f32 (neg.f32 x)) s))))
(/.f32 #s(literal 1 binary32) (+.f32 #s(literal 1 binary32) (exp.f32 (/.f32 (neg.f32 x) (neg.f32 s)))))
(neg.f32 (/.f32 #s(literal 1 binary32) (+.f32 #s(literal 1 binary32) (exp.f32 (/.f32 (neg.f32 (neg.f32 x)) s)))))
(neg.f32 (/.f32 #s(literal 1 binary32) (+.f32 #s(literal 1 binary32) (exp.f32 (/.f32 (neg.f32 x) (neg.f32 s))))))
(/.f32 #s(literal 1 binary32) (+.f32 #s(literal 1 binary32) (exp.f32 (/.f32 (neg.f32 s) x))))

Outputs
(/.f32 #s(literal 1 binary32) (+.f32 #s(literal 1 binary32) (exp.f32 (/.f32 (neg.f32 x) s))))
(/.f32 #s(literal 1 binary32) (+.f32 #s(literal 1 binary32) (exp.f32 (/.f32 x (neg.f32 s)))))
(/.f32 #s(literal 1 binary32) (+.f32 #s(literal 1 binary32) (exp.f32 (/.f32 (neg.f32 x) s))))
(/.f32 #s(literal 1 binary32) (+.f32 #s(literal 1 binary32) (exp.f32 (/.f32 x (neg.f32 s)))))
(/.f32 #s(literal 1 binary32) (+.f32 #s(literal 1 binary32) (exp.f32 (/.f32 (neg.f32 (neg.f32 x)) s))))
(/.f32 #s(literal 1 binary32) (+.f32 #s(literal 1 binary32) (exp.f32 (/.f32 x s))))
(/.f32 #s(literal 1 binary32) (+.f32 #s(literal 1 binary32) (exp.f32 (/.f32 (neg.f32 x) (neg.f32 s)))))
(/.f32 #s(literal 1 binary32) (+.f32 #s(literal 1 binary32) (exp.f32 (/.f32 x s))))
(neg.f32 (/.f32 #s(literal 1 binary32) (+.f32 #s(literal 1 binary32) (exp.f32 (/.f32 (neg.f32 (neg.f32 x)) s)))))
(/.f32 #s(literal -1 binary32) (+.f32 #s(literal 1 binary32) (exp.f32 (/.f32 x s))))
(/.f32 #s(literal 1 binary32) (-.f32 #s(literal -1 binary32) (exp.f32 (/.f32 x s))))
(neg.f32 (/.f32 #s(literal 1 binary32) (+.f32 #s(literal 1 binary32) (exp.f32 (/.f32 (neg.f32 x) (neg.f32 s))))))
(/.f32 #s(literal -1 binary32) (+.f32 #s(literal 1 binary32) (exp.f32 (/.f32 x s))))
(/.f32 #s(literal 1 binary32) (-.f32 #s(literal -1 binary32) (exp.f32 (/.f32 x s))))
(/.f32 #s(literal 1 binary32) (+.f32 #s(literal 1 binary32) (exp.f32 (/.f32 (neg.f32 s) x))))
(/.f32 #s(literal 1 binary32) (+.f32 #s(literal 1 binary32) (exp.f32 (/.f32 s (neg.f32 x)))))

Compiler

Compiled 11 to 8 computations (27.3% saved)

eval0.0ms (0%)

Memory: 0.2MiB live, 0.2MiB allocated
Compiler: Compiled 2 to 2 computations (0% saved)

prune1.0ms (0%)

Memory

0.9MiB live, 0.9MiB allocated

Alt Table

Click to see full alt table

Status	Accuracy	Program
	99.8%	(/.f32 #s(literal 1 binary32) (+.f32 #s(literal 1 binary32) (exp.f32 (/.f32 (neg.f32 x) s))))

Compiler

Compiled 22 to 16 computations (27.3% saved)

simplify2.0ms (0%)

Memory

0.5MiB live, 0.5MiB allocated

Algorithm

1×	egg-herbie

Rules

8×	`+-commutative`
6×	`sub-neg`
6×	`*-commutative`
6×	`neg-sub0`
6×	`neg-mul-1`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	14	33
1	25	33
2	31	33
3	36	33
4	39	33
5	40	33

Stop Event

1×

saturated

Calls

Call 1

Inputs
(/.f32 #s(literal 1 binary32) (+.f32 #s(literal 1 binary32) (exp.f32 (/.f32 (neg.f32 x) s))))

Outputs

(/.f32 #s(literal 1 binary32) (+.f32 #s(literal 1 binary32) (exp.f32 (/.f32 (neg.f32 x) s))))

(/.f32 #s(literal 1 binary32) (+.f32 #s(literal 1 binary32) (exp.f32 (neg.f32 (/.f32 x s)))))

(/.f32 #s(literal 1 binary32) (+.f32 #s(literal 1 binary32) (exp.f32 (/.f32 x (neg.f32 s)))))

soundness0.0ms (0%)

Memory

0.4MiB live, 0.4MiB allocated

Stop Event

1×

fuel

Compiler

Compiled 11 to 8 computations (27.3% saved)

preprocess14.0ms (0.2%)

Memory: 5.3MiB live, 21.0MiB allocated
Compiler: Compiled 44 to 32 computations (27.3% saved)

end0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated

analyze27.0ms (0.3%)

sample8.1s (98.5%)

preprocess78.0ms (0.9%)

eval0.0ms (0%)

prune1.0ms (0%)

simplify2.0ms (0%)

soundness0.0ms (0%)

preprocess14.0ms (0.2%)

end0.0ms (0%)

Profiling