EXACT VERIFICATION + PROBABILISTIC TRIAGE

SMT solver lab

Can every constraint be true at once? Compare Jev’s prediction with Z3’s exact check.

Build your logic puzzle

Z3 + Jev

THE QUESTION

Can one number fit two impossible bounds?

A constraint is a rule that must hold. Add one per line, then compare a fast prediction with an exact check.

Constraint typeYour rules2 rules · 1 variables

x > 5
x < 3

Use true / false or whole numbers. Up to 60 rules and 40 variables. ⌘ / Ctrl + Enter runs the check.

Check options Exact verification always on

Classify independent groups in parallel Full exact check required

Need help writing a rule?

Use =, ==, !=, <, <=, >, >=, +, -, multiplication by an integer, parentheses, !, &&, || and =>.

(a_end <= b_start) || (b_end <= a_start)

This explicitly requires two meetings not to overlap. Availability flags alone do not create scheduling rules. Unsupported syntax is rejected; constraints are never executed as code.

Jev predicts; Z3 verifies every rule. Uncertain predictions stay uncertain until the exact check completes.

Comparison

Your rules→Jev predicts→Z3 verifies

One puzzle. Two approaches.

Choose a scenario or write your own rules. You’ll see whether they can coexist, how confident Jev was, and which method took longer.

Satisfiable: a solution exists Unsatisfiable: the rules conflict Unknown: more checking needed

Seeded benchmark

Five measured cases · API calls use your configured key

No benchmark measurements yet. Latency includes network and initialization; these examples are not a general accuracy claim.

Example	Z3	Jev	Confidence	Z3 server	Jev round trip	Agree
Impossible bounds	—	—	—	—	—	—
Team availability	—	—	—	—	—	—
Equality contradiction	—	—	—	—	—	—
Ordered tasks	—	—	—	—	—	—
Overlapping meetings	—	—	—	—	—	—