+ h=Rt^RIt^RIt^RIt^RIHtHt^RIHtH t H t H t H t H t HtHtHt^R^R^R^R^R^R ^R ^R ^eR / t!R R4t!RR]]4t!RR4tRtRt!RR]]4t!RR]4t!RR]4t!RR]4tRtRtRtR .3R!.3R".3R#.3R$.3R!.3R".3R$.3R%.3R&.3R'R(R).3R*.3R+.3R,.3R-R..3R/R..3.t.R3Ot R4R0lt!R1t"]#R28Xd ]"!4R#R#)5zD 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)c.a]tRt^/toRtRRltRtVtR#)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. c VP4R8Xd%VP4Fp\V4K R#VP4R8Xd.\VP44Fp\V4K R#\ RV,4h)z, Print the list of the current assumptions. nltkprover9z*Unrecognized value for 'output_format': %sN)lower assumptionsprintconvert_to_prover9 NameError)self output_formatas&& 8/usr/lib/python3/dist-packages/nltk/inference/prover9.pyprint_assumptions&Prover9CommandParent.print_assumptions6sv    F *%%'a(  "i /'(8(8(:;a<<}L N)r)__name__ __module__ __qualname____firstlineno____doc__r__static_attributes____classdictcell__ __classdict__s@rrr/s  rrc8a]tRt^FtoRtRRltRRltRtVtR#)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. Nc V'g.pVe\V\4'gQhM \V4p\P!WW4R#)al :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__)rgoalrtimeoutprovers&&&&&rr-Prover9Command.__init__Ms?K  fg.. ..W%F""4Crc V'd3VPPVR.4^,P4#VP4#)z) :see BaseProverCommand.decorate_proof() striplabels)_prover_call_prooftransrstrip)r proof_stringsimplifys&&&rdecorate_proofProver9Command.decorate_proofdsB <<00 Ofh  &&( (rr)NN<N)T) rr r!r"r#r-r9r$r%r&s@rr)r)Fs D. ) )rr)cVa]tRt^ptoRtRtR RltRtRtR Rlt .R3Rlt R t Vt R#) 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  VfRVnRVnR#Rp\PP VVR.RW3R,.VR7VnVPP \ PP^4VnR#)NrPROVER9'https://www.cs.unm.edu/~mccune/prover9/.exe) path_to_binenv_varsurl binary_namesverbose) _binary_location _prover9_binr internals find_binaryrsplitospathsep)rbinary_locationrFnames&&& rconfig_prover9Prover9Parent.config_prover9ysy  "$(D ! $D D $ : :+#="6M2 !;!D %)$5$5$<$R\VP4,R,\ VP 4,#\V\ 4'd>R\VP4,R,\ VP 4,#\V\4'd$R\ VP 4,R,#\V\4'dER\ VP4,R,\ VP4,R,#\V\4'dER\ VP4,R,\ VP4,R,#\V\4'dER\ VP4,R ,\ VP4,R,#\V\4'dER\ VP4,R ,\ VP4,R,#\V\4'dER\ VP4,R ,\ VP4,R,#\V4#) z; Convert ``logic.Expression`` to Prover9 formatted string. zexists  zall z-()(z & z | z -> z <-> z = )r+rstrvariablerztermrr rfirstsecondr r r r) expressions&rrzrzsW*.// *%%& ' "*//2 3 J . . *%%& ' "*//2 3 J 1 2 2)*//::S@@ J . . !*"2"23 4 "*"3"34 5    J - - !*"2"23 4 "*"3"34 5    J . . !*"2"23 4 "*"3"34 5    J . . !*"2"23 4 "*"3"34 5    J 2 3 3 !*"2"23 4 "*"3"34 5   :rc^a]tRtRtoRtRtR RltR RltRt.R3Rlt .R3Rlt R t Vt R#) r,i3NcWnR#)N)_timeout)rr/s&&rr-Prover9.__init__7s   &rFc lV'g.pVPVPW4VR7wrEV^8HV3#)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. )rF) _call_prover9rW)rr.rrFrcrns&&&& r_proveProver9._prove=sEK!//   t 170 a((rc @RpV\PWV4,#)z# :see: Prover9Parent.prover9_input zclear(auto_denials). )r=rW)rr.rrUs&&& rrWProver9.prover9_inputLs! %=..t;GGGrc VPfVPRV4VnRpVP^8dVRVP,, pWA, pVPW@PW#4wrVVR9dLRpWu9d%VP V4pWXRP 4p MRp VR9d \ Wi4h\Wi4hWV3#)z 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`` NrrTzassign(max_seconds, %d). z%%ERROR:)))rHr^rruindexstripProver9LimitExceededExceptionProver9FatalException) rrprrrFupdated_input_strrcrnerrormsgprefixmsgstarterrormsgs &&&& rrProver9._call_prover9Ss    $ $ 1 1)W ED  ==1  !?$--!O O &!ZZ 00$  V #'N'!<<7!),224\)3JII+JAA!!rc VPfVPRV4VnVPWPW#4#)z 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`` prooftrans)_prooftrans_binr^ru)rrprrrFs&&&&rr5Prover9._call_prooftransvs<    '#'#4#4\7#KD zz)%9%94IIr)rrHr)r;)NNF) rr r!r"rHrr-rrWrr5r$r%r&s@rr,r,3s?LO& )H-/!"F025 J Jrr,c&a]tRtRtoRtRtVtR#)Prover9Exceptionicz\V,pV'dVRV,, p\PW4R#)z %sN)p9_return_codes Exceptionr-)rrnmessagemsgs&&& rr-Prover9Exception.__init__s,j)  6G# #C4%rrN)rr r!r"r-r$r%r&s@rrrs&&rrc]tRtRtRtR#)rirNrr r!r"r$rrrrrrrc]tRtRtRtR#)rirNrrrrrrrrrc\P!R4p\P!R4p\W.R7pRVn.VnVP 4\ VP 44\ VP44R#)z(walk(j) & sing(j))zwalk(j)rN)r fromstringr)_executable_pathprover9_searchproverproof)rgrts r test_configrsd34Ai(Aqc*AAAGGI !'') !'')rclVF-p\P!V4p\\V44K/ R#)z Test that parsing works OK. N)rrrr)exprtes& rtest_convert_to_prover9rs,  ! !! $  #$rc*VFwr\P!V4pVUu.uFp\P!V4NK pp\W5R7P4pVFp\ RV,4K \ RV RV R24K R#uupi)z* Try some proofs and exhibit the results. rz %sz|- z: raN)rrr)rr) argumentsr.rrralistrts& r test_provers'  ! !$ '3>?;a&&q);? 1 0 6 6 8A 'A+  A3b2 '?sBz(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)))c*\RV,4R#)-N)r)nums&rspacerrs #)rc\R4\4\4\4\R4\4\\4\4\R4\4\ \ 4R#)zTesting configurationz$Testing conversion to Prover9 formatzTesting proofsN)rrrr expressionsrrrrrdemorsK !" HM G 01 HK( G  Hyr__main__) 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)))-)$r#rLrirnltk.inference.apirrnltk.sem.logicrrrrrr r r r rrr)r=rrzr,rrrrrrrrrrrrrrrrs  8    tyu|}|z .'))+<')Tk6k6\*=@OJmVOJd&y& ,  $4  %  '+$b)##2$b)#2B&+7IJH"M%r*r"- e  a e +  :    zFr