TSTP Solution File: CSR077+6 by E---3.1.00

View Problem - Process Solution

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

% Computer : n023.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 : Mon May 20 19:14:11 EDT 2024

% Result   : Theorem 6.17s 3.41s
% Output   : CNFRefutation 6.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   25 (   8 unt;   0 def)
%            Number of atoms       :   65 (  10 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   68 (  28   ~;  29   |;   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_26636,axiom,
    ! [X1,X15,X13] :
      ( ( s__instance(X15,s__SetOrClass)
        & s__instance(X1,s__SetOrClass) )
     => ( ( s__subclass(X1,X15)
          & s__instance(X13,X1) )
       => s__instance(X13,X15) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+2.ax',kb_SUMO_26636) ).

fof(kb_SUMO_26635,axiom,
    ! [X1,X15] :
      ( s__subclass(X1,X15)
     => ( s__instance(X1,s__SetOrClass)
        & s__instance(X15,s__SetOrClass) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+2.ax',kb_SUMO_26635) ).

fof(kb_SUMO_32531,axiom,
    ! [X545] :
      ( s__instance(X545,s__RealNumber)
     => ( s__instance(X545,s__NegativeRealNumber)
       => s__SignumFn(X545) = "-1" ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+2.ax',kb_SUMO_32531) ).

fof(kb_SUMO_32529,axiom,
    ! [X545] :
      ( s__instance(X545,s__RealNumber)
     => ( s__instance(X545,s__NonnegativeRealNumber)
       => ( s__SignumFn(X545) = "1"
          | s__SignumFn(X545) = "0" ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+2.ax',kb_SUMO_32529) ).

fof(kb_SUMO_27718,axiom,
    s__subclass(s__NegativeRealNumber,s__RealNumber),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+2.ax',kb_SUMO_27718) ).

fof(prove_from_ALL,conjecture,
    ~ s__instance(s__Number3_1,s__NegativeRealNumber),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_from_ALL) ).

fof(local_1,axiom,
    s__instance(s__Number3_1,s__NonnegativeRealNumber),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_1) ).

fof(c_0_7,plain,
    ! [X2379,X2380,X2381] :
      ( ~ s__instance(X2380,s__SetOrClass)
      | ~ s__instance(X2379,s__SetOrClass)
      | ~ s__subclass(X2379,X2380)
      | ~ s__instance(X2381,X2379)
      | s__instance(X2381,X2380) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26636])])]) ).

fof(c_0_8,plain,
    ! [X2377,X2378] :
      ( ( s__instance(X2377,s__SetOrClass)
        | ~ s__subclass(X2377,X2378) )
      & ( s__instance(X2378,s__SetOrClass)
        | ~ s__subclass(X2377,X2378) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26635])])])]) ).

cnf(c_0_9,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_10,plain,
    ( s__instance(X1,s__SetOrClass)
    | ~ s__subclass(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

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

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

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

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

cnf(c_0_15,plain,
    s__subclass(s__NegativeRealNumber,s__RealNumber),
    inference(split_conjunct,[status(thm)],[kb_SUMO_27718]) ).

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

cnf(c_0_17,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_13]) ).

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

cnf(c_0_19,plain,
    ( s__SignumFn(X1) = "1"
    | ~ s__instance(X1,s__NegativeRealNumber)
    | ~ s__instance(X1,s__NonnegativeRealNumber) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).

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

cnf(c_0_21,plain,
    ( ~ s__instance(X1,s__NegativeRealNumber)
    | ~ s__instance(X1,s__NonnegativeRealNumber) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_19]),c_0_18]) ).

cnf(c_0_22,negated_conjecture,
    s__instance(s__Number3_1,s__NegativeRealNumber),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : CSR077+6 : TPTP v8.2.0. Bugfixed v7.3.0.
% 0.13/0.13  % Command    : run_E %s %d THM
% 0.14/0.35  % Computer : n023.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Sun May 19 01:13:53 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.21/0.47  Running first-order theorem proving
% 0.21/0.47  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
% 6.17/3.41  # Version: 3.1.0
% 6.17/3.41  # Preprocessing class: FMLLSMSLSSSNFFN.
% 6.17/3.41  # Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 6.17/3.41  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1490s (5) cores
% 6.17/3.41  # Starting new_bool_3 with 298s (1) cores
% 6.17/3.41  # Starting new_bool_1 with 298s (1) cores
% 6.17/3.41  # Starting sh5l with 298s (1) cores
% 6.17/3.41  # G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 16869 completed with status 0
% 6.17/3.41  # Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 6.17/3.41  # Preprocessing class: FMLLSMSLSSSNFFN.
% 6.17/3.41  # Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 6.17/3.41  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1490s (5) cores
% 6.17/3.41  # SinE strategy is gf200_h_gu_R03_F100_L20000
% 6.17/3.41  # Search class: FGHSS-FSLM32-MFFFFFNN
% 6.17/3.41  # Scheduled 6 strats onto 5 cores with 1490 seconds (1490 total)
% 6.17/3.41  # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 805s (1) cores
% 6.17/3.41  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 150s (1) cores
% 6.17/3.41  # Starting new_bool_3 with 135s (1) cores
% 6.17/3.41  # Starting new_bool_1 with 135s (1) cores
% 6.17/3.41  # Starting sh5l with 135s (1) cores
% 6.17/3.41  # G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with pid 16875 completed with status 0
% 6.17/3.41  # Result found by G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y
% 6.17/3.41  # Preprocessing class: FMLLSMSLSSSNFFN.
% 6.17/3.41  # Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 6.17/3.41  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1490s (5) cores
% 6.17/3.41  # SinE strategy is gf200_h_gu_R03_F100_L20000
% 6.17/3.41  # Search class: FGHSS-FSLM32-MFFFFFNN
% 6.17/3.41  # Scheduled 6 strats onto 5 cores with 1490 seconds (1490 total)
% 6.17/3.41  # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 805s (1) cores
% 6.17/3.41  # Preprocessing time       : 0.023 s
% 6.17/3.41  # Presaturation interreduction done
% 6.17/3.41  
% 6.17/3.41  # Proof found!
% 6.17/3.41  # SZS status Theorem
% 6.17/3.41  # SZS output start CNFRefutation
% See solution above
% 6.17/3.41  # Parsed axioms                        : 55588
% 6.17/3.41  # Removed by relevancy pruning/SinE    : 55412
% 6.17/3.41  # Initial clauses                      : 248
% 6.17/3.41  # Removed in clause preprocessing      : 11
% 6.17/3.41  # Initial clauses in saturation        : 237
% 6.17/3.41  # Processed clauses                    : 860
% 6.17/3.41  # ...of these trivial                  : 52
% 6.17/3.41  # ...subsumed                          : 32
% 6.17/3.41  # ...remaining for further processing  : 776
% 6.17/3.41  # Other redundant clauses eliminated   : 58
% 6.17/3.41  # Clauses deleted for lack of memory   : 0
% 6.17/3.41  # Backward-subsumed                    : 14
% 6.17/3.41  # Backward-rewritten                   : 146
% 6.17/3.41  # Generated clauses                    : 3970
% 6.17/3.41  # ...of the previous two non-redundant : 3500
% 6.17/3.41  # ...aggressively subsumed             : 0
% 6.17/3.41  # Contextual simplify-reflections      : 25
% 6.17/3.41  # Paramodulations                      : 3916
% 6.17/3.41  # Factorizations                       : 3
% 6.17/3.41  # NegExts                              : 0
% 6.17/3.41  # Equation resolutions                 : 58
% 6.17/3.41  # Disequality decompositions           : 0
% 6.17/3.41  # Total rewrite steps                  : 626
% 6.17/3.41  # ...of those cached                   : 430
% 6.17/3.41  # Propositional unsat checks           : 0
% 6.17/3.41  #    Propositional check models        : 0
% 6.17/3.41  #    Propositional check unsatisfiable : 0
% 6.17/3.41  #    Propositional clauses             : 0
% 6.17/3.41  #    Propositional clauses after purity: 0
% 6.17/3.41  #    Propositional unsat core size     : 0
% 6.17/3.41  #    Propositional preprocessing time  : 0.000
% 6.17/3.41  #    Propositional encoding time       : 0.000
% 6.17/3.41  #    Propositional solver time         : 0.000
% 6.17/3.41  #    Success case prop preproc time    : 0.000
% 6.17/3.41  #    Success case prop encoding time   : 0.000
% 6.17/3.41  #    Success case prop solver time     : 0.000
% 6.17/3.41  # Current number of processed clauses  : 362
% 6.17/3.41  #    Positive orientable unit clauses  : 90
% 6.17/3.41  #    Positive unorientable unit clauses: 0
% 6.17/3.41  #    Negative unit clauses             : 1
% 6.17/3.41  #    Non-unit-clauses                  : 271
% 6.17/3.41  # Current number of unprocessed clauses: 2583
% 6.17/3.41  # ...number of literals in the above   : 10455
% 6.17/3.41  # Current number of archived formulas  : 0
% 6.17/3.41  # Current number of archived clauses   : 394
% 6.17/3.41  # Clause-clause subsumption calls (NU) : 20712
% 6.17/3.41  # Rec. Clause-clause subsumption calls : 5337
% 6.17/3.41  # Non-unit clause-clause subsumptions  : 66
% 6.17/3.41  # Unit Clause-clause subsumption calls : 2676
% 6.17/3.41  # Rewrite failures with RHS unbound    : 0
% 6.17/3.41  # BW rewrite match attempts            : 207
% 6.17/3.41  # BW rewrite match successes           : 108
% 6.17/3.41  # Condensation attempts                : 0
% 6.17/3.41  # Condensation successes               : 0
% 6.17/3.41  # Termbank termtop insertions          : 713211
% 6.17/3.41  # Search garbage collected termcells   : 293507
% 6.17/3.41  
% 6.17/3.41  # -------------------------------------------------
% 6.17/3.41  # User time                : 0.494 s
% 6.17/3.41  # System time              : 0.162 s
% 6.17/3.41  # Total time               : 0.656 s
% 6.17/3.41  # Maximum resident set size: 131872 pages
% 6.17/3.41  
% 6.17/3.41  # -------------------------------------------------
% 6.17/3.41  # User time                : 3.360 s
% 6.17/3.41  # System time              : 0.359 s
% 6.17/3.41  # Total time               : 3.719 s
% 6.17/3.41  # Maximum resident set size: 57428 pages
% 6.17/3.41  % E---3.1 exiting
% 6.17/3.41  % E exiting
%------------------------------------------------------------------------------