seam-lang 2.0.0

package/examples/output/dog.pl

@@ -0,0 +1 @@
+mustHave(alice, dogLicense).

package/examples/output/dpv-odrl-purpose-mapping.pl

@@ -0,0 +1,18 @@
+type(alpha_policy, odrl_policy).
+type(alpha_permission, odrl_permission).
+type(alpha_purpose_constraint, odrl_constraint).
+type(alpha_basis_constraint, odrl_constraint).
+odrl_permission(alpha_policy, alpha_permission).
+derived_from_process(alpha_permission, alpha_care_process).
+odrl_assigner(alpha_permission, hospital_a).
+odrl_assignee(alpha_permission, research_partner).
+odrl_target(alpha_permission, lab_result).
+odrl_action(alpha_permission, dpv_use).
+odrl_constraint(alpha_permission, alpha_purpose_constraint).
+odrl_constraint(alpha_permission, alpha_basis_constraint).
+odrl_leftOperand(alpha_purpose_constraint, dpv_odrl_purpose).
+odrl_leftOperand(alpha_basis_constraint, dpv_odrl_legal_basis).
+odrl_operator(alpha_purpose_constraint, odrl_isA).
+odrl_operator(alpha_basis_constraint, odrl_isA).
+odrl_rightOperand(alpha_purpose_constraint, dpv_healthcare).
+odrl_rightOperand(alpha_basis_constraint, dpv_consent).

package/examples/output/drone-corridor-planner.pl

@@ -0,0 +1,17 @@
+gps_plan(d1, plan([fly_gent_brugge, public_coastline_brugge_oostende], 2800.0, 0.012, 0.96029999999999993, 0.95039999999999991, low, none, [t, t, t, t, t])).
+gps_plan(d1, plan([fly_gent_brugge, buy_permit_brugge, public_coastline_brugge_oostende], 3250.0, 0.014, 0.94109399999999999, 0.95039999999999991, low, yes, [t, t, t, t])).
+gps_plan(d1, plan([fly_gent_brugge, buy_permit_brugge, topup_brugge, cross_corridor_brugge_oostende], 3250.0, 0.015000000000000001, 0.94984520399999994, 0.97019999999999995, mid, yes, [t, t, t])).
+gps_plan(d1, plan([fly_gent_brugge, buy_permit_brugge, topup_brugge, public_coastline_brugge_oostende], 3550.0, 0.017000000000000001, 0.94499905500000003, 0.931392, mid, yes, [t, t, t])).
+gps_plan(d1, plan([fly_gent_brugge, topup_brugge, public_coastline_brugge_oostende], 3100.0, 0.015000000000000001, 0.96428475000000002, 0.931392, mid, none, [t, t, t, t])).
+gps_plan(d1, plan([fly_gent_brugge, topup_brugge, buy_permit_brugge, cross_corridor_brugge_oostende], 3250.0, 0.015000000000000001, 0.94984520399999994, 0.97019999999999995, mid, yes, [t, t, t])).
+gps_plan(d1, plan([fly_gent_brugge, topup_brugge, buy_permit_brugge, public_coastline_brugge_oostende], 3550.0, 0.017000000000000001, 0.94499905500000003, 0.931392, mid, yes, [t, t, t])).
+gps_plan(d1, plan([train_gent_brugge, public_coastline_brugge_oostende], 2900.0, 0.018000000000000002, 0.97402500000000003, 0.95519999999999994, mid, none, [t, t, t, t, t])).
+gps_plan(d1, plan([train_gent_brugge, buy_permit_brugge, cross_corridor_brugge_oostende], 3050.0, 0.018000000000000002, 0.95943959999999995, 0.995, mid, yes, [t, t, t, t])).
+gps_plan(d1, plan([train_gent_brugge, buy_permit_brugge, public_coastline_brugge_oostende], 3350.0, 0.02, 0.95454450000000002, 0.95519999999999994, mid, yes, [t, t, t, t])).
+gps_plan(d1, plan([fly_gent_kortrijk, fly_kortrijk_brugge, buy_permit_brugge, quick_charge_brugge, cross_corridor_brugge_oostende], 5150.0, 0.024, 0.94034675195999995, 0.9506969999999999, mid, yes, [t, t])).
+gps_plan(d1, plan([fly_gent_kortrijk, fly_kortrijk_brugge, quick_charge_brugge, public_coastline_brugge_oostende], 5000.0, 0.024, 0.95464190250000003, 0.91266911999999989, mid, none, [t, t, t])).
+gps_plan(d1, plan([fly_gent_kortrijk, fly_kortrijk_brugge, quick_charge_brugge, buy_permit_brugge, cross_corridor_brugge_oostende], 5150.0, 0.024, 0.94034675195999995, 0.9506969999999999, mid, yes, [t, t])).
+gps_plan(d1, plan([fly_gent_kortrijk, get_zone_permit_kortrijk, fly_kortrijk_brugge, quick_charge_brugge, cross_corridor_brugge_oostende], 5000.0, 0.023, 0.95857796449800003, 0.9506969999999999, mid, yes, [t, t])).
+gps_plan(d1, plan([fly_gent_kortrijk, get_zone_permit_kortrijk, fly_kortrijk_brugge, quick_charge_brugge, public_coastline_brugge_oostende], 5300.0, 0.025000000000000001, 0.95368726059749998, 0.91266911999999989, mid, yes, [t, t])).
+gps_plan(d1, plan([fly_gent_kortrijk, get_zone_permit_kortrijk, emergency_charge_kortrijk, direct_corridor_kortrijk_oostende], 3500.0, 0.02, 0.94356004544999994, 0.86526000000000003, mid, yes, [t, t, t])).
+gps_plan(d1, plan([fly_gent_kortrijk, emergency_charge_kortrijk, get_zone_permit_kortrijk, direct_corridor_kortrijk_oostende], 3500.0, 0.019999999999999997, 0.94356004544999994, 0.86526000000000003, mid, yes, [t, t, t])).

package/examples/output/easter-computus.pl

@@ -0,0 +1,30 @@
+easterDate(y2026, date(2026, april, 5)).
+easterDate(y2027, date(2027, march, 28)).
+easterDate(y2028, date(2028, april, 16)).
+easterDate(y2029, date(2029, april, 1)).
+easterDate(y2030, date(2030, april, 21)).
+easterDate(y2031, date(2031, april, 13)).
+easterDate(y2032, date(2032, march, 28)).
+easterDate(y2033, date(2033, april, 17)).
+easterDate(y2034, date(2034, april, 9)).
+easterDate(y2035, date(2035, march, 25)).
+computusRemainders(y2026, remainders(12, 12, 2)).
+computusRemainders(y2027, remainders(13, 1, 5)).
+computusRemainders(y2028, remainders(14, 20, 5)).
+computusRemainders(y2029, remainders(15, 9, 1)).
+computusRemainders(y2030, remainders(16, 28, 2)).
+computusRemainders(y2031, remainders(17, 17, 5)).
+computusRemainders(y2032, remainders(18, 6, 0)).
+computusRemainders(y2033, remainders(0, 24, 2)).
+computusRemainders(y2034, remainders(1, 13, 5)).
+computusRemainders(y2035, remainders(2, 2, 1)).
+legalGregorianWindow(y2026, true).
+legalGregorianWindow(y2027, true).
+legalGregorianWindow(y2028, true).
+legalGregorianWindow(y2029, true).
+legalGregorianWindow(y2030, true).
+legalGregorianWindow(y2031, true).
+legalGregorianWindow(y2032, true).
+legalGregorianWindow(y2033, true).
+legalGregorianWindow(y2034, true).
+legalGregorianWindow(y2035, true).

package/examples/output/electrical-rc-filter.pl

@@ -0,0 +1,3 @@
+type(filter1, first_order_low_pass).
+timeConstant_s(filter1, 0.01).
+cutoffFrequency_Hz(filter1, 15.915494309189533).

package/examples/output/epidemic-policy.pl

@@ -0,0 +1,14 @@
+status(no_mandate, insufficient_control).
+status(vaccination_campaign, insufficient_control).
+status(indoor_masks, insufficient_control).
+status(vaccination_and_masks, acceptable_control).
+riskScore(no_mandate, 1.3999999999999999).
+riskScore(vaccination_campaign, 0.77000000000000002).
+riskScore(indoor_masks, 0.90999999999999992).
+riskScore(vaccination_and_masks, 0.50050000000000006).
+cost(no_mandate, 0).
+cost(vaccination_campaign, 3).
+cost(indoor_masks, 2).
+cost(vaccination_and_masks, 5).
+recommendedPolicy(epidemic_policy, vaccination_and_masks).
+reason(epidemic_policy, "combined vaccination and indoor masks are the only policy below the outbreak threshold").

package/examples/output/equality-saturation.pl

@@ -0,0 +1,5 @@
+egraphAnswer(start, add(mul(add(x, 0), 1), mul(2, add(1, 2)))).
+egraphAnswer(best, add(x, 6)).
+egraphAnswer(cost, 3).
+egraphAnswer(candidate_count, 32).
+egraphAnswer(note, "bounded equality saturation extracts the cheapest term without a real e-graph").

package/examples/output/equivalence-classes-overlap-implies-same-class.pl

@@ -0,0 +1,18 @@
+sameClassBecauseOfSharedMember(a, b, a).
+sameClassBecauseOfSharedMember(a, c, a).
+sameClassBecauseOfSharedMember(b, a, a).
+sameClassBecauseOfSharedMember(b, c, a).
+sameClassBecauseOfSharedMember(c, a, a).
+sameClassBecauseOfSharedMember(c, b, a).
+sameClassBecauseOfSharedMember(a, b, b).
+sameClassBecauseOfSharedMember(a, c, b).
+sameClassBecauseOfSharedMember(b, a, b).
+sameClassBecauseOfSharedMember(b, c, b).
+sameClassBecauseOfSharedMember(c, a, b).
+sameClassBecauseOfSharedMember(c, b, b).
+sameClassBecauseOfSharedMember(a, b, c).
+sameClassBecauseOfSharedMember(a, c, c).
+sameClassBecauseOfSharedMember(b, a, c).
+sameClassBecauseOfSharedMember(b, c, c).
+sameClassBecauseOfSharedMember(c, a, c).
+sameClassBecauseOfSharedMember(c, b, c).

package/examples/output/eulerian-path.pl

@@ -0,0 +1,3 @@
+oddVertices(eulerian_path_case, []).
+path(eulerian_path_case, [v1, v2, v3, v4, v5, v1, v3, v6, v2, v4, v6, v1]).
+edgeCount(eulerian_path_case, 11).

package/examples/output/ev-range-worlds.pl

@@ -0,0 +1,19 @@
+safeInWorld(city_errand, w1).
+safeInWorld(city_errand, w2).
+safeInWorld(city_errand, w0).
+safeInWorld(city_errand, w3).
+safeInWorld(winter_highway, w1).
+safeInWorld(heavy_delivery, w1).
+safeInWorld(heavy_delivery, w2).
+safeInWorld(heavy_delivery, w0).
+safeInWorld(cold_commute, w1).
+safeInWorld(cold_commute, w2).
+safeInWorld(cold_commute, w0).
+safeInWorld(cold_commute, w3).
+riskyInWorld(winter_highway, w2).
+riskyInWorld(winter_highway, w0).
+riskyInWorld(winter_highway, w3).
+riskyInWorld(heavy_delivery, w3).
+reason(winter_highway, "cold fast payload trip exceeds battery in physics-aware worlds").
+reason(heavy_delivery, "safety buffer turns a physics-safe delivery into a cautious risk").
+status(ev_range_worlds, expected_world_pattern).

package/examples/output/existential-rule.pl

@@ -0,0 +1,2 @@
+is(socrates, human_witness(socrates)).
+is(plato, human_witness(plato)).

package/examples/output/exoplanet-validation-worlds.pl

@@ -0,0 +1,22 @@
+ppvPlanetGivenDetection(rare_wide_orbit, 0.090163934426229442).
+ppvPlanetGivenDetection(mstar_short_period, 0.96116504854368934).
+ppvPlanetGivenDetection(common_hot_neptune_good, 0.91346153846153844).
+ppvPlanetGivenDetection(common_hot_neptune_low_spec, 0.76000000000000001).
+confirmsInWorld(mstar_short_period, w0).
+confirmsInWorld(common_hot_neptune_good, w0).
+confirmsInWorld(rare_wide_orbit, w1).
+confirmsInWorld(mstar_short_period, w1).
+confirmsInWorld(common_hot_neptune_good, w1).
+confirmsInWorld(common_hot_neptune_low_spec, w1).
+confirmsInWorld(mstar_short_period, w2).
+confirmsInWorld(common_hot_neptune_good, w2).
+confirmsInWorld(mstar_short_period, w3).
+rejectsInWorld(rare_wide_orbit, w0).
+rejectsInWorld(common_hot_neptune_low_spec, w0).
+rejectsInWorld(rare_wide_orbit, w2).
+rejectsInWorld(common_hot_neptune_low_spec, w2).
+rejectsInWorld(rare_wide_orbit, w3).
+rejectsInWorld(common_hot_neptune_good, w3).
+rejectsInWorld(common_hot_neptune_low_spec, w3).
+status(exoplanet_validation_worlds, expected_world_pattern).
+reason(exoplanet_validation_worlds, "Bayesian worlds account for occurrence and false positives while the naive world trusts sensitivity alone").

package/examples/output/expression-eval.pl

@@ -0,0 +1 @@
+result(root, 12).

package/examples/output/family-cousins.pl

@@ -0,0 +1,28 @@
+branch(dave, b).
+branch(eve, b).
+branch(frank, c).
+branch(grace, c).
+branch(heidi, b).
+branch(ivan, b).
+branch(judy, c).
+generation(bob, 1).
+generation(carol, 1).
+generation(dave, 2).
+generation(eve, 2).
+generation(frank, 2).
+generation(grace, 2).
+generation(heidi, 3).
+generation(ivan, 3).
+generation(judy, 3).
+cousin(dave, frank).
+cousin(dave, grace).
+cousin(eve, frank).
+cousin(eve, grace).
+cousin(frank, dave).
+cousin(frank, eve).
+cousin(grace, dave).
+cousin(grace, eve).
+cousin(heidi, judy).
+cousin(ivan, judy).
+cousin(judy, heidi).
+cousin(judy, ivan).

package/examples/output/fastpow.pl

@@ -0,0 +1,6 @@
+pow([2, 10], 1024).
+powSlow([2, 10], 1024).
+powMod1e6([2, 10000], 709376).
+powMod1e6([3, 10000], 200001).
+tower([2, 4], 65536).
+towerMod1e6([2, 5], 156736).

package/examples/output/fft8-numeric.pl

@@ -0,0 +1,4 @@
+fft(ramp8, [c(28, 0.0), c(-4.0, 9.6568542494923797), c(-4.0, 4.0), c(-4.0, 1.6568542494923806), c(-4, 0.0), c(-4.0, -1.6568542494923806), c(-4.0, -4.0), c(-4.0, -9.6568542494923797)]).
+fft(alternating8, [c(0, 0.0), c(0.0, 0.0), c(0.0, 0.0), c(0.0, 0.0), c(8, 0.0), c(0.0, 0.0), c(0.0, 0.0), c(0.0, 0.0)]).
+dcComponent(ramp8, c(28, 0.0)).
+dcComponent(alternating8, c(0, 0.0)).

package/examples/output/fibonacci.pl

@@ -0,0 +1,6 @@
+fibonacci(0, 0).
+fibonacci(1, 1).
+fibonacci(10, 55).
+fibonacci(100, 354224848179261915075).
+fibonacci(1000, 43466557686937456435688527675040625802564660517371780402481729089536555417949051890403879840079255169295922593080322634775209689623239873322471161642996440906533187938298969649928516003704476137795166849228875).
+fibonacci(10000, 33644764876431783266621612005107543310302148460680063906564769974680081442166662368155595513633734025582065332680836159373734790483865268263040892463056431887354544369559827491606602099884183933864652731300088830269235673613135117579297437854413752130520504347701602264758318906527890855154366159582987279682987510631200575428783453215515103870818298969791613127856265033195487140214287532698187962046936097879900350962302291026368131493195275630227837628441540360584402572114334961180023091208287046088923962328835461505776583271252546093591128203925285393434620904245248929403901706233888991085841065183173360437470737908552631764325733993712871937587746897479926305837065742830161637408969178426378624212835258112820516370298089332099905707920064367426202389783111470054074998459250360633560933883831923386783056136435351892133279732908133732642652633989763922723407882928177953580570993691049175470808931841056146322338217465637321248226383092103297701648054726243842374862411453093812206564914032751086643394517512161526545361333111314042436854805106765843493523836959653428071768775328348234345557366719731392746273629108210679280784718035329131176778924659089938635459327894523777674406192240337638674004021330343297496902028328145933418826817683893072003634795623117103101291953169794607632737589253530772552375943788434504067715555779056450443016640119462580972216729758615026968443146952034614932291105970676243268515992834709891284706740862008587135016260312071903172086094081298321581077282076353186624611278245537208532365305775956430072517744315051539600905168603220349163222640885248852433158051534849622434848299380905070483482449327453732624567755879089187190803662058009594743150052402532709746995318770724376825907419939632265984147498193609285223945039707165443156421328157688908058783183404917434556270520223564846495196112460268313970975069382648706613264507665074611512677522748621598642530711298441182622661057163515069260029861704945425047491378115154139941550671256271197133252763631939606902895650288268608362241082050562430701794976171121233066073310059947366875).

package/examples/output/field-nitrogen-balance.pl

@@ -0,0 +1,21 @@
+status(low_input, under_supplied).
+status(balanced_loam, balanced).
+status(sandy_high, over_supplied).
+status(clay_surplus, over_supplied).
+availableN_kg_ha(low_input, 58.5).
+availableN_kg_ha(balanced_loam, 110.0).
+availableN_kg_ha(sandy_high, 117.0).
+availableN_kg_ha(clay_surplus, 147.20000000000002).
+deficitN_kg_ha(low_input, 51.5).
+deficitN_kg_ha(balanced_loam, 0.0).
+deficitN_kg_ha(sandy_high, 0.0).
+deficitN_kg_ha(clay_surplus, 0.0).
+surplusN_kg_ha(sandy_high, 12.0).
+surplusN_kg_ha(clay_surplus, 27.200000000000017).
+surplusN_kg_ha(low_input, 0.0).
+surplusN_kg_ha(balanced_loam, 0.0).
+leachingIndex(sandy_high, 4.1999999999999993).
+leachingIndex(clay_surplus, 2.1760000000000015).
+leachingIndex(low_input, 0.0).
+leachingIndex(balanced_loam, 0.0).
+highestLeachingRisk(field_nitrogen_balance, sandy_high).

package/examples/output/flandor.pl

@@ -0,0 +1,43 @@
+caseName(case, "flandor").
+regionName(flanders, "Flanders").
+metric(macroInsight, "regional_retooling_priority").
+alg(signature, "HMAC-SHA256").
+payloadHashSHA256(signature, "718f5b17d07ab6a95503bc04a1000ddb132409f600659c03d21def81914b780b").
+signatureHMAC(signature, "955968ca99a191783bc00cba068128ccb9ff40a5e6114fda13a52c74ee27329e").
+auditEntries(case, 1).
+filesWritten(case, 6).
+exportWeakness(case, true).
+skillsStrain(case, true).
+gridStress(case, true).
+needsRetoolingPulse(case, true).
+derivedFromNeed(case, "regional_retooling_and_flexibility").
+activeNeedCount(answer, 3).
+activeNeedThreshold(answer, 3).
+recommendedPackageName(answer, "Flandor Retooling Pulse").
+budgetCapMEUR(answer, 140).
+packageCostMEUR(answer, 120).
+envelopeExpiresAt(answer, "2026-04-08T19:00:00+00:00").
+workerCoverage(why, 1200).
+gridReliefMW(why, 85).
+outcome(decision, "Allowed").
+target(decision, macroInsight).
+allChecksPass(result, true).
+signatureVerifies(check, true).
+payloadHashMatches(check, true).
+hmacMatches(check, true).
+minimizationStripsSensitiveTerms(check, true).
+scopeComplete(check, true).
+authorizationAllowed(check, true).
+thresholdReached(check, true).
+packageWithinBudget(check, true).
+packageCoversAllNeeds(check, true).
+dutyTimingConsistent(check, true).
+surveillanceReuseProhibited(check, true).
+filesWrittenExpected(check, true).
+lowestCostEligiblePackageChosen(check, true).
+reason(whyExportWeakness, "Export weakness is active because at least one cluster has exportOrdersIndex < 90 (Antwerp chemicals=84, Ghent manufacturing=87).").
+reason(whySkillsStrain, "Skills strain is active because technical vacancy rate is 4.6% (threshold > 3.9%).").
+reason(whyGridStress, "Grid stress is active because congestion hours = 19 (threshold > 11).").
+reason(whyRecommendationPolicy, "The recommendation policy is \"lowest_cost_package_covering_all_active_needs\", so the cheapest package that covers all active needs within budget is selected.").
+reason(whySelectedPackage, "Selected package \"Flandor Retooling Pulse\" covers export=true, skills=true, grid=true, cost=€120M.").
+reason(whyUsage, "Usage is permitted only for purpose \"regional_stabilization\" and the envelope expires at 2026-04-08T19:00:00+00:00.").

package/examples/output/floating-point.pl

@@ -0,0 +1,9 @@
+value(sum, 3.75).
+value(difference, 6.875).
+value(product, 10.0).
+value(quotient, 3.75).
+value(sqrtByPower, 3.0).
+value(mathSum, 1.0).
+value(mathProduct, 3.0).
+value(comfortable, true).
+than(warmer, targetC).

package/examples/output/four-color-map.pl

@@ -0,0 +1,3 @@
+color(map_eu, [[belgium, yellow], [netherlands, green], [luxemburg, green], [france, blue], [germany, red], [italy, red], [denmark, green], [ireland, red], [greece, red], [spain, green], [portugal, red], [austria, yellow], [sweden, green], [finland, red], [cyprus, red], [malta, red], [poland, blue], [hungary, blue], [czech_republic, green], [slovakia, red], [slovenia, green], [estonia, red], [latvia, green], [lithuania, red], [bulgaria, green], [romania, red], [croatia, red]]).
+status(map_eu, valid_four_colour_assignment).
+reason(map_eu, "no neighbouring countries share a colour").

package/examples/output/fundamental-theorem-arithmetic.pl

@@ -0,0 +1,9 @@
+product(case, 202692987).
+n(case, 202692987).
+factorsSmallest(case, [3, 3, 7, 829, 3881]).
+factorsLargest(case, [3881, 829, 7, 3, 3]).
+expectedFactorsMatched(case, true).
+productReconstructsInput(case, true).
+distinctPrimeCount(case, 4).
+smallestPrimeFactor(case, 3).
+largestPrimeFactor(case, 3881).

package/examples/output/gd-step-certified.pl

@@ -0,0 +1,79 @@
+width(0, 2.0).
+width(1, 2.7999999999999998).
+width(2, 3.9199999999999999).
+width(3, 5.4879999999999995).
+width(4, 7.6831999999999994).
+width(5, 10.75648).
+width(6, 15.059072).
+width(7, 21.082700800000001).
+width(8, 29.51578112).
+width(9, 41.322093568).
+width(10, 57.850930995200002).
+width(result, width(0, 2.0)).
+width(result, width(1, 2.7999999999999998)).
+width(result, width(2, 3.9199999999999999)).
+width(result, width(3, 5.4879999999999995)).
+width(result, width(4, 7.6831999999999994)).
+width(result, width(5, 10.75648)).
+width(result, width(6, 15.059072)).
+width(result, width(7, 21.082700800000001)).
+width(result, width(8, 29.51578112)).
+width(result, width(9, 41.322093568)).
+width(result, width(10, 57.850930995200002)).
+eta(result, 0.20000000000000001).
+etaLeHalf(result, true).
+xBounds(result, bounds(0, 0.0, 2.0)).
+xBounds(result, bounds(1, -0.40000000000000002, 2.3999999999999999)).
+xBounds(result, bounds(2, -0.95999999999999996, 2.96)).
+xBounds(result, bounds(3, -1.744, 3.7439999999999998)).
+xBounds(result, bounds(4, -2.8415999999999997, 4.8415999999999997)).
+xBounds(result, bounds(5, -4.3782399999999999, 6.3782399999999999)).
+xBounds(result, bounds(6, -6.5295360000000002, 8.5295360000000002)).
+xBounds(result, bounds(7, -9.5413504000000007, 11.541350400000001)).
+xBounds(result, bounds(8, -13.75789056, 15.75789056)).
+xBounds(result, bounds(9, -19.661046784, 21.661046784)).
+xBounds(result, bounds(10, -27.925465497600001, 29.925465497600001)).
+midpoint(result, midpoint(0, 1.0, 1.0)).
+midpoint(result, midpoint(1, 1.0, 1.3999999999999999)).
+midpoint(result, midpoint(2, 1.0, 1.96)).
+midpoint(result, midpoint(3, 0.99999999999999989, 2.7439999999999998)).
+midpoint(result, midpoint(4, 1.0, 3.8415999999999997)).
+midpoint(result, midpoint(5, 1.0, 5.3782399999999999)).
+midpoint(result, midpoint(6, 1.0, 7.5295360000000002)).
+midpoint(result, midpoint(7, 1.0, 10.541350400000001)).
+midpoint(result, midpoint(8, 1.0, 14.75789056)).
+midpoint(result, midpoint(9, 1.0, 20.661046784)).
+midpoint(result, midpoint(10, 1.0, 28.925465497600001)).
+gradientBounds(result, gradient(0, -2.0, 2.0)).
+gradientBounds(result, gradient(1, -2.7999999999999998, 2.7999999999999998)).
+gradientBounds(result, gradient(2, -3.9199999999999999, 3.9199999999999999)).
+gradientBounds(result, gradient(3, -5.4879999999999995, 5.4879999999999995)).
+gradientBounds(result, gradient(4, -7.6831999999999994, 7.6831999999999994)).
+gradientBounds(result, gradient(5, -10.75648, 10.75648)).
+gradientBounds(result, gradient(6, -15.059072, 15.059072)).
+gradientBounds(result, gradient(7, -21.082700800000001, 21.082700800000001)).
+gradientBounds(result, gradient(8, -29.51578112, 29.51578112)).
+gradientBounds(result, gradient(9, -41.322093568, 41.322093568)).
+gradientBounds(result, gradient(10, -57.850930995200002, 57.850930995200002)).
+stepBounds(result, step(0, -0.40000000000000002, 0.40000000000000002)).
+stepBounds(result, step(1, -0.55999999999999994, 0.55999999999999994)).
+stepBounds(result, step(2, -0.78400000000000003, 0.78400000000000003)).
+stepBounds(result, step(3, -1.0975999999999999, 1.0975999999999999)).
+stepBounds(result, step(4, -1.53664, 1.53664)).
+stepBounds(result, step(5, -2.1512959999999999, 2.1512959999999999)).
+stepBounds(result, step(6, -3.0118144000000004, 3.0118144000000004)).
+stepBounds(result, step(7, -4.2165401600000001, 4.2165401600000001)).
+stepBounds(result, step(8, -5.903156224, 5.903156224)).
+stepBounds(result, step(9, -8.2644187135999996, 8.2644187135999996)).
+stepBounds(result, step(10, -11.570186199040002, 11.570186199040002)).
+objectiveBounds(result, f(0, 0.0, 1.0)).
+objectiveBounds(result, f(1, 0.0, 1.9599999999999997)).
+objectiveBounds(result, f(2, 0.0, 3.8415999999999997)).
+objectiveBounds(result, f(3, 0.0, 7.5295359999999985)).
+objectiveBounds(result, f(4, 0.0, 14.757890559999998)).
+objectiveBounds(result, f(5, 0.0, 28.925465497599998)).
+objectiveBounds(result, f(6, 0.0, 56.693912375296001)).
+objectiveBounds(result, f(7, 0.0, 111.12006825558018)).
+objectiveBounds(result, f(8, 0.0, 217.79533378093711)).
+objectiveBounds(result, f(9, 0.0, 426.87885421063675)).
+objectiveBounds(result, f(10, 0.0, 836.68255425284804)).

package/examples/output/gdpr-compliance.pl

@@ -0,0 +1,6 @@
+status(case_alpha, gdpr_compliant).
+status(case_beta, gdpr_noncompliant).
+reason(case_beta, missing_legal_basis).
+reason(case_beta, not_minimized).
+reason(case_beta, missing_access_logging).
+reason(case_beta, transfer_without_adequacy).

package/examples/output/good-cobbler.pl

@@ -0,0 +1 @@
+is(test, is(joe, good(cobbler))).

package/examples/output/gps.pl

@@ -0,0 +1,21 @@
+outcome(decision, "Take the direct route via Brugge.").
+recommendedRoute(decision, routeDirect).
+statement(check, c1, true).
+statement(check, c2, true).
+statement(check, c3, true).
+statement(check, c4, true).
+statement(check, c5, true).
+label(routeDirect, "Gent -> Brugge -> Oostende").
+label(routeViaKortrijk, "Gent -> Kortrijk -> Brugge -> Oostende").
+actionSequence(routeDirect, [drive_gent_brugge, drive_brugge_oostende]).
+actionSequence(routeViaKortrijk, [drive_gent_kortrijk, drive_kortrijk_brugge, drive_brugge_oostende]).
+durationSeconds(routeDirect, 2400.0).
+durationSeconds(routeViaKortrijk, 4100.0).
+cost(routeDirect, 0.01).
+cost(routeViaKortrijk, 0.017999999999999999).
+belief(routeDirect, 0.94079999999999997).
+belief(routeViaKortrijk, 0.90316799999999997).
+comfort(routeDirect, 0.98999999999999999).
+comfort(routeViaKortrijk, 0.98009999999999997).
+selectedRoute(report, route(routeDirect, [drive_gent_brugge, drive_brugge_oostende], 2400.0, 0.01, 0.94079999999999997, 0.98999999999999999)).
+comparison(report, dominates(routeDirect, routeViaKortrijk)).

package/examples/output/graph-reachability.pl

@@ -0,0 +1,3 @@
+reachable(reachability_case, path(a, f)).
+reachable(reachability_case, path(c, g)).
+not_reachable(reachability_case, path(b, e)).

package/examples/output/graph.pl

@@ -0,0 +1,21 @@
+path(paris, orleans).
+path(paris, chartres).
+path(paris, amiens).
+path(orleans, blois).
+path(orleans, bourges).
+path(blois, tours).
+path(chartres, lemans).
+path(lemans, angers).
+path(lemans, tours).
+path(angers, nantes).
+path(paris, blois).
+path(paris, bourges).
+path(paris, tours).
+path(paris, lemans).
+path(paris, angers).
+path(paris, nantes).
+path(orleans, tours).
+path(chartres, angers).
+path(chartres, tours).
+path(chartres, nantes).
+path(lemans, nantes).

package/examples/output/gray-code-counter.pl

@@ -0,0 +1 @@
+isgcc([[1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0]], [[0, 0, 1], [0, 1, 1], [0, 1, 0], [1, 1, 0], [1, 1, 1], [1, 0, 1], [1, 0, 0], [0, 0, 0], [0, 0, 1]]).

package/examples/output/greatest-lower-bound-uniqueness.pl

@@ -0,0 +1,2 @@
+sameGreatestLowerBound(a, b, g1, g2).
+sameGreatestLowerBound(a, b, g2, g1).

package/examples/output/group-inverse-uniqueness.pl

@@ -0,0 +1,2 @@
+sameInverse(x, i, j).
+sameInverse(x, j, i).

package/examples/output/hamiltonian-path.pl

@@ -0,0 +1,121 @@
+hasHamiltonianPath(graph, true).
+hamiltonianPath(graph, [v1, v2, v3, v6, v4, v5]).
+hamiltonianPath(graph, [v1, v2, v6, v3, v4, v5]).
+hamiltonianPath(graph, [v1, v3, v2, v6, v4, v5]).
+hamiltonianPath(graph, [v1, v3, v6, v2, v4, v5]).
+hamiltonianPath(graph, [v1, v5, v4, v2, v3, v6]).
+hamiltonianPath(graph, [v1, v5, v4, v2, v6, v3]).
+hamiltonianPath(graph, [v1, v5, v4, v3, v2, v6]).
+hamiltonianPath(graph, [v1, v5, v4, v3, v6, v2]).
+hamiltonianPath(graph, [v1, v5, v4, v6, v2, v3]).
+hamiltonianPath(graph, [v1, v5, v4, v6, v3, v2]).
+hamiltonianPath(graph, [v1, v6, v2, v3, v4, v5]).
+hamiltonianPath(graph, [v1, v6, v3, v2, v4, v5]).
+hamiltonianPath(graph, [v2, v1, v3, v6, v4, v5]).
+hamiltonianPath(graph, [v2, v1, v5, v4, v3, v6]).
+hamiltonianPath(graph, [v2, v1, v5, v4, v6, v3]).
+hamiltonianPath(graph, [v2, v1, v6, v3, v4, v5]).
+hamiltonianPath(graph, [v2, v3, v1, v5, v4, v6]).
+hamiltonianPath(graph, [v2, v3, v1, v6, v4, v5]).
+hamiltonianPath(graph, [v2, v3, v4, v5, v1, v6]).
+hamiltonianPath(graph, [v2, v3, v4, v6, v1, v5]).
+hamiltonianPath(graph, [v2, v3, v6, v1, v5, v4]).
+hamiltonianPath(graph, [v2, v3, v6, v4, v5, v1]).
+hamiltonianPath(graph, [v2, v4, v3, v6, v1, v5]).
+hamiltonianPath(graph, [v2, v4, v5, v1, v3, v6]).
+hamiltonianPath(graph, [v2, v4, v5, v1, v6, v3]).
+hamiltonianPath(graph, [v2, v4, v6, v3, v1, v5]).
+hamiltonianPath(graph, [v2, v6, v1, v3, v4, v5]).
+hamiltonianPath(graph, [v2, v6, v1, v5, v4, v3]).
+hamiltonianPath(graph, [v2, v6, v3, v1, v5, v4]).
+hamiltonianPath(graph, [v2, v6, v3, v4, v5, v1]).
+hamiltonianPath(graph, [v2, v6, v4, v3, v1, v5]).
+hamiltonianPath(graph, [v2, v6, v4, v5, v1, v3]).
+hamiltonianPath(graph, [v3, v1, v2, v6, v4, v5]).
+hamiltonianPath(graph, [v3, v1, v5, v4, v2, v6]).
+hamiltonianPath(graph, [v3, v1, v5, v4, v6, v2]).
+hamiltonianPath(graph, [v3, v1, v6, v2, v4, v5]).
+hamiltonianPath(graph, [v3, v2, v1, v5, v4, v6]).
+hamiltonianPath(graph, [v3, v2, v1, v6, v4, v5]).
+hamiltonianPath(graph, [v3, v2, v4, v5, v1, v6]).
+hamiltonianPath(graph, [v3, v2, v4, v6, v1, v5]).
+hamiltonianPath(graph, [v3, v2, v6, v1, v5, v4]).
+hamiltonianPath(graph, [v3, v2, v6, v4, v5, v1]).
+hamiltonianPath(graph, [v3, v4, v2, v6, v1, v5]).
+hamiltonianPath(graph, [v3, v4, v5, v1, v2, v6]).
+hamiltonianPath(graph, [v3, v4, v5, v1, v6, v2]).
+hamiltonianPath(graph, [v3, v4, v6, v2, v1, v5]).
+hamiltonianPath(graph, [v3, v6, v1, v2, v4, v5]).
+hamiltonianPath(graph, [v3, v6, v1, v5, v4, v2]).
+hamiltonianPath(graph, [v3, v6, v2, v1, v5, v4]).
+hamiltonianPath(graph, [v3, v6, v2, v4, v5, v1]).
+hamiltonianPath(graph, [v3, v6, v4, v2, v1, v5]).
+hamiltonianPath(graph, [v3, v6, v4, v5, v1, v2]).
+hamiltonianPath(graph, [v4, v2, v3, v6, v1, v5]).
+hamiltonianPath(graph, [v4, v2, v6, v3, v1, v5]).
+hamiltonianPath(graph, [v4, v3, v2, v6, v1, v5]).
+hamiltonianPath(graph, [v4, v3, v6, v2, v1, v5]).
+hamiltonianPath(graph, [v4, v5, v1, v2, v3, v6]).
+hamiltonianPath(graph, [v4, v5, v1, v2, v6, v3]).
+hamiltonianPath(graph, [v4, v5, v1, v3, v2, v6]).
+hamiltonianPath(graph, [v4, v5, v1, v3, v6, v2]).
+hamiltonianPath(graph, [v4, v5, v1, v6, v2, v3]).
+hamiltonianPath(graph, [v4, v5, v1, v6, v3, v2]).
+hamiltonianPath(graph, [v4, v6, v2, v3, v1, v5]).
+hamiltonianPath(graph, [v4, v6, v3, v2, v1, v5]).
+hamiltonianPath(graph, [v5, v1, v2, v3, v4, v6]).
+hamiltonianPath(graph, [v5, v1, v2, v3, v6, v4]).
+hamiltonianPath(graph, [v5, v1, v2, v4, v3, v6]).
+hamiltonianPath(graph, [v5, v1, v2, v4, v6, v3]).
+hamiltonianPath(graph, [v5, v1, v2, v6, v3, v4]).
+hamiltonianPath(graph, [v5, v1, v2, v6, v4, v3]).
+hamiltonianPath(graph, [v5, v1, v3, v2, v4, v6]).
+hamiltonianPath(graph, [v5, v1, v3, v2, v6, v4]).
+hamiltonianPath(graph, [v5, v1, v3, v4, v2, v6]).
+hamiltonianPath(graph, [v5, v1, v3, v4, v6, v2]).
+hamiltonianPath(graph, [v5, v1, v3, v6, v2, v4]).
+hamiltonianPath(graph, [v5, v1, v3, v6, v4, v2]).
+hamiltonianPath(graph, [v5, v1, v6, v2, v3, v4]).
+hamiltonianPath(graph, [v5, v1, v6, v2, v4, v3]).
+hamiltonianPath(graph, [v5, v1, v6, v3, v2, v4]).
+hamiltonianPath(graph, [v5, v1, v6, v3, v4, v2]).
+hamiltonianPath(graph, [v5, v1, v6, v4, v2, v3]).
+hamiltonianPath(graph, [v5, v1, v6, v4, v3, v2]).
+hamiltonianPath(graph, [v5, v4, v2, v1, v3, v6]).
+hamiltonianPath(graph, [v5, v4, v2, v1, v6, v3]).
+hamiltonianPath(graph, [v5, v4, v2, v3, v1, v6]).
+hamiltonianPath(graph, [v5, v4, v2, v3, v6, v1]).
+hamiltonianPath(graph, [v5, v4, v2, v6, v1, v3]).
+hamiltonianPath(graph, [v5, v4, v2, v6, v3, v1]).
+hamiltonianPath(graph, [v5, v4, v3, v1, v2, v6]).
+hamiltonianPath(graph, [v5, v4, v3, v1, v6, v2]).
+hamiltonianPath(graph, [v5, v4, v3, v2, v1, v6]).
+hamiltonianPath(graph, [v5, v4, v3, v2, v6, v1]).
+hamiltonianPath(graph, [v5, v4, v3, v6, v1, v2]).
+hamiltonianPath(graph, [v5, v4, v3, v6, v2, v1]).
+hamiltonianPath(graph, [v5, v4, v6, v1, v2, v3]).
+hamiltonianPath(graph, [v5, v4, v6, v1, v3, v2]).
+hamiltonianPath(graph, [v5, v4, v6, v2, v1, v3]).
+hamiltonianPath(graph, [v5, v4, v6, v2, v3, v1]).
+hamiltonianPath(graph, [v5, v4, v6, v3, v1, v2]).
+hamiltonianPath(graph, [v5, v4, v6, v3, v2, v1]).
+hamiltonianPath(graph, [v6, v1, v2, v3, v4, v5]).
+hamiltonianPath(graph, [v6, v1, v3, v2, v4, v5]).
+hamiltonianPath(graph, [v6, v1, v5, v4, v2, v3]).
+hamiltonianPath(graph, [v6, v1, v5, v4, v3, v2]).
+hamiltonianPath(graph, [v6, v2, v1, v3, v4, v5]).
+hamiltonianPath(graph, [v6, v2, v1, v5, v4, v3]).
+hamiltonianPath(graph, [v6, v2, v3, v1, v5, v4]).
+hamiltonianPath(graph, [v6, v2, v3, v4, v5, v1]).
+hamiltonianPath(graph, [v6, v2, v4, v3, v1, v5]).
+hamiltonianPath(graph, [v6, v2, v4, v5, v1, v3]).
+hamiltonianPath(graph, [v6, v3, v1, v2, v4, v5]).
+hamiltonianPath(graph, [v6, v3, v1, v5, v4, v2]).
+hamiltonianPath(graph, [v6, v3, v2, v1, v5, v4]).
+hamiltonianPath(graph, [v6, v3, v2, v4, v5, v1]).
+hamiltonianPath(graph, [v6, v3, v4, v2, v1, v5]).
+hamiltonianPath(graph, [v6, v3, v4, v5, v1, v2]).
+hamiltonianPath(graph, [v6, v4, v2, v3, v1, v5]).
+hamiltonianPath(graph, [v6, v4, v3, v2, v1, v5]).
+hamiltonianPath(graph, [v6, v4, v5, v1, v2, v3]).
+hamiltonianPath(graph, [v6, v4, v5, v1, v3, v2]).

package/examples/output/hamming-code.pl

@@ -0,0 +1,6 @@
+syndrome(packet1, 5).
+errorBit(packet1, 5).
+correctedCodeword(packet1, [1, 0, 1, 1, 0, 1, 0]).
+decodedPayload(packet1, [1, 0, 1, 0]).
+status(packet1, single_bit_corrected).
+reason(packet1, "Hamming syndrome identifies the flipped bit position").

package/examples/output/hanoi.pl

@@ -0,0 +1 @@
+answer(3, [[left, right], [left, center], [right, center], [left, right], [center, left], [center, right], [left, right]]).

package/examples/output/heat-loss.pl

@@ -0,0 +1,5 @@
+type(wall1, conduction_heat_loss).
+temperatureDifference_K(wall1, 25.0).
+thermalResistance_K_W(wall1, 0.020833333333333332).
+heatLoss_W(wall1, 1200.0).
+status(wall1, high_heat_loss).

package/examples/output/herbrand-witnesses.pl

@@ -0,0 +1,7 @@
+has_parent(alice, parent_of(alice)).
+has_parent(bob, parent_of(bob)).
+registration(alice, logic, registration_of(alice, logic)).
+registration(alice, math, registration_of(alice, math)).
+registration(bob, logic, registration_of(bob, logic)).
+same_witness(parent_of_alice, true).
+distinct_witnesses(alice_logic_vs_alice_math, true).

package/examples/output/heron-theorem.pl

@@ -0,0 +1,4 @@
+semiperimeter(field_plot, 21).
+area(field_plot, 84.0).
+heronProduct(field_plot, 7056).
+status(field_plot, valid_survey_triangle).

package/examples/output/ideal-gas-law.pl

@@ -0,0 +1,3 @@
+pressure_Pa(cell1, 100000.0).
+status(cell1, near_atmospheric).
+reason(cell1, "pressure is inside the one-atmosphere tolerance band").