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

View Problem - Process Solution

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

% Computer : n022.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:54 EDT 2024

% Result   : Theorem 16.96s 5.44s
% Output   : CNFRefutation 16.96s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   26 (   9 unt;   0 def)
%            Number of atoms       :   68 (  10 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   73 (  31   ~;  31   |;   4   &)
%                                         (   0 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   6 usr;   8 con; 0-1 aty)
%            Number of variables   :   29 (   2 sgn  14   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(kb_SUMO_4610,axiom,
    ! [X12] :
      ( s__instance(X12,s__RealNumber)
     => ( s__instance(X12,s__NegativeRealNumber)
       => s__SignumFn(X12) = "-1" ) ),
    file('/export/starexec/sandbox2/tmp/tmp.FbUafLezFM/E---3.1_1168.p',kb_SUMO_4610) ).

fof(kb_SUMO_4608,axiom,
    ! [X12] :
      ( s__instance(X12,s__RealNumber)
     => ( s__instance(X12,s__NonnegativeRealNumber)
       => ( s__SignumFn(X12) = "1"
          | s__SignumFn(X12) = "0" ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.FbUafLezFM/E---3.1_1168.p',kb_SUMO_4608) ).

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.FbUafLezFM/E---3.1_1168.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.FbUafLezFM/E---3.1_1168.p',kb_SUMO_26) ).

fof(prove_from_SUMO_MILO,conjecture,
    ~ s__instance(s__Number3_1,s__NegativeRealNumber),
    file('/export/starexec/sandbox2/tmp/tmp.FbUafLezFM/E---3.1_1168.p',prove_from_SUMO_MILO) ).

fof(kb_SUMO_953,axiom,
    s__subclass(s__NegativeRealNumber,s__RealNumber),
    file('/export/starexec/sandbox2/tmp/tmp.FbUafLezFM/E---3.1_1168.p',kb_SUMO_953) ).

fof(local_1,axiom,
    s__instance(s__Number3_1,s__NonnegativeRealNumber),
    file('/export/starexec/sandbox2/tmp/tmp.FbUafLezFM/E---3.1_1168.p',local_1) ).

fof(c_0_7,plain,
    ! [X1241] :
      ( ~ s__instance(X1241,s__RealNumber)
      | ~ s__instance(X1241,s__NegativeRealNumber)
      | s__SignumFn(X1241) = "-1" ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_4610])])]) ).

fof(c_0_8,plain,
    ! [X1252] :
      ( ~ s__instance(X1252,s__RealNumber)
      | ~ s__instance(X1252,s__NonnegativeRealNumber)
      | s__SignumFn(X1252) = "1"
      | s__SignumFn(X1252) = "0" ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_4608])])]) ).

fof(c_0_9,plain,
    ! [X1225,X1226,X1227] :
      ( ~ s__instance(X1226,s__SetOrClass)
      | ~ s__instance(X1225,s__SetOrClass)
      | ~ s__subclass(X1225,X1226)
      | ~ s__instance(X1227,X1225)
      | s__instance(X1227,X1226) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_27])])]) ).

fof(c_0_10,plain,
    ! [X1223,X1224] :
      ( ( s__instance(X1223,s__SetOrClass)
        | ~ s__subclass(X1223,X1224) )
      & ( s__instance(X1224,s__SetOrClass)
        | ~ s__subclass(X1223,X1224) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26])])])]) ).

cnf(c_0_11,plain,
    ( s__SignumFn(X1) = "-1"
    | ~ s__instance(X1,s__RealNumber)
    | ~ s__instance(X1,s__NegativeRealNumber) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_12,plain,
    ( s__SignumFn(X1) = "1"
    | s__SignumFn(X1) = "0"
    | ~ s__instance(X1,s__RealNumber)
    | ~ s__instance(X1,s__NonnegativeRealNumber) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_13,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_9]) ).

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

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

cnf(c_0_16,plain,
    ( s__SignumFn(X1) = "1"
    | ~ s__instance(X1,s__RealNumber)
    | ~ s__instance(X1,s__NegativeRealNumber)
    | ~ s__instance(X1,s__NonnegativeRealNumber) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

fof(c_0_17,negated_conjecture,
    s__instance(s__Number3_1,s__NegativeRealNumber),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[prove_from_SUMO_MILO])]) ).

cnf(c_0_18,plain,
    ( s__instance(X1,X2)
    | ~ s__subclass(X3,X2)
    | ~ s__instance(X1,X3) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).

cnf(c_0_19,plain,
    s__subclass(s__NegativeRealNumber,s__RealNumber),
    inference(split_conjunct,[status(thm)],[kb_SUMO_953]) ).

cnf(c_0_20,plain,
    ( ~ s__instance(X1,s__RealNumber)
    | ~ s__instance(X1,s__NegativeRealNumber)
    | ~ s__instance(X1,s__NonnegativeRealNumber) ),
    inference(spm,[status(thm)],[c_0_11,c_0_16]) ).

cnf(c_0_21,negated_conjecture,
    s__instance(s__Number3_1,s__NegativeRealNumber),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_22,plain,
    s__instance(s__Number3_1,s__NonnegativeRealNumber),
    inference(split_conjunct,[status(thm)],[local_1]) ).

cnf(c_0_23,plain,
    ( s__instance(X1,s__RealNumber)
    | ~ s__instance(X1,s__NegativeRealNumber) ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_24,negated_conjecture,
    ~ s__instance(s__Number3_1,s__RealNumber),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).

cnf(c_0_25,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_21]),c_0_24]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : CSR077+5 : TPTP v8.1.2. Bugfixed v7.3.0.
% 0.11/0.13  % Command    : run_E %s %d THM
% 0.13/0.34  % Computer : n022.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Fri May  3 14:41:38 EDT 2024
% 0.13/0.34  % CPUTime    : 
% 3.03/3.29  Running first-order model finding
% 3.03/3.29  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.FbUafLezFM/E---3.1_1168.p
% 16.96/5.44  # Version: 3.1.0
% 16.96/5.44  # Preprocessing class: FMLLSMSLSSSNFFN.
% 16.96/5.44  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 16.96/5.44  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 16.96/5.44  # Starting new_bool_3 with 300s (1) cores
% 16.96/5.44  # Starting new_bool_1 with 300s (1) cores
% 16.96/5.44  # Starting sh5l with 300s (1) cores
% 16.96/5.44  # G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 1246 completed with status 0
% 16.96/5.44  # Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 16.96/5.44  # Preprocessing class: FMLLSMSLSSSNFFN.
% 16.96/5.44  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 16.96/5.44  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 16.96/5.44  # SinE strategy is gf500_h_gu_R04_F100_L20000
% 16.96/5.44  # Search class: FGHSM-SMLM31-MFFFFFNN
% 16.96/5.44  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 16.96/5.44  # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 811s (1) cores
% 16.96/5.44  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 16.96/5.44  # Starting new_bool_3 with 136s (1) cores
% 16.96/5.44  # Starting new_bool_1 with 136s (1) cores
% 16.96/5.44  # Starting sh5l with 136s (1) cores
% 16.96/5.44  # G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 1254 completed with status 0
% 16.96/5.44  # Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 16.96/5.44  # Preprocessing class: FMLLSMSLSSSNFFN.
% 16.96/5.44  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 16.96/5.44  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 16.96/5.44  # SinE strategy is gf500_h_gu_R04_F100_L20000
% 16.96/5.44  # Search class: FGHSM-SMLM31-MFFFFFNN
% 16.96/5.44  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 16.96/5.44  # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 811s (1) cores
% 16.96/5.44  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 16.96/5.44  # Preprocessing time       : 0.064 s
% 16.96/5.44  # Presaturation interreduction done
% 16.96/5.44  
% 16.96/5.44  # Proof found!
% 16.96/5.44  # SZS status Theorem
% 16.96/5.44  # SZS output start CNFRefutation
% See solution above
% 16.96/5.44  # Parsed axioms                        : 16750
% 16.96/5.44  # Removed by relevancy pruning/SinE    : 14079
% 16.96/5.44  # Initial clauses                      : 3628
% 16.96/5.44  # Removed in clause preprocessing      : 60
% 16.96/5.44  # Initial clauses in saturation        : 3568
% 16.96/5.44  # Processed clauses                    : 10409
% 16.96/5.44  # ...of these trivial                  : 825
% 16.96/5.44  # ...subsumed                          : 772
% 16.96/5.44  # ...remaining for further processing  : 8812
% 16.96/5.44  # Other redundant clauses eliminated   : 7
% 16.96/5.44  # Clauses deleted for lack of memory   : 0
% 16.96/5.44  # Backward-subsumed                    : 24
% 16.96/5.44  # Backward-rewritten                   : 886
% 16.96/5.44  # Generated clauses                    : 20272
% 16.96/5.44  # ...of the previous two non-redundant : 18812
% 16.96/5.44  # ...aggressively subsumed             : 0
% 16.96/5.44  # Contextual simplify-reflections      : 305
% 16.96/5.44  # Paramodulations                      : 20247
% 16.96/5.44  # Factorizations                       : 5
% 16.96/5.44  # NegExts                              : 0
% 16.96/5.44  # Equation resolutions                 : 20
% 16.96/5.44  # Disequality decompositions           : 0
% 16.96/5.44  # Total rewrite steps                  : 4202
% 16.96/5.44  # ...of those cached                   : 2530
% 16.96/5.44  # Propositional unsat checks           : 0
% 16.96/5.44  #    Propositional check models        : 0
% 16.96/5.44  #    Propositional check unsatisfiable : 0
% 16.96/5.44  #    Propositional clauses             : 0
% 16.96/5.44  #    Propositional clauses after purity: 0
% 16.96/5.44  #    Propositional unsat core size     : 0
% 16.96/5.44  #    Propositional preprocessing time  : 0.000
% 16.96/5.44  #    Propositional encoding time       : 0.000
% 16.96/5.44  #    Propositional solver time         : 0.000
% 16.96/5.44  #    Success case prop preproc time    : 0.000
% 16.96/5.44  #    Success case prop encoding time   : 0.000
% 16.96/5.44  #    Success case prop solver time     : 0.000
% 16.96/5.44  # Current number of processed clauses  : 4416
% 16.96/5.44  #    Positive orientable unit clauses  : 1688
% 16.96/5.44  #    Positive unorientable unit clauses: 38
% 16.96/5.44  #    Negative unit clauses             : 9
% 16.96/5.44  #    Non-unit-clauses                  : 2681
% 16.96/5.44  # Current number of unprocessed clauses: 11900
% 16.96/5.44  # ...number of literals in the above   : 39670
% 16.96/5.44  # Current number of archived formulas  : 0
% 16.96/5.44  # Current number of archived clauses   : 4390
% 16.96/5.44  # Clause-clause subsumption calls (NU) : 3662583
% 16.96/5.44  # Rec. Clause-clause subsumption calls : 798037
% 16.96/5.44  # Non-unit clause-clause subsumptions  : 1004
% 16.96/5.44  # Unit Clause-clause subsumption calls : 580378
% 16.96/5.44  # Rewrite failures with RHS unbound    : 1119
% 16.96/5.44  # BW rewrite match attempts            : 69706
% 16.96/5.44  # BW rewrite match successes           : 892
% 16.96/5.44  # Condensation attempts                : 0
% 16.96/5.44  # Condensation successes               : 0
% 16.96/5.44  # Termbank termtop insertions          : 735235
% 16.96/5.44  # Search garbage collected termcells   : 122121
% 16.96/5.44  
% 16.96/5.44  # -------------------------------------------------
% 16.96/5.44  # User time                : 1.770 s
% 16.96/5.44  # System time              : 0.140 s
% 16.96/5.44  # Total time               : 1.910 s
% 16.96/5.44  # Maximum resident set size: 46700 pages
% 16.96/5.44  
% 16.96/5.44  # -------------------------------------------------
% 16.96/5.44  # User time                : 8.204 s
% 16.96/5.44  # System time              : 0.273 s
% 16.96/5.44  # Total time               : 8.477 s
% 16.96/5.44  # Maximum resident set size: 18652 pages
% 16.96/5.44  % E---3.1 exiting
%------------------------------------------------------------------------------