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

View Problem - Process Solution

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

% Computer : n013.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:52:55 EDT 2022

% Result   : Theorem 0.24s 1.41s
% Output   : CNFRefutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   25 (   8 unt;   0 def)
%            Number of atoms       :   91 (   0 equ)
%            Maximal formula atoms :    8 (   3 avg)
%            Number of connectives :  105 (  39   ~;  36   |;   8   &)
%                                         (   0 <=>;  22  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-2 aty)
%            Number of variables   :   53 (   3 sgn  30   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(p3,axiom,
    ! [X1] :
      ( ilf_type(X1,set_type)
     => ! [X2] :
          ( ilf_type(X2,set_type)
         => ! [X3] :
              ( ilf_type(X3,set_type)
             => ! [X4] :
                  ( ilf_type(X4,relation_type(X1,X3))
                 => ( subset(domain_of(X4),X2)
                   => ilf_type(X4,relation_type(X2,X3)) ) ) ) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',p3) ).

fof(p22,axiom,
    ! [X1] : ilf_type(X1,set_type),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',p22) ).

fof(prove_relset_1_15,conjecture,
    ! [X1] :
      ( ilf_type(X1,set_type)
     => ! [X2] :
          ( ilf_type(X2,set_type)
         => ! [X3] :
              ( ilf_type(X3,set_type)
             => ! [X4] :
                  ( ilf_type(X4,relation_type(X1,X3))
                 => ( subset(X1,X2)
                   => ilf_type(X4,relation_type(X2,X3)) ) ) ) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',prove_relset_1_15) ).

fof(p1,axiom,
    ! [X1] :
      ( ilf_type(X1,set_type)
     => ! [X2] :
          ( ilf_type(X2,set_type)
         => ! [X3] :
              ( ilf_type(X3,set_type)
             => ( ( subset(X1,X2)
                  & subset(X2,X3) )
               => subset(X1,X3) ) ) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',p1) ).

fof(p2,axiom,
    ! [X1] :
      ( ilf_type(X1,set_type)
     => ! [X2] :
          ( ilf_type(X2,set_type)
         => ! [X3] :
              ( ilf_type(X3,relation_type(X1,X2))
             => ( subset(domain_of(X3),X1)
                & subset(range_of(X3),X2) ) ) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',p2) ).

fof(c_0_5,plain,
    ! [X5,X6,X7,X8] :
      ( ~ ilf_type(X5,set_type)
      | ~ ilf_type(X6,set_type)
      | ~ ilf_type(X7,set_type)
      | ~ ilf_type(X8,relation_type(X5,X7))
      | ~ subset(domain_of(X8),X6)
      | ilf_type(X8,relation_type(X6,X7)) ),
    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)],[p3])])])])]) ).

fof(c_0_6,plain,
    ! [X2] : ilf_type(X2,set_type),
    inference(variable_rename,[status(thm)],[p22]) ).

fof(c_0_7,negated_conjecture,
    ~ ! [X1] :
        ( ilf_type(X1,set_type)
       => ! [X2] :
            ( ilf_type(X2,set_type)
           => ! [X3] :
                ( ilf_type(X3,set_type)
               => ! [X4] :
                    ( ilf_type(X4,relation_type(X1,X3))
                   => ( subset(X1,X2)
                     => ilf_type(X4,relation_type(X2,X3)) ) ) ) ) ),
    inference(assume_negation,[status(cth)],[prove_relset_1_15]) ).

fof(c_0_8,plain,
    ! [X4,X5,X6] :
      ( ~ ilf_type(X4,set_type)
      | ~ ilf_type(X5,set_type)
      | ~ ilf_type(X6,set_type)
      | ~ subset(X4,X5)
      | ~ subset(X5,X6)
      | subset(X4,X6) ),
    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)],[p1])])])])]) ).

fof(c_0_9,plain,
    ! [X4,X5,X6] :
      ( ( subset(domain_of(X6),X4)
        | ~ ilf_type(X6,relation_type(X4,X5))
        | ~ ilf_type(X5,set_type)
        | ~ ilf_type(X4,set_type) )
      & ( subset(range_of(X6),X5)
        | ~ ilf_type(X6,relation_type(X4,X5))
        | ~ ilf_type(X5,set_type)
        | ~ ilf_type(X4,set_type) ) ),
    inference(distribute,[status(thm)],[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)],[p2])])])])])]) ).

cnf(c_0_10,plain,
    ( ilf_type(X1,relation_type(X2,X3))
    | ~ subset(domain_of(X1),X2)
    | ~ ilf_type(X1,relation_type(X4,X3))
    | ~ ilf_type(X3,set_type)
    | ~ ilf_type(X2,set_type)
    | ~ ilf_type(X4,set_type) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_11,plain,
    ilf_type(X1,set_type),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

fof(c_0_12,negated_conjecture,
    ( ilf_type(esk10_0,set_type)
    & ilf_type(esk11_0,set_type)
    & ilf_type(esk12_0,set_type)
    & ilf_type(esk13_0,relation_type(esk10_0,esk12_0))
    & subset(esk10_0,esk11_0)
    & ~ ilf_type(esk13_0,relation_type(esk11_0,esk12_0)) ),
    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_7])])])])]) ).

cnf(c_0_13,plain,
    ( subset(X1,X2)
    | ~ subset(X3,X2)
    | ~ subset(X1,X3)
    | ~ ilf_type(X2,set_type)
    | ~ ilf_type(X3,set_type)
    | ~ ilf_type(X1,set_type) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_14,plain,
    ( subset(domain_of(X3),X1)
    | ~ ilf_type(X1,set_type)
    | ~ ilf_type(X2,set_type)
    | ~ ilf_type(X3,relation_type(X1,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_15,plain,
    ( ilf_type(X1,relation_type(X2,X3))
    | ~ subset(domain_of(X1),X2)
    | ~ ilf_type(X1,relation_type(X4,X3)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_11]),c_0_11])]) ).

cnf(c_0_16,negated_conjecture,
    ilf_type(esk13_0,relation_type(esk10_0,esk12_0)),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_17,plain,
    ( subset(X1,X2)
    | ~ subset(X3,X2)
    | ~ subset(X1,X3) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_11]),c_0_11]),c_0_11])]) ).

cnf(c_0_18,negated_conjecture,
    subset(esk10_0,esk11_0),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_19,plain,
    ( subset(domain_of(X1),X2)
    | ~ ilf_type(X1,relation_type(X2,X3)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_11]),c_0_11])]) ).

cnf(c_0_20,negated_conjecture,
    ( ilf_type(esk13_0,relation_type(X1,esk12_0))
    | ~ subset(domain_of(esk13_0),X1) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_21,negated_conjecture,
    ( subset(X1,esk11_0)
    | ~ subset(X1,esk10_0) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_22,negated_conjecture,
    subset(domain_of(esk13_0),esk10_0),
    inference(spm,[status(thm)],[c_0_19,c_0_16]) ).

cnf(c_0_23,negated_conjecture,
    ~ ilf_type(esk13_0,relation_type(esk11_0,esk12_0)),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_24,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]),c_0_23]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SET653+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.13  % Command  : run_ET %s %d
% 0.13/0.34  % Computer : n013.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sun Jul 10 23:00:59 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.24/1.41  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.41  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.41  # Preprocessing time       : 0.015 s
% 0.24/1.41  
% 0.24/1.41  # Failure: Out of unprocessed clauses!
% 0.24/1.41  # OLD status GaveUp
% 0.24/1.41  # Parsed axioms                        : 23
% 0.24/1.41  # Removed by relevancy pruning/SinE    : 16
% 0.24/1.41  # Initial clauses                      : 17
% 0.24/1.41  # Removed in clause preprocessing      : 0
% 0.24/1.41  # Initial clauses in saturation        : 17
% 0.24/1.41  # Processed clauses                    : 33
% 0.24/1.41  # ...of these trivial                  : 5
% 0.24/1.41  # ...subsumed                          : 5
% 0.24/1.41  # ...remaining for further processing  : 23
% 0.24/1.41  # Other redundant clauses eliminated   : 0
% 0.24/1.41  # Clauses deleted for lack of memory   : 0
% 0.24/1.41  # Backward-subsumed                    : 0
% 0.24/1.41  # Backward-rewritten                   : 0
% 0.24/1.41  # Generated clauses                    : 21
% 0.24/1.41  # ...of the previous two non-trivial   : 16
% 0.24/1.41  # Contextual simplify-reflections      : 3
% 0.24/1.41  # Paramodulations                      : 21
% 0.24/1.41  # Factorizations                       : 0
% 0.24/1.41  # Equation resolutions                 : 0
% 0.24/1.41  # Current number of processed clauses  : 23
% 0.24/1.41  #    Positive orientable unit clauses  : 5
% 0.24/1.41  #    Positive unorientable unit clauses: 0
% 0.24/1.41  #    Negative unit clauses             : 1
% 0.24/1.41  #    Non-unit-clauses                  : 17
% 0.24/1.41  # Current number of unprocessed clauses: 0
% 0.24/1.41  # ...number of literals in the above   : 0
% 0.24/1.41  # Current number of archived formulas  : 0
% 0.24/1.41  # Current number of archived clauses   : 0
% 0.24/1.41  # Clause-clause subsumption calls (NU) : 44
% 0.24/1.41  # Rec. Clause-clause subsumption calls : 33
% 0.24/1.41  # Non-unit clause-clause subsumptions  : 8
% 0.24/1.41  # Unit Clause-clause subsumption calls : 0
% 0.24/1.41  # Rewrite failures with RHS unbound    : 0
% 0.24/1.41  # BW rewrite match attempts            : 1
% 0.24/1.41  # BW rewrite match successes           : 0
% 0.24/1.41  # Condensation attempts                : 0
% 0.24/1.41  # Condensation successes               : 0
% 0.24/1.41  # Termbank termtop insertions          : 1737
% 0.24/1.41  
% 0.24/1.41  # -------------------------------------------------
% 0.24/1.41  # User time                : 0.013 s
% 0.24/1.41  # System time              : 0.003 s
% 0.24/1.41  # Total time               : 0.016 s
% 0.24/1.41  # Maximum resident set size: 2704 pages
% 0.24/1.41  # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.24/1.41  # Preprocessing time       : 0.016 s
% 0.24/1.41  
% 0.24/1.41  # Proof found!
% 0.24/1.41  # SZS status Theorem
% 0.24/1.41  # SZS output start CNFRefutation
% See solution above
% 0.24/1.41  # Proof object total steps             : 25
% 0.24/1.41  # Proof object clause steps            : 14
% 0.24/1.41  # Proof object formula steps           : 11
% 0.24/1.41  # Proof object conjectures             : 10
% 0.24/1.41  # Proof object clause conjectures      : 7
% 0.24/1.41  # Proof object formula conjectures     : 3
% 0.24/1.41  # Proof object initial clauses used    : 7
% 0.24/1.41  # Proof object initial formulas used   : 5
% 0.24/1.41  # Proof object generating inferences   : 4
% 0.24/1.41  # Proof object simplifying inferences  : 14
% 0.24/1.41  # Training examples: 0 positive, 0 negative
% 0.24/1.41  # Parsed axioms                        : 23
% 0.24/1.41  # Removed by relevancy pruning/SinE    : 0
% 0.24/1.41  # Initial clauses                      : 46
% 0.24/1.41  # Removed in clause preprocessing      : 0
% 0.24/1.41  # Initial clauses in saturation        : 46
% 0.24/1.41  # Processed clauses                    : 80
% 0.24/1.41  # ...of these trivial                  : 12
% 0.24/1.41  # ...subsumed                          : 6
% 0.24/1.41  # ...remaining for further processing  : 62
% 0.24/1.41  # Other redundant clauses eliminated   : 0
% 0.24/1.41  # Clauses deleted for lack of memory   : 0
% 0.24/1.41  # Backward-subsumed                    : 0
% 0.24/1.41  # Backward-rewritten                   : 3
% 0.24/1.41  # Generated clauses                    : 79
% 0.24/1.41  # ...of the previous two non-trivial   : 63
% 0.24/1.41  # Contextual simplify-reflections      : 2
% 0.24/1.41  # Paramodulations                      : 79
% 0.24/1.41  # Factorizations                       : 0
% 0.24/1.41  # Equation resolutions                 : 0
% 0.24/1.41  # Current number of processed clauses  : 59
% 0.24/1.41  #    Positive orientable unit clauses  : 12
% 0.24/1.41  #    Positive unorientable unit clauses: 0
% 0.24/1.41  #    Negative unit clauses             : 2
% 0.24/1.41  #    Non-unit-clauses                  : 45
% 0.24/1.41  # Current number of unprocessed clauses: 29
% 0.24/1.41  # ...number of literals in the above   : 60
% 0.24/1.41  # Current number of archived formulas  : 0
% 0.24/1.41  # Current number of archived clauses   : 3
% 0.24/1.41  # Clause-clause subsumption calls (NU) : 127
% 0.24/1.41  # Rec. Clause-clause subsumption calls : 113
% 0.24/1.41  # Non-unit clause-clause subsumptions  : 8
% 0.24/1.41  # Unit Clause-clause subsumption calls : 8
% 0.24/1.41  # Rewrite failures with RHS unbound    : 0
% 0.24/1.41  # BW rewrite match attempts            : 9
% 0.24/1.41  # BW rewrite match successes           : 3
% 0.24/1.41  # Condensation attempts                : 0
% 0.24/1.41  # Condensation successes               : 0
% 0.24/1.41  # Termbank termtop insertions          : 4616
% 0.24/1.41  
% 0.24/1.41  # -------------------------------------------------
% 0.24/1.41  # User time                : 0.018 s
% 0.24/1.41  # System time              : 0.001 s
% 0.24/1.41  # Total time               : 0.019 s
% 0.24/1.41  # Maximum resident set size: 2984 pages
%------------------------------------------------------------------------------