↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : CSR077+6 : 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 : n018.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:35 PM UTC 2026

% Result   : Theorem 5.88s 3.76s
% Output   : CNFRefutation 5.88s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   35 (  14 unt;   0 def)
%            Number of atoms       :  133 (  24 equ)
%            Maximal formula atoms :   45 (   3 avg)
%            Number of connectives :  157 (  59   ~;  68   |;  20   &)
%                                         (   1 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   24 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   14 (  11 usr;   9 con; 0-3 aty)
%            Number of variables   :   51 (   9 sgn  29   !;   0   ?)

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

fof(kb_SUMO_32603,axiom,
    ! [X137,X12,X136] :
      ( X12 = s__UnionFn(X136,X137)
    <=> ! [X1138,X34,X1139] :
          ( ( s__instance(X137,s__SetOrClass)
            & s__instance(X12,s__SetOrClass)
            & s__instance(X136,s__SetOrClass) )
         => ( ( s__instance(X1139,X12)
              & s__instance(X34,X137)
              & s__instance(X1138,X136) )
           => ( ( s__instance(X1139,X137)
                | s__instance(X1139,X136) )
              & s__instance(X34,X12)
              & s__instance(X1138,X12) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR003+2.ax',kb_SUMO_32603) ).

fof(kb_SUMO_27743,axiom,
    s__subclass(s__NegativeInteger,s__NegativeRealNumber),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR003+2.ax',kb_SUMO_27743) ).

fof(kb_SUMO_32531,axiom,
    ! [X545] :
      ( s__instance(X545,s__RealNumber)
     => ( s__instance(X545,s__NegativeRealNumber)
       => s__SignumFn(X545) = "-1" ) ),
    file('/export/starexec/sandbox/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) = "0"
          | s__SignumFn(X545) = "1" ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR003+2.ax',kb_SUMO_32529) ).

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

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

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

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

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

fof(c_0_10,plain,
    ! [X2490,X2491,X2492,X2493,X2494,X2495,X2496,X2497,X2498] :
      ( ( X2497 = s__UnionFn(X2498,X2496)
        | ~ s__instance(esk8_3(X2496,X2497,X2498),X2497)
        | ~ s__instance(esk7_3(X2496,X2497,X2498),X2497)
        | ~ s__instance(esk9_3(X2496,X2497,X2498),X2496) )
      & ( X2497 = s__UnionFn(X2498,X2496)
        | ~ s__instance(esk8_3(X2496,X2497,X2498),X2497)
        | ~ s__instance(esk7_3(X2496,X2497,X2498),X2497)
        | ~ s__instance(esk9_3(X2496,X2497,X2498),X2498) )
      & ( X2497 = s__UnionFn(X2498,X2496)
        | s__instance(esk9_3(X2496,X2497,X2498),X2497) )
      & ( X2497 = s__UnionFn(X2498,X2496)
        | s__instance(esk8_3(X2496,X2497,X2498),X2496) )
      & ( X2497 = s__UnionFn(X2498,X2496)
        | s__instance(esk7_3(X2496,X2497,X2498),X2498) )
      & ( X2497 = s__UnionFn(X2498,X2496)
        | s__instance(X2496,s__SetOrClass) )
      & ( X2497 = s__UnionFn(X2498,X2496)
        | s__instance(X2497,s__SetOrClass) )
      & ( X2497 = s__UnionFn(X2498,X2496)
        | s__instance(X2498,s__SetOrClass) )
      & ( X2491 != s__UnionFn(X2492,X2490)
        | ~ s__instance(X2490,s__SetOrClass)
        | ~ s__instance(X2491,s__SetOrClass)
        | ~ s__instance(X2492,s__SetOrClass)
        | ~ s__instance(X2495,X2491)
        | ~ s__instance(X2494,X2490)
        | ~ s__instance(X2493,X2492)
        | s__instance(X2495,X2490)
        | s__instance(X2495,X2492) )
      & ( X2491 != s__UnionFn(X2492,X2490)
        | ~ s__instance(X2490,s__SetOrClass)
        | ~ s__instance(X2491,s__SetOrClass)
        | ~ s__instance(X2492,s__SetOrClass)
        | ~ s__instance(X2495,X2491)
        | ~ s__instance(X2494,X2490)
        | ~ s__instance(X2493,X2492)
        | s__instance(X2494,X2491) )
      & ( X2491 != s__UnionFn(X2492,X2490)
        | ~ s__instance(X2490,s__SetOrClass)
        | ~ s__instance(X2491,s__SetOrClass)
        | ~ s__instance(X2492,s__SetOrClass)
        | ~ s__instance(X2495,X2491)
        | ~ s__instance(X2494,X2490)
        | ~ s__instance(X2493,X2492)
        | s__instance(X2493,X2491) ) ),
    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_32603])])])])])])]) ).

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

cnf(c_0_12,plain,
    s__subclass(s__NegativeInteger,s__NegativeRealNumber),
    inference(split_conjunct,[status(thm)],[kb_SUMO_27743]) ).

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

cnf(c_0_14,plain,
    s__instance(s__NegativeInteger,s__SetOrClass),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_15,plain,
    ( s__instance(X3,s__SetOrClass)
    | X1 = X2 ),
    inference(spm,[status(thm)],[c_0_13,c_0_13]) ).

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

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

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

cnf(c_0_19,plain,
    ( s__instance(X2,s__SetOrClass)
    | s__instance(X1,s__SetOrClass) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

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

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

fof(c_0_22,negated_conjecture,
    ~ ~ s__instance(s__Number3_1,s__NegativeRealNumber),
    inference(assume_negation,[status(cth)],[prove_from_ALL]) ).

cnf(c_0_23,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_18]) ).

cnf(c_0_24,plain,
    s__instance(X1,s__SetOrClass),
    inference(ef,[status(thm)],[c_0_19]) ).

cnf(c_0_25,plain,
    ( ~ s__instance(X1,s__NonnegativeRealNumber)
    | ~ s__instance(X1,s__NegativeRealNumber)
    | ~ s__instance(X1,s__RealNumber)
    | s__SignumFn(X1) = "1" ),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

fof(c_0_26,negated_conjecture,
    s__instance(s__Number3_1,s__NegativeRealNumber),
    inference(fof_simplification,[status(thm)],[c_0_22]) ).

cnf(c_0_27,plain,
    ( ~ s__subclass(X3,X2)
    | ~ s__instance(X1,X3)
    | s__instance(X1,X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_24])]) ).

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

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

cnf(c_0_30,negated_conjecture,
    s__instance(s__Number3_1,s__NegativeRealNumber),
    inference(split_conjunct,[status(thm)],[c_0_26]) ).

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

cnf(c_0_32,plain,
    ( ~ s__instance(X1,s__NegativeRealNumber)
    | s__instance(X1,s__RealNumber) ),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_33,negated_conjecture,
    ~ s__instance(s__Number3_1,s__RealNumber),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : CSR077+6 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.08  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.43  % Computer : n018.cluster.edu
% 0.16/0.43  % Model    : x86_64 x86_64
% 0.16/0.43  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.43  % Memory   : 8046.5625MB
% 0.16/0.43  % OS       : Linux 6.8.0-71-generic
% 0.16/0.43  % CPULimit : 300
% 0.16/0.43  % WCLimit  : 300
% 0.16/0.43  % DateTime : Mon Sep 21 14:49:59 UTC 2026
% 0.16/0.44  % CPUTime  : 
% 0.16/0.44  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.49  Running first-order theorem proving
% 0.16/0.49  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
% 5.88/3.76  % Version: 3.5.1
% 5.88/3.76  % Preprocessing class: FMLLSMSLSSSNFFN.
% 5.88/3.76  % Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 5.88/3.76  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1490s (5) cores
% 5.88/3.76  % Starting new_bool_3 with 298s (1) cores
% 5.88/3.76  % Starting new_bool_1 with 298s (1) cores
% 5.88/3.76  % Starting sh5l with 298s (1) cores
% 5.88/3.76  % G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 2154485 completed with status 0
% 5.88/3.76  % Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 5.88/3.76  % Preprocessing class: FMLLSMSLSSSNFFN.
% 5.88/3.76  % Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 5.88/3.76  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1490s (5) cores
% 5.88/3.76  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 5.88/3.76  % SinE strategy is gf200_h_gu_R03_F100_L20000
% 5.88/3.76  % Search class: FGHSS-FSLM32-MFFFFFNN
% 5.88/3.76  % Scheduled 7 strats onto 5 cores with 1490 seconds (1490 total)
% 5.88/3.76  % Starting SubtermCWHack with 135s (1) cores
% 5.88/3.76  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 150s (1) cores
% 5.88/3.76  % Starting G-E--_208_B07_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 135s (1) cores
% 5.88/3.76  % Starting new_bool_3 with 135s (1) cores
% 5.88/3.76  % Starting new_bool_1 with 135s (1) cores
% 5.88/3.76  % SubtermCWHack with pid 2154491 completed with status 0
% 5.88/3.76  % Result found by SubtermCWHack
% 5.88/3.76  % Preprocessing class: FMLLSMSLSSSNFFN.
% 5.88/3.76  % Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 5.88/3.76  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1490s (5) cores
% 5.88/3.76  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 5.88/3.76  % SinE strategy is gf200_h_gu_R03_F100_L20000
% 5.88/3.76  % Search class: FGHSS-FSLM32-MFFFFFNN
% 5.88/3.76  % Scheduled 7 strats onto 5 cores with 1490 seconds (1490 total)
% 5.88/3.76  % Starting SubtermCWHack with 135s (1) cores
% 5.88/3.76  % Preprocessing time       : 0.046 s
% 5.88/3.76  
% 5.88/3.76  % Proof found!
% 5.88/3.76  % SZS status Theorem
% 5.88/3.76  % SZS output start CNFRefutation
% See solution above
% 5.88/3.76  % Parsed axioms                        : 55588
% 5.88/3.76  % Removed by relevancy pruning/SinE    : 55412
% 5.88/3.76  % Initial clauses                      : 248
% 5.88/3.76  % Removed in clause preprocessing      : 11
% 5.88/3.76  % Initial clauses in saturation        : 237
% 5.88/3.76  % Processed clauses                    : 368
% 5.88/3.76  % ...of these trivial                  : 35
% 5.88/3.76  % ...subsumed                          : 14
% 5.88/3.76  % ...remaining for further processing  : 319
% 5.88/3.76  % Other redundant clauses eliminated   : 5
% 5.88/3.76  % Clauses deleted for lack of memory   : 0
% 5.88/3.76  % Backward-subsumed                    : 14
% 5.88/3.76  % Backward-rewritten                   : 65
% 5.88/3.76  % Generated clauses                    : 972
% 5.88/3.76  % ...of the previous two non-redundant : 938
% 5.88/3.76  % ...aggressively subsumed             : 0
% 5.88/3.76  % Contextual simplify-reflections      : 1
% 5.88/3.76  % Paramodulations                      : 964
% 5.88/3.76  % Factorizations                       : 3
% 5.88/3.76  % NegExts                              : 0
% 5.88/3.76  % Equation resolutions                 : 5
% 5.88/3.76  % Disequality decompositions           : 0
% 5.88/3.76  % Total rewrite steps                  : 132
% 5.88/3.76  % ...of those cached                   : 39
% 5.88/3.76  % Propositional unsat checks           : 0
% 5.88/3.76  %    Propositional check models        : 0
% 5.88/3.76  %    Propositional check unsatisfiable : 0
% 5.88/3.76  %    Propositional clauses             : 0
% 5.88/3.76  %    Propositional clauses after purity: 0
% 5.88/3.76  %    Propositional unsat core size     : 0
% 5.88/3.76  %    Propositional preprocessing time  : 0.000
% 5.88/3.76  %    Propositional encoding time       : 0.000
% 5.88/3.76  %    Propositional solver time         : 0.000
% 5.88/3.76  %    Success case prop preproc time    : 0.000
% 5.88/3.76  %    Success case prop encoding time   : 0.000
% 5.88/3.76  %    Success case prop solver time     : 0.000
% 5.88/3.76  % Current number of processed clauses  : 235
% 5.88/3.76  %    Positive orientable unit clauses  : 84
% 5.88/3.76  %    Positive unorientable unit clauses: 0
% 5.88/3.76  %    Negative unit clauses             : 2
% 5.88/3.76  %    Non-unit-clauses                  : 149
% 5.88/3.76  % Current number of unprocessed clauses: 170
% 5.88/3.76  % ...number of literals in the above   : 753
% 5.88/3.76  % Current number of archived formulas  : 0
% 5.88/3.76  % Current number of archived clauses   : 79
% 5.88/3.76  % Clause-clause subsumption calls (NU) : 2909
% 5.88/3.76  % Rec. Clause-clause subsumption calls : 1733
% 5.88/3.76  % Non-unit clause-clause subsumptions  : 20
% 5.88/3.76  % Unit Clause-clause subsumption calls : 333
% 5.88/3.76  % Rewrite failures with RHS unbound    : 0
% 5.88/3.76  % BW rewrite match attempts            : 116
% 5.88/3.76  % BW rewrite match successes           : 63
% 5.88/3.76  % Condensation attempts                : 0
% 5.88/3.76  % Condensation successes               : 0
% 5.88/3.76  % Termbank termtop insertions          : 673937
% 5.88/3.76  % Search garbage collected termcells   : 293506
% 5.88/3.76  
% 5.88/3.76  % -------------------------------------------------
% 5.88/3.76  % User time                : 0.517 s
% 5.88/3.76  % System time              : 0.297 s
% 5.88/3.76  % Total time               : 0.814 s
% 5.88/3.76  % Maximum resident set size: 137272 pages
% 5.88/3.76  
% 5.88/3.76  % -------------------------------------------------
% 5.88/3.76  % User time                : 3.017 s
% 5.88/3.76  % System time              : 0.738 s
% 5.88/3.76  % Total time               : 3.755 s
% 5.88/3.76  % Maximum resident set size: 63744 pages
% 5.88/3.76  % E exiting
%------------------------------------------------------------------------------