↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n002.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:34 PM UTC 2026

% Result   : Theorem 63.60s 11.99s
% Output   : CNFRefutation 63.60s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   26 (  12 unt;   0 def)
%            Number of atoms       :   56 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   54 (  24   ~;  20   |;   6   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-1 aty)
%            Number of variables   :   31 (   3 sgn  13   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(kb_SUMO_27,axiom,
    ! [X6,X7,X8] :
      ( ( s__instance(X6,s__SetOrClass)
        & s__instance(X7,s__SetOrClass) )
     => ( ( s__instance(X8,X6)
          & s__subclass(X6,X7) )
       => s__instance(X8,X7) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR003+1.ax',kb_SUMO_27) ).

fof(kb_SUMO_26,axiom,
    ! [X6,X7] :
      ( s__subclass(X6,X7)
     => ( s__instance(X7,s__SetOrClass)
        & s__instance(X6,s__SetOrClass) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR003+1.ax',kb_SUMO_26) ).

fof(prove_from_SUMO_MILO,conjecture,
    ? [X1223] : s__member(X1223,s__Org1_1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_from_SUMO_MILO) ).

fof(kb_SUMO_734,axiom,
    ! [X85] :
      ( s__instance(X85,s__Collection)
     => ? [X51] :
          ( s__member(X51,X85)
          & s__instance(X51,s__SelfConnectedObject) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR003+1.ax',kb_SUMO_734) ).

fof(kb_SUMO_7741,axiom,
    s__subclass(s__Group,s__Collection),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR003+1.ax',kb_SUMO_7741) ).

fof(kb_SUMO_7890,axiom,
    s__subclass(s__Organization,s__Group),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR003+1.ax',kb_SUMO_7890) ).

fof(local_1,axiom,
    s__instance(s__Org1_1,s__Organization),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_1) ).

fof(c_0_7,plain,
    ! [X1290,X1291,X1292] :
      ( s__instance(X1292,X1291)
      | ~ s__instance(X1292,X1290)
      | ~ s__subclass(X1290,X1291)
      | ~ s__instance(X1290,s__SetOrClass)
      | ~ s__instance(X1291,s__SetOrClass) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_27])])]) ).

fof(c_0_8,plain,
    ! [X1288,X1289] :
      ( ( ~ s__subclass(X1288,X1289)
        | s__instance(X1289,s__SetOrClass) )
      & ( ~ s__subclass(X1288,X1289)
        | s__instance(X1288,s__SetOrClass) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26])])])]) ).

fof(c_0_9,negated_conjecture,
    ~ ? [X1223] : s__member(X1223,s__Org1_1),
    inference(assume_negation,[status(cth)],[prove_from_SUMO_MILO]) ).

cnf(c_0_10,plain,
    ( ~ s__instance(X3,X2)
    | ~ s__subclass(X2,X1)
    | ~ s__instance(X2,s__SetOrClass)
    | ~ s__instance(X1,s__SetOrClass)
    | s__instance(X3,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_11,plain,
    ( ~ s__subclass(X2,X1)
    | s__instance(X1,s__SetOrClass) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

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

fof(c_0_13,negated_conjecture,
    ! [X1224] : ~ s__member(X1224,s__Org1_1),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).

fof(c_0_14,plain,
    ! [X1227] :
      ( ( ~ s__instance(X1227,s__Collection)
        | s__member(esk1_1(X1227),X1227) )
      & ( ~ s__instance(X1227,s__Collection)
        | s__instance(esk1_1(X1227),s__SelfConnectedObject) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_734])])])])]) ).

cnf(c_0_15,plain,
    ( ~ s__instance(X1,X3)
    | ~ s__subclass(X3,X2)
    | s__instance(X1,X2) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).

cnf(c_0_16,plain,
    s__subclass(s__Group,s__Collection),
    inference(split_conjunct,[status(thm)],[kb_SUMO_7741]) ).

cnf(c_0_17,plain,
    s__subclass(s__Organization,s__Group),
    inference(split_conjunct,[status(thm)],[kb_SUMO_7890]) ).

cnf(c_0_18,negated_conjecture,
    ~ s__member(X1,s__Org1_1),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_19,plain,
    ( ~ s__instance(X1,s__Collection)
    | s__member(esk1_1(X1),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_20,plain,
    ( ~ s__instance(X1,s__Group)
    | s__instance(X1,s__Collection) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_21,plain,
    ( ~ s__instance(X1,s__Organization)
    | s__instance(X1,s__Group) ),
    inference(spm,[status(thm)],[c_0_15,c_0_17]) ).

cnf(c_0_22,negated_conjecture,
    ~ s__instance(s__Org1_1,s__Collection),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_23,plain,
    ( ~ s__instance(X1,s__Organization)
    | s__instance(X1,s__Collection) ),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_24,plain,
    s__instance(s__Org1_1,s__Organization),
    inference(split_conjunct,[status(thm)],[local_1]) ).

cnf(c_0_25,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : CSR075+5 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.06  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.47  % Computer : n002.cluster.edu
% 0.18/0.47  % Model    : x86_64 x86_64
% 0.18/0.47  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.47  % Memory   : 8046.5625MB
% 0.18/0.47  % OS       : Linux 6.8.0-71-generic
% 0.18/0.47  % CPULimit : 300
% 0.18/0.47  % WCLimit  : 300
% 0.18/0.47  % DateTime : Mon Sep 21 14:50:17 UTC 2026
% 0.18/0.47  % CPUTime  : 
% 0.18/0.47  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.56  Running first-order theorem proving
% 0.23/0.56  Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 63.60/11.99  % Version: 3.5.1
% 63.60/11.99  % Preprocessing class: FMLLSMSLSSSNFFN.
% 63.60/11.99  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 63.60/11.99  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 63.60/11.99  % Starting new_bool_3 with 300s (1) cores
% 63.60/11.99  % Starting new_bool_1 with 300s (1) cores
% 63.60/11.99  % Starting sh5l with 300s (1) cores
% 63.60/11.99  % G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 3539899 completed with status 0
% 63.60/11.99  % Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 63.60/11.99  % Preprocessing class: FMLLSMSLSSSNFFN.
% 63.60/11.99  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 63.60/11.99  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 63.60/11.99  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 63.60/11.99  % SinE strategy is gf500_h_gu_R04_F100_L20000
% 63.60/11.99  % Search class: FGHSM-SMLM31-MFFFFFNN
% 63.60/11.99  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 63.60/11.99  % Starting SubtermCWHack with 136s (1) cores
% 63.60/11.99  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 63.60/11.99  % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 136s (1) cores
% 63.60/11.99  % Starting new_bool_3 with 136s (1) cores
% 63.60/11.99  % Starting new_bool_1 with 136s (1) cores
% 63.60/11.99  % G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 3539908 completed with status 0
% 63.60/11.99  % Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 63.60/11.99  % Preprocessing class: FMLLSMSLSSSNFFN.
% 63.60/11.99  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 63.60/11.99  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 63.60/11.99  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 63.60/11.99  % SinE strategy is gf500_h_gu_R04_F100_L20000
% 63.60/11.99  % Search class: FGHSM-SMLM31-MFFFFFNN
% 63.60/11.99  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 63.60/11.99  % Starting SubtermCWHack with 136s (1) cores
% 63.60/11.99  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 63.60/11.99  % Preprocessing time       : 0.097 s
% 63.60/11.99  % Presaturation interreduction done
% 63.60/11.99  
% 63.60/11.99  % Proof found!
% 63.60/11.99  % SZS status Theorem
% 63.60/11.99  % SZS output start CNFRefutation
% See solution above
% 63.60/11.99  % Parsed axioms                        : 16750
% 63.60/11.99  % Removed by relevancy pruning/SinE    : 12975
% 63.60/11.99  % Initial clauses                      : 5289
% 63.60/11.99  % Removed in clause preprocessing      : 57
% 63.60/11.99  % Initial clauses in saturation        : 5232
% 63.60/11.99  % Processed clauses                    : 17794
% 63.60/11.99  % ...of these trivial                  : 813
% 63.60/11.99  % ...subsumed                          : 551
% 63.60/11.99  % ...remaining for further processing  : 16430
% 63.60/11.99  % Other redundant clauses eliminated   : 13
% 63.60/11.99  % Clauses deleted for lack of memory   : 0
% 63.60/11.99  % Backward-subsumed                    : 37
% 63.60/11.99  % Backward-rewritten                   : 1928
% 63.60/11.99  % Generated clauses                    : 43002
% 63.60/11.99  % ...of the previous two non-redundant : 39803
% 63.60/11.99  % ...aggressively subsumed             : 0
% 63.60/11.99  % Contextual simplify-reflections      : 506
% 63.60/11.99  % Paramodulations                      : 42978
% 63.60/11.99  % Factorizations                       : 9
% 63.60/11.99  % NegExts                              : 0
% 63.60/11.99  % Equation resolutions                 : 15
% 63.60/11.99  % Disequality decompositions           : 0
% 63.60/11.99  % Total rewrite steps                  : 6138
% 63.60/11.99  % ...of those cached                   : 3366
% 63.60/11.99  % Propositional unsat checks           : 0
% 63.60/11.99  %    Propositional check models        : 0
% 63.60/11.99  %    Propositional check unsatisfiable : 0
% 63.60/11.99  %    Propositional clauses             : 0
% 63.60/11.99  %    Propositional clauses after purity: 0
% 63.60/11.99  %    Propositional unsat core size     : 0
% 63.60/11.99  %    Propositional preprocessing time  : 0.000
% 63.60/11.99  %    Propositional encoding time       : 0.000
% 63.60/11.99  %    Propositional solver time         : 0.000
% 63.60/11.99  %    Success case prop preproc time    : 0.000
% 63.60/11.99  %    Success case prop encoding time   : 0.000
% 63.60/11.99  %    Success case prop solver time     : 0.000
% 63.60/11.99  % Current number of processed clauses  : 9348
% 63.60/11.99  %    Positive orientable unit clauses  : 2838
% 63.60/11.99  %    Positive unorientable unit clauses: 4
% 63.60/11.99  %    Negative unit clauses             : 257
% 63.60/11.99  %    Non-unit-clauses                  : 6249
% 63.60/11.99  % Current number of unprocessed clauses: 27620
% 63.60/11.99  % ...number of literals in the above   : 96608
% 63.60/11.99  % Current number of archived formulas  : 0
% 63.60/11.99  % Current number of archived clauses   : 7075
% 63.60/11.99  % Clause-clause subsumption calls (NU) : 9948748
% 63.60/11.99  % Rec. Clause-clause subsumption calls : 4002286
% 63.60/11.99  % Non-unit clause-clause subsumptions  : 1067
% 63.60/11.99  % Unit Clause-clause subsumption calls : 2542559
% 63.60/11.99  % Rewrite failures with RHS unbound    : 0
% 63.60/11.99  % BW rewrite match attempts            : 3155
% 63.60/11.99  % BW rewrite match successes           : 1428
% 63.60/11.99  % Condensation attempts                : 0
% 63.60/11.99  % Condensation successes               : 0
% 63.60/11.99  % Termbank termtop insertions          : 1089204
% 63.60/11.99  % Search garbage collected termcells   : 134200
% 63.60/11.99  
% 63.60/11.99  % -------------------------------------------------
% 63.60/11.99  % User time                : 9.694 s
% 63.60/11.99  % System time              : 0.232 s
% 63.60/11.99  % Total time               : 9.926 s
% 63.60/11.99  % Maximum resident set size: 52580 pages
% 63.60/11.99  
% 63.60/11.99  % -------------------------------------------------
% 63.60/11.99  % User time                : 44.926 s
% 63.60/11.99  % System time              : 1.333 s
% 63.60/11.99  % Total time               : 46.259 s
% 63.60/11.99  % Maximum resident set size: 22016 pages
% 63.60/11.99  % E exiting
%------------------------------------------------------------------------------