Metrics for sqrtexp (problem 3.4.4)

analyze176.0ms (4.8%)

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
53.1%	53.1%	46.9%	0%	0%	0%	0%	6
54.7%	54.7%	45.3%	0%	0%	0%	0%	7
55.5%	55.4%	44.5%	0%	0%	0%	0%	8
55.9%	55.8%	44.1%	0%	0%	0%	0%	9
56.1%	56%	43.9%	0%	0%	0%	0%	10
56.2%	56.1%	43.8%	0%	0%	0%	0%	11
56.2%	56.2%	43.8%	0%	0%	0%	0%	12

Compiler

Compiled 14 to 12 computations (14.3% saved)

Precisions

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

ival-exp: 21.0ms (28% of total)

ival-sub: 19.0ms (25.3% of total)

ival-mult: 15.0ms (20% of total)

ival-sqrt: 11.0ms (14.7% of total)

ival-div: 5.0ms (6.7% of total)

const: 3.0ms (4% of total)

sample2.8s (76%)

Results

1.6s	5011×	1	valid
453.0ms	3245×	0	valid
186.0ms	2717×	0	unsamplable

Precisions

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

ival-exp: 858.0ms (45.2% of total)

ival-sub: 260.0ms (13.7% of total)

ival-mult: 246.0ms (13% of total)

ival-div: 229.0ms (12.1% of total)

backward-pass: 144.0ms (7.6% of total)

ival-sqrt: 123.0ms (6.5% of total)

const: 37.0ms (1.9% of total)

Bogosity

preprocess116.0ms (3.2%)

Algorithm

1×	egg-herbie

Rules

612×	`div-sub`
326×	`associate--r+`
307×	`associate-+l-`
283×	`fma-define`
257×	`associate--l+`

Iterations

Useful iterations: 5 (0.0ms)

Iter	Nodes	Cost
0	24	144
1	56	136
2	82	136
3	128	136
4	221	96
5	401	84
6	803	84
7	2959	84

Stop Event

1×	node limit

Calls

Call 1

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

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

explain409.0ms (11.2%)

FPErrors

Click to see full error table

Ground Truth	Example	Example	Subexpression
164	-	-	`(-.f64 (exp.f64 (*.f64 #s(literal 2 binary64) x)) #s(literal 1 binary64))`
164	-	-	`(-.f64 (exp.f64 x) #s(literal 1 binary64))`
1	-	-	`(/.f64 (-.f64 (exp.f64 (*.f64 #s(literal 2 binary64) x)) #s(literal 1 binary64)) (-.f64 (exp.f64 x) #s(literal 1 binary64)))`
0	-	-	`x`
0	-	-	`(exp.f64 x)`
0	-	-	`#s(literal 2 binary64)`
0	-	-	`(sqrt.f64 (/.f64 (-.f64 (exp.f64 (*.f64 #s(literal 2 binary64) x)) #s(literal 1 binary64)) (-.f64 (exp.f64 x) #s(literal 1 binary64))))`
0	-	-	`(*.f64 #s(literal 2 binary64) x)`
0	-	-	`#s(literal 1 binary64)`
0	-	-	`(exp.f64 (*.f64 #s(literal 2 binary64) x))`

Results

49.0ms	258×	256	valid
208.0ms	160×	1024	valid
55.0ms	78×	512	valid
16.0ms	16×	2048	valid

Compiler

Compiled 107 to 79 computations (26.2% saved)

Precisions

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

ival-exp: 161.0ms (57.9% of total)

ival-div: 42.0ms (15.1% of total)

ival-mult: 34.0ms (12.2% of total)

ival-sub: 28.0ms (10.1% of total)

ival-sqrt: 7.0ms (2.5% of total)

const: 6.0ms (2.2% of total)

eval1.0ms (0%)

Compiler: Compiled 21 to 16 computations (23.8% saved)

prune5.0ms (0.1%)

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(sqrt.f64 (+.f64 #s(literal 1 binary64) (exp.f64 x)))

Compiler

Compiled 6 to 5 computations (16.7% saved)

localize24.0ms (0.7%)

Results

15.0ms

256×

256

valid

Compiler

Compiled 15 to 9 computations (40% saved)

Precisions

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

ival-add: 3.0ms (41.1% of total)

ival-exp: 2.0ms (27.4% of total)

ival-sqrt: 2.0ms (27.4% of total)

const: 1.0ms (13.7% of total)

eval0.0ms (0%)

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

prune1.0ms (0%)

Pruning

1 alts after pruning (0 fresh and 1 done)

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

Accuracy

100.0%

Counts

1 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(sqrt.f64 (+.f64 #s(literal 1 binary64) (exp.f64 x)))

Compiler

Compiled 24 to 19 computations (20.8% saved)

regimes3.0ms (0.1%)

Accuracy

Total -40.1b remaining (-∞%)

Threshold costs -40.1b (-∞%)

Counts

2 → 1

Calls

Call 1

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

Outputs
(sqrt.f64 (+.f64 #s(literal 1 binary64) (exp.f64 x)))

Calls

3 calls:

1.0ms

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

1.0ms

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

Results

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

Compiler

Compiled 27 to 22 computations (18.5% saved)

simplify2.0ms (0%)

Algorithm

1×	egg-herbie

Rules

3×	`1-exp`
1×	`+-commutative`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	10	18
1	16	18

Stop Event

1×

saturated

Calls

Call 1

Inputs
(sqrt.f64 (+.f64 #s(literal 1 binary64) (exp.f64 x)))

Outputs
(sqrt.f64 (+.f64 #s(literal 1 binary64) (exp.f64 x)))

soundness121.0ms (3.3%)

Rules

612×	`div-sub`
326×	`associate--r+`
307×	`associate-+l-`
283×	`fma-define`
257×	`associate--l+`

Iterations

Useful iterations: 5 (0.0ms)

Iter	Nodes	Cost
0	24	144
1	56	136
2	82	136
3	128	136
4	221	96
5	401	84
6	803	84
7	2959	84

Stop Event

1×	done
1×	node limit

Compiler

Compiled 91 to 61 computations (33% saved)

preprocess20.0ms (0.5%)

Compiler: Compiled 38 to 32 computations (15.8% saved)

sqrtexp (problem 3.4.4)

analyze176.0ms (4.8%)

sample2.8s (76%)

preprocess116.0ms (3.2%)

explain409.0ms (11.2%)

eval1.0ms (0%)

prune5.0ms (0.1%)

localize24.0ms (0.7%)

eval0.0ms (0%)

prune1.0ms (0%)

regimes3.0ms (0.1%)

simplify2.0ms (0%)

soundness121.0ms (3.3%)

preprocess20.0ms (0.5%)

end0.0ms (0%)

Profiling