TSTP Solution File: CSR075+5 by E-SAT---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1.00
% Problem  : CSR075+5 : TPTP v8.1.2. Bugfixed v7.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n008.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sat May  4 07:35:53 EDT 2024

% Result   : Theorem 34.84s 7.71s
% Output   : CNFRefutation 34.84s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   25 (  12 unt;   0 def)
%            Number of atoms       :   54 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   52 (  23   ~;  19   |;   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   :   30 (   3 sgn  13   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(kb_SUMO_27,axiom,
    ! [X6,X7,X8] :
      ( ( s__instance(X7,s__SetOrClass)
        & s__instance(X6,s__SetOrClass) )
     => ( ( s__subclass(X6,X7)
          & s__instance(X8,X6) )
       => s__instance(X8,X7) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.qXCPzRTGam/E---3.1_23122.p',kb_SUMO_27) ).

fof(kb_SUMO_26,axiom,
    ! [X6,X7] :
      ( s__subclass(X6,X7)
     => ( s__instance(X6,s__SetOrClass)
        & s__instance(X7,s__SetOrClass) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.qXCPzRTGam/E---3.1_23122.p',kb_SUMO_26) ).

fof(prove_from_SUMO_MILO,conjecture,
    ? [X1223] : s__member(X1223,s__Org1_1),
    file('/export/starexec/sandbox2/tmp/tmp.qXCPzRTGam/E---3.1_23122.p',prove_from_SUMO_MILO) ).

fof(kb_SUMO_734,axiom,
    ! [X85] :
      ( s__instance(X85,s__Collection)
     => ? [X51] :
          ( s__instance(X51,s__SelfConnectedObject)
          & s__member(X51,X85) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.qXCPzRTGam/E---3.1_23122.p',kb_SUMO_734) ).

fof(kb_SUMO_7890,axiom,
    s__subclass(s__Organization,s__Group),
    file('/export/starexec/sandbox2/tmp/tmp.qXCPzRTGam/E---3.1_23122.p',kb_SUMO_7890) ).

fof(kb_SUMO_7741,axiom,
    s__subclass(s__Group,s__Collection),
    file('/export/starexec/sandbox2/tmp/tmp.qXCPzRTGam/E---3.1_23122.p',kb_SUMO_7741) ).

fof(local_1,axiom,
    s__instance(s__Org1_1,s__Organization),
    file('/export/starexec/sandbox2/tmp/tmp.qXCPzRTGam/E---3.1_23122.p',local_1) ).

fof(c_0_7,plain,
    ! [X1290,X1291,X1292] :
      ( ~ s__instance(X1291,s__SetOrClass)
      | ~ s__instance(X1290,s__SetOrClass)
      | ~ s__subclass(X1290,X1291)
      | ~ s__instance(X1292,X1290)
      | s__instance(X1292,X1291) ),
    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__instance(X1288,s__SetOrClass)
        | ~ s__subclass(X1288,X1289) )
      & ( s__instance(X1289,s__SetOrClass)
        | ~ s__subclass(X1288,X1289) ) ),
    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,X1)
    | ~ s__instance(X1,s__SetOrClass)
    | ~ s__instance(X2,s__SetOrClass)
    | ~ s__subclass(X2,X1)
    | ~ s__instance(X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

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

cnf(c_0_12,plain,
    ( s__instance(X1,s__SetOrClass)
    | ~ s__subclass(X1,X2) ),
    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(esk1_1(X1227),s__SelfConnectedObject)
        | ~ s__instance(X1227,s__Collection) )
      & ( s__member(esk1_1(X1227),X1227)
        | ~ s__instance(X1227,s__Collection) ) ),
    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,X2)
    | ~ s__subclass(X3,X2)
    | ~ s__instance(X1,X3) ),
    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__Organization,s__Group),
    inference(split_conjunct,[status(thm)],[kb_SUMO_7890]) ).

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

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__member(esk1_1(X1),X1)
    | ~ s__instance(X1,s__Collection) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

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

cnf(c_0_21,plain,
    ( s__instance(X1,s__Collection)
    | ~ 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(s__Org1_1,s__Organization),
    inference(split_conjunct,[status(thm)],[local_1]) ).

cnf(c_0_24,plain,
    $false,
    inference(cdclpropres,[status(thm)],[c_0_20,c_0_21,c_0_22,c_0_23]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : CSR075+5 : TPTP v8.1.2. Bugfixed v7.3.0.
% 0.03/0.13  % Command    : run_E %s %d THM
% 0.14/0.34  % Computer : n008.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Fri May  3 14:51:38 EDT 2024
% 0.14/0.34  % CPUTime    : 
% 3.10/3.31  Running first-order model finding
% 3.10/3.31  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.qXCPzRTGam/E---3.1_23122.p
% 34.84/7.71  # Version: 3.1.0
% 34.84/7.71  # Preprocessing class: FMLLSMSLSSSNFFN.
% 34.84/7.71  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 34.84/7.71  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 34.84/7.71  # Starting new_bool_3 with 300s (1) cores
% 34.84/7.71  # Starting new_bool_1 with 300s (1) cores
% 34.84/7.71  # Starting sh5l with 300s (1) cores
% 34.84/7.71  # sh5l with pid 23220 completed with status 0
% 34.84/7.71  # Result found by sh5l
% 34.84/7.71  # Preprocessing class: FMLLSMSLSSSNFFN.
% 34.84/7.71  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 34.84/7.71  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 34.84/7.71  # Starting new_bool_3 with 300s (1) cores
% 34.84/7.71  # Starting new_bool_1 with 300s (1) cores
% 34.84/7.71  # Starting sh5l with 300s (1) cores
% 34.84/7.71  # SinE strategy is gf500_gu_R04_F100_L20000
% 34.84/7.71  # Search class: FGHSM-SMLM31-MFFFFFNN
% 34.84/7.71  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 34.84/7.71  # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 181s (1) cores
% 34.84/7.71  # C07_19_nc_SAT001_MinMin_p005000_rr with pid 23228 completed with status 0
% 34.84/7.71  # Result found by C07_19_nc_SAT001_MinMin_p005000_rr
% 34.84/7.71  # Preprocessing class: FMLLSMSLSSSNFFN.
% 34.84/7.71  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 34.84/7.71  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 34.84/7.71  # Starting new_bool_3 with 300s (1) cores
% 34.84/7.71  # Starting new_bool_1 with 300s (1) cores
% 34.84/7.71  # Starting sh5l with 300s (1) cores
% 34.84/7.71  # SinE strategy is gf500_gu_R04_F100_L20000
% 34.84/7.71  # Search class: FGHSM-SMLM31-MFFFFFNN
% 34.84/7.71  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 34.84/7.71  # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 181s (1) cores
% 34.84/7.71  # Preprocessing time       : 0.063 s
% 34.84/7.71  # Presaturation interreduction done
% 34.84/7.71  # SatCheck found unsatisfiable ground set
% 34.84/7.71  
% 34.84/7.71  # Proof found!
% 34.84/7.71  # SZS status Theorem
% 34.84/7.71  # SZS output start CNFRefutation
% See solution above
% 34.84/7.71  # Parsed axioms                        : 16750
% 34.84/7.71  # Removed by relevancy pruning/SinE    : 12975
% 34.84/7.71  # Initial clauses                      : 5289
% 34.84/7.71  # Removed in clause preprocessing      : 57
% 34.84/7.71  # Initial clauses in saturation        : 5232
% 34.84/7.71  # Processed clauses                    : 16500
% 34.84/7.71  # ...of these trivial                  : 810
% 34.84/7.71  # ...subsumed                          : 690
% 34.84/7.71  # ...remaining for further processing  : 15000
% 34.84/7.71  # Other redundant clauses eliminated   : 112
% 34.84/7.71  # Clauses deleted for lack of memory   : 0
% 34.84/7.71  # Backward-subsumed                    : 44
% 34.84/7.71  # Backward-rewritten                   : 1643
% 34.84/7.71  # Generated clauses                    : 32415
% 34.84/7.71  # ...of the previous two non-redundant : 27414
% 34.84/7.71  # ...aggressively subsumed             : 0
% 34.84/7.71  # Contextual simplify-reflections      : 509
% 34.84/7.71  # Paramodulations                      : 32307
% 34.84/7.71  # Factorizations                       : 5
% 34.84/7.71  # NegExts                              : 0
% 34.84/7.71  # Equation resolutions                 : 113
% 34.84/7.71  # Disequality decompositions           : 0
% 34.84/7.71  # Total rewrite steps                  : 4799
% 34.84/7.71  # ...of those cached                   : 2417
% 34.84/7.71  # Propositional unsat checks           : 4
% 34.84/7.71  #    Propositional check models        : 3
% 34.84/7.71  #    Propositional check unsatisfiable : 1
% 34.84/7.71  #    Propositional clauses             : 25526
% 34.84/7.71  #    Propositional clauses after purity: 1186
% 34.84/7.71  #    Propositional unsat core size     : 4
% 34.84/7.71  #    Propositional preprocessing time  : 0.000
% 34.84/7.71  #    Propositional encoding time       : 0.079
% 34.84/7.71  #    Propositional solver time         : 0.030
% 34.84/7.71  #    Success case prop preproc time    : 0.000
% 34.84/7.71  #    Success case prop encoding time   : 0.036
% 34.84/7.71  #    Success case prop solver time     : 0.004
% 34.84/7.71  # Current number of processed clauses  : 8147
% 34.84/7.71  #    Positive orientable unit clauses  : 2519
% 34.84/7.71  #    Positive unorientable unit clauses: 4
% 34.84/7.71  #    Negative unit clauses             : 223
% 34.84/7.71  #    Non-unit-clauses                  : 5401
% 34.84/7.71  # Current number of unprocessed clauses: 17379
% 34.84/7.71  # ...number of literals in the above   : 59487
% 34.84/7.71  # Current number of archived formulas  : 0
% 34.84/7.71  # Current number of archived clauses   : 6797
% 34.84/7.71  # Clause-clause subsumption calls (NU) : 8117657
% 34.84/7.71  # Rec. Clause-clause subsumption calls : 3024149
% 34.84/7.71  # Non-unit clause-clause subsumptions  : 1210
% 34.84/7.71  # Unit Clause-clause subsumption calls : 2432454
% 34.84/7.71  # Rewrite failures with RHS unbound    : 0
% 34.84/7.71  # BW rewrite match attempts            : 3116
% 34.84/7.71  # BW rewrite match successes           : 1417
% 34.84/7.71  # Condensation attempts                : 0
% 34.84/7.71  # Condensation successes               : 0
% 34.84/7.71  # Termbank termtop insertions          : 1100609
% 34.84/7.71  # Search garbage collected termcells   : 134200
% 34.84/7.71  
% 34.84/7.71  # -------------------------------------------------
% 34.84/7.71  # User time                : 3.906 s
% 34.84/7.71  # System time              : 0.169 s
% 34.84/7.71  # Total time               : 4.076 s
% 34.84/7.71  # Maximum resident set size: 50272 pages
% 34.84/7.71  
% 34.84/7.71  # -------------------------------------------------
% 34.84/7.71  # User time                : 4.080 s
% 34.84/7.71  # System time              : 0.183 s
% 34.84/7.71  # Total time               : 4.263 s
% 34.84/7.71  # Maximum resident set size: 18648 pages
% 34.84/7.71  % E---3.1 exiting
%------------------------------------------------------------------------------