TSTP Solution File: RNG047+2 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : RNG047+2 : TPTP v8.2.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n018.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 : Tue May 21 02:36:01 EDT 2024

% Result   : Theorem 0.21s 0.51s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   36 (  16 unt;   0 def)
%            Number of atoms       :   95 (  49 equ)
%            Maximal formula atoms :    9 (   2 avg)
%            Number of connectives :   86 (  27   ~;  22   |;  24   &)
%                                         (   0 <=>;  13  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   3 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   3 con; 0-2 aty)
%            Number of variables   :   24 (   0 sgn  15   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(mNatExtr,axiom,
    ! [X1] :
      ( ( aNaturalNumber0(X1)
        & X1 != sz00 )
     => ? [X2] :
          ( aNaturalNumber0(X2)
          & X1 = szszuzczcdt0(X2) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mNatExtr) ).

fof(mDimNat,axiom,
    ! [X1] :
      ( aVector0(X1)
     => aNaturalNumber0(aDimensionOf0(X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDimNat) ).

fof(m__1329_01,hypothesis,
    ( aDimensionOf0(xs) = aDimensionOf0(xt)
    & aDimensionOf0(xt) != sz00 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1329_01) ).

fof(m__1329,hypothesis,
    ( aVector0(xs)
    & aVector0(xt) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1329) ).

fof(m__,conjecture,
    ( ( aVector0(sziznziztdt0(xs))
      & szszuzczcdt0(aDimensionOf0(sziznziztdt0(xs))) = aDimensionOf0(xs)
      & ! [X1] :
          ( aNaturalNumber0(X1)
         => sdtlbdtrb0(sziznziztdt0(xs),X1) = sdtlbdtrb0(xs,X1) ) )
   => ( ( aVector0(sziznziztdt0(xt))
        & szszuzczcdt0(aDimensionOf0(sziznziztdt0(xt))) = aDimensionOf0(xt)
        & ! [X1] :
            ( aNaturalNumber0(X1)
           => sdtlbdtrb0(sziznziztdt0(xt),X1) = sdtlbdtrb0(xt,X1) ) )
     => aDimensionOf0(sziznziztdt0(xs)) = aDimensionOf0(sziznziztdt0(xt)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

fof(mSuccEqu,axiom,
    ! [X1,X2] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2) )
     => ( szszuzczcdt0(X1) = szszuzczcdt0(X2)
       => X1 = X2 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSuccEqu) ).

fof(c_0_6,plain,
    ! [X1] :
      ( ( aNaturalNumber0(X1)
        & X1 != sz00 )
     => ? [X2] :
          ( aNaturalNumber0(X2)
          & X1 = szszuzczcdt0(X2) ) ),
    inference(fof_simplification,[status(thm)],[mNatExtr]) ).

fof(c_0_7,plain,
    ! [X8] :
      ( ~ aVector0(X8)
      | aNaturalNumber0(aDimensionOf0(X8)) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDimNat])])]) ).

fof(c_0_8,hypothesis,
    ( aDimensionOf0(xs) = aDimensionOf0(xt)
    & aDimensionOf0(xt) != sz00 ),
    inference(fof_simplification,[status(thm)],[m__1329_01]) ).

fof(c_0_9,plain,
    ! [X10] :
      ( ( aNaturalNumber0(esk1_1(X10))
        | ~ aNaturalNumber0(X10)
        | X10 = sz00 )
      & ( X10 = szszuzczcdt0(esk1_1(X10))
        | ~ aNaturalNumber0(X10)
        | X10 = sz00 ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])]) ).

cnf(c_0_10,plain,
    ( aNaturalNumber0(aDimensionOf0(X1))
    | ~ aVector0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_11,hypothesis,
    aVector0(xt),
    inference(split_conjunct,[status(thm)],[m__1329]) ).

fof(c_0_12,hypothesis,
    ( aDimensionOf0(xs) = aDimensionOf0(xt)
    & aDimensionOf0(xt) != sz00 ),
    inference(fof_nnf,[status(thm)],[c_0_8]) ).

fof(c_0_13,negated_conjecture,
    ~ ( ( aVector0(sziznziztdt0(xs))
        & szszuzczcdt0(aDimensionOf0(sziznziztdt0(xs))) = aDimensionOf0(xs)
        & ! [X1] :
            ( aNaturalNumber0(X1)
           => sdtlbdtrb0(sziznziztdt0(xs),X1) = sdtlbdtrb0(xs,X1) ) )
     => ( ( aVector0(sziznziztdt0(xt))
          & szszuzczcdt0(aDimensionOf0(sziznziztdt0(xt))) = aDimensionOf0(xt)
          & ! [X1] :
              ( aNaturalNumber0(X1)
             => sdtlbdtrb0(sziznziztdt0(xt),X1) = sdtlbdtrb0(xt,X1) ) )
       => aDimensionOf0(sziznziztdt0(xs)) = aDimensionOf0(sziznziztdt0(xt)) ) ),
    inference(assume_negation,[status(cth)],[m__]) ).

fof(c_0_14,plain,
    ! [X20,X21] :
      ( ~ aNaturalNumber0(X20)
      | ~ aNaturalNumber0(X21)
      | szszuzczcdt0(X20) != szszuzczcdt0(X21)
      | X20 = X21 ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSuccEqu])])]) ).

cnf(c_0_15,plain,
    ( X1 = szszuzczcdt0(esk1_1(X1))
    | X1 = sz00
    | ~ aNaturalNumber0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_16,hypothesis,
    aNaturalNumber0(aDimensionOf0(xt)),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_17,hypothesis,
    aDimensionOf0(xt) != sz00,
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_18,plain,
    ( aNaturalNumber0(esk1_1(X1))
    | X1 = sz00
    | ~ aNaturalNumber0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

fof(c_0_19,negated_conjecture,
    ! [X5,X6] :
      ( aVector0(sziznziztdt0(xs))
      & szszuzczcdt0(aDimensionOf0(sziznziztdt0(xs))) = aDimensionOf0(xs)
      & ( ~ aNaturalNumber0(X5)
        | sdtlbdtrb0(sziznziztdt0(xs),X5) = sdtlbdtrb0(xs,X5) )
      & aVector0(sziznziztdt0(xt))
      & szszuzczcdt0(aDimensionOf0(sziznziztdt0(xt))) = aDimensionOf0(xt)
      & ( ~ aNaturalNumber0(X6)
        | sdtlbdtrb0(sziznziztdt0(xt),X6) = sdtlbdtrb0(xt,X6) )
      & aDimensionOf0(sziznziztdt0(xs)) != aDimensionOf0(sziznziztdt0(xt)) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])]) ).

cnf(c_0_20,plain,
    ( X1 = X2
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2)
    | szszuzczcdt0(X1) != szszuzczcdt0(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_21,hypothesis,
    szszuzczcdt0(esk1_1(aDimensionOf0(xt))) = aDimensionOf0(xt),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).

cnf(c_0_22,hypothesis,
    aNaturalNumber0(esk1_1(aDimensionOf0(xt))),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_16]),c_0_17]) ).

cnf(c_0_23,negated_conjecture,
    szszuzczcdt0(aDimensionOf0(sziznziztdt0(xs))) = aDimensionOf0(xs),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_24,hypothesis,
    aDimensionOf0(xs) = aDimensionOf0(xt),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_25,negated_conjecture,
    aVector0(sziznziztdt0(xs)),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_26,hypothesis,
    ( esk1_1(aDimensionOf0(xt)) = X1
    | szszuzczcdt0(X1) != aDimensionOf0(xt)
    | ~ aNaturalNumber0(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).

cnf(c_0_27,negated_conjecture,
    szszuzczcdt0(aDimensionOf0(sziznziztdt0(xs))) = aDimensionOf0(xt),
    inference(rw,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_28,negated_conjecture,
    aNaturalNumber0(aDimensionOf0(sziznziztdt0(xs))),
    inference(spm,[status(thm)],[c_0_10,c_0_25]) ).

cnf(c_0_29,negated_conjecture,
    esk1_1(aDimensionOf0(xt)) = aDimensionOf0(sziznziztdt0(xs)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).

cnf(c_0_30,negated_conjecture,
    aVector0(sziznziztdt0(xt)),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_31,hypothesis,
    ( aDimensionOf0(sziznziztdt0(xs)) = X1
    | szszuzczcdt0(X1) != aDimensionOf0(xt)
    | ~ aNaturalNumber0(X1) ),
    inference(rw,[status(thm)],[c_0_26,c_0_29]) ).

cnf(c_0_32,negated_conjecture,
    szszuzczcdt0(aDimensionOf0(sziznziztdt0(xt))) = aDimensionOf0(xt),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_33,negated_conjecture,
    aNaturalNumber0(aDimensionOf0(sziznziztdt0(xt))),
    inference(spm,[status(thm)],[c_0_10,c_0_30]) ).

cnf(c_0_34,negated_conjecture,
    aDimensionOf0(sziznziztdt0(xs)) != aDimensionOf0(sziznziztdt0(xt)),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : RNG047+2 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.14  % Command    : run_E %s %d THM
% 0.14/0.35  % Computer : n018.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   : Sat May 18 12:22:38 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.21/0.49  Running first-order theorem proving
% 0.21/0.49  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
% 0.21/0.51  # Version: 3.1.0
% 0.21/0.51  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.51  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51  # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51  # Starting sh5l with 300s (1) cores
% 0.21/0.51  # new_bool_3 with pid 23499 completed with status 0
% 0.21/0.51  # Result found by new_bool_3
% 0.21/0.51  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.51  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.51  # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.21/0.51  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.21/0.51  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 23503 completed with status 0
% 0.21/0.51  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.51  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.51  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.51  # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.21/0.51  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.21/0.51  # Preprocessing time       : 0.001 s
% 0.21/0.51  # Presaturation interreduction done
% 0.21/0.51  
% 0.21/0.51  # Proof found!
% 0.21/0.51  # SZS status Theorem
% 0.21/0.51  # SZS output start CNFRefutation
% See solution above
% 0.21/0.51  # Parsed axioms                        : 35
% 0.21/0.51  # Removed by relevancy pruning/SinE    : 22
% 0.21/0.51  # Initial clauses                      : 27
% 0.21/0.51  # Removed in clause preprocessing      : 3
% 0.21/0.51  # Initial clauses in saturation        : 24
% 0.21/0.51  # Processed clauses                    : 72
% 0.21/0.51  # ...of these trivial                  : 1
% 0.21/0.51  # ...subsumed                          : 3
% 0.21/0.51  # ...remaining for further processing  : 68
% 0.21/0.51  # Other redundant clauses eliminated   : 3
% 0.21/0.51  # Clauses deleted for lack of memory   : 0
% 0.21/0.51  # Backward-subsumed                    : 0
% 0.21/0.51  # Backward-rewritten                   : 3
% 0.21/0.51  # Generated clauses                    : 83
% 0.21/0.51  # ...of the previous two non-redundant : 69
% 0.21/0.51  # ...aggressively subsumed             : 0
% 0.21/0.51  # Contextual simplify-reflections      : 0
% 0.21/0.51  # Paramodulations                      : 79
% 0.21/0.51  # Factorizations                       : 0
% 0.21/0.51  # NegExts                              : 0
% 0.21/0.51  # Equation resolutions                 : 4
% 0.21/0.51  # Disequality decompositions           : 0
% 0.21/0.51  # Total rewrite steps                  : 38
% 0.21/0.51  # ...of those cached                   : 27
% 0.21/0.51  # Propositional unsat checks           : 0
% 0.21/0.51  #    Propositional check models        : 0
% 0.21/0.51  #    Propositional check unsatisfiable : 0
% 0.21/0.51  #    Propositional clauses             : 0
% 0.21/0.51  #    Propositional clauses after purity: 0
% 0.21/0.51  #    Propositional unsat core size     : 0
% 0.21/0.51  #    Propositional preprocessing time  : 0.000
% 0.21/0.51  #    Propositional encoding time       : 0.000
% 0.21/0.51  #    Propositional solver time         : 0.000
% 0.21/0.51  #    Success case prop preproc time    : 0.000
% 0.21/0.51  #    Success case prop encoding time   : 0.000
% 0.21/0.51  #    Success case prop solver time     : 0.000
% 0.21/0.51  # Current number of processed clauses  : 38
% 0.21/0.51  #    Positive orientable unit clauses  : 12
% 0.21/0.51  #    Positive unorientable unit clauses: 0
% 0.21/0.51  #    Negative unit clauses             : 2
% 0.21/0.51  #    Non-unit-clauses                  : 24
% 0.21/0.51  # Current number of unprocessed clauses: 44
% 0.21/0.51  # ...number of literals in the above   : 170
% 0.21/0.51  # Current number of archived formulas  : 0
% 0.21/0.51  # Current number of archived clauses   : 27
% 0.21/0.51  # Clause-clause subsumption calls (NU) : 67
% 0.21/0.51  # Rec. Clause-clause subsumption calls : 16
% 0.21/0.51  # Non-unit clause-clause subsumptions  : 0
% 0.21/0.51  # Unit Clause-clause subsumption calls : 1
% 0.21/0.51  # Rewrite failures with RHS unbound    : 0
% 0.21/0.51  # BW rewrite match attempts            : 4
% 0.21/0.51  # BW rewrite match successes           : 1
% 0.21/0.51  # Condensation attempts                : 0
% 0.21/0.51  # Condensation successes               : 0
% 0.21/0.51  # Termbank termtop insertions          : 3366
% 0.21/0.51  # Search garbage collected termcells   : 575
% 0.21/0.51  
% 0.21/0.51  # -------------------------------------------------
% 0.21/0.51  # User time                : 0.009 s
% 0.21/0.51  # System time              : 0.001 s
% 0.21/0.51  # Total time               : 0.010 s
% 0.21/0.51  # Maximum resident set size: 1836 pages
% 0.21/0.51  
% 0.21/0.51  # -------------------------------------------------
% 0.21/0.51  # User time                : 0.010 s
% 0.21/0.51  # System time              : 0.004 s
% 0.21/0.51  # Total time               : 0.014 s
% 0.21/0.51  # Maximum resident set size: 1732 pages
% 0.21/0.51  % E---3.1 exiting
% 0.21/0.52  % E exiting
%------------------------------------------------------------------------------