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

View Problem - Process Solution

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

% Computer : n029.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:55:54 EDT 2022

% Result   : Theorem 0.21s 1.40s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   21 (   3 unt;   0 def)
%            Number of atoms       :   73 (  19 equ)
%            Maximal formula atoms :   10 (   3 avg)
%            Number of connectives :   83 (  31   ~;  28   |;  17   &)
%                                         (   2 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   1 con; 0-2 aty)
%            Number of variables   :   51 (   4 sgn  36   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t2_funct_1,conjecture,
    ! [X1] :
      ( ( ! [X2] :
            ~ ( in(X2,X1)
              & ! [X3,X4] : ordered_pair(X3,X4) != X2 )
        & ! [X2,X3,X4] :
            ( ( in(ordered_pair(X2,X3),X1)
              & in(ordered_pair(X2,X4),X1) )
           => X3 = X4 ) )
     => ( relation(X1)
        & function(X1) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t2_funct_1) ).

fof(d1_funct_1,axiom,
    ! [X1] :
      ( function(X1)
    <=> ! [X2,X3,X4] :
          ( ( in(ordered_pair(X2,X3),X1)
            & in(ordered_pair(X2,X4),X1) )
         => X3 = X4 ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d1_funct_1) ).

fof(d1_relat_1,axiom,
    ! [X1] :
      ( relation(X1)
    <=> ! [X2] :
          ~ ( in(X2,X1)
            & ! [X3,X4] : X2 != ordered_pair(X3,X4) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d1_relat_1) ).

fof(c_0_3,negated_conjecture,
    ~ ! [X1] :
        ( ( ! [X2] :
              ~ ( in(X2,X1)
                & ! [X3,X4] : ordered_pair(X3,X4) != X2 )
          & ! [X2,X3,X4] :
              ( ( in(ordered_pair(X2,X3),X1)
                & in(ordered_pair(X2,X4),X1) )
             => X3 = X4 ) )
       => ( relation(X1)
          & function(X1) ) ),
    inference(assume_negation,[status(cth)],[t2_funct_1]) ).

fof(c_0_4,negated_conjecture,
    ! [X6,X9,X10,X11] :
      ( ( ~ in(X6,esk1_0)
        | ordered_pair(esk2_1(X6),esk3_1(X6)) = X6 )
      & ( ~ in(ordered_pair(X9,X10),esk1_0)
        | ~ in(ordered_pair(X9,X11),esk1_0)
        | X10 = X11 )
      & ( ~ relation(esk1_0)
        | ~ function(esk1_0) ) ),
    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_3])])])])])]) ).

fof(c_0_5,plain,
    ! [X5,X6,X7,X8,X5] :
      ( ( ~ function(X5)
        | ~ in(ordered_pair(X6,X7),X5)
        | ~ in(ordered_pair(X6,X8),X5)
        | X7 = X8 )
      & ( in(ordered_pair(esk5_1(X5),esk6_1(X5)),X5)
        | function(X5) )
      & ( in(ordered_pair(esk5_1(X5),esk7_1(X5)),X5)
        | function(X5) )
      & ( esk6_1(X5) != esk7_1(X5)
        | function(X5) ) ),
    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)],[d1_funct_1])])])])])])]) ).

cnf(c_0_6,negated_conjecture,
    ( X1 = X2
    | ~ in(ordered_pair(X3,X2),esk1_0)
    | ~ in(ordered_pair(X3,X1),esk1_0) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,plain,
    ( function(X1)
    | in(ordered_pair(esk5_1(X1),esk6_1(X1)),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

fof(c_0_8,plain,
    ! [X5,X6,X5,X10,X11] :
      ( ( ~ relation(X5)
        | ~ in(X6,X5)
        | X6 = ordered_pair(esk10_2(X5,X6),esk11_2(X5,X6)) )
      & ( in(esk12_1(X5),X5)
        | relation(X5) )
      & ( esk12_1(X5) != ordered_pair(X10,X11)
        | relation(X5) ) ),
    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)],[d1_relat_1])])])])])])]) ).

cnf(c_0_9,negated_conjecture,
    ( X1 = esk6_1(esk1_0)
    | function(esk1_0)
    | ~ in(ordered_pair(esk5_1(esk1_0),X1),esk1_0) ),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_10,plain,
    ( function(X1)
    | in(ordered_pair(esk5_1(X1),esk7_1(X1)),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_11,plain,
    ( function(X1)
    | esk6_1(X1) != esk7_1(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_12,plain,
    ( relation(X1)
    | esk12_1(X1) != ordered_pair(X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_13,negated_conjecture,
    ( ordered_pair(esk2_1(X1),esk3_1(X1)) = X1
    | ~ in(X1,esk1_0) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_14,negated_conjecture,
    ( ~ function(esk1_0)
    | ~ relation(esk1_0) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_15,negated_conjecture,
    function(esk1_0),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).

cnf(c_0_16,negated_conjecture,
    ( relation(X1)
    | esk12_1(X1) != X2
    | ~ in(X2,esk1_0) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_17,plain,
    ( relation(X1)
    | in(esk12_1(X1),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_18,negated_conjecture,
    ~ relation(esk1_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]) ).

cnf(c_0_19,negated_conjecture,
    ( relation(X1)
    | esk12_1(X1) != esk12_1(esk1_0) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).

cnf(c_0_20,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_19]),c_0_18]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11  % Problem  : SET988+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.12  % Command  : run_ET %s %d
% 0.12/0.33  % Computer : n029.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Sun Jul 10 15:14:31 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.21/1.40  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.21/1.40  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.21/1.40  # Preprocessing time       : 0.016 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             : 21
% 0.21/1.40  # Proof object clause steps            : 14
% 0.21/1.40  # Proof object formula steps           : 7
% 0.21/1.40  # Proof object conjectures             : 12
% 0.21/1.40  # Proof object clause conjectures      : 9
% 0.21/1.40  # Proof object formula conjectures     : 3
% 0.21/1.40  # Proof object initial clauses used    : 8
% 0.21/1.40  # Proof object initial formulas used   : 3
% 0.21/1.40  # Proof object generating inferences   : 5
% 0.21/1.40  # Proof object simplifying inferences  : 5
% 0.21/1.40  # Training examples: 0 positive, 0 negative
% 0.21/1.40  # Parsed axioms                        : 33
% 0.21/1.40  # Removed by relevancy pruning/SinE    : 11
% 0.21/1.40  # Initial clauses                      : 34
% 0.21/1.40  # Removed in clause preprocessing      : 0
% 0.21/1.40  # Initial clauses in saturation        : 34
% 0.21/1.40  # Processed clauses                    : 78
% 0.21/1.40  # ...of these trivial                  : 2
% 0.21/1.40  # ...subsumed                          : 11
% 0.21/1.40  # ...remaining for further processing  : 65
% 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                   : 8
% 0.21/1.40  # Generated clauses                    : 82
% 0.21/1.40  # ...of the previous two non-trivial   : 77
% 0.21/1.40  # Contextual simplify-reflections      : 3
% 0.21/1.40  # Paramodulations                      : 81
% 0.21/1.40  # Factorizations                       : 0
% 0.21/1.40  # Equation resolutions                 : 1
% 0.21/1.40  # Current number of processed clauses  : 57
% 0.21/1.40  #    Positive orientable unit clauses  : 12
% 0.21/1.40  #    Positive unorientable unit clauses: 0
% 0.21/1.40  #    Negative unit clauses             : 8
% 0.21/1.40  #    Non-unit-clauses                  : 37
% 0.21/1.40  # Current number of unprocessed clauses: 28
% 0.21/1.40  # ...number of literals in the above   : 75
% 0.21/1.40  # Current number of archived formulas  : 0
% 0.21/1.40  # Current number of archived clauses   : 8
% 0.21/1.40  # Clause-clause subsumption calls (NU) : 101
% 0.21/1.40  # Rec. Clause-clause subsumption calls : 89
% 0.21/1.40  # Non-unit clause-clause subsumptions  : 9
% 0.21/1.40  # Unit Clause-clause subsumption calls : 14
% 0.21/1.40  # Rewrite failures with RHS unbound    : 0
% 0.21/1.40  # BW rewrite match attempts            : 4
% 0.21/1.40  # BW rewrite match successes           : 4
% 0.21/1.40  # Condensation attempts                : 0
% 0.21/1.40  # Condensation successes               : 0
% 0.21/1.40  # Termbank termtop insertions          : 2826
% 0.21/1.40  
% 0.21/1.40  # -------------------------------------------------
% 0.21/1.40  # User time                : 0.016 s
% 0.21/1.40  # System time              : 0.004 s
% 0.21/1.40  # Total time               : 0.020 s
% 0.21/1.40  # Maximum resident set size: 2992 pages
%------------------------------------------------------------------------------