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

View Problem - Process Solution

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

% Computer : n021.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:50 EDT 2022

% Result   : Theorem 0.24s 1.42s
% Output   : CNFRefutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   34 (   9 unt;   0 def)
%            Number of atoms       :  134 (   0 equ)
%            Maximal formula atoms :   18 (   3 avg)
%            Number of connectives :  166 (  66   ~;  66   |;  12   &)
%                                         (   4 <=>;  18  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   3 con; 0-2 aty)
%            Number of variables   :   62 (   2 sgn  32   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(p15,axiom,
    ! [X1] :
      ( ilf_type(X1,set_type)
     => ( empty(X1)
      <=> ! [X2] :
            ( ilf_type(X2,set_type)
           => ~ member(X2,X1) ) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',p15) ).

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

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

fof(p13,axiom,
    ! [X1] :
      ( ilf_type(X1,set_type)
     => ! [X2] :
          ( ( ~ empty(X2)
            & ilf_type(X2,set_type) )
         => ( ilf_type(X1,member_type(X2))
          <=> member(X1,X2) ) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',p13) ).

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

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

fof(p7,axiom,
    ! [X1] :
      ( ilf_type(X1,set_type)
     => ! [X2] :
          ( ilf_type(X2,set_type)
         => ( ilf_type(X2,subset_type(X1))
          <=> ilf_type(X2,member_type(power_set(X1))) ) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',p7) ).

fof(c_0_7,plain,
    ! [X3,X4] :
      ( ( ~ empty(X3)
        | ~ ilf_type(X4,set_type)
        | ~ member(X4,X3)
        | ~ ilf_type(X3,set_type) )
      & ( ilf_type(esk6_1(X3),set_type)
        | empty(X3)
        | ~ ilf_type(X3,set_type) )
      & ( member(esk6_1(X3),X3)
        | empty(X3)
        | ~ ilf_type(X3,set_type) ) ),
    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)],[inference(fof_simplification,[status(thm)],[p15])])])])])])])]) ).

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

fof(c_0_9,plain,
    ! [X4,X5,X6] :
      ( ( ~ member(X4,power_set(X5))
        | ~ ilf_type(X6,set_type)
        | ~ member(X6,X4)
        | member(X6,X5)
        | ~ ilf_type(X5,set_type)
        | ~ ilf_type(X4,set_type) )
      & ( ilf_type(esk8_2(X4,X5),set_type)
        | member(X4,power_set(X5))
        | ~ ilf_type(X5,set_type)
        | ~ ilf_type(X4,set_type) )
      & ( member(esk8_2(X4,X5),X4)
        | member(X4,power_set(X5))
        | ~ ilf_type(X5,set_type)
        | ~ ilf_type(X4,set_type) )
      & ( ~ member(esk8_2(X4,X5),X5)
        | member(X4,power_set(X5))
        | ~ ilf_type(X5,set_type)
        | ~ ilf_type(X4,set_type) ) ),
    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)],[p11])])])])])])]) ).

fof(c_0_10,plain,
    ! [X3,X4] :
      ( ( ~ ilf_type(X3,member_type(X4))
        | member(X3,X4)
        | empty(X4)
        | ~ ilf_type(X4,set_type)
        | ~ ilf_type(X3,set_type) )
      & ( ~ member(X3,X4)
        | ilf_type(X3,member_type(X4))
        | empty(X4)
        | ~ ilf_type(X4,set_type)
        | ~ ilf_type(X3,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)],[inference(fof_simplification,[status(thm)],[p13])])])])])])]) ).

cnf(c_0_11,plain,
    ( ~ ilf_type(X1,set_type)
    | ~ member(X2,X1)
    | ~ ilf_type(X2,set_type)
    | ~ empty(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_12,plain,
    ilf_type(X1,set_type),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_13,plain,
    ( member(X1,power_set(X2))
    | ~ ilf_type(X1,set_type)
    | ~ ilf_type(X2,set_type)
    | ~ member(esk8_2(X1,X2),X2) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_14,plain,
    ( member(X1,power_set(X2))
    | member(esk8_2(X1,X2),X1)
    | ~ ilf_type(X1,set_type)
    | ~ ilf_type(X2,set_type) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

fof(c_0_15,negated_conjecture,
    ~ ! [X1] :
        ( ilf_type(X1,set_type)
       => ! [X2] :
            ( ilf_type(X2,set_type)
           => ilf_type(cross_product(X1,X2),relation_type(X1,X2)) ) ),
    inference(assume_negation,[status(cth)],[prove_relset_1_5]) ).

fof(c_0_16,plain,
    ! [X5,X6,X7,X8] :
      ( ( ~ ilf_type(X7,subset_type(cross_product(X5,X6)))
        | ilf_type(X7,relation_type(X5,X6))
        | ~ ilf_type(X6,set_type)
        | ~ ilf_type(X5,set_type) )
      & ( ~ ilf_type(X8,relation_type(X5,X6))
        | ilf_type(X8,subset_type(cross_product(X5,X6)))
        | ~ ilf_type(X6,set_type)
        | ~ ilf_type(X5,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)],[p4])])])])])]) ).

fof(c_0_17,plain,
    ! [X3,X4] :
      ( ( ~ ilf_type(X4,subset_type(X3))
        | ilf_type(X4,member_type(power_set(X3)))
        | ~ ilf_type(X4,set_type)
        | ~ ilf_type(X3,set_type) )
      & ( ~ ilf_type(X4,member_type(power_set(X3)))
        | ilf_type(X4,subset_type(X3))
        | ~ ilf_type(X4,set_type)
        | ~ ilf_type(X3,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)],[p7])])])])])]) ).

cnf(c_0_18,plain,
    ( empty(X2)
    | ilf_type(X1,member_type(X2))
    | ~ ilf_type(X1,set_type)
    | ~ ilf_type(X2,set_type)
    | ~ member(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_19,plain,
    ( ~ empty(X1)
    | ~ member(X2,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12]),c_0_12])]) ).

cnf(c_0_20,plain,
    ( member(X1,power_set(X2))
    | ~ member(esk8_2(X1,X2),X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_12]),c_0_12])]) ).

cnf(c_0_21,plain,
    ( member(esk8_2(X1,X2),X1)
    | member(X1,power_set(X2)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_12]),c_0_12])]) ).

fof(c_0_22,negated_conjecture,
    ( ilf_type(esk1_0,set_type)
    & ilf_type(esk2_0,set_type)
    & ~ ilf_type(cross_product(esk1_0,esk2_0),relation_type(esk1_0,esk2_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_15])])])])]) ).

cnf(c_0_23,plain,
    ( ilf_type(X3,relation_type(X1,X2))
    | ~ ilf_type(X1,set_type)
    | ~ ilf_type(X2,set_type)
    | ~ ilf_type(X3,subset_type(cross_product(X1,X2))) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_24,plain,
    ( ilf_type(X2,subset_type(X1))
    | ~ ilf_type(X1,set_type)
    | ~ ilf_type(X2,set_type)
    | ~ ilf_type(X2,member_type(power_set(X1))) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_25,plain,
    ( ilf_type(X1,member_type(X2))
    | ~ member(X1,X2) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_12]),c_0_12])]),c_0_19]) ).

cnf(c_0_26,plain,
    member(X1,power_set(X1)),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_27,negated_conjecture,
    ~ ilf_type(cross_product(esk1_0,esk2_0),relation_type(esk1_0,esk2_0)),
    inference(split_conjunct,[status(thm)],[c_0_22]) ).

cnf(c_0_28,plain,
    ( ilf_type(X1,relation_type(X2,X3))
    | ~ ilf_type(X1,subset_type(cross_product(X2,X3))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_12]),c_0_12])]) ).

cnf(c_0_29,plain,
    ( ilf_type(X1,subset_type(X2))
    | ~ ilf_type(X1,member_type(power_set(X2))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_12]),c_0_12])]) ).

cnf(c_0_30,plain,
    ilf_type(X1,member_type(power_set(X1))),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_31,negated_conjecture,
    ~ ilf_type(cross_product(esk1_0,esk2_0),subset_type(cross_product(esk1_0,esk2_0))),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_32,plain,
    ilf_type(X1,subset_type(X1)),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_33,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.12  % Problem  : SET643+3 : TPTP v8.1.0. Released v2.2.0.
% 0.05/0.13  % Command  : run_ET %s %d
% 0.13/0.34  % Computer : n021.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 04:05:52 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.24/1.42  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.42  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.42  # Preprocessing time       : 0.019 s
% 0.24/1.42  
% 0.24/1.42  # Proof found!
% 0.24/1.42  # SZS status Theorem
% 0.24/1.42  # SZS output start CNFRefutation
% See solution above
% 0.24/1.42  # Proof object total steps             : 34
% 0.24/1.42  # Proof object clause steps            : 19
% 0.24/1.42  # Proof object formula steps           : 15
% 0.24/1.42  # Proof object conjectures             : 6
% 0.24/1.42  # Proof object clause conjectures      : 3
% 0.24/1.42  # Proof object formula conjectures     : 3
% 0.24/1.42  # Proof object initial clauses used    : 8
% 0.24/1.42  # Proof object initial formulas used   : 7
% 0.24/1.42  # Proof object generating inferences   : 4
% 0.24/1.42  # Proof object simplifying inferences  : 21
% 0.24/1.42  # Training examples: 0 positive, 0 negative
% 0.24/1.42  # Parsed axioms                        : 20
% 0.24/1.42  # Removed by relevancy pruning/SinE    : 0
% 0.24/1.42  # Initial clauses                      : 44
% 0.24/1.42  # Removed in clause preprocessing      : 0
% 0.24/1.42  # Initial clauses in saturation        : 44
% 0.24/1.42  # Processed clauses                    : 50
% 0.24/1.42  # ...of these trivial                  : 13
% 0.24/1.42  # ...subsumed                          : 1
% 0.24/1.42  # ...remaining for further processing  : 36
% 0.24/1.42  # Other redundant clauses eliminated   : 2
% 0.24/1.42  # Clauses deleted for lack of memory   : 0
% 0.24/1.42  # Backward-subsumed                    : 0
% 0.24/1.42  # Backward-rewritten                   : 1
% 0.24/1.42  # Generated clauses                    : 43
% 0.24/1.42  # ...of the previous two non-trivial   : 33
% 0.24/1.42  # Contextual simplify-reflections      : 1
% 0.24/1.42  # Paramodulations                      : 40
% 0.24/1.42  # Factorizations                       : 0
% 0.24/1.42  # Equation resolutions                 : 3
% 0.24/1.42  # Current number of processed clauses  : 35
% 0.24/1.42  #    Positive orientable unit clauses  : 8
% 0.24/1.42  #    Positive unorientable unit clauses: 0
% 0.24/1.42  #    Negative unit clauses             : 2
% 0.24/1.42  #    Non-unit-clauses                  : 25
% 0.24/1.42  # Current number of unprocessed clauses: 27
% 0.24/1.42  # ...number of literals in the above   : 64
% 0.24/1.42  # Current number of archived formulas  : 0
% 0.24/1.42  # Current number of archived clauses   : 1
% 0.24/1.42  # Clause-clause subsumption calls (NU) : 106
% 0.24/1.42  # Rec. Clause-clause subsumption calls : 95
% 0.24/1.42  # Non-unit clause-clause subsumptions  : 2
% 0.24/1.42  # Unit Clause-clause subsumption calls : 11
% 0.24/1.42  # Rewrite failures with RHS unbound    : 0
% 0.24/1.42  # BW rewrite match attempts            : 7
% 0.24/1.42  # BW rewrite match successes           : 1
% 0.24/1.42  # Condensation attempts                : 0
% 0.24/1.42  # Condensation successes               : 0
% 0.24/1.42  # Termbank termtop insertions          : 4224
% 0.24/1.42  
% 0.24/1.42  # -------------------------------------------------
% 0.24/1.42  # User time                : 0.018 s
% 0.24/1.42  # System time              : 0.003 s
% 0.24/1.42  # Total time               : 0.021 s
% 0.24/1.42  # Maximum resident set size: 3060 pages
%------------------------------------------------------------------------------