TRIP REQUEST · MODEL-FREE
Construct the cheapest routing
Runs the exact traversal → Knowledge-Base read → resolution → deterministic solver pipeline with no model in the loop (FR-9). Needs no API key.
Try an example (fills the form)
Puts both seeded contradictions (ANA 85k vs 90k, VS 25k vs 20k) back to unresolved so the gate fires again.
No routing constructed yet
Pick an origin, destination, cabin, and the points currencies you hold, then construct the routing. You’ll see the exact GROQ traversal, the Knowledge-Base contradiction, how it’s resolved, and the deterministic minimality proof — in that order.