{"id":"W4391124671","doi":"10.48550/arxiv.2401.10703","title":"DRAT Proofs of Unsatisfiability for SAT Modulo Monotonic Theories","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical proof; Modulo; Computer science; Monotonic function; Proof complexity; Theoretical computer science; Mathematics; Discrete mathematics; Algorithm","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006710998,0.001465195,0.0008440893,0.001939212,0.001550858,0.003371563,0.002871994,0.001146581,0.01828822],"category_scores_gemma":[0.04270293,0.001452538,0.00280378,0.002139158,0.002420074,0.007266185,0.004329794,0.004640114,0.003028195],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002555826,"about_ca_system_score_gemma":0.003686176,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002034027,"about_ca_topic_score_gemma":0.005083602,"domain_scores_codex":[0.989748,0.00475289,0.0005327761,0.001107589,0.003311379,0.0005472319],"domain_scores_gemma":[0.9244221,0.06122762,0.002411474,0.008500878,0.00296731,0.0004706229],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007442651,0.0005245424,0.004171677,0.002740906,0.000482932,0.0008508079,0.00110724,0.1215974,0.02349599,0.3620317,0.05221534,0.4300372],"study_design_scores_gemma":[0.0002757068,0.0001496836,0.000535689,0.0002315192,0.0001989802,0.0005126932,0.0002558806,0.5341325,0.03263101,0.4048999,0.02611555,0.00006088261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03131026,0.0008864984,0.9419271,0.002274385,0.0001425797,0.0003625267,0.001822571,0.01129716,0.009976978],"genre_scores_gemma":[0.2724041,0.0007159744,0.7134352,0.00114691,0.000160763,0.0003972898,0.00485329,0.002816693,0.004069831],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01828822,"threshold_uncertainty_score":0.06118023,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05290255597217422,"score_gpt":0.1860302992382359,"score_spread":0.1331277432660616,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}