'[f?dZddlZddlZddlZddlmZmZddlmZm Z m Z m Z m Z m Z mZmZmZddddd d d d d d ZGddZGddeeZGddZdZdZGddeeZGddeZGddeZGddeZdZd Zd!Zd"gfd#gfd$gfd%gfd&gfd#gfd$gfd&gfd'gfd(gfd)d*d+gfd,gfd-gfd.gfd/d0gfd1d0gfgZgd2Z d7d4Z!d5Z"e#d6kr e"dSdS)8zD A theorem prover that makes use of the external 'Prover9' package. N)BaseProverCommandProver) AllExpression AndExpressionEqualityExpressionExistsExpression Expression IffExpression ImpExpressionNegatedExpression OrExpressionTz(FATAL)Fz (MAX_MEGS)z (MAX_SECONDS)z (MAX_GIVEN)z (MAX_KEPT)z(ACTION)z (SIGSEGV)) receZdZdZddZdS)Prover9CommandParentz A common base class used by both ``Prover9Command`` and ``MaceCommand``, which is responsible for maintaining a goal and a set of assumptions, and generating prover9-style input files from them. nltkc@|dkr(|D]}t|dS|dkr5t|D]}t|dSt d|z)z< Print the list of the current assumptions. rprover9z*Unrecognized value for 'output_format': %sN)lower assumptionsprintconvert_to_prover9 NameError)self output_formatas J/var/www/piapp/venv/lib/python3.11/site-packages/nltk/inference/prover9.pyprint_assumptionsz&Prover9CommandParent.print_assumptions6s    F * *%%''  a    " "i / /'(8(8(:(:;;  a  <}L N)r)__name__ __module__ __qualname____doc__r$r%r#rr/s2      r%rc"eZdZdZddZddZdS) Prover9Commandz A ``ProverCommand`` specific to the ``Prover9`` prover. It contains the a print_assumptions() method that is used to print the list of assumptions in multiple formats. N<c|sg}|t|tsJnt|}tj||||dS)a :param goal: Input expression to prove :type goal: sem.Expression :param assumptions: Input expressions to use as assumptions in the proof. :type assumptions: list(sem.Expression) :param timeout: number of seconds before timeout; set to 0 for no timeout. :type timeout: int :param prover: a prover. If not set, one will be created. :type prover: Prover9 N) isinstanceProver9r__init__)r goalrtimeoutprovers r#r1zProver9Command.__init__MsZ K  fg.. . . . .W%%F"4{CCCCCr%Tc|r4|j|dgdS|S)z9 :see BaseProverCommand.decorate_proof() striplabelsr)_prover_call_prooftransrstrip)r proof_stringsimplifys r#decorate_proofzProver9Command.decorate_proofdsM  )<00 OOfhh  &&(( (r%)NNr-N)T)r&r'r(r)r1r<r*r%r#r,r,FsJ DDDD. ) ) ) ) ) )r%r,c>eZdZdZdZd dZdZdZd dZgdfdZ dS) Prover9Parentz A common class extended by both ``Prover9`` and ``Mace ``. It contains the functionality required to convert NLTK-style expressions into Prover9-style expressions. NFc |d|_d|_dSd}tj||dgd||dzg||_|jt jjd|_dS)NrPROVER9'https://www.cs.unm.edu/~mccune/prover9/.exe) path_to_binenv_varsurl binary_namesverboser) _binary_location _prover9_binr internals find_binaryrsplitospathsep)r binary_locationrGnames r#config_prover9zProver9Parent.config_prover9ys  "$(D ! $D   D $ : :+#="D6M2 !;!!D %)$5$<$r>ps MMMM *         -/!6!6!6!6!6!6r%r>cLt|trVg}|D]O} |t|8#t d|zxYw|S t|S#t d|zxYw)z; Convert a ``logic.Expression`` to Prover9 format. z4input %s cannot be converted to Prover9 input syntax)r/listappend_convert_to_prover9r;r)rcresultrUs r#rrs%  A  1!**,,??@@@@ LuTUUU  &u~~'7'788 8  H5P Q Q Q s4AA'- BB#cTt|tr/dt|jzdzt |jzSt|t r/dt|jzdzt |jzSt|trdt |jzdzSt|tr2dt |j zdzt |j zdzSt|tr2dt |j zdzt |j zdzSt|tr2dt |j zd zt |j zdzSt|tr2dt |j zd zt |j zdzSt|tr2dt |j zd zt |j zdzSt|S) zC Convert ``logic.Expression`` to Prover9 formatted string. zexists  zall z-()(z & z | z -> z <-> z = )r/rstrvariablervtermrr rfirstsecondr r r r) expressions r#rvrvs*.//9 *%&& ' "*/22 3 J . .2 *%&& ' "*/22 3 J 1 2 2+)*/:::S@@ J . .) !*"233 4 "*"344 5    J - -! !*"233 4 "*"344 5    J . . !*"233 4 "*"344 5    J . . !*"233 4 "*"344 5    J 2 3 3  !*"233 4 "*"344 5   :r%cDeZdZdZdZd dZd dZdZgdfdZgdfdZ dS) r0Nr-c||_dS)N)_timeout)r r3s r#r1zProver9.__init__7s  & &r%Fcv|sg}|||||\}}|dk|fS)z Use Prover9 to prove a theorem. :return: A pair whose first element is a boolean indicating if the proof was successful (i.e. returns value of 0) and whose second element is the output of the prover. )rGr) _call_prover9rW)r r2rrGr`rks r#_provezProver9._prove=sV K!//   t[ 1 170   a((r%cDd}|t|||zS)z3 :see: Prover9Parent.prover9_input zclear(auto_denials). )r>rW)r r2rrUs r#rWzProver9.prover9_inputLs& %=..tT;GGGGr%c|j|d||_d}|jdkr |d|jzz }||z }|||j||\}}|dvr^d}||vr2||}||d} nd} |dvrt || t|| ||fS) a Call the ``prover9`` binary with the given input. :param input_str: A string whose contents are used as stdin. :param args: A list of command-line arguments. :return: A tuple (stdout, returncode) :see: ``config_prover9`` NrrTrzassign(max_seconds, %d). )rrz%%ERROR:)rrrr)rIr\rrrindexstripProver9LimitExceededExceptionProver9FatalException) r rmrorGupdated_input_strr`rkerrormsgprefixmsgstarterrormsgs r#rzProver9._call_prover9Ss   $ $ 1 1)W E ED  =1   !?$-!O O Y&!ZZ t0$    V # #'N''!<<77!()),2244\))3JIII+JAAAz!!r%c|j|d||_|||j||S)a Call the ``prooftrans`` binary with the given input. :param input_str: A string whose contents are used as stdin. :param args: A list of command-line arguments. :return: A tuple (stdout, returncode) :see: ``config_prover9`` N prooftrans)_prooftrans_binr\rr)r rmrorGs r#r8zProver9._call_prooftransvs@   '#'#4#4\7#K#KD zz)T%94IIIr%)r-)NNF) r&r'r(rIrr1rrWrr8r*r%r#r0r03sLO&&&& ) ) ) )HHH-/!"!"!"!"F025 J J J J J Jr%r0ceZdZdZdS)Prover9Exceptioncjt|}|r|d|zz }t||dS)Nz %s)p9_return_codes Exceptionr1)r rkmessagemsgs r#r1zProver9Exception.__init__s?j)  $ 6G# #C4%%%%%r%N)r&r'r(r1r*r%r#rrs#&&&&&r%rceZdZdS)rNr&r'r(r*r%r#rrDr%rceZdZdS)rNrr*r%r#rrrr%rcBtjd}tjd}t||g}d|_g|_|t |t |dS)Nz(walk(j) & sing(j))zwalk(j)r)r fromstringr,_executable_pathprover9_searchproverproof)r"grqs r# test_configrs344Ai((Aqqc***AAAGGIII !'')) !''))r%cp|D]2}tj|}tt|3dS)z% Test that parsing works OK. N)r rrr)exprtes r#test_convert_to_prover9rsG%%  !! $ $  ##$$$$%%r%c|D]u\}}tj|}d|D}t||}|D]}t d|zt d|d|dvdS)z2 Try some proofs and exhibit the results. c6g|]}tj|Sr*)r r).0r"s r# ztest_prove..s#???a&q))???r%rz %sz|- z: r^N)r rr,rr) argumentsr2rralistrqr"s r# test_provers )  {  !$ ' '??;??? 1% 0 0 0 6 6 8 8  A 'A+     A   r%z(man(x) <-> (not (not man(x))))z(not (man(x) & (not man(x))))z(man(x) | (not man(x)))z(man(x) & (not man(x)))z(man(x) -> man(x))z(man(x) <-> man(x))z(not (man(x) <-> (not man(x))))zmortal(Socrates)zall x.(man(x) -> mortal(x))z man(Socrates)zA((all x.(man(x) -> walks(x)) & man(Socrates)) -> some y.walks(y))z(all x.man(x) -> all x.man(x))zsome x.all y.sees(x,y)z#some e3.(walk(e3) & subj(e3, mary))zWsome e1.(see(e1) & subj(e1, john) & some e2.(pred(e1, e2) & walk(e2) & subj(e2, mary)))zVsome x e1.(see(e1) & subj(e1, x) & some e2.(pred(e1, e2) & walk(e2) & subj(e2, mary)))) zsome x y.sees(x,y)zsome x.(man(x) & walks(x))z\x.(man(x) & walks(x))z\x y.sees(x,y)z walks(john)z\x.big(x, \y.mouse(y))z/(walks(x) & (runs(x) & (threes(x) & fours(x))))z(walks(x) -> runs(x))zsome x.(PRO(x) & sees(John, x))z some x.(man(x) & (not walks(x)))zall x.(man(x) -> walks(x))-c*td|zdS)N-)r)nums r#spacerrs #)r%cXtdttttdtttttdtt t dS)NzTesting configurationz$Testing conversion to Prover9 formatzTesting proofs)rrrr expressionsrrr*r%r#demors !""" HHHMMM GGG 0111 HHHK((( GGG  HHHyr%__main__)r)$r)rMrfrnltk.inference.apirrnltk.sem.logicrrrrr r r r r rrr,r>rrvr0rrrrrrrrrrrr&r*r%r#rsi  88888888                            .')')')')'))+<')')')Tk6k6k6k6k6k6k6k6\*===@OJOJOJOJOJmVOJOJOJd&&&&&y&&&     ,        $4      %%%    '+$b)##2$b)#2B&+7IJH"M%r*r"- e  a e +  :        zDFFFFFr%