o i=@sdZddlZddlZddlZddlmZmZddlmZm Z m Z m Z m Z m Z mZmZmZddddd d d d d d ZGdddZGdddeeZGdddZddZddZGdddeeZGdddeZGdddeZGdd d eZd!d"Zd#d$Zd%d&Zd'gfd(gfd)gfd*gfd+gfd(gfd)gfd+gfd,gfd-gfd.d/d0gfd1gfd2gfd3gfd4d5gfd6d5gfgZgd7Z d>d9d:Z!d;d<Z"e#d=kre"dSdS)?zD 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)) rec@seZdZdZdddZdS)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. nltkcCs\|dkr|D]}t|q dS|dkr(t|D]}t|qdStd|)z< Print the list of the current assumptions. rprover9z*Unrecognized value for 'output_format': %sN)lower assumptionsprintconvert_to_prover9 NameError)self output_formatar Q/var/www/edux/Edux_v2/venv/lib/python3.10/site-packages/nltk/inference/prover9.pyprint_assumptions6s     z&Prover9CommandParent.print_assumptionsN)r)__name__ __module__ __qualname____doc__r"r r r r!r/src@s$eZdZdZd ddZd ddZdS) 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<cCs<|sg}|durt|tsJnt|}t||||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__)rgoalrtimeoutproverr r r!r+Ms  zProver9Command.__init__TcCs$|r|j|dgdS|S)z9 :see BaseProverCommand.decorate_proof() striplabelsr)_prover_call_prooftransrstrip)r proof_stringsimplifyr r r!decorate_proofdszProver9Command.decorate_proof)NNr(N)T)r#r$r%r&r+r5r r r r!r'Fs r'c@sFeZdZdZdZdddZddZdd Zdd d Zgdfd d Z 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. NFcCsX|dur d|_d|_dSd}tjj||dgd||dg|d|_|jtjjd|_dS)NrPROVER9'https://www.cs.unm.edu/~mccune/prover9/.exe) path_to_binenv_varsurl binary_namesverboser ) _binary_location _prover9_binr internals find_binaryrsplitospathsep)rbinary_locationr>namer r r!config_prover9ys  zProver9Parent.config_prover9cCsZd}|r|d7}t|D]}|d|7}q |d7}|r+|d7}|dt|7}|d7}|S)z :return: The input string that should be provided to the prover9 binary. This string is formed based on the goal, assumptions, and timeout value of this object. zformulas(assumptions). z %s. zend_of_list. zformulas(goals). )r)rr,rs p9_assumptionr r r! prover9_inputs zProver9Parent.prover9_inputcCsgdS)z A list of directories that should be searched for the prover9 executables. This list is used by ``config_prover9`` when searching for the prover9 executables. )z/usr/local/bin/prover9z/usr/local/bin/prover9/binz/usr/local/binz/usr/binz/usr/local/prover9z/usr/local/share/prover9r )rr r r!binary_locationsszProver9Parent.binary_locationscCs@|}|jdur||jg7}tjj||dgd||dg|dS)Nr7r8r9) searchpathr;r<r=r>)rNr?rrArB)rrHr>rNr r r! _find_binarys   zProver9Parent._find_binaryc Cs|rtd|td|td|d|g|}z|d}Wn ty'Ynwtj|tjtjtjd}|j|d\}}|rTtd|j|rLtd |d|rTtd |d| d |jfS) a= Call the binary with the given input. :param input_str: A string whose contents are used as stdin. :param binary: The location of the binary to call :param args: A list of command-line arguments. :return: A tuple (stdout, returncode) :see: ``config_prover9`` zCalling:zArgs:zInput:  utf8)stdoutstderrstdin)inputz Return code:zstdout: zstderr: zutf-8) rencodeAttributeError subprocessPopenPIPESTDOUT communicate returncodedecode) r input_strbinaryargsr>cmdprSrTr r r!_calls*        zProver9Parent._call)F) r#r$r%r&r?rIrMrNrPrer r r r!r6ps   r6cCsjt|tr#g}|D]}z |t|Wq td||Szt|WStd|)z; Convert a ``logic.Expression`` to Prover9 format. z4input %s cannot be converted to Prover9 input syntax)r)listappend_convert_to_prover9r4r)rVresultrKr r r!rs   rcCsBt|trdt|jdt|jSt|tr&dt|jdt|jSt|tr4dt|jdSt|trIdt|j dt|j dSt|t r^dt|j dt|j dSt|t rsdt|j d t|j dSt|t rdt|j d t|j dSt|trdt|j d t|j dSt|S) zC Convert ``logic.Expression`` to Prover9 formatted string. zexists  zall z-()(z & z | z -> z <-> z = )r)rstrvariablerhtermrr rfirstsecondr r r r) expressionr r r!rhs        rhc@sLeZdZdZdZdddZdddZdd Zgdfd d Zgdfd d Z dS)r*Nr(cCs ||_dS)N)_timeout)rr-r r r!r+7szProver9.__init__FcCs.|sg}|j||||d\}}|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. )r>r) _call_prover9rM)rr,rr>rSr^r r r!_prove=s   zProver9._provecCsd}|t|||S)z3 :see: Prover9Parent.prover9_input zclear(auto_denials). )r6rM)rr,rrKr r r!rMLszProver9.prover9_inputc Cs|jdur |d||_d}|jdkr|d|j7}||7}|||j||\}}|dvrQd}||vrA||}||d} nd} |dvrLt|| 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`` NrrJrzassign(max_seconds, %d). )rrz%%ERROR:)rrrr)r@rPrsreindexstripProver9LimitExceededExceptionProver9FatalException) rr`rbr>updated_input_strrSr^errormsgprefixmsgstarterrormsgr r r!rtSs&      zProver9._call_prover9cCs*|jdur |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_binrPre)rr`rbr>r r r!r1vs zProver9._call_prooftrans)r()NNF) r#r$r%r@rr+rurMrtr1r r r r!r*3s  #r*c@seZdZddZdS)Prover9ExceptioncCs(t|}|r |d|7}t||dS)Nz %s)p9_return_codes Exceptionr+)rr^messagemsgr r r!r+s zProver9Exception.__init__N)r#r$r%r+r r r r!rs rc@ eZdZdS)ryNr#r$r%r r r r!ryryc@r)rxNrr r r r!rxrrxcCsRtd}td}t||gd}d|_g|_|t|t|dS)Nz(walk(j) & sing(j))zwalk(j)r)r fromstringr'_executable_pathprover9_searchproverproof)rgrdr r r! test_configs   rcCs$|D] }t|}tt|qdS)z% Test that parsing works OK. N)rrrr)exprter r r!test_convert_to_prover9s rcCsf|D].\}}t|}dd|D}t||d}|D]}td|qtd|d|dqdS) z2 Try some proofs and exhibit the results. cSsg|]}t|qSr )rr).0rr r r! sztest_prove..rz %sz|- z: rQN)rrr'rr) argumentsr,rralistrdrr r r! test_proves  rz(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))-cCstd|dS)N-)r)numr r r!spacersrcCsPtdttttdtttttdtttdS)NzTesting configurationz$Testing conversion to Prover9 formatzTesting proofs)rrrr expressionsrrr r r r!demos r__main__)r)$r&rDrYrnltk.inference.apirrnltk.sem.logicrrrrrr r r r rrr'r6rrhr*rrryrxrrrrrrrr#r r r r!sr,*n@R