↑ Up

PyRes---1.5.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : PyRes---1.5
% Problem  : PUZ128+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s

% Computer : n012.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu May  9 17:37:49 EDT 2024

% Result   : Theorem 0.20s 0.52s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   26 (  16 unt;   0 def)
%            Number of atoms       :   50 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   47 (  23   ~;  15   |;   9   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   12 (   0 sgn   4   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(thersandros_not_patricidal,axiom,
    ~ patricide(thersandros),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',thersandros_not_patricidal) ).

fof(c5,plain,
    ~ patricide(thersandros),
    inference(fof_simplification,[status(thm)],[thersandros_not_patricidal]) ).

cnf(c6,plain,
    ~ patricide(thersandros),
    inference(split_conjunct,[status(thm)],[c5]) ).

fof(iokaste_polyneikes,axiom,
    parent_of(iokaste,polyneikes),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',iokaste_polyneikes) ).

cnf(c10,plain,
    parent_of(iokaste,polyneikes),
    inference(split_conjunct,[status(thm)],[iokaste_polyneikes]) ).

fof(polyneikes_thersandros,axiom,
    parent_of(polyneikes,thersandros),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',polyneikes_thersandros) ).

cnf(c8,plain,
    parent_of(polyneikes,thersandros),
    inference(split_conjunct,[status(thm)],[polyneikes_thersandros]) ).

fof(iokaste_parent_particide_parent_not_patricide,conjecture,
    ? [P,NP] :
      ( parent_of(iokaste,P)
      & patricide(P)
      & parent_of(P,NP)
      & ~ patricide(NP) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',iokaste_parent_particide_parent_not_patricide) ).

fof(c0,negated_conjecture,
    ~ ? [P,NP] :
        ( parent_of(iokaste,P)
        & patricide(P)
        & parent_of(P,NP)
        & ~ patricide(NP) ),
    inference(assume_negation,[status(cth)],[iokaste_parent_particide_parent_not_patricide]) ).

fof(c1,negated_conjecture,
    ~ ? [P,NP] :
        ( parent_of(iokaste,P)
        & patricide(P)
        & parent_of(P,NP)
        & ~ patricide(NP) ),
    inference(fof_simplification,[status(thm)],[c0]) ).

fof(c2,negated_conjecture,
    ! [P,NP] :
      ( ~ parent_of(iokaste,P)
      | ~ patricide(P)
      | ~ parent_of(P,NP)
      | patricide(NP) ),
    inference(fof_nnf,[status(thm)],[c1]) ).

fof(c3,negated_conjecture,
    ! [X2,X3] :
      ( ~ parent_of(iokaste,X2)
      | ~ patricide(X2)
      | ~ parent_of(X2,X3)
      | patricide(X3) ),
    inference(variable_rename,[status(thm)],[c2]) ).

cnf(c4,negated_conjecture,
    ( ~ parent_of(iokaste,X4)
    | ~ patricide(X4)
    | ~ parent_of(X4,X5)
    | patricide(X5) ),
    inference(split_conjunct,[status(thm)],[c3]) ).

cnf(c13,plain,
    ( ~ parent_of(iokaste,polyneikes)
    | ~ patricide(polyneikes)
    | patricide(thersandros) ),
    inference(resolution,[status(thm)],[c4,c8]) ).

cnf(c17,plain,
    ( ~ patricide(polyneikes)
    | patricide(thersandros) ),
    inference(resolution,[status(thm)],[c13,c10]) ).

fof(oedipus_patricidal,axiom,
    patricide(oedipus),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',oedipus_patricidal) ).

cnf(c7,plain,
    patricide(oedipus),
    inference(split_conjunct,[status(thm)],[oedipus_patricidal]) ).

fof(iokaste_oedipus,axiom,
    parent_of(iokaste,oedipus),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',iokaste_oedipus) ).

cnf(c11,plain,
    parent_of(iokaste,oedipus),
    inference(split_conjunct,[status(thm)],[iokaste_oedipus]) ).

fof(oedipus_polyneikes,axiom,
    parent_of(oedipus,polyneikes),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',oedipus_polyneikes) ).

cnf(c9,plain,
    parent_of(oedipus,polyneikes),
    inference(split_conjunct,[status(thm)],[oedipus_polyneikes]) ).

cnf(c14,plain,
    ( ~ parent_of(iokaste,oedipus)
    | ~ patricide(oedipus)
    | patricide(polyneikes) ),
    inference(resolution,[status(thm)],[c4,c9]) ).

cnf(c18,plain,
    ( ~ patricide(oedipus)
    | patricide(polyneikes) ),
    inference(resolution,[status(thm)],[c14,c11]) ).

cnf(c19,plain,
    patricide(polyneikes),
    inference(resolution,[status(thm)],[c18,c7]) ).

cnf(c20,plain,
    patricide(thersandros),
    inference(resolution,[status(thm)],[c19,c17]) ).

cnf(c21,plain,
    $false,
    inference(resolution,[status(thm)],[c20,c6]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : PUZ128+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.13  % Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.12/0.34  % Computer : n012.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Wed May  8 20:42:23 EDT 2024
% 0.12/0.34  % CPUTime  : 
% 0.20/0.52  % Version:  1.5
% 0.20/0.52  % SZS status Theorem
% 0.20/0.52  % SZS output start CNFRefutation
% See solution above
% 0.20/0.52  
% 0.20/0.52  % Initial clauses    : 7
% 0.20/0.52  % Processed clauses  : 14
% 0.20/0.52  % Factors computed   : 1
% 0.20/0.52  % Resolvents computed: 9
% 0.20/0.52  % Tautologies deleted: 1
% 0.20/0.52  % Forward subsumed   : 0
% 0.20/0.52  % Backward subsumed  : 5
% 0.20/0.52  % -------- CPU Time ---------
% 0.20/0.52  % User time          : 0.161 s
% 0.20/0.52  % System time        : 0.018 s
% 0.20/0.52  % Total time         : 0.179 s
%------------------------------------------------------------------------------