↑ Up

E-SAT---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E-SAT---3.5.1
% Problem  : SEU324+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 : n004.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:28:59 PM UTC 2026

% Result   : Theorem 0.15s 5.44s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   38 (   9 unt;   0 def)
%            Number of atoms       :  132 (  28 equ)
%            Maximal formula atoms :   13 (   3 avg)
%            Number of connectives :  148 (  54   ~;  52   |;  18   &)
%                                         (   1 <=>;  23  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   5 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   4 con; 0-2 aty)
%            Number of variables   :   52 (   0 sgn  32   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(d1_tops_1,axiom,
    ! [X1] :
      ( top_str(X1)
     => ! [X2] :
          ( element(X2,powerset(the_carrier(X1)))
         => interior(X1,X2) = subset_complement(the_carrier(X1),topstr_closure(X1,subset_complement(the_carrier(X1),X2))) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tops_1) ).

fof(involutiveness_k3_subset_1,axiom,
    ! [X1,X2] :
      ( element(X2,powerset(X1))
     => subset_complement(X1,subset_complement(X1,X2)) = X2 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',involutiveness_k3_subset_1) ).

fof(dt_k3_subset_1,axiom,
    ! [X1,X2] :
      ( element(X2,powerset(X1))
     => element(subset_complement(X1,X2),powerset(X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k3_subset_1) ).

fof(t52_pre_topc,axiom,
    ! [X1] :
      ( top_str(X1)
     => ! [X2] :
          ( element(X2,powerset(the_carrier(X1)))
         => ( ( ( topstr_closure(X1,X2) = X2
                & topological_space(X1) )
             => closed_subset(X2,X1) )
            & ( closed_subset(X2,X1)
             => topstr_closure(X1,X2) = X2 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t52_pre_topc) ).

fof(t55_tops_1,conjecture,
    ! [X1] :
      ( ( top_str(X1)
        & topological_space(X1) )
     => ! [X2] :
          ( top_str(X2)
         => ! [X3] :
              ( element(X3,powerset(the_carrier(X1)))
             => ! [X4] :
                  ( element(X4,powerset(the_carrier(X2)))
                 => ( ( interior(X1,X3) = X3
                     => open_subset(X3,X1) )
                    & ( open_subset(X4,X2)
                     => interior(X2,X4) = X4 ) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t55_tops_1) ).

fof(t30_tops_1,axiom,
    ! [X1] :
      ( top_str(X1)
     => ! [X2] :
          ( element(X2,powerset(the_carrier(X1)))
         => ( open_subset(X2,X1)
          <=> closed_subset(subset_complement(the_carrier(X1),X2),X1) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t30_tops_1) ).

fof(fc6_tops_1,axiom,
    ! [X1,X2] :
      ( ( element(X2,powerset(the_carrier(X1)))
        & top_str(X1)
        & topological_space(X1) )
     => open_subset(interior(X1,X2),X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc6_tops_1) ).

fof(c_0_7,plain,
    ! [X5,X6] :
      ( interior(X5,X6) = subset_complement(the_carrier(X5),topstr_closure(X5,subset_complement(the_carrier(X5),X6)))
      | ~ element(X6,powerset(the_carrier(X5)))
      | ~ top_str(X5) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_tops_1])])])]) ).

fof(c_0_8,plain,
    ! [X26,X27] :
      ( subset_complement(X26,subset_complement(X26,X27)) = X27
      | ~ element(X27,powerset(X26)) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[involutiveness_k3_subset_1])])]) ).

fof(c_0_9,plain,
    ! [X9,X10] :
      ( element(subset_complement(X9,X10),powerset(X9))
      | ~ element(X10,powerset(X9)) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k3_subset_1])])]) ).

cnf(c_0_10,plain,
    ( ~ element(X2,powerset(the_carrier(X1)))
    | ~ top_str(X1)
    | interior(X1,X2) = subset_complement(the_carrier(X1),topstr_closure(X1,subset_complement(the_carrier(X1),X2))) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_11,plain,
    ( ~ element(X1,powerset(X2))
    | subset_complement(X2,subset_complement(X2,X1)) = X1 ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_12,plain,
    ( ~ element(X1,powerset(X2))
    | element(subset_complement(X2,X1),powerset(X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

fof(c_0_13,plain,
    ! [X39,X40] :
      ( ( ~ top_str(X39)
        | ~ element(X40,powerset(the_carrier(X39)))
        | closed_subset(X40,X39)
        | topstr_closure(X39,X40) != X40
        | ~ topological_space(X39) )
      & ( ~ top_str(X39)
        | ~ element(X40,powerset(the_carrier(X39)))
        | topstr_closure(X39,X40) = X40
        | ~ closed_subset(X40,X39) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t52_pre_topc])])])])]) ).

cnf(c_0_14,plain,
    ( ~ top_str(X1)
    | ~ element(X2,powerset(the_carrier(X1)))
    | subset_complement(the_carrier(X1),topstr_closure(X1,X2)) = interior(X1,subset_complement(the_carrier(X1),X2)) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).

cnf(c_0_15,plain,
    ( ~ top_str(X2)
    | ~ element(X1,powerset(the_carrier(X2)))
    | ~ closed_subset(X1,X2)
    | topstr_closure(X2,X1) = X1 ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

fof(c_0_16,negated_conjecture,
    ~ ! [X1] :
        ( ( top_str(X1)
          & topological_space(X1) )
       => ! [X2] :
            ( top_str(X2)
           => ! [X3] :
                ( element(X3,powerset(the_carrier(X1)))
               => ! [X4] :
                    ( element(X4,powerset(the_carrier(X2)))
                   => ( ( interior(X1,X3) = X3
                       => open_subset(X3,X1) )
                      & ( open_subset(X4,X2)
                       => interior(X2,X4) = X4 ) ) ) ) ) ),
    inference(assume_negation,[status(cth)],[t55_tops_1]) ).

cnf(c_0_17,plain,
    ( ~ top_str(X1)
    | ~ element(X2,powerset(the_carrier(X1)))
    | ~ closed_subset(X2,X1)
    | interior(X1,subset_complement(the_carrier(X1),X2)) = subset_complement(the_carrier(X1),X2) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

fof(c_0_18,plain,
    ! [X35,X36] :
      ( ( ~ top_str(X35)
        | ~ element(X36,powerset(the_carrier(X35)))
        | open_subset(X36,X35)
        | ~ closed_subset(subset_complement(the_carrier(X35),X36),X35) )
      & ( ~ top_str(X35)
        | ~ element(X36,powerset(the_carrier(X35)))
        | closed_subset(subset_complement(the_carrier(X35),X36),X35)
        | ~ open_subset(X36,X35) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t30_tops_1])])])])]) ).

fof(c_0_19,plain,
    ! [X24,X25] :
      ( open_subset(interior(X24,X25),X24)
      | ~ element(X25,powerset(the_carrier(X24)))
      | ~ top_str(X24)
      | ~ topological_space(X24) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc6_tops_1])])]) ).

fof(c_0_20,negated_conjecture,
    ( ( interior(esk8_0,esk10_0) != esk10_0
      | ~ open_subset(esk9_0,esk7_0) )
    & ( interior(esk8_0,esk10_0) != esk10_0
      | interior(esk7_0,esk9_0) = esk9_0 )
    & ( open_subset(esk10_0,esk8_0)
      | ~ open_subset(esk9_0,esk7_0) )
    & ( open_subset(esk10_0,esk8_0)
      | interior(esk7_0,esk9_0) = esk9_0 )
    & element(esk10_0,powerset(the_carrier(esk8_0)))
    & element(esk9_0,powerset(the_carrier(esk7_0)))
    & top_str(esk8_0)
    & top_str(esk7_0)
    & topological_space(esk7_0) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])])]) ).

cnf(c_0_21,plain,
    ( ~ top_str(X1)
    | ~ element(X2,powerset(the_carrier(X1)))
    | ~ closed_subset(subset_complement(the_carrier(X1),X2),X1)
    | interior(X1,X2) = X2 ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_11]),c_0_12]) ).

cnf(c_0_22,plain,
    ( ~ top_str(X2)
    | ~ element(X1,powerset(the_carrier(X2)))
    | ~ open_subset(X1,X2)
    | closed_subset(subset_complement(the_carrier(X2),X1),X2) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_23,plain,
    ( ~ element(X2,powerset(the_carrier(X1)))
    | ~ top_str(X1)
    | ~ topological_space(X1)
    | open_subset(interior(X1,X2),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_24,negated_conjecture,
    ( open_subset(esk10_0,esk8_0)
    | interior(esk7_0,esk9_0) = esk9_0 ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_25,negated_conjecture,
    topological_space(esk7_0),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_26,negated_conjecture,
    element(esk9_0,powerset(the_carrier(esk7_0))),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_27,negated_conjecture,
    top_str(esk7_0),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_28,negated_conjecture,
    ( ~ open_subset(esk9_0,esk7_0)
    | open_subset(esk10_0,esk8_0) ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_29,negated_conjecture,
    ( interior(esk8_0,esk10_0) != esk10_0
    | interior(esk7_0,esk9_0) = esk9_0 ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_30,plain,
    ( ~ top_str(X1)
    | ~ element(X2,powerset(the_carrier(X1)))
    | ~ open_subset(X2,X1)
    | interior(X1,X2) = X2 ),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_31,negated_conjecture,
    open_subset(esk10_0,esk8_0),
    inference(csr,[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_24]),c_0_25]),c_0_26]),c_0_27])]),c_0_28]) ).

cnf(c_0_32,negated_conjecture,
    element(esk10_0,powerset(the_carrier(esk8_0))),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_33,negated_conjecture,
    top_str(esk8_0),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_34,negated_conjecture,
    ( interior(esk8_0,esk10_0) != esk10_0
    | ~ open_subset(esk9_0,esk7_0) ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_35,negated_conjecture,
    interior(esk7_0,esk9_0) = esk9_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_32]),c_0_33])]) ).

cnf(c_0_36,negated_conjecture,
    ~ open_subset(esk9_0,esk7_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_30]),c_0_31]),c_0_32]),c_0_33])]) ).

cnf(c_0_37,negated_conjecture,
    $false,
    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_35]),c_0_25]),c_0_26]),c_0_27])]),c_0_36]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU324+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/5.37  % Computer : n004.cluster.edu
% 0.11/5.37  % Model    : x86_64 x86_64
% 0.11/5.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.37  % Memory   : 8046.5625MB
% 0.11/5.37  % OS       : Linux 6.8.0-71-generic
% 0.11/5.37  % CPULimit : 300
% 0.11/5.37  % WCLimit  : 300
% 0.11/5.37  % DateTime : Mon Sep 21 06:11:41 UTC 2026
% 0.11/5.38  % CPUTime  : 
% 0.11/5.38  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/5.42  Running first-order theorem proving
% 0.15/5.42  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.15/5.44  % Version: 3.5.1
% 0.15/5.44  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.44  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.44  % Starting new_bool_3 with 300s (1) cores
% 0.15/5.44  % Starting new_bool_1 with 300s (1) cores
% 0.15/5.44  % Starting sh5l with 300s (1) cores
% 0.15/5.44  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2418668 completed with status 0
% 0.15/5.44  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/5.44  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.44  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.44  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/5.44  % No SInE strategy applied
% 0.15/5.44  % Search class: FGHSS-FFMM21-MFFFFFNN
% 0.15/5.44  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/5.44  % Starting SubtermCWHack with 136s (1) cores
% 0.15/5.44  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/5.44  % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.15/5.44  % Starting new_bool_3 with 136s (1) cores
% 0.15/5.44  % Starting new_bool_1 with 136s (1) cores
% 0.15/5.44  % SubtermCWHack with pid 2418672 completed with status 0
% 0.15/5.44  % Result found by SubtermCWHack
% 0.15/5.44  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.44  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.44  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/5.44  % No SInE strategy applied
% 0.15/5.44  % Search class: FGHSS-FFMM21-MFFFFFNN
% 0.15/5.44  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/5.44  % Starting SubtermCWHack with 136s (1) cores
% 0.15/5.44  % Preprocessing time       : 0.002 s
% 0.15/5.44  
% 0.15/5.44  % Proof found!
% 0.15/5.44  % SZS status Theorem
% 0.15/5.44  % SZS output start CNFRefutation
% See solution above
% 0.15/5.44  % Parsed axioms                        : 25
% 0.15/5.44  % Removed by relevancy pruning/SinE    : 0
% 0.15/5.44  % Initial clauses                      : 40
% 0.15/5.44  % Removed in clause preprocessing      : 4
% 0.15/5.44  % Initial clauses in saturation        : 36
% 0.15/5.44  % Processed clauses                    : 54
% 0.15/5.44  % ...of these trivial                  : 0
% 0.15/5.44  % ...subsumed                          : 7
% 0.15/5.44  % ...remaining for further processing  : 47
% 0.15/5.44  % Other redundant clauses eliminated   : 0
% 0.15/5.44  % Clauses deleted for lack of memory   : 0
% 0.15/5.44  % Backward-subsumed                    : 3
% 0.15/5.44  % Backward-rewritten                   : 2
% 0.15/5.44  % Generated clauses                    : 59
% 0.15/5.44  % ...of the previous two non-redundant : 45
% 0.15/5.44  % ...aggressively subsumed             : 0
% 0.15/5.44  % Contextual simplify-reflections      : 6
% 0.15/5.44  % Paramodulations                      : 59
% 0.15/5.44  % Factorizations                       : 0
% 0.15/5.44  % NegExts                              : 0
% 0.15/5.44  % Equation resolutions                 : 0
% 0.15/5.44  % Disequality decompositions           : 0
% 0.15/5.44  % Total rewrite steps                  : 14
% 0.15/5.44  % ...of those cached                   : 7
% 0.15/5.44  % Propositional unsat checks           : 0
% 0.15/5.44  %    Propositional check models        : 0
% 0.15/5.44  %    Propositional check unsatisfiable : 0
% 0.15/5.44  %    Propositional clauses             : 0
% 0.15/5.44  %    Propositional clauses after purity: 0
% 0.15/5.44  %    Propositional unsat core size     : 0
% 0.15/5.44  %    Propositional preprocessing time  : 0.000
% 0.15/5.44  %    Propositional encoding time       : 0.000
% 0.15/5.44  %    Propositional solver time         : 0.000
% 0.15/5.44  %    Success case prop preproc time    : 0.000
% 0.15/5.44  %    Success case prop encoding time   : 0.000
% 0.15/5.44  %    Success case prop solver time     : 0.000
% 0.15/5.44  % Current number of processed clauses  : 42
% 0.15/5.44  %    Positive orientable unit clauses  : 12
% 0.15/5.44  %    Positive unorientable unit clauses: 0
% 0.15/5.44  %    Negative unit clauses             : 1
% 0.15/5.44  %    Non-unit-clauses                  : 29
% 0.15/5.44  % Current number of unprocessed clauses: 26
% 0.15/5.44  % ...number of literals in the above   : 124
% 0.15/5.44  % Current number of archived formulas  : 0
% 0.15/5.44  % Current number of archived clauses   : 5
% 0.15/5.44  % Clause-clause subsumption calls (NU) : 323
% 0.15/5.44  % Rec. Clause-clause subsumption calls : 170
% 0.15/5.44  % Non-unit clause-clause subsumptions  : 14
% 0.15/5.44  % Unit Clause-clause subsumption calls : 21
% 0.15/5.44  % Rewrite failures with RHS unbound    : 0
% 0.15/5.44  % BW rewrite match attempts            : 5
% 0.15/5.44  % BW rewrite match successes           : 2
% 0.15/5.44  % Condensation attempts                : 0
% 0.15/5.44  % Condensation successes               : 0
% 0.15/5.44  % Termbank termtop insertions          : 4169
% 0.15/5.44  % Search garbage collected termcells   : 515
% 0.15/5.44  
% 0.15/5.44  % -------------------------------------------------
% 0.15/5.44  % User time                : 0.008 s
% 0.15/5.44  % System time              : 0.002 s
% 0.15/5.44  % Total time               : 0.010 s
% 0.15/5.44  % Maximum resident set size: 3344 pages
% 0.15/5.44  
% 0.15/5.44  % -------------------------------------------------
% 0.15/5.44  % User time                : 0.029 s
% 0.15/5.44  % System time              : 0.015 s
% 0.15/5.44  % Total time               : 0.044 s
% 0.15/5.44  % Maximum resident set size: 4608 pages
% 0.15/5.44  % E exiting
%------------------------------------------------------------------------------