Metrics for Hyperbolic arc-(co)tangent

analyze3.0ms (0%)

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	100%	0%	0%	0%	0%	0
0%	0%	100%	0%	0%	0%	0%	1
0%	0%	100%	0%	0%	0%	0%	2
0%	0%	50%	0%	0%	50%	0%	3
50%	25%	25%	0%	0%	50%	0%	4
75%	37.5%	12.5%	0%	0%	50%	0%	5
87.5%	43.7%	6.2%	0%	0%	50%	0%	6
93.8%	46.9%	3.1%	0%	0%	50%	0%	7
96.9%	48.4%	1.6%	0%	0%	50%	0%	8
98.4%	49.2%	0.8%	0%	0%	50%	0%	9
99.2%	49.6%	0.4%	0%	0%	50%	0%	10
99.6%	49.8%	0.2%	0%	0%	50%	0%	11
99.8%	49.9%	0.1%	0%	0%	50%	0%	12

Compiler

Compiled 28 to 20 computations (28.6% saved)

sample7.3s (98.8%)

Results

1.3s	6031×	1	valid-rival
1.4s	6031×	1	valid-sollya
1.4s	6030×	1	valid-rival-baseline
696.0ms	1944×	2	valid-rival
708.0ms	1944×	2	valid-sollya
769.0ms	1943×	2	valid-rival-baseline
22.0ms	281×	0	valid-sollya
21.0ms	281×	0	valid-rival
21.0ms	281×	0	valid-rival-baseline

Bogosity

preprocess64.0ms (0.9%)

Algorithm

1×	egg-herbie

Rules

305×	`fma-define`
221×	`fma-neg`
96×	`times-frac`
79×	`div-sub`
50×	`associate-l`

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	22	148
1	44	140
2	69	140
3	118	140
4	214	140
5	451	140
6	1138	140
7	1432	140
8	1598	140

Stop Event

1×

saturated

Calls

Call 1

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

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

Compiler

Compiled 13 to 9 computations (30.8% saved)

eval0.0ms (0%)

Compiler: Compiled 1 to 1 computations (0% saved)

prune1.0ms (0%)

Alt Table

Click to see full alt table

Status	Accuracy	Program
	9.0%	(*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (log.f64 (/.f64 (+.f64 #s(literal 1 binary64) x) (-.f64 #s(literal 1 binary64) x))))

Compiler

Compiled 26 to 18 computations (30.8% saved)

simplify2.0ms (0%)

Algorithm

1×	egg-herbie

Rules

3×	`1-exp`
3×	`+-commutative`
2×	`sub-neg`
2×	`*-commutative`
1×	`neg-sub0`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	15	35
1	24	35
2	28	35
3	30	35
4	31	35

Stop Event

1×

saturated

Calls

Call 1

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

Outputs

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

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

soundness1.0ms (0%)

Stop Event

1×

fuel

Compiler

Compiled 11 to 8 computations (27.3% saved)

preprocess16.0ms (0.2%)

Compiler: Compiled 48 to 34 computations (29.2% saved)

Hyperbolic arc-(co)tangent

analyze3.0ms (0%)

sample7.3s (98.8%)

preprocess64.0ms (0.9%)

eval0.0ms (0%)

prune1.0ms (0%)

simplify2.0ms (0%)

soundness1.0ms (0%)

preprocess16.0ms (0.2%)

end0.0ms (0%)

Profiling