↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : RNG099+2 : TPTP v9.3.1. Released v4.0.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:05:50 PM UTC 2026

% Result   : Theorem 0.27s 0.55s
% Output   : CNFRefutation 0.27s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   35 (  16 unt;   0 def)
%            Number of atoms       :  108 (   3 equ)
%            Maximal formula atoms :   16 (   3 avg)
%            Number of connectives :  112 (  39   ~;  37   |;  26   &)
%                                         (   0 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-3 aty)
%            Number of functors    :   11 (  11 usr;   8 con; 0-2 aty)
%            Number of variables   :   34 (   0 sgn  25   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(mSortsB,axiom,
    ! [X1,X2] :
      ( ( aElement0(X2)
        & aElement0(X1) )
     => aElement0(sdtpldt0(X1,X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsB) ).

fof(mEOfElem,axiom,
    ! [X1] :
      ( aSet0(X1)
     => ! [X2] :
          ( aElementOf0(X2,X1)
         => aElement0(X2) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mEOfElem) ).

fof(m__1205,hypothesis,
    ( aIdeal0(xJ)
    & ! [X1] :
        ( aElementOf0(X1,xJ)
       => ( ! [X2] :
              ( aElement0(X2)
             => aElementOf0(sdtasdt0(X2,X1),xJ) )
          & ! [X2] :
              ( aElementOf0(X2,xJ)
             => aElementOf0(sdtpldt0(X1,X2),xJ) ) ) )
    & aSet0(xJ)
    & aIdeal0(xI)
    & ! [X1] :
        ( aElementOf0(X1,xI)
       => ( ! [X2] :
              ( aElement0(X2)
             => aElementOf0(sdtasdt0(X2,X1),xI) )
          & ! [X2] :
              ( aElementOf0(X2,xI)
             => aElementOf0(sdtpldt0(X1,X2),xI) ) ) )
    & aSet0(xI) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1205) ).

fof(m__1319,hypothesis,
    xw = sdtpldt0(sdtasdt0(xy,xa),sdtasdt0(xx,xb)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1319) ).

fof(mSortsB_02,axiom,
    ! [X1,X2] :
      ( ( aElement0(X2)
        & aElement0(X1) )
     => aElement0(sdtasdt0(X1,X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsB_02) ).

fof(m__1294,hypothesis,
    ( sdtpldt0(xa,xb) = sz10
    & aElementOf0(xb,xJ)
    & aElementOf0(xa,xI) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1294) ).

fof(m__,conjecture,
    ? [X1] :
      ( ( sdteqdtlpzmzozddtrp0(X1,xy,xJ)
        | aElementOf0(sdtpldt0(X1,smndt0(xy)),xJ) )
      & ( sdteqdtlpzmzozddtrp0(X1,xx,xI)
        | aElementOf0(sdtpldt0(X1,smndt0(xx)),xI) )
      & aElement0(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).

fof(m__1217,hypothesis,
    ( aElement0(xy)
    & aElement0(xx) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1217) ).

fof(m__1409,hypothesis,
    aElementOf0(sdtpldt0(xw,smndt0(xy)),xJ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1409) ).

fof(m__1332,hypothesis,
    aElementOf0(sdtpldt0(xw,smndt0(xx)),xI),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1332) ).

fof(c_0_10,plain,
    ! [X36,X37] :
      ( aElement0(sdtpldt0(X36,X37))
      | ~ aElement0(X37)
      | ~ aElement0(X36) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB])])]) ).

fof(c_0_11,plain,
    ! [X44,X45] :
      ( aElement0(X45)
      | ~ aElementOf0(X45,X44)
      | ~ aSet0(X44) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEOfElem])])])]) ).

fof(c_0_12,hypothesis,
    ! [X7,X8,X9,X10,X11,X12] :
      ( aIdeal0(xJ)
      & ( ~ aElementOf0(X10,xJ)
        | aElementOf0(sdtasdt0(X12,X10),xJ)
        | ~ aElement0(X12) )
      & ( ~ aElementOf0(X10,xJ)
        | aElementOf0(sdtpldt0(X10,X11),xJ)
        | ~ aElementOf0(X11,xJ) )
      & aSet0(xJ)
      & aIdeal0(xI)
      & ( ~ aElementOf0(X7,xI)
        | aElementOf0(sdtasdt0(X9,X7),xI)
        | ~ aElement0(X9) )
      & ( ~ aElementOf0(X7,xI)
        | aElementOf0(sdtpldt0(X7,X8),xI)
        | ~ aElementOf0(X8,xI) )
      & aSet0(xI) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__1205])])])])]) ).

cnf(c_0_13,plain,
    ( ~ aElement0(X2)
    | ~ aElement0(X1)
    | aElement0(sdtpldt0(X1,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_14,hypothesis,
    xw = sdtpldt0(sdtasdt0(xy,xa),sdtasdt0(xx,xb)),
    inference(split_conjunct,[status(thm)],[m__1319]) ).

fof(c_0_15,plain,
    ! [X25,X26] :
      ( aElement0(sdtasdt0(X25,X26))
      | ~ aElement0(X26)
      | ~ aElement0(X25) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])])]) ).

cnf(c_0_16,plain,
    ( ~ aElementOf0(X2,X1)
    | ~ aSet0(X1)
    | aElement0(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_17,hypothesis,
    aElementOf0(xa,xI),
    inference(split_conjunct,[status(thm)],[m__1294]) ).

cnf(c_0_18,hypothesis,
    aSet0(xI),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

fof(c_0_19,negated_conjecture,
    ~ ? [X1] :
        ( ( sdteqdtlpzmzozddtrp0(X1,xy,xJ)
          | aElementOf0(sdtpldt0(X1,smndt0(xy)),xJ) )
        & ( sdteqdtlpzmzozddtrp0(X1,xx,xI)
          | aElementOf0(sdtpldt0(X1,smndt0(xx)),xI) )
        & aElement0(X1) ),
    inference(assume_negation,[status(cth)],[m__]) ).

cnf(c_0_20,hypothesis,
    ( ~ aElement0(sdtasdt0(xy,xa))
    | ~ aElement0(sdtasdt0(xx,xb))
    | aElement0(xw) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_21,plain,
    ( ~ aElement0(X2)
    | ~ aElement0(X1)
    | aElement0(sdtasdt0(X1,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_22,hypothesis,
    aElement0(xa),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).

cnf(c_0_23,hypothesis,
    aElement0(xy),
    inference(split_conjunct,[status(thm)],[m__1217]) ).

cnf(c_0_24,hypothesis,
    aElementOf0(xb,xJ),
    inference(split_conjunct,[status(thm)],[m__1294]) ).

cnf(c_0_25,hypothesis,
    aSet0(xJ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

fof(c_0_26,negated_conjecture,
    ! [X16] :
      ( ( ~ aElement0(X16)
        | ~ sdteqdtlpzmzozddtrp0(X16,xx,xI)
        | ~ sdteqdtlpzmzozddtrp0(X16,xy,xJ) )
      & ( ~ aElement0(X16)
        | ~ sdteqdtlpzmzozddtrp0(X16,xx,xI)
        | ~ aElementOf0(sdtpldt0(X16,smndt0(xy)),xJ) )
      & ( ~ aElement0(X16)
        | ~ aElementOf0(sdtpldt0(X16,smndt0(xx)),xI)
        | ~ sdteqdtlpzmzozddtrp0(X16,xy,xJ) )
      & ( ~ aElement0(X16)
        | ~ aElementOf0(sdtpldt0(X16,smndt0(xx)),xI)
        | ~ aElementOf0(sdtpldt0(X16,smndt0(xy)),xJ) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])])]) ).

cnf(c_0_27,hypothesis,
    ( ~ aElement0(sdtasdt0(xx,xb))
    | aElement0(xw) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23])]) ).

cnf(c_0_28,hypothesis,
    aElement0(xb),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_24]),c_0_25])]) ).

cnf(c_0_29,hypothesis,
    aElement0(xx),
    inference(split_conjunct,[status(thm)],[m__1217]) ).

cnf(c_0_30,negated_conjecture,
    ( ~ aElement0(X1)
    | ~ aElementOf0(sdtpldt0(X1,smndt0(xx)),xI)
    | ~ aElementOf0(sdtpldt0(X1,smndt0(xy)),xJ) ),
    inference(split_conjunct,[status(thm)],[c_0_26]) ).

cnf(c_0_31,hypothesis,
    aElementOf0(sdtpldt0(xw,smndt0(xy)),xJ),
    inference(split_conjunct,[status(thm)],[m__1409]) ).

cnf(c_0_32,hypothesis,
    aElementOf0(sdtpldt0(xw,smndt0(xx)),xI),
    inference(split_conjunct,[status(thm)],[m__1332]) ).

cnf(c_0_33,hypothesis,
    aElement0(xw),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_21]),c_0_28]),c_0_29])]) ).

cnf(c_0_34,hypothesis,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_33])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : RNG099+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.44  % Computer : n001.cluster.edu
% 0.19/0.44  % Model    : x86_64 x86_64
% 0.19/0.44  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.44  % Memory   : 8046.5625MB
% 0.19/0.44  % OS       : Linux 6.8.0-71-generic
% 0.19/0.44  % CPULimit : 300
% 0.19/0.44  % WCLimit  : 300
% 0.19/0.44  % DateTime : Mon Sep 21 04:25:13 UTC 2026
% 0.19/0.44  % CPUTime  : 
% 0.19/0.44  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.50  Running first-order theorem proving
% 0.19/0.50  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
% 0.27/0.55  % Version: 3.5.1
% 0.27/0.55  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.27/0.55  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.55  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.27/0.55  % Starting new_bool_3 with 300s (1) cores
% 0.27/0.55  % Starting new_bool_1 with 300s (1) cores
% 0.27/0.55  % Starting sh5l with 300s (1) cores
% 0.27/0.55  % new_bool_1 with pid 2178307 completed with status 0
% 0.27/0.55  % Result found by new_bool_1
% 0.27/0.55  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.27/0.55  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.55  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.27/0.55  % Starting new_bool_3 with 300s (1) cores
% 0.27/0.55  % Starting new_bool_1 with 300s (1) cores
% 0.27/0.55  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.27/0.55  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.27/0.55  % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.27/0.55  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.27/0.55  % Starting SubtermCWHack with 28s (1) cores
% 0.27/0.55  % SubtermCWHack with pid 2178312 completed with status 0
% 0.27/0.55  % Result found by SubtermCWHack
% 0.27/0.55  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.27/0.55  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.55  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.27/0.55  % Starting new_bool_3 with 300s (1) cores
% 0.27/0.55  % Starting new_bool_1 with 300s (1) cores
% 0.27/0.55  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.27/0.55  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.27/0.55  % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.27/0.55  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.27/0.55  % Starting SubtermCWHack with 28s (1) cores
% 0.27/0.55  % Preprocessing time       : 0.002 s
% 0.27/0.55  
% 0.27/0.55  % Proof found!
% 0.27/0.55  % SZS status Theorem
% 0.27/0.55  % SZS output start CNFRefutation
% See solution above
% 0.27/0.55  % Parsed axioms                        : 35
% 0.27/0.55  % Removed by relevancy pruning/SinE    : 2
% 0.27/0.55  % Initial clauses                      : 74
% 0.27/0.55  % Removed in clause preprocessing      : 2
% 0.27/0.55  % Initial clauses in saturation        : 72
% 0.27/0.55  % Processed clauses                    : 253
% 0.27/0.55  % ...of these trivial                  : 6
% 0.27/0.55  % ...subsumed                          : 102
% 0.27/0.55  % ...remaining for further processing  : 145
% 0.27/0.55  % Other redundant clauses eliminated   : 3
% 0.27/0.55  % Clauses deleted for lack of memory   : 0
% 0.27/0.55  % Backward-subsumed                    : 3
% 0.27/0.55  % Backward-rewritten                   : 6
% 0.27/0.55  % Generated clauses                    : 737
% 0.27/0.55  % ...of the previous two non-redundant : 478
% 0.27/0.55  % ...aggressively subsumed             : 0
% 0.27/0.55  % Contextual simplify-reflections      : 0
% 0.27/0.55  % Paramodulations                      : 735
% 0.27/0.55  % Factorizations                       : 0
% 0.27/0.55  % NegExts                              : 0
% 0.27/0.55  % Equation resolutions                 : 3
% 0.27/0.55  % Disequality decompositions           : 0
% 0.27/0.55  % Total rewrite steps                  : 655
% 0.27/0.55  % ...of those cached                   : 626
% 0.27/0.55  % Propositional unsat checks           : 0
% 0.27/0.55  %    Propositional check models        : 0
% 0.27/0.55  %    Propositional check unsatisfiable : 0
% 0.27/0.55  %    Propositional clauses             : 0
% 0.27/0.55  %    Propositional clauses after purity: 0
% 0.27/0.55  %    Propositional unsat core size     : 0
% 0.27/0.55  %    Propositional preprocessing time  : 0.000
% 0.27/0.55  %    Propositional encoding time       : 0.000
% 0.27/0.55  %    Propositional solver time         : 0.000
% 0.27/0.55  %    Success case prop preproc time    : 0.000
% 0.27/0.55  %    Success case prop encoding time   : 0.000
% 0.27/0.55  %    Success case prop solver time     : 0.000
% 0.27/0.55  % Current number of processed clauses  : 134
% 0.27/0.55  %    Positive orientable unit clauses  : 31
% 0.27/0.55  %    Positive unorientable unit clauses: 0
% 0.27/0.55  %    Negative unit clauses             : 1
% 0.27/0.55  %    Non-unit-clauses                  : 102
% 0.27/0.55  % Current number of unprocessed clauses: 244
% 0.27/0.55  % ...number of literals in the above   : 1082
% 0.27/0.55  % Current number of archived formulas  : 0
% 0.27/0.55  % Current number of archived clauses   : 9
% 0.27/0.55  % Clause-clause subsumption calls (NU) : 1464
% 0.27/0.55  % Rec. Clause-clause subsumption calls : 1290
% 0.27/0.55  % Non-unit clause-clause subsumptions  : 105
% 0.27/0.55  % Unit Clause-clause subsumption calls : 65
% 0.27/0.55  % Rewrite failures with RHS unbound    : 0
% 0.27/0.55  % BW rewrite match attempts            : 7
% 0.27/0.55  % BW rewrite match successes           : 6
% 0.27/0.55  % Condensation attempts                : 0
% 0.27/0.55  % Condensation successes               : 0
% 0.27/0.55  % Termbank termtop insertions          : 14963
% 0.27/0.55  % Search garbage collected termcells   : 1051
% 0.27/0.55  
% 0.27/0.55  % -------------------------------------------------
% 0.27/0.55  % User time                : 0.022 s
% 0.27/0.55  % System time              : 0.004 s
% 0.27/0.55  % Total time               : 0.026 s
% 0.27/0.55  % Maximum resident set size: 3680 pages
% 0.27/0.55  
% 0.27/0.55  % -------------------------------------------------
% 0.27/0.55  % User time                : 0.026 s
% 0.27/0.55  % System time              : 0.009 s
% 0.27/0.55  % Total time               : 0.036 s
% 0.27/0.55  % Maximum resident set size: 4608 pages
% 0.27/0.55  % E exiting
%------------------------------------------------------------------------------