↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n001.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 12:16:42 PM UTC 2026

% Result   : Theorem 32.38s 5.85s
% Output   : CNFRefutation 32.38s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   34 (   8 unt;   0 def)
%            Number of atoms       :  148 (  31 equ)
%            Maximal formula atoms :   45 (   4 avg)
%            Number of connectives :  181 (  67   ~;  70   |;  34   &)
%                                         (   3 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   24 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;   7 con; 0-3 aty)
%            Number of variables   :   76 (  21 sgn  31   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(prove_from_SUMO,conjecture,
    ~ ? [X591] :
        ( X591 != s__Nucleus14_1
        & s__component(X591,s__Atom14_1)
        & s__instance(X591,s__AtomicNucleus) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_from_SUMO) ).

fof(kb_SUMO_3496,axiom,
    ! [X171,X172,X173] :
      ( X172 = s__UnionFn(X173,X171)
    <=> ! [X174,X175,X176] :
          ( ( s__instance(X171,s__SetOrClass)
            & s__instance(X172,s__SetOrClass)
            & s__instance(X173,s__SetOrClass) )
         => ( ( s__instance(X176,X172)
              & s__instance(X175,X171)
              & s__instance(X174,X173) )
           => ( ( s__instance(X176,X171)
                | s__instance(X176,X173) )
              & s__instance(X175,X172)
              & s__instance(X174,X172) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+0.ax',kb_SUMO_3496) ).

fof(kb_SUMO_3533,axiom,
    ! [X168] :
      ( s__instance(X168,s__SetOrClass)
     => ( s__instance(X168,s__NullSet)
       => ~ ? [X48] : s__instance(X48,X168) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+0.ax',kb_SUMO_3533) ).

fof(kb_SUMO_276,axiom,
    ! [X9,X10] :
      ( s__disjoint(X9,X10)
    <=> ! [X48] :
          ( ( s__instance(X9,s__SetOrClass)
            & s__instance(X10,s__SetOrClass) )
         => ~ ( s__instance(X48,X10)
              & s__instance(X48,X9) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+0.ax',kb_SUMO_276) ).

fof(kb_SUMO_3489,axiom,
    ! [X169,X170] :
      ( ! [X49] :
          ( ( s__instance(X169,s__Set)
            & s__instance(X170,s__Set) )
         => ( s__element(X49,X170)
          <=> s__element(X49,X169) ) )
     => X170 = X169 ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+0.ax',kb_SUMO_3489) ).

fof(c_0_5,negated_conjecture,
    ~ ~ ? [X591] :
          ( X591 != s__Nucleus14_1
          & s__component(X591,s__Atom14_1)
          & s__instance(X591,s__AtomicNucleus) ),
    inference(assume_negation,[status(cth)],[prove_from_SUMO]) ).

fof(c_0_6,negated_conjecture,
    ~ ~ ? [X591] :
          ( X591 != s__Nucleus14_1
          & s__component(X591,s__Atom14_1)
          & s__instance(X591,s__AtomicNucleus) ),
    inference(fof_simplification,[status(thm)],[c_0_5]) ).

fof(c_0_7,negated_conjecture,
    ( esk505_0 != s__Nucleus14_1
    & s__component(esk505_0,s__Atom14_1)
    & s__instance(esk505_0,s__AtomicNucleus) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).

fof(c_0_8,plain,
    ! [X6423,X6424,X6425,X6426,X6427,X6428,X6429,X6430,X6431] :
      ( ( X6430 = s__UnionFn(X6431,X6429)
        | ~ s__instance(esk159_3(X6429,X6430,X6431),X6430)
        | ~ s__instance(esk158_3(X6429,X6430,X6431),X6430)
        | ~ s__instance(esk160_3(X6429,X6430,X6431),X6429) )
      & ( X6430 = s__UnionFn(X6431,X6429)
        | ~ s__instance(esk159_3(X6429,X6430,X6431),X6430)
        | ~ s__instance(esk158_3(X6429,X6430,X6431),X6430)
        | ~ s__instance(esk160_3(X6429,X6430,X6431),X6431) )
      & ( X6430 = s__UnionFn(X6431,X6429)
        | s__instance(esk160_3(X6429,X6430,X6431),X6430) )
      & ( X6430 = s__UnionFn(X6431,X6429)
        | s__instance(esk159_3(X6429,X6430,X6431),X6429) )
      & ( X6430 = s__UnionFn(X6431,X6429)
        | s__instance(esk158_3(X6429,X6430,X6431),X6431) )
      & ( X6430 = s__UnionFn(X6431,X6429)
        | s__instance(X6429,s__SetOrClass) )
      & ( X6430 = s__UnionFn(X6431,X6429)
        | s__instance(X6430,s__SetOrClass) )
      & ( X6430 = s__UnionFn(X6431,X6429)
        | s__instance(X6431,s__SetOrClass) )
      & ( X6424 != s__UnionFn(X6425,X6423)
        | ~ s__instance(X6423,s__SetOrClass)
        | ~ s__instance(X6424,s__SetOrClass)
        | ~ s__instance(X6425,s__SetOrClass)
        | ~ s__instance(X6428,X6424)
        | ~ s__instance(X6427,X6423)
        | ~ s__instance(X6426,X6425)
        | s__instance(X6428,X6423)
        | s__instance(X6428,X6425) )
      & ( X6424 != s__UnionFn(X6425,X6423)
        | ~ s__instance(X6423,s__SetOrClass)
        | ~ s__instance(X6424,s__SetOrClass)
        | ~ s__instance(X6425,s__SetOrClass)
        | ~ s__instance(X6428,X6424)
        | ~ s__instance(X6427,X6423)
        | ~ s__instance(X6426,X6425)
        | s__instance(X6427,X6424) )
      & ( X6424 != s__UnionFn(X6425,X6423)
        | ~ s__instance(X6423,s__SetOrClass)
        | ~ s__instance(X6424,s__SetOrClass)
        | ~ s__instance(X6425,s__SetOrClass)
        | ~ s__instance(X6428,X6424)
        | ~ s__instance(X6427,X6423)
        | ~ s__instance(X6426,X6425)
        | s__instance(X6426,X6424) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_3496])])])])])])]) ).

fof(c_0_9,plain,
    ! [X6435,X6436] :
      ( ~ s__instance(X6436,X6435)
      | ~ s__instance(X6435,s__NullSet)
      | ~ s__instance(X6435,s__SetOrClass) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_3533])])])]) ).

cnf(c_0_10,negated_conjecture,
    esk505_0 != s__Nucleus14_1,
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_11,plain,
    ( X2 = s__UnionFn(X3,X1)
    | s__instance(X1,s__SetOrClass) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_12,plain,
    ( ~ s__instance(X2,X1)
    | ~ s__instance(X1,s__NullSet)
    | ~ s__instance(X1,s__SetOrClass) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_13,negated_conjecture,
    s__instance(X1,s__SetOrClass),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_11]) ).

fof(c_0_14,plain,
    ! [X1513,X1514,X1515,X1516,X1517] :
      ( ( s__disjoint(X1516,X1517)
        | s__instance(esk1_2(X1516,X1517),X1517) )
      & ( s__disjoint(X1516,X1517)
        | s__instance(esk1_2(X1516,X1517),X1516) )
      & ( s__disjoint(X1516,X1517)
        | s__instance(X1516,s__SetOrClass) )
      & ( s__disjoint(X1516,X1517)
        | s__instance(X1517,s__SetOrClass) )
      & ( ~ s__instance(X1515,X1514)
        | ~ s__instance(X1515,X1513)
        | ~ s__instance(X1513,s__SetOrClass)
        | ~ s__instance(X1514,s__SetOrClass)
        | ~ s__disjoint(X1513,X1514) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_276])])])])])])]) ).

cnf(c_0_15,plain,
    ( ~ s__instance(X2,X1)
    | ~ s__instance(X1,s__NullSet) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]) ).

cnf(c_0_16,plain,
    ( s__disjoint(X1,X2)
    | s__instance(esk1_2(X1,X2),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_17,plain,
    ( ~ s__instance(X2,esk1_2(s__NullSet,X1))
    | s__disjoint(s__NullSet,X1) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_18,plain,
    ( X2 = s__UnionFn(X3,X1)
    | s__instance(esk158_3(X1,X2,X3),X3) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_19,plain,
    ( s__disjoint(s__NullSet,X2)
    | X1 = s__UnionFn(esk1_2(s__NullSet,X2),X3) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

fof(c_0_20,plain,
    ! [X6420,X6421] :
      ( ( X6421 = X6420
        | s__element(esk157_2(X6420,X6421),X6420)
        | s__element(esk157_2(X6420,X6421),X6421) )
      & ( X6421 = X6420
        | ~ s__element(esk157_2(X6420,X6421),X6420)
        | ~ s__element(esk157_2(X6420,X6421),X6421) )
      & ( X6421 = X6420
        | s__instance(X6420,s__Set) )
      & ( X6421 = X6420
        | s__instance(X6421,s__Set) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_3489])])])])])]) ).

cnf(c_0_21,plain,
    ( ~ s__instance(X3,X2)
    | ~ s__instance(X3,X1)
    | ~ s__instance(X1,s__SetOrClass)
    | ~ s__instance(X2,s__SetOrClass)
    | ~ s__disjoint(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_22,plain,
    ( s__disjoint(s__NullSet,X3)
    | X1 = X2 ),
    inference(spm,[status(thm)],[c_0_19,c_0_19]) ).

cnf(c_0_23,plain,
    ( X2 = X1
    | s__instance(X1,s__Set) ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_24,plain,
    ( ~ s__instance(X3,X1)
    | ~ s__instance(X3,X2)
    | ~ s__disjoint(X1,X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_13]),c_0_13])]) ).

cnf(c_0_25,negated_conjecture,
    s__disjoint(s__NullSet,X1),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_22]),c_0_22]) ).

cnf(c_0_26,negated_conjecture,
    ( X1 != s__Nucleus14_1
    | s__instance(esk505_0,s__Set) ),
    inference(spm,[status(thm)],[c_0_10,c_0_23]) ).

cnf(c_0_27,negated_conjecture,
    ( ~ s__instance(X1,X2)
    | ~ s__instance(X1,s__NullSet) ),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_28,negated_conjecture,
    s__instance(esk505_0,s__Set),
    inference(er,[status(thm)],[c_0_26]) ).

cnf(c_0_29,negated_conjecture,
    ( ~ s__instance(esk158_3(X2,X1,s__NullSet),X3)
    | X1 = s__UnionFn(s__NullSet,X2) ),
    inference(spm,[status(thm)],[c_0_27,c_0_18]) ).

cnf(c_0_30,negated_conjecture,
    s__instance(X1,s__Set),
    inference(spm,[status(thm)],[c_0_28,c_0_23]) ).

cnf(c_0_31,negated_conjecture,
    X1 = s__UnionFn(s__NullSet,X2),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_32,negated_conjecture,
    X1 = X2,
    inference(spm,[status(thm)],[c_0_31,c_0_31]) ).

cnf(c_0_33,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[c_0_10,c_0_32]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : CSR087+4 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37  % Computer : n001.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Mon Sep 21 14:58:32 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.41  Running first-order theorem proving
% 0.14/0.41  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
% 32.38/5.85  % Version: 3.5.1
% 32.38/5.85  % Preprocessing class: FMLLSMSLSSSNFFN.
% 32.38/5.85  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 32.38/5.85  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 32.38/5.85  % Starting new_bool_3 with 300s (1) cores
% 32.38/5.85  % Starting new_bool_1 with 300s (1) cores
% 32.38/5.85  % Starting sh5l with 300s (1) cores
% 32.38/5.85  % G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 3402405 completed with status 0
% 32.38/5.85  % Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 32.38/5.85  % Preprocessing class: FMLLSMSLSSSNFFN.
% 32.38/5.85  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 32.38/5.85  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 32.38/5.85  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 32.38/5.85  % No SInE strategy applied
% 32.38/5.85  % Search class: FGHSM-SMLM31-MFFFFFNN
% 32.38/5.85  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 32.38/5.85  % Starting SubtermCWHack with 136s (1) cores
% 32.38/5.85  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 32.38/5.85  % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 136s (1) cores
% 32.38/5.85  % Starting new_bool_3 with 136s (1) cores
% 32.38/5.85  % Starting new_bool_1 with 136s (1) cores
% 32.38/5.85  % G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 3402429 completed with status 0
% 32.38/5.85  % Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 32.38/5.85  % Preprocessing class: FMLLSMSLSSSNFFN.
% 32.38/5.85  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 32.38/5.85  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 32.38/5.85  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 32.38/5.85  % No SInE strategy applied
% 32.38/5.85  % Search class: FGHSM-SMLM31-MFFFFFNN
% 32.38/5.85  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 32.38/5.85  % Starting SubtermCWHack with 136s (1) cores
% 32.38/5.85  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 32.38/5.85  % Preprocessing time       : 0.175 s
% 32.38/5.85  % Presaturation interreduction done
% 32.38/5.85  
% 32.38/5.85  % Proof found!
% 32.38/5.85  % SZS status Theorem
% 32.38/5.85  % SZS output start CNFRefutation
% See solution above
% 32.38/5.85  % Parsed axioms                        : 7221
% 32.38/5.85  % Removed by relevancy pruning/SinE    : 0
% 32.38/5.85  % Initial clauses                      : 8414
% 32.38/5.85  % Removed in clause preprocessing      : 63
% 32.38/5.85  % Initial clauses in saturation        : 8351
% 32.38/5.85  % Processed clauses                    : 16809
% 32.38/5.85  % ...of these trivial                  : 545
% 32.38/5.85  % ...subsumed                          : 400
% 32.38/5.85  % ...remaining for further processing  : 15864
% 32.38/5.85  % Other redundant clauses eliminated   : 43
% 32.38/5.85  % Clauses deleted for lack of memory   : 0
% 32.38/5.85  % Backward-subsumed                    : 213
% 32.38/5.85  % Backward-rewritten                   : 1724
% 32.38/5.85  % Generated clauses                    : 96556
% 32.38/5.85  % ...of the previous two non-redundant : 62300
% 32.38/5.85  % ...aggressively subsumed             : 0
% 32.38/5.85  % Contextual simplify-reflections      : 668
% 32.38/5.85  % Paramodulations                      : 96454
% 32.38/5.85  % Factorizations                       : 1
% 32.38/5.85  % NegExts                              : 0
% 32.38/5.85  % Equation resolutions                 : 62
% 32.38/5.85  % Disequality decompositions           : 0
% 32.38/5.85  % Total rewrite steps                  : 12745
% 32.38/5.85  % ...of those cached                   : 7793
% 32.38/5.85  % Propositional unsat checks           : 0
% 32.38/5.85  %    Propositional check models        : 0
% 32.38/5.85  %    Propositional check unsatisfiable : 0
% 32.38/5.85  %    Propositional clauses             : 0
% 32.38/5.85  %    Propositional clauses after purity: 0
% 32.38/5.85  %    Propositional unsat core size     : 0
% 32.38/5.85  %    Propositional preprocessing time  : 0.000
% 32.38/5.85  %    Propositional encoding time       : 0.000
% 32.38/5.85  %    Propositional solver time         : 0.000
% 32.38/5.85  %    Success case prop preproc time    : 0.000
% 32.38/5.85  %    Success case prop encoding time   : 0.000
% 32.38/5.85  %    Success case prop solver time     : 0.000
% 32.38/5.85  % Current number of processed clauses  : 5725
% 32.38/5.85  %    Positive orientable unit clauses  : 3959
% 32.38/5.85  %    Positive unorientable unit clauses: 1
% 32.38/5.85  %    Negative unit clauses             : 15
% 32.38/5.85  %    Non-unit-clauses                  : 1750
% 32.38/5.85  % Current number of unprocessed clauses: 28122
% 32.38/5.85  % ...number of literals in the above   : 72846
% 32.38/5.85  % Current number of archived formulas  : 0
% 32.38/5.85  % Current number of archived clauses   : 10131
% 32.38/5.85  % Clause-clause subsumption calls (NU) : 3214825
% 32.38/5.85  % Rec. Clause-clause subsumption calls : 818523
% 32.38/5.85  % Non-unit clause-clause subsumptions  : 1075
% 32.38/5.85  % Unit Clause-clause subsumption calls : 292502
% 32.38/5.85  % Rewrite failures with RHS unbound    : 9293
% 32.38/5.85  % BW rewrite match attempts            : 31763
% 32.38/5.85  % BW rewrite match successes           : 10472
% 32.38/5.85  % Condensation attempts                : 0
% 32.38/5.85  % Condensation successes               : 0
% 32.38/5.85  % Termbank termtop insertions          : 1174440
% 32.38/5.85  % Search garbage collected termcells   : 89737
% 32.38/5.85  
% 32.38/5.85  % -------------------------------------------------
% 32.38/5.85  % User time                : 4.750 s
% 32.38/5.85  % System time              : 0.212 s
% 32.38/5.85  % Total time               : 4.962 s
% 32.38/5.85  % Maximum resident set size: 31792 pages
% 32.38/5.85  
% 32.38/5.85  % -------------------------------------------------
% 32.38/5.85  % User time                : 20.660 s
% 32.38/5.85  % System time              : 0.935 s
% 32.38/5.85  % Total time               : 21.595 s
% 32.38/5.85  % Maximum resident set size: 12544 pages
% 32.38/5.85  % E exiting
%------------------------------------------------------------------------------