TSTP Solution File: NUM618+3 by ET---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : NUM618+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n009.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  : 600s
% DateTime : Mon Jul 18 09:34:28 EDT 2022

% Result   : Theorem 0.21s 1.40s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   17 (   5 unt;   0 def)
%            Number of atoms       :   56 (  18 equ)
%            Maximal formula atoms :   20 (   3 avg)
%            Number of connectives :   61 (  22   ~;  19   |;  18   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   7 con; 0-2 aty)
%            Number of variables   :   14 (   0 sgn   6   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(m__5208,hypothesis,
    ( ! [X1] :
        ( aElementOf0(X1,xP)
       => aElementOf0(X1,xO) )
    & aSubsetOf0(xP,xO) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',m__5208) ).

fof(m__,conjecture,
    ? [X1] :
      ( aElementOf0(X1,szNzAzT0)
      & xx = sdtlpdtrp0(xe,X1) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',m__) ).

fof(m__4982,hypothesis,
    ! [X1] :
      ( ( ? [X2] :
            ( aElementOf0(X2,sdtlbdtrb0(xd,szDzizrdt0(xd)))
            & sdtlpdtrp0(xe,X2) = X1 )
        | aElementOf0(X1,xO) )
     => ? [X2] :
          ( aElementOf0(X2,szNzAzT0)
          & sdtlpdtrp0(xd,X2) = szDzizrdt0(xd)
          & aElementOf0(X2,sdtlbdtrb0(xd,szDzizrdt0(xd)))
          & sdtlpdtrp0(xe,X2) = X1 ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',m__4982) ).

fof(m__5348,hypothesis,
    ( aElement0(xx)
    & aElementOf0(xx,xQ)
    & xx != szmzizndt0(xQ)
    & aElementOf0(xx,xP) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',m__5348) ).

fof(c_0_4,hypothesis,
    ! [X2] :
      ( ( ~ aElementOf0(X2,xP)
        | aElementOf0(X2,xO) )
      & aSubsetOf0(xP,xO) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__5208])])])])]) ).

fof(c_0_5,negated_conjecture,
    ~ ? [X1] :
        ( aElementOf0(X1,szNzAzT0)
        & xx = sdtlpdtrp0(xe,X1) ),
    inference(assume_negation,[status(cth)],[m__]) ).

fof(c_0_6,hypothesis,
    ! [X3,X4] :
      ( ( aElementOf0(esk2_1(X3),szNzAzT0)
        | ~ aElementOf0(X4,sdtlbdtrb0(xd,szDzizrdt0(xd)))
        | sdtlpdtrp0(xe,X4) != X3 )
      & ( sdtlpdtrp0(xd,esk2_1(X3)) = szDzizrdt0(xd)
        | ~ aElementOf0(X4,sdtlbdtrb0(xd,szDzizrdt0(xd)))
        | sdtlpdtrp0(xe,X4) != X3 )
      & ( aElementOf0(esk2_1(X3),sdtlbdtrb0(xd,szDzizrdt0(xd)))
        | ~ aElementOf0(X4,sdtlbdtrb0(xd,szDzizrdt0(xd)))
        | sdtlpdtrp0(xe,X4) != X3 )
      & ( sdtlpdtrp0(xe,esk2_1(X3)) = X3
        | ~ aElementOf0(X4,sdtlbdtrb0(xd,szDzizrdt0(xd)))
        | sdtlpdtrp0(xe,X4) != X3 )
      & ( aElementOf0(esk2_1(X3),szNzAzT0)
        | ~ aElementOf0(X3,xO) )
      & ( sdtlpdtrp0(xd,esk2_1(X3)) = szDzizrdt0(xd)
        | ~ aElementOf0(X3,xO) )
      & ( aElementOf0(esk2_1(X3),sdtlbdtrb0(xd,szDzizrdt0(xd)))
        | ~ aElementOf0(X3,xO) )
      & ( sdtlpdtrp0(xe,esk2_1(X3)) = X3
        | ~ aElementOf0(X3,xO) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__4982])])])])])])]) ).

cnf(c_0_7,hypothesis,
    ( aElementOf0(X1,xO)
    | ~ aElementOf0(X1,xP) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_8,hypothesis,
    aElementOf0(xx,xP),
    inference(split_conjunct,[status(thm)],[m__5348]) ).

fof(c_0_9,negated_conjecture,
    ! [X2] :
      ( ~ aElementOf0(X2,szNzAzT0)
      | xx != sdtlpdtrp0(xe,X2) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])]) ).

cnf(c_0_10,hypothesis,
    ( sdtlpdtrp0(xe,esk2_1(X1)) = X1
    | ~ aElementOf0(X1,xO) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_11,hypothesis,
    aElementOf0(xx,xO),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_12,hypothesis,
    ( aElementOf0(esk2_1(X1),szNzAzT0)
    | ~ aElementOf0(X1,xO) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_13,negated_conjecture,
    ( xx != sdtlpdtrp0(xe,X1)
    | ~ aElementOf0(X1,szNzAzT0) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_14,hypothesis,
    sdtlpdtrp0(xe,esk2_1(xx)) = xx,
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_15,hypothesis,
    aElementOf0(esk2_1(xx),szNzAzT0),
    inference(spm,[status(thm)],[c_0_12,c_0_11]) ).

cnf(c_0_16,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : NUM618+3 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.11  % Command  : run_ET %s %d
% 0.11/0.32  % Computer : n009.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 600
% 0.11/0.32  % DateTime : Thu Jul  7 19:15:52 EDT 2022
% 0.11/0.32  % CPUTime  : 
% 0.21/1.40  # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.21/1.40  # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.21/1.40  # Preprocessing time       : 0.023 s
% 0.21/1.40  
% 0.21/1.40  # Proof found!
% 0.21/1.40  # SZS status Theorem
% 0.21/1.40  # SZS output start CNFRefutation
% See solution above
% 0.21/1.40  # Proof object total steps             : 17
% 0.21/1.40  # Proof object clause steps            : 9
% 0.21/1.40  # Proof object formula steps           : 8
% 0.21/1.40  # Proof object conjectures             : 5
% 0.21/1.40  # Proof object clause conjectures      : 2
% 0.21/1.40  # Proof object formula conjectures     : 3
% 0.21/1.40  # Proof object initial clauses used    : 5
% 0.21/1.40  # Proof object initial formulas used   : 4
% 0.21/1.40  # Proof object generating inferences   : 4
% 0.21/1.40  # Proof object simplifying inferences  : 2
% 0.21/1.40  # Training examples: 0 positive, 0 negative
% 0.21/1.40  # Parsed axioms                        : 115
% 0.21/1.40  # Removed by relevancy pruning/SinE    : 78
% 0.21/1.40  # Initial clauses                      : 108
% 0.21/1.40  # Removed in clause preprocessing      : 4
% 0.21/1.40  # Initial clauses in saturation        : 104
% 0.21/1.40  # Processed clauses                    : 112
% 0.21/1.40  # ...of these trivial                  : 2
% 0.21/1.40  # ...subsumed                          : 6
% 0.21/1.40  # ...remaining for further processing  : 104
% 0.21/1.40  # Other redundant clauses eliminated   : 0
% 0.21/1.40  # Clauses deleted for lack of memory   : 0
% 0.21/1.40  # Backward-subsumed                    : 0
% 0.21/1.40  # Backward-rewritten                   : 0
% 0.21/1.40  # Generated clauses                    : 98
% 0.21/1.40  # ...of the previous two non-trivial   : 89
% 0.21/1.40  # Contextual simplify-reflections      : 0
% 0.21/1.40  # Paramodulations                      : 95
% 0.21/1.40  # Factorizations                       : 0
% 0.21/1.40  # Equation resolutions                 : 3
% 0.21/1.40  # Current number of processed clauses  : 104
% 0.21/1.40  #    Positive orientable unit clauses  : 30
% 0.21/1.40  #    Positive unorientable unit clauses: 0
% 0.21/1.40  #    Negative unit clauses             : 4
% 0.21/1.40  #    Non-unit-clauses                  : 70
% 0.21/1.40  # Current number of unprocessed clauses: 81
% 0.21/1.40  # ...number of literals in the above   : 201
% 0.21/1.40  # Current number of archived formulas  : 0
% 0.21/1.40  # Current number of archived clauses   : 0
% 0.21/1.40  # Clause-clause subsumption calls (NU) : 608
% 0.21/1.40  # Rec. Clause-clause subsumption calls : 112
% 0.21/1.40  # Non-unit clause-clause subsumptions  : 5
% 0.21/1.40  # Unit Clause-clause subsumption calls : 73
% 0.21/1.40  # Rewrite failures with RHS unbound    : 0
% 0.21/1.40  # BW rewrite match attempts            : 0
% 0.21/1.40  # BW rewrite match successes           : 0
% 0.21/1.40  # Condensation attempts                : 0
% 0.21/1.40  # Condensation successes               : 0
% 0.21/1.40  # Termbank termtop insertions          : 10621
% 0.21/1.40  
% 0.21/1.40  # -------------------------------------------------
% 0.21/1.40  # User time                : 0.026 s
% 0.21/1.40  # System time              : 0.003 s
% 0.21/1.40  # Total time               : 0.029 s
% 0.21/1.40  # Maximum resident set size: 3632 pages
%------------------------------------------------------------------------------