Metrics for Trigonometry B

analyze131.0ms (5%)

Memory

3.6MiB live, 50.8MiB allocated

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
50%	50%	50%	0%	0%	0%	0%	3
50%	50%	50%	0%	0%	0%	0%	4
50%	50%	50%	0%	0%	0%	0%	5
50%	50%	50%	0%	0%	0%	0%	6
50%	50%	50%	0%	0%	0%	0%	7
50%	50%	50%	0%	0%	0%	0%	8
50%	50%	50%	0%	0%	0%	0%	9
50%	50%	50%	0%	0%	0%	0%	10
50%	50%	50%	0%	0%	0%	0%	11
50%	50%	50%	0%	0%	0%	0%	12

Compiler

Compiled 34 to 17 computations (50% saved)

sample2.3s (87.6%)

Memory

14.3MiB live, 623.4MiB allocated

Samples

562.0ms	8 256×	valid-baseline
515.0ms	8 256×	valid-rival
408.0ms	8 256×	valid-sollya

Precisions

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

ival-tan: 181.0ms (50.5% of total)

ival-mult: 51.0ms (14.2% of total)

ival-div: 46.0ms (12.8% of total)

ival-sub: 35.0ms (9.8% of total)

ival-add: 34.0ms (9.5% of total)

ival-true: 7.0ms (2% of total)

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

...in/eval/compile.rkt:76:19: 2.0ms (0.6% of total)

Precisions

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

ival-tan: 157.0ms (44.6% of total)

ival-mult: 53.0ms (15.1% of total)

ival-div: 49.0ms (13.9% of total)

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

ival-sub: 39.0ms (11.1% of total)

const: 10.0ms (2.8% of total)

Bogosity

preprocess171.0ms (6.5%)

Memory

4.6MiB live, 21.2MiB allocated

Algorithm

1×	egg-herbie

Rules

938×	`fma-define`
758×	`fmm-def`
705×	`sub-neg`
484×	`div-sub`
355×	`times-frac`

Iterations

Useful iterations: 3 (0.0ms)

Iter	Nodes	Cost
0	19	256
1	51	220
2	95	220
3	206	216
4	453	216
5	880	216
6	1708	216
7	2318	216
8	4186	216
9	5682	216
10	6640	216
11	7860	216

Stop Event

1×	node limit

Calls

Call 1

Inputs
(/.f64 (-.f64 #s(literal 1 binary64) (.f64 (tan.f64 x) (tan.f64 x))) (+.f64 #s(literal 1 binary64) (.f64 (tan.f64 x) (tan.f64 x))))
(/.f64 (-.f64 #s(literal 1 binary64) (.f64 (tan.f64 x) (tan.f64 x))) (+.f64 #s(literal 1 binary64) (.f64 (tan.f64 x) (tan.f64 x))))
(/.f64 (-.f64 #s(literal 1 binary64) (.f64 (tan.f64 (neg.f64 x)) (tan.f64 (neg.f64 x)))) (+.f64 #s(literal 1 binary64) (.f64 (tan.f64 (neg.f64 x)) (tan.f64 (neg.f64 x)))))
(neg.f64 (/.f64 (-.f64 #s(literal 1 binary64) (.f64 (tan.f64 (neg.f64 x)) (tan.f64 (neg.f64 x)))) (+.f64 #s(literal 1 binary64) (.f64 (tan.f64 (neg.f64 x)) (tan.f64 (neg.f64 x))))))

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

Symmetry

(abs x)

Compiler

Compiled 16 to 7 computations (56.3% saved)

eval0.0ms (0%)

Memory: 0.2MiB live, 0.2MiB allocated
Compiler: Compiled 1 to 1 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.5%	(/.f64 (-.f64 #s(literal 1 binary64) (.f64 (tan.f64 x) (tan.f64 x))) (+.f64 #s(literal 1 binary64) (.f64 (tan.f64 x) (tan.f64 x))))

Compiler

Compiled 32 to 14 computations (56.3% saved)

simplify2.0ms (0.1%)

Memory

0.6MiB live, 0.6MiB allocated

Algorithm

1×	egg-herbie

Rules

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	12	59
1	23	59
2	30	59
3	34	59
4	36	59

Stop Event

1×

saturated

Calls

Call 1

Inputs
(/.f64 (-.f64 #s(literal 1 binary64) (.f64 (tan.f64 x) (tan.f64 x))) (+.f64 #s(literal 1 binary64) (.f64 (tan.f64 x) (tan.f64 x))))

Outputs
(/.f64 (-.f64 #s(literal 1 binary64) (.f64 (tan.f64 x) (tan.f64 x))) (+.f64 #s(literal 1 binary64) (.f64 (tan.f64 x) (tan.f64 x))))

soundness0.0ms (0%)

Memory

0.4MiB live, 0.4MiB allocated

Stop Event

1×

fuel

Compiler

Compiled 16 to 7 computations (56.3% saved)

preprocess20.0ms (0.8%)

Memory: -4.9MiB live, 26.1MiB allocated
Remove: (abs x)
Compiler: Compiled 128 to 56 computations (56.3% saved)

end0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated

analyze131.0ms (5%)

sample2.3s (87.6%)

preprocess171.0ms (6.5%)

eval0.0ms (0%)

prune1.0ms (0%)

simplify2.0ms (0.1%)

soundness0.0ms (0%)

preprocess20.0ms (0.8%)

end0.0ms (0%)

Profiling