↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SET662+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n019.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 02:14:55 PM UTC 2026

% Result   : Theorem 0.02s 0.42s
% Output   : CNFRefutation 0.02s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   39 (   9 unt;   0 def)
%            Number of atoms       :  147 (   0 equ)
%            Maximal formula atoms :   18 (   3 avg)
%            Number of connectives :  179 (  71   ~;  65   |;  13   &)
%                                         (   6 <=>;  24  =>;   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    :   11 (  11 usr;   4 con; 0-2 aty)
%            Number of variables   :   70 (   7 sgn  39   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(p11,axiom,
    ! [X1] :
      ( ilf_type(X1,set_type)
     => ( empty(X1)
      <=> ! [X2] :
            ( ilf_type(X2,set_type)
           => ~ member(X2,X1) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p11) ).

fof(p14,axiom,
    ! [X1] :
      ( ilf_type(X1,set_type)
     => ! [X2] :
          ( ( ilf_type(X2,set_type)
            & ~ empty(X2) )
         => ( ilf_type(X1,member_type(X2))
          <=> member(X1,X2) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p14) ).

fof(p20,axiom,
    ! [X1] : ilf_type(X1,set_type),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p20) ).

fof(p4,axiom,
    ! [X1] :
      ( ilf_type(X1,set_type)
     => ~ member(X1,empty_set) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',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/sandbox2/benchmark/theBenchmark.p',p7) ).

fof(p12,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/sandbox2/benchmark/theBenchmark.p',p12) ).

fof(p2,axiom,
    ! [X1] :
      ( ilf_type(X1,set_type)
     => ! [X2] :
          ( ilf_type(X2,set_type)
         => ( ! [X4] :
                ( ilf_type(X4,relation_type(X1,X2))
               => ilf_type(X4,subset_type(cross_product(X1,X2))) )
            & ! [X3] :
                ( ilf_type(X3,subset_type(cross_product(X1,X2)))
               => ilf_type(X3,relation_type(X1,X2)) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2) ).

fof(prove_relset_1_25,conjecture,
    ! [X1] :
      ( ilf_type(X1,set_type)
     => ! [X2] :
          ( ilf_type(X2,set_type)
         => ilf_type(empty_set,relation_type(X1,X2)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_relset_1_25) ).

fof(c_0_8,plain,
    ! [X1] :
      ( ilf_type(X1,set_type)
     => ( empty(X1)
      <=> ! [X2] :
            ( ilf_type(X2,set_type)
           => ~ member(X2,X1) ) ) ),
    inference(fof_simplification,[status(thm)],[p11]) ).

fof(c_0_9,plain,
    ! [X1] :
      ( ilf_type(X1,set_type)
     => ! [X2] :
          ( ( ilf_type(X2,set_type)
            & ~ empty(X2) )
         => ( ilf_type(X1,member_type(X2))
          <=> member(X1,X2) ) ) ),
    inference(fof_simplification,[status(thm)],[p14]) ).

fof(c_0_10,plain,
    ! [X27,X28] :
      ( ( ~ ilf_type(X27,set_type)
        | empty(X27)
        | member(esk5_1(X27),X27) )
      & ( ~ ilf_type(X27,set_type)
        | empty(X27)
        | ilf_type(esk5_1(X27),set_type) )
      & ( ~ ilf_type(X27,set_type)
        | ~ member(X28,X27)
        | ~ ilf_type(X28,set_type)
        | ~ empty(X27) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])])]) ).

fof(c_0_11,plain,
    ! [X7] : ilf_type(X7,set_type),
    inference(variable_rename,[status(thm)],[p20]) ).

fof(c_0_12,plain,
    ! [X1] :
      ( ilf_type(X1,set_type)
     => ~ member(X1,empty_set) ),
    inference(fof_simplification,[status(thm)],[p4]) ).

fof(c_0_13,plain,
    ! [X16,X17] :
      ( ( ~ ilf_type(X16,set_type)
        | ~ ilf_type(X17,set_type)
        | ilf_type(X17,subset_type(X16))
        | ~ ilf_type(X17,member_type(power_set(X16))) )
      & ( ~ ilf_type(X16,set_type)
        | ~ ilf_type(X17,set_type)
        | ilf_type(X17,member_type(power_set(X16)))
        | ~ ilf_type(X17,subset_type(X16)) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p7])])])])]) ).

fof(c_0_14,plain,
    ! [X30,X31] :
      ( ( ~ ilf_type(X30,set_type)
        | ~ ilf_type(X31,set_type)
        | empty(X31)
        | ilf_type(X30,member_type(X31))
        | ~ member(X30,X31) )
      & ( ~ ilf_type(X30,set_type)
        | ~ ilf_type(X31,set_type)
        | empty(X31)
        | member(X30,X31)
        | ~ ilf_type(X30,member_type(X31)) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])]) ).

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

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

fof(c_0_17,plain,
    ! [X15] :
      ( ~ member(X15,empty_set)
      | ~ ilf_type(X15,set_type) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])]) ).

fof(c_0_18,plain,
    ! [X34,X35,X36] :
      ( ( ~ ilf_type(X34,set_type)
        | ~ ilf_type(X35,set_type)
        | member(X34,power_set(X35))
        | ~ member(esk7_2(X34,X35),X35) )
      & ( ~ ilf_type(X34,set_type)
        | ~ ilf_type(X35,set_type)
        | member(X34,power_set(X35))
        | member(esk7_2(X34,X35),X34) )
      & ( ~ ilf_type(X34,set_type)
        | ~ ilf_type(X35,set_type)
        | member(X34,power_set(X35))
        | ilf_type(esk7_2(X34,X35),set_type) )
      & ( ~ ilf_type(X34,set_type)
        | ~ ilf_type(X35,set_type)
        | member(X36,X35)
        | ~ member(X36,X34)
        | ~ ilf_type(X36,set_type)
        | ~ member(X34,power_set(X35)) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p12])])])])])]) ).

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

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

cnf(c_0_21,plain,
    ( ~ member(X2,X1)
    | ~ empty(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_16])]) ).

cnf(c_0_22,plain,
    ( ~ member(X1,empty_set)
    | ~ ilf_type(X1,set_type) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_23,plain,
    ( ~ ilf_type(X1,set_type)
    | ~ ilf_type(X2,set_type)
    | member(X1,power_set(X2))
    | member(esk7_2(X1,X2),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

fof(c_0_24,plain,
    ! [X8,X9,X10,X11] :
      ( ( ~ ilf_type(X8,set_type)
        | ~ ilf_type(X9,set_type)
        | ilf_type(X11,subset_type(cross_product(X8,X9)))
        | ~ ilf_type(X11,relation_type(X8,X9)) )
      & ( ~ ilf_type(X8,set_type)
        | ~ ilf_type(X9,set_type)
        | ilf_type(X10,relation_type(X8,X9))
        | ~ ilf_type(X10,subset_type(cross_product(X8,X9))) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p2])])])])]) ).

cnf(c_0_25,plain,
    ( ~ ilf_type(X1,member_type(power_set(X2)))
    | ilf_type(X1,subset_type(X2)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_16]),c_0_16])]) ).

cnf(c_0_26,plain,
    ( ~ member(X1,X2)
    | ilf_type(X1,member_type(X2)) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_16]),c_0_16])]),c_0_21]) ).

cnf(c_0_27,plain,
    ~ member(X1,empty_set),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_16])]) ).

cnf(c_0_28,plain,
    ( member(X1,power_set(X2))
    | member(esk7_2(X1,X2),X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_16]),c_0_16])]) ).

fof(c_0_29,negated_conjecture,
    ~ ! [X1] :
        ( ilf_type(X1,set_type)
       => ! [X2] :
            ( ilf_type(X2,set_type)
           => ilf_type(empty_set,relation_type(X1,X2)) ) ),
    inference(assume_negation,[status(cth)],[prove_relset_1_25]) ).

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

cnf(c_0_31,plain,
    ( ~ member(X1,power_set(X2))
    | ilf_type(X1,subset_type(X2)) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_32,plain,
    member(empty_set,power_set(X1)),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

fof(c_0_33,negated_conjecture,
    ( ~ ilf_type(empty_set,relation_type(esk1_0,esk2_0))
    & ilf_type(esk2_0,set_type)
    & ilf_type(esk1_0,set_type) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_29])])])]) ).

cnf(c_0_34,plain,
    ( ~ ilf_type(X1,subset_type(cross_product(X2,X3)))
    | ilf_type(X1,relation_type(X2,X3)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_16]),c_0_16])]) ).

cnf(c_0_35,plain,
    ilf_type(empty_set,subset_type(X1)),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_36,negated_conjecture,
    ~ ilf_type(empty_set,relation_type(esk1_0,esk2_0)),
    inference(split_conjunct,[status(thm)],[c_0_33]) ).

cnf(c_0_37,plain,
    ilf_type(empty_set,relation_type(X1,X2)),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_38,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SET662+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.35  % Computer : n019.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Mon Sep 21 05:32:06 UTC 2026
% 0.02/0.36  % CPUTime  : 
% 0.02/0.36  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.02/0.40  Running first-order theorem proving
% 0.02/0.40  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.02/0.42  % Version: 3.5.1
% 0.02/0.42  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.02/0.42  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.02/0.42  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.02/0.42  % Starting new_bool_3 with 300s (1) cores
% 0.02/0.42  % Starting new_bool_1 with 300s (1) cores
% 0.02/0.42  % Starting sh5l with 300s (1) cores
% 0.02/0.42  % new_bool_3 with pid 1781234 completed with status 0
% 0.02/0.42  % Result found by new_bool_3
% 0.02/0.42  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.02/0.42  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.02/0.42  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.02/0.42  % Starting new_bool_3 with 300s (1) cores
% 0.02/0.42  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.02/0.42  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.02/0.42  % Search class: FGHSF-FFMS21-SFFFFFNN
% 0.02/0.42  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.02/0.42  % Starting SubtermCWHack with 31s (1) cores
% 0.02/0.42  % SubtermCWHack with pid 1781241 completed with status 0
% 0.02/0.42  % Result found by SubtermCWHack
% 0.02/0.42  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.02/0.42  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.02/0.42  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.02/0.42  % Starting new_bool_3 with 300s (1) cores
% 0.02/0.42  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.02/0.42  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.02/0.42  % Search class: FGHSF-FFMS21-SFFFFFNN
% 0.02/0.42  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.02/0.42  % Starting SubtermCWHack with 31s (1) cores
% 0.02/0.42  % Preprocessing time       : 0.001 s
% 0.02/0.42  
% 0.02/0.42  % Proof found!
% 0.02/0.42  % SZS status Theorem
% 0.02/0.42  % SZS output start CNFRefutation
% See solution above
% 0.02/0.42  % Parsed axioms                        : 22
% 0.02/0.42  % Removed by relevancy pruning/SinE    : 2
% 0.02/0.42  % Initial clauses                      : 39
% 0.02/0.42  % Removed in clause preprocessing      : 0
% 0.02/0.42  % Initial clauses in saturation        : 39
% 0.02/0.42  % Processed clauses                    : 100
% 0.02/0.42  % ...of these trivial                  : 8
% 0.02/0.42  % ...subsumed                          : 17
% 0.02/0.42  % ...remaining for further processing  : 75
% 0.02/0.42  % Other redundant clauses eliminated   : 1
% 0.02/0.42  % Clauses deleted for lack of memory   : 0
% 0.02/0.42  % Backward-subsumed                    : 0
% 0.02/0.42  % Backward-rewritten                   : 4
% 0.02/0.42  % Generated clauses                    : 128
% 0.02/0.42  % ...of the previous two non-redundant : 108
% 0.02/0.42  % ...aggressively subsumed             : 0
% 0.02/0.42  % Contextual simplify-reflections      : 1
% 0.02/0.42  % Paramodulations                      : 127
% 0.02/0.42  % Factorizations                       : 0
% 0.02/0.42  % NegExts                              : 0
% 0.02/0.42  % Equation resolutions                 : 1
% 0.02/0.42  % Disequality decompositions           : 0
% 0.02/0.42  % Total rewrite steps                  : 80
% 0.02/0.42  % ...of those cached                   : 58
% 0.02/0.42  % Propositional unsat checks           : 0
% 0.02/0.42  %    Propositional check models        : 0
% 0.02/0.42  %    Propositional check unsatisfiable : 0
% 0.02/0.42  %    Propositional clauses             : 0
% 0.02/0.42  %    Propositional clauses after purity: 0
% 0.02/0.42  %    Propositional unsat core size     : 0
% 0.02/0.42  %    Propositional preprocessing time  : 0.000
% 0.02/0.42  %    Propositional encoding time       : 0.000
% 0.02/0.42  %    Propositional solver time         : 0.000
% 0.02/0.42  %    Success case prop preproc time    : 0.000
% 0.02/0.42  %    Success case prop encoding time   : 0.000
% 0.02/0.42  %    Success case prop solver time     : 0.000
% 0.02/0.42  % Current number of processed clauses  : 71
% 0.02/0.42  %    Positive orientable unit clauses  : 21
% 0.02/0.42  %    Positive unorientable unit clauses: 0
% 0.02/0.42  %    Negative unit clauses             : 2
% 0.02/0.42  %    Non-unit-clauses                  : 48
% 0.02/0.42  % Current number of unprocessed clauses: 47
% 0.02/0.42  % ...number of literals in the above   : 102
% 0.02/0.42  % Current number of archived formulas  : 0
% 0.02/0.42  % Current number of archived clauses   : 4
% 0.02/0.42  % Clause-clause subsumption calls (NU) : 157
% 0.02/0.42  % Rec. Clause-clause subsumption calls : 144
% 0.02/0.42  % Non-unit clause-clause subsumptions  : 11
% 0.02/0.42  % Unit Clause-clause subsumption calls : 49
% 0.02/0.42  % Rewrite failures with RHS unbound    : 0
% 0.02/0.42  % BW rewrite match attempts            : 18
% 0.02/0.42  % BW rewrite match successes           : 4
% 0.02/0.42  % Condensation attempts                : 0
% 0.02/0.42  % Condensation successes               : 0
% 0.02/0.42  % Termbank termtop insertions          : 4949
% 0.02/0.42  % Search garbage collected termcells   : 804
% 0.02/0.42  
% 0.02/0.42  % -------------------------------------------------
% 0.02/0.42  % User time                : 0.009 s
% 0.02/0.42  % System time              : 0.001 s
% 0.02/0.42  % Total time               : 0.011 s
% 0.02/0.42  % Maximum resident set size: 3656 pages
% 0.02/0.42  
% 0.02/0.42  % -------------------------------------------------
% 0.02/0.42  % User time                : 0.012 s
% 0.02/0.42  % System time              : 0.005 s
% 0.02/0.42  % Total time               : 0.017 s
% 0.02/0.42  % Maximum resident set size: 4864 pages
% 0.02/0.42  % E exiting
%------------------------------------------------------------------------------