↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n020.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:24:56 PM UTC 2026

% Result   : Theorem 0.16s 0.71s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   29 (   9 unt;   0 def)
%            Number of atoms       :  123 (  13 equ)
%            Maximal formula atoms :   19 (   4 avg)
%            Number of connectives :  149 (  55   ~;  52   |;  25   &)
%                                         (   5 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-3 aty)
%            Number of variables   :   45 (   0 sgn  25   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t3_yellow19,conjecture,
    ! [X1] :
      ( ( top_str(X1)
        & topological_space(X1)
        & ~ empty_carrier(X1) )
     => ! [X2] :
          ( element(X2,the_carrier(X1))
         => ! [X3] :
              ( in(X3,neighborhood_system(X1,X2))
            <=> point_neighbourhood(X3,X1,X2) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_yellow19) ).

fof(fraenkel_a_2_0_yellow19,axiom,
    ! [X1,X2,X3] :
      ( ( element(X3,the_carrier(X2))
        & top_str(X2)
        & topological_space(X2)
        & ~ empty_carrier(X2) )
     => ( in(X1,a_2_0_yellow19(X2,X3))
      <=> ? [X4] :
            ( X1 = X4
            & point_neighbourhood(X4,X2,X3) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fraenkel_a_2_0_yellow19) ).

fof(d1_yellow19,axiom,
    ! [X1] :
      ( ( top_str(X1)
        & topological_space(X1)
        & ~ empty_carrier(X1) )
     => ! [X2] :
          ( element(X2,the_carrier(X1))
         => neighborhood_system(X1,X2) = a_2_0_yellow19(X1,X2) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_yellow19) ).

fof(c_0_3,negated_conjecture,
    ~ ! [X1] :
        ( ( top_str(X1)
          & topological_space(X1)
          & ~ empty_carrier(X1) )
       => ! [X2] :
            ( element(X2,the_carrier(X1))
           => ! [X3] :
                ( in(X3,neighborhood_system(X1,X2))
              <=> point_neighbourhood(X3,X1,X2) ) ) ),
    inference(assume_negation,[status(cth)],[t3_yellow19]) ).

fof(c_0_4,plain,
    ! [X1,X2,X3] :
      ( ( element(X3,the_carrier(X2))
        & top_str(X2)
        & topological_space(X2)
        & ~ empty_carrier(X2) )
     => ( in(X1,a_2_0_yellow19(X2,X3))
      <=> ? [X4] :
            ( X1 = X4
            & point_neighbourhood(X4,X2,X3) ) ) ),
    inference(fof_simplification,[status(thm)],[fraenkel_a_2_0_yellow19]) ).

fof(c_0_5,plain,
    ! [X1] :
      ( ( top_str(X1)
        & topological_space(X1)
        & ~ empty_carrier(X1) )
     => ! [X2] :
          ( element(X2,the_carrier(X1))
         => neighborhood_system(X1,X2) = a_2_0_yellow19(X1,X2) ) ),
    inference(fof_simplification,[status(thm)],[d1_yellow19]) ).

fof(c_0_6,negated_conjecture,
    ~ ! [X1] :
        ( ( top_str(X1)
          & topological_space(X1)
          & ~ empty_carrier(X1) )
       => ! [X2] :
            ( element(X2,the_carrier(X1))
           => ! [X3] :
                ( in(X3,neighborhood_system(X1,X2))
              <=> point_neighbourhood(X3,X1,X2) ) ) ),
    inference(fof_simplification,[status(thm)],[c_0_3]) ).

fof(c_0_7,plain,
    ! [X93,X94,X95,X97] :
      ( ( ~ element(X95,the_carrier(X94))
        | ~ top_str(X94)
        | ~ topological_space(X94)
        | empty_carrier(X94)
        | in(X93,a_2_0_yellow19(X94,X95))
        | X93 != X97
        | ~ point_neighbourhood(X97,X94,X95) )
      & ( ~ element(X95,the_carrier(X94))
        | ~ top_str(X94)
        | ~ topological_space(X94)
        | empty_carrier(X94)
        | ~ in(X93,a_2_0_yellow19(X94,X95))
        | X93 = esk8_3(X93,X94,X95) )
      & ( ~ element(X95,the_carrier(X94))
        | ~ top_str(X94)
        | ~ topological_space(X94)
        | empty_carrier(X94)
        | ~ in(X93,a_2_0_yellow19(X94,X95))
        | point_neighbourhood(esk8_3(X93,X94,X95),X94,X95) ) ),
    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_4])])])])])]) ).

fof(c_0_8,plain,
    ! [X41,X42] :
      ( neighborhood_system(X41,X42) = a_2_0_yellow19(X41,X42)
      | ~ element(X42,the_carrier(X41))
      | ~ top_str(X41)
      | ~ topological_space(X41)
      | empty_carrier(X41) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).

fof(c_0_9,negated_conjecture,
    ( ( point_neighbourhood(esk46_0,esk44_0,esk45_0)
      | in(esk46_0,neighborhood_system(esk44_0,esk45_0)) )
    & ( ~ point_neighbourhood(esk46_0,esk44_0,esk45_0)
      | ~ in(esk46_0,neighborhood_system(esk44_0,esk45_0)) )
    & element(esk45_0,the_carrier(esk44_0))
    & top_str(esk44_0)
    & topological_space(esk44_0)
    & ~ empty_carrier(esk44_0) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).

cnf(c_0_10,plain,
    ( ~ element(X3,the_carrier(X2))
    | ~ top_str(X2)
    | ~ topological_space(X2)
    | X4 != X1
    | ~ point_neighbourhood(X1,X2,X3)
    | empty_carrier(X2)
    | in(X4,a_2_0_yellow19(X2,X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_11,plain,
    ( ~ element(X2,the_carrier(X1))
    | ~ top_str(X1)
    | ~ topological_space(X1)
    | neighborhood_system(X1,X2) = a_2_0_yellow19(X1,X2)
    | empty_carrier(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_12,negated_conjecture,
    element(esk45_0,the_carrier(esk44_0)),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_13,negated_conjecture,
    top_str(esk44_0),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_14,negated_conjecture,
    topological_space(esk44_0),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_15,negated_conjecture,
    ~ empty_carrier(esk44_0),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_16,plain,
    ( ~ element(X3,the_carrier(X1))
    | ~ topological_space(X1)
    | ~ top_str(X1)
    | ~ point_neighbourhood(X2,X1,X3)
    | in(X2,a_2_0_yellow19(X1,X3))
    | empty_carrier(X1) ),
    inference(er,[status(thm)],[c_0_10]) ).

cnf(c_0_17,negated_conjecture,
    a_2_0_yellow19(esk44_0,esk45_0) = neighborhood_system(esk44_0,esk45_0),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14])]),c_0_15]) ).

cnf(c_0_18,negated_conjecture,
    ( ~ point_neighbourhood(esk46_0,esk44_0,esk45_0)
    | ~ in(esk46_0,neighborhood_system(esk44_0,esk45_0)) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_19,negated_conjecture,
    ( ~ point_neighbourhood(X1,esk44_0,esk45_0)
    | in(X1,neighborhood_system(esk44_0,esk45_0)) ),
    inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_12]),c_0_13]),c_0_14])]),c_0_15]),c_0_17]) ).

cnf(c_0_20,plain,
    ( ~ element(X3,the_carrier(X2))
    | ~ top_str(X2)
    | ~ topological_space(X2)
    | ~ in(X1,a_2_0_yellow19(X2,X3))
    | empty_carrier(X2)
    | X1 = esk8_3(X1,X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_21,negated_conjecture,
    ( point_neighbourhood(esk46_0,esk44_0,esk45_0)
    | in(esk46_0,neighborhood_system(esk44_0,esk45_0)) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_22,negated_conjecture,
    ~ point_neighbourhood(esk46_0,esk44_0,esk45_0),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_23,plain,
    ( ~ element(X3,the_carrier(X2))
    | ~ top_str(X2)
    | ~ topological_space(X2)
    | ~ in(X1,a_2_0_yellow19(X2,X3))
    | empty_carrier(X2)
    | point_neighbourhood(esk8_3(X1,X2,X3),X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_24,negated_conjecture,
    ( ~ in(X1,neighborhood_system(esk44_0,esk45_0))
    | esk8_3(X1,esk44_0,esk45_0) = X1 ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_17]),c_0_13]),c_0_14]),c_0_12])]),c_0_15]) ).

cnf(c_0_25,negated_conjecture,
    in(esk46_0,neighborhood_system(esk44_0,esk45_0)),
    inference(sr,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_26,negated_conjecture,
    ( ~ in(X1,neighborhood_system(esk44_0,esk45_0))
    | point_neighbourhood(esk8_3(X1,esk44_0,esk45_0),esk44_0,esk45_0) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_17]),c_0_13]),c_0_14]),c_0_12])]),c_0_15]) ).

cnf(c_0_27,negated_conjecture,
    esk8_3(esk46_0,esk44_0,esk45_0) = esk46_0,
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_28,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_25])]),c_0_22]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : SEU388+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.59  % Computer : n020.cluster.edu
% 0.12/0.59  % Model    : x86_64 x86_64
% 0.12/0.59  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.59  % Memory   : 8046.5625MB
% 0.12/0.59  % OS       : Linux 6.8.0-71-generic
% 0.12/0.59  % CPULimit : 300
% 0.12/0.59  % WCLimit  : 300
% 0.12/0.60  % DateTime : Mon Sep 21 06:19:19 UTC 2026
% 0.12/0.60  % CPUTime  : 
% 0.12/0.60  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.64  Running first-order theorem proving
% 0.16/0.64  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.16/0.71  % Version: 3.5.1
% 0.16/0.71  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.71  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.71  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.71  % Starting new_bool_3 with 300s (1) cores
% 0.16/0.71  % Starting new_bool_1 with 300s (1) cores
% 0.16/0.71  % Starting sh5l with 300s (1) cores
% 0.16/0.71  % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2186943 completed with status 0
% 0.16/0.71  % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.16/0.71  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.71  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.71  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.71  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/0.71  % No SInE strategy applied
% 0.16/0.71  % Search class: FGHSM-FSLM31-MFFFFFNN
% 0.16/0.71  % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.71  % Starting SubtermCWHack with 136s (1) cores
% 0.16/0.71  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.16/0.71  % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 136s (1) cores
% 0.16/0.71  % Starting G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with 136s (1) cores
% 0.16/0.71  % Starting U----_116Y_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.16/0.71  % U----_116Y_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 2186953 completed with status 0
% 0.16/0.71  % Result found by U----_116Y_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.71  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.71  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.71  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.71  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/0.71  % No SInE strategy applied
% 0.16/0.71  % Search class: FGHSM-FSLM31-MFFFFFNN
% 0.16/0.71  % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.71  % Starting SubtermCWHack with 136s (1) cores
% 0.16/0.71  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.16/0.71  % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 136s (1) cores
% 0.16/0.71  % Starting G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with 136s (1) cores
% 0.16/0.71  % Starting U----_116Y_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.16/0.71  % Preprocessing time       : 0.003 s
% 0.16/0.71  % Presaturation interreduction done
% 0.16/0.71  
% 0.16/0.71  % Proof found!
% 0.16/0.71  % SZS status Theorem
% 0.16/0.71  % SZS output start CNFRefutation
% See solution above
% 0.16/0.71  % Parsed axioms                        : 119
% 0.16/0.71  % Removed by relevancy pruning/SinE    : 0
% 0.16/0.71  % Initial clauses                      : 385
% 0.16/0.71  % Removed in clause preprocessing      : 35
% 0.16/0.71  % Initial clauses in saturation        : 350
% 0.16/0.71  % Processed clauses                    : 949
% 0.16/0.71  % ...of these trivial                  : 46
% 0.16/0.71  % ...subsumed                          : 38
% 0.16/0.71  % ...remaining for further processing  : 865
% 0.16/0.71  % Other redundant clauses eliminated   : 1
% 0.16/0.71  % Clauses deleted for lack of memory   : 0
% 0.16/0.71  % Backward-subsumed                    : 8
% 0.16/0.71  % Backward-rewritten                   : 12
% 0.16/0.71  % Generated clauses                    : 1118
% 0.16/0.71  % ...of the previous two non-redundant : 990
% 0.16/0.71  % ...aggressively subsumed             : 0
% 0.16/0.71  % Contextual simplify-reflections      : 3
% 0.16/0.71  % Paramodulations                      : 1112
% 0.16/0.71  % Factorizations                       : 2
% 0.16/0.71  % NegExts                              : 0
% 0.16/0.71  % Equation resolutions                 : 1
% 0.16/0.71  % Disequality decompositions           : 0
% 0.16/0.71  % Total rewrite steps                  : 636
% 0.16/0.71  % ...of those cached                   : 518
% 0.16/0.71  % Propositional unsat checks           : 0
% 0.16/0.71  %    Propositional check models        : 0
% 0.16/0.71  %    Propositional check unsatisfiable : 0
% 0.16/0.71  %    Propositional clauses             : 0
% 0.16/0.71  %    Propositional clauses after purity: 0
% 0.16/0.71  %    Propositional unsat core size     : 0
% 0.16/0.71  %    Propositional preprocessing time  : 0.000
% 0.16/0.71  %    Propositional encoding time       : 0.000
% 0.16/0.71  %    Propositional solver time         : 0.000
% 0.16/0.71  %    Success case prop preproc time    : 0.000
% 0.16/0.71  %    Success case prop encoding time   : 0.000
% 0.16/0.71  %    Success case prop solver time     : 0.000
% 0.16/0.71  % Current number of processed clauses  : 549
% 0.16/0.71  %    Positive orientable unit clauses  : 307
% 0.16/0.71  %    Positive unorientable unit clauses: 0
% 0.16/0.71  %    Negative unit clauses             : 29
% 0.16/0.71  %    Non-unit-clauses                  : 213
% 0.16/0.71  % Current number of unprocessed clauses: 664
% 0.16/0.71  % ...number of literals in the above   : 2658
% 0.16/0.71  % Current number of archived formulas  : 0
% 0.16/0.71  % Current number of archived clauses   : 315
% 0.16/0.71  % Clause-clause subsumption calls (NU) : 12876
% 0.16/0.71  % Rec. Clause-clause subsumption calls : 4014
% 0.16/0.71  % Non-unit clause-clause subsumptions  : 23
% 0.16/0.71  % Unit Clause-clause subsumption calls : 3954
% 0.16/0.71  % Rewrite failures with RHS unbound    : 0
% 0.16/0.71  % BW rewrite match attempts            : 11
% 0.16/0.71  % BW rewrite match successes           : 11
% 0.16/0.71  % Condensation attempts                : 0
% 0.16/0.71  % Condensation successes               : 0
% 0.16/0.71  % Termbank termtop insertions          : 38519
% 0.16/0.71  % Search garbage collected termcells   : 3042
% 0.16/0.71  
% 0.16/0.71  % -------------------------------------------------
% 0.16/0.71  % User time                : 0.035 s
% 0.16/0.71  % System time              : 0.008 s
% 0.16/0.71  % Total time               : 0.043 s
% 0.16/0.71  % Maximum resident set size: 4536 pages
% 0.16/0.71  
% 0.16/0.71  % -------------------------------------------------
% 0.16/0.71  % User time                : 0.172 s
% 0.16/0.71  % System time              : 0.026 s
% 0.16/0.71  % Total time               : 0.198 s
% 0.16/0.71  % Maximum resident set size: 4864 pages
% 0.16/0.71  % E exiting
%------------------------------------------------------------------------------