↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n001.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 02:24:23 PM UTC 2026

% Result   : Theorem 13.52s 2.47s
% Output   : CNFRefutation 13.52s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   33 (   6 unt;   0 def)
%            Number of atoms       :  111 (   9 equ)
%            Maximal formula atoms :   16 (   3 avg)
%            Number of connectives :  125 (  47   ~;  41   |;  24   &)
%                                         (   3 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   1 con; 0-1 aty)
%            Number of variables   :   41 (   0 sgn  28   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t31_ordinal1,conjecture,
    ! [X1] :
      ( ! [X2] :
          ( in(X2,X1)
         => ( subset(X2,X1)
            & ordinal(X2) ) )
     => ordinal(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t31_ordinal1) ).

fof(d3_ordinal1,axiom,
    ! [X1] :
      ( epsilon_connected(X1)
    <=> ! [X2,X3] :
          ~ ( ~ in(X3,X2)
            & X2 != X3
            & ~ in(X2,X3)
            & in(X3,X1)
            & in(X2,X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_ordinal1) ).

fof(d2_ordinal1,axiom,
    ! [X1] :
      ( epsilon_transitive(X1)
    <=> ! [X2] :
          ( in(X2,X1)
         => subset(X2,X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_ordinal1) ).

fof(t24_ordinal1,lemma,
    ! [X1] :
      ( ordinal(X1)
     => ! [X2] :
          ( ordinal(X2)
         => ~ ( ~ in(X2,X1)
              & X1 != X2
              & ~ in(X1,X2) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t24_ordinal1) ).

fof(cc2_ordinal1,axiom,
    ! [X1] :
      ( ( epsilon_connected(X1)
        & epsilon_transitive(X1) )
     => ordinal(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cc2_ordinal1) ).

fof(c_0_5,negated_conjecture,
    ~ ! [X1] :
        ( ! [X2] :
            ( in(X2,X1)
           => ( subset(X2,X1)
              & ordinal(X2) ) )
       => ordinal(X1) ),
    inference(assume_negation,[status(cth)],[t31_ordinal1]) ).

fof(c_0_6,plain,
    ! [X1] :
      ( epsilon_connected(X1)
    <=> ! [X2,X3] :
          ~ ( ~ in(X3,X2)
            & X2 != X3
            & ~ in(X2,X3)
            & in(X3,X1)
            & in(X2,X1) ) ),
    inference(fof_simplification,[status(thm)],[d3_ordinal1]) ).

fof(c_0_7,negated_conjecture,
    ! [X558] :
      ( ~ ordinal(esk85_0)
      & ( ~ in(X558,esk85_0)
        | subset(X558,esk85_0) )
      & ( ~ in(X558,esk85_0)
        | ordinal(X558) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])])]) ).

fof(c_0_8,plain,
    ! [X146,X147,X148] :
      ( ( epsilon_transitive(X148)
        | ~ subset(esk27_1(X148),X148) )
      & ( epsilon_transitive(X148)
        | in(esk27_1(X148),X148) )
      & ( subset(X147,X146)
        | ~ in(X147,X146)
        | ~ epsilon_transitive(X146) ) ),
    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)],[d2_ordinal1])])])])])])]) ).

fof(c_0_9,lemma,
    ! [X1] :
      ( ordinal(X1)
     => ! [X2] :
          ( ordinal(X2)
         => ~ ( ~ in(X2,X1)
              & X1 != X2
              & ~ in(X1,X2) ) ) ),
    inference(fof_simplification,[status(thm)],[t24_ordinal1]) ).

fof(c_0_10,plain,
    ! [X195,X196,X197,X198] :
      ( ( epsilon_connected(X198)
        | ~ in(esk38_1(X198),esk37_1(X198)) )
      & ( epsilon_connected(X198)
        | esk37_1(X198) != esk38_1(X198) )
      & ( epsilon_connected(X198)
        | ~ in(esk37_1(X198),esk38_1(X198)) )
      & ( epsilon_connected(X198)
        | in(esk38_1(X198),X198) )
      & ( epsilon_connected(X198)
        | in(esk37_1(X198),X198) )
      & ( in(X197,X196)
        | X196 = X197
        | in(X196,X197)
        | ~ in(X197,X195)
        | ~ in(X196,X195)
        | ~ epsilon_connected(X195) ) ),
    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)],[c_0_6])])])])])])]) ).

fof(c_0_11,plain,
    ! [X15] :
      ( ordinal(X15)
      | ~ epsilon_connected(X15)
      | ~ epsilon_transitive(X15) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc2_ordinal1])])]) ).

cnf(c_0_12,negated_conjecture,
    ( ~ in(X1,esk85_0)
    | subset(X1,esk85_0) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_13,plain,
    ( epsilon_transitive(X1)
    | in(esk27_1(X1),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_14,plain,
    ( ~ subset(esk27_1(X1),X1)
    | epsilon_transitive(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

fof(c_0_15,lemma,
    ! [X538,X539] :
      ( in(X539,X538)
      | X538 = X539
      | in(X538,X539)
      | ~ ordinal(X539)
      | ~ ordinal(X538) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).

cnf(c_0_16,negated_conjecture,
    ( ~ in(X1,esk85_0)
    | ordinal(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_17,plain,
    ( epsilon_connected(X1)
    | in(esk37_1(X1),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_18,plain,
    ( ~ epsilon_connected(X1)
    | ~ epsilon_transitive(X1)
    | ordinal(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_19,negated_conjecture,
    epsilon_transitive(esk85_0),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).

cnf(c_0_20,negated_conjecture,
    ~ ordinal(esk85_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_21,plain,
    ( epsilon_connected(X1)
    | in(esk38_1(X1),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_22,plain,
    ( ~ in(esk38_1(X1),esk37_1(X1))
    | epsilon_connected(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_23,lemma,
    ( ~ ordinal(X2)
    | ~ ordinal(X1)
    | in(X2,X1)
    | X1 = X2
    | in(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_24,plain,
    ( ~ in(esk37_1(X1),esk38_1(X1))
    | epsilon_connected(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_25,plain,
    ( esk37_1(X1) != esk38_1(X1)
    | epsilon_connected(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_26,negated_conjecture,
    ( ordinal(esk37_1(esk85_0))
    | epsilon_connected(esk85_0) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_27,negated_conjecture,
    ~ epsilon_connected(esk85_0),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).

cnf(c_0_28,negated_conjecture,
    ( ordinal(esk38_1(esk85_0))
    | epsilon_connected(esk85_0) ),
    inference(spm,[status(thm)],[c_0_16,c_0_21]) ).

cnf(c_0_29,lemma,
    ( ~ ordinal(esk38_1(X1))
    | ~ ordinal(esk37_1(X1))
    | epsilon_connected(X1) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_25]) ).

cnf(c_0_30,negated_conjecture,
    ordinal(esk37_1(esk85_0)),
    inference(sr,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_31,negated_conjecture,
    ordinal(esk38_1(esk85_0)),
    inference(sr,[status(thm)],[c_0_28,c_0_27]) ).

cnf(c_0_32,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]),c_0_27]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU234+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.38  % Computer : n001.cluster.edu
% 0.13/0.38  % Model    : x86_64 x86_64
% 0.13/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38  % Memory   : 8046.5625MB
% 0.13/0.38  % OS       : Linux 6.8.0-71-generic
% 0.13/0.38  % CPULimit : 300
% 0.13/0.38  % WCLimit  : 300
% 0.13/0.38  % DateTime : Mon Sep 21 06:07:43 UTC 2026
% 0.13/0.38  % CPUTime  : 
% 0.13/0.39  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.43  Running first-order theorem proving
% 0.16/0.43  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
% 13.52/2.47  % Version: 3.5.1
% 13.52/2.47  % Preprocessing class: FSLSSMSSSSSNFFN.
% 13.52/2.47  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 13.52/2.47  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 13.52/2.47  % Starting new_bool_3 with 300s (1) cores
% 13.52/2.47  % Starting new_bool_1 with 300s (1) cores
% 13.52/2.47  % Starting sh5l with 300s (1) cores
% 13.52/2.47  % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2352061 completed with status 0
% 13.52/2.47  % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 13.52/2.47  % Preprocessing class: FSLSSMSSSSSNFFN.
% 13.52/2.47  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 13.52/2.47  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 13.52/2.47  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 13.52/2.47  % No SInE strategy applied
% 13.52/2.47  % Search class: FGHSM-FSLM32-MFFFFFNN
% 13.52/2.47  % Scheduled 12 strats onto 5 cores with 1500 seconds (1500 total)
% 13.52/2.47  % Starting SubtermCWHack with 136s (1) cores
% 13.52/2.47  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 13.52/2.47  % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 123s (1) cores
% 13.52/2.47  % Starting U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with 123s (1) cores
% 13.52/2.47  % Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 123s (1) cores
% 13.52/2.47  % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2352069 completed with status 0
% 13.52/2.47  % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 13.52/2.47  % Preprocessing class: FSLSSMSSSSSNFFN.
% 13.52/2.47  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 13.52/2.47  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 13.52/2.47  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 13.52/2.47  % No SInE strategy applied
% 13.52/2.47  % Search class: FGHSM-FSLM32-MFFFFFNN
% 13.52/2.47  % Scheduled 12 strats onto 5 cores with 1500 seconds (1500 total)
% 13.52/2.47  % Starting SubtermCWHack with 136s (1) cores
% 13.52/2.47  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 13.52/2.47  % Preprocessing time       : 0.006 s
% 13.52/2.47  % Presaturation interreduction done
% 13.52/2.47  
% 13.52/2.47  % Proof found!
% 13.52/2.47  % SZS status Theorem
% 13.52/2.47  % SZS output start CNFRefutation
% See solution above
% 13.52/2.47  % Parsed axioms                        : 270
% 13.52/2.47  % Removed by relevancy pruning/SinE    : 0
% 13.52/2.47  % Initial clauses                      : 547
% 13.52/2.47  % Removed in clause preprocessing      : 29
% 13.52/2.47  % Initial clauses in saturation        : 518
% 13.52/2.47  % Processed clauses                    : 14614
% 13.52/2.47  % ...of these trivial                  : 189
% 13.52/2.47  % ...subsumed                          : 10646
% 13.52/2.47  % ...remaining for further processing  : 3779
% 13.52/2.47  % Other redundant clauses eliminated   : 645
% 13.52/2.47  % Clauses deleted for lack of memory   : 0
% 13.52/2.47  % Backward-subsumed                    : 71
% 13.52/2.47  % Backward-rewritten                   : 55
% 13.52/2.47  % Generated clauses                    : 161044
% 13.52/2.47  % ...of the previous two non-redundant : 150676
% 13.52/2.47  % ...aggressively subsumed             : 0
% 13.52/2.47  % Contextual simplify-reflections      : 72
% 13.52/2.47  % Paramodulations                      : 160344
% 13.52/2.47  % Factorizations                       : 62
% 13.52/2.47  % NegExts                              : 0
% 13.52/2.47  % Equation resolutions                 : 652
% 13.52/2.47  % Disequality decompositions           : 0
% 13.52/2.47  % Total rewrite steps                  : 22284
% 13.52/2.47  % ...of those cached                   : 19890
% 13.52/2.47  % Propositional unsat checks           : 0
% 13.52/2.47  %    Propositional check models        : 0
% 13.52/2.47  %    Propositional check unsatisfiable : 0
% 13.52/2.47  %    Propositional clauses             : 0
% 13.52/2.47  %    Propositional clauses after purity: 0
% 13.52/2.47  %    Propositional unsat core size     : 0
% 13.52/2.47  %    Propositional preprocessing time  : 0.000
% 13.52/2.47  %    Propositional encoding time       : 0.000
% 13.52/2.47  %    Propositional solver time         : 0.000
% 13.52/2.47  %    Success case prop preproc time    : 0.000
% 13.52/2.47  %    Success case prop encoding time   : 0.000
% 13.52/2.47  %    Success case prop solver time     : 0.000
% 13.52/2.47  % Current number of processed clauses  : 3104
% 13.52/2.47  %    Positive orientable unit clauses  : 529
% 13.52/2.47  %    Positive unorientable unit clauses: 3
% 13.52/2.47  %    Negative unit clauses             : 596
% 13.52/2.47  %    Non-unit-clauses                  : 1976
% 13.52/2.47  % Current number of unprocessed clauses: 136767
% 13.52/2.47  % ...number of literals in the above   : 495921
% 13.52/2.47  % Current number of archived formulas  : 0
% 13.52/2.47  % Current number of archived clauses   : 589
% 13.52/2.47  % Clause-clause subsumption calls (NU) : 832000
% 13.52/2.47  % Rec. Clause-clause subsumption calls : 528585
% 13.52/2.47  % Non-unit clause-clause subsumptions  : 3141
% 13.52/2.47  % Unit Clause-clause subsumption calls : 142687
% 13.52/2.47  % Rewrite failures with RHS unbound    : 0
% 13.52/2.47  % BW rewrite match attempts            : 322
% 13.52/2.47  % BW rewrite match successes           : 95
% 13.52/2.47  % Condensation attempts                : 0
% 13.52/2.47  % Condensation successes               : 0
% 13.52/2.47  % Termbank termtop insertions          : 2074474
% 13.52/2.47  % Search garbage collected termcells   : 9170
% 13.52/2.47  
% 13.52/2.47  % -------------------------------------------------
% 13.52/2.47  % User time                : 1.885 s
% 13.52/2.47  % System time              : 0.083 s
% 13.52/2.47  % Total time               : 1.968 s
% 13.52/2.47  % Maximum resident set size: 5444 pages
% 13.52/2.47  
% 13.52/2.47  % -------------------------------------------------
% 13.52/2.47  % User time                : 9.232 s
% 13.52/2.47  % System time              : 0.368 s
% 13.52/2.47  % Total time               : 9.599 s
% 13.52/2.47  % Maximum resident set size: 5120 pages
% 13.52/2.47  % E exiting
%------------------------------------------------------------------------------