TSTP Solution File: SET788+1 by ET---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : SET788+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n004.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 : Tue Jul 19 00:54:22 EDT 2022

% Result   : Theorem 0.25s 1.44s
% Output   : CNFRefutation 0.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   20 (   5 unt;   0 def)
%            Number of atoms       :   62 (   0 equ)
%            Maximal formula atoms :   16 (   3 avg)
%            Number of connectives :   65 (  23   ~;  29   |;   5   &)
%                                         (   6 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   31 (   3 sgn  16   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(prove_this,conjecture,
    ( ! [X1,X2] :
        ( equalish(X1,X2)
      <=> ! [X3] :
            ( a_member_of(X3,X1)
          <=> a_member_of(X3,X2) ) )
   => ! [X1,X2] :
        ( equalish(X1,X2)
      <=> equalish(X2,X1) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',prove_this) ).

fof(c_0_1,negated_conjecture,
    ~ ( ! [X1,X2] :
          ( equalish(X1,X2)
        <=> ! [X3] :
              ( a_member_of(X3,X1)
            <=> a_member_of(X3,X2) ) )
     => ! [X1,X2] :
          ( equalish(X1,X2)
        <=> equalish(X2,X1) ) ),
    inference(assume_negation,[status(cth)],[prove_this]) ).

fof(c_0_2,negated_conjecture,
    ! [X4,X5,X6,X6,X4,X5] :
      ( ( ~ a_member_of(X6,X4)
        | a_member_of(X6,X5)
        | ~ equalish(X4,X5) )
      & ( ~ a_member_of(X6,X5)
        | a_member_of(X6,X4)
        | ~ equalish(X4,X5) )
      & ( ~ a_member_of(esk1_2(X4,X5),X4)
        | ~ a_member_of(esk1_2(X4,X5),X5)
        | equalish(X4,X5) )
      & ( a_member_of(esk1_2(X4,X5),X4)
        | a_member_of(esk1_2(X4,X5),X5)
        | equalish(X4,X5) )
      & ( ~ equalish(esk2_0,esk3_0)
        | ~ equalish(esk3_0,esk2_0) )
      & ( equalish(esk2_0,esk3_0)
        | equalish(esk3_0,esk2_0) ) ),
    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)],[c_0_1])])])])])])]) ).

cnf(c_0_3,negated_conjecture,
    ( a_member_of(X3,X2)
    | ~ equalish(X1,X2)
    | ~ a_member_of(X3,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_4,negated_conjecture,
    ( equalish(esk3_0,esk2_0)
    | equalish(esk2_0,esk3_0) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_5,negated_conjecture,
    ( a_member_of(X3,X1)
    | ~ equalish(X1,X2)
    | ~ a_member_of(X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_6,negated_conjecture,
    ( a_member_of(X1,esk3_0)
    | ~ a_member_of(X1,esk2_0) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4]),c_0_5]) ).

cnf(c_0_7,negated_conjecture,
    ( equalish(X1,X2)
    | a_member_of(esk1_2(X1,X2),X2)
    | a_member_of(esk1_2(X1,X2),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_8,negated_conjecture,
    ( equalish(X1,X2)
    | ~ a_member_of(esk1_2(X1,X2),X2)
    | ~ a_member_of(esk1_2(X1,X2),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_9,negated_conjecture,
    ( a_member_of(X1,esk2_0)
    | ~ a_member_of(X1,esk3_0) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_4]),c_0_3]) ).

cnf(c_0_10,negated_conjecture,
    ( a_member_of(esk1_2(X1,esk2_0),esk3_0)
    | a_member_of(esk1_2(X1,esk2_0),X1)
    | equalish(X1,esk2_0) ),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_11,negated_conjecture,
    ( equalish(X1,esk2_0)
    | ~ a_member_of(esk1_2(X1,esk2_0),esk3_0)
    | ~ a_member_of(esk1_2(X1,esk2_0),X1) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_12,negated_conjecture,
    ( a_member_of(esk1_2(esk3_0,esk2_0),esk3_0)
    | equalish(esk3_0,esk2_0) ),
    inference(ef,[status(thm)],[c_0_10]) ).

cnf(c_0_13,negated_conjecture,
    ( ~ equalish(esk3_0,esk2_0)
    | ~ equalish(esk2_0,esk3_0) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_14,negated_conjecture,
    equalish(esk3_0,esk2_0),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_12]) ).

cnf(c_0_15,negated_conjecture,
    ( a_member_of(esk1_2(esk2_0,X1),esk3_0)
    | a_member_of(esk1_2(esk2_0,X1),X1)
    | equalish(esk2_0,X1) ),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_16,negated_conjecture,
    ~ equalish(esk2_0,esk3_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]) ).

cnf(c_0_17,negated_conjecture,
    a_member_of(esk1_2(esk2_0,esk3_0),esk3_0),
    inference(sr,[status(thm)],[inference(ef,[status(thm)],[c_0_15]),c_0_16]) ).

cnf(c_0_18,negated_conjecture,
    ~ a_member_of(esk1_2(esk2_0,esk3_0),esk2_0),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_17]),c_0_16]) ).

cnf(c_0_19,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_9]),c_0_17])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : SET788+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.14  % Command  : run_ET %s %d
% 0.13/0.35  % Computer : n004.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Mon Jul 11 06:34:52 EDT 2022
% 0.13/0.36  % CPUTime  : 
% 0.25/1.44  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.44  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.44  # Preprocessing time       : 0.014 s
% 0.25/1.44  
% 0.25/1.44  # Proof found!
% 0.25/1.44  # SZS status Theorem
% 0.25/1.44  # SZS output start CNFRefutation
% See solution above
% 0.25/1.44  # Proof object total steps             : 20
% 0.25/1.44  # Proof object clause steps            : 17
% 0.25/1.44  # Proof object formula steps           : 3
% 0.25/1.44  # Proof object conjectures             : 20
% 0.25/1.44  # Proof object clause conjectures      : 17
% 0.25/1.44  # Proof object formula conjectures     : 3
% 0.25/1.44  # Proof object initial clauses used    : 6
% 0.25/1.44  # Proof object initial formulas used   : 1
% 0.25/1.44  # Proof object generating inferences   : 10
% 0.25/1.44  # Proof object simplifying inferences  : 9
% 0.25/1.44  # Training examples: 0 positive, 0 negative
% 0.25/1.44  # Parsed axioms                        : 1
% 0.25/1.44  # Removed by relevancy pruning/SinE    : 0
% 0.25/1.44  # Initial clauses                      : 6
% 0.25/1.44  # Removed in clause preprocessing      : 0
% 0.25/1.44  # Initial clauses in saturation        : 6
% 0.25/1.44  # Processed clauses                    : 24
% 0.25/1.44  # ...of these trivial                  : 4
% 0.25/1.44  # ...subsumed                          : 2
% 0.25/1.44  # ...remaining for further processing  : 18
% 0.25/1.44  # Other redundant clauses eliminated   : 0
% 0.25/1.44  # Clauses deleted for lack of memory   : 0
% 0.25/1.44  # Backward-subsumed                    : 0
% 0.25/1.44  # Backward-rewritten                   : 4
% 0.25/1.44  # Generated clauses                    : 29
% 0.25/1.44  # ...of the previous two non-trivial   : 21
% 0.25/1.44  # Contextual simplify-reflections      : 4
% 0.25/1.44  # Paramodulations                      : 23
% 0.25/1.44  # Factorizations                       : 6
% 0.25/1.44  # Equation resolutions                 : 0
% 0.25/1.44  # Current number of processed clauses  : 14
% 0.25/1.44  #    Positive orientable unit clauses  : 3
% 0.25/1.44  #    Positive unorientable unit clauses: 0
% 0.25/1.44  #    Negative unit clauses             : 2
% 0.25/1.44  #    Non-unit-clauses                  : 9
% 0.25/1.44  # Current number of unprocessed clauses: 2
% 0.25/1.44  # ...number of literals in the above   : 4
% 0.25/1.44  # Current number of archived formulas  : 0
% 0.25/1.44  # Current number of archived clauses   : 4
% 0.25/1.44  # Clause-clause subsumption calls (NU) : 23
% 0.25/1.44  # Rec. Clause-clause subsumption calls : 17
% 0.25/1.44  # Non-unit clause-clause subsumptions  : 6
% 0.25/1.44  # Unit Clause-clause subsumption calls : 8
% 0.25/1.44  # Rewrite failures with RHS unbound    : 0
% 0.25/1.44  # BW rewrite match attempts            : 8
% 0.25/1.44  # BW rewrite match successes           : 2
% 0.25/1.44  # Condensation attempts                : 0
% 0.25/1.44  # Condensation successes               : 0
% 0.25/1.44  # Termbank termtop insertions          : 880
% 0.25/1.44  
% 0.25/1.44  # -------------------------------------------------
% 0.25/1.44  # User time                : 0.014 s
% 0.25/1.44  # System time              : 0.001 s
% 0.25/1.44  # Total time               : 0.015 s
% 0.25/1.44  # Maximum resident set size: 2756 pages
%------------------------------------------------------------------------------