TSTP Solution File: RNG047+1 by E---3.1

View Problem - Process Solution

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

% Computer : n009.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 : 2400s
% WCLimit  : 300s
% DateTime : Tue Oct 10 19:14:51 EDT 2023

% Result   : Theorem 0.20s 0.50s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   33 (  11 unt;   0 def)
%            Number of atoms       :  109 (  56 equ)
%            Maximal formula atoms :   25 (   3 avg)
%            Number of connectives :  122 (  46   ~;  56   |;  12   &)
%                                         (   1 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   3 con; 0-2 aty)
%            Number of variables   :   31 (   0 sgn;  15   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(mDefInit,axiom,
    ! [X1] :
      ( aVector0(X1)
     => ( aDimensionOf0(X1) != sz00
       => ! [X2] :
            ( X2 = sziznziztdt0(X1)
          <=> ( aVector0(X2)
              & szszuzczcdt0(aDimensionOf0(X2)) = aDimensionOf0(X1)
              & ! [X3] :
                  ( aNaturalNumber0(X3)
                 => sdtlbdtrb0(X2,X3) = sdtlbdtrb0(X1,X3) ) ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.qx7DsXFRL8/E---3.1_13770.p',mDefInit) ).

fof(mDimNat,axiom,
    ! [X1] :
      ( aVector0(X1)
     => aNaturalNumber0(aDimensionOf0(X1)) ),
    file('/export/starexec/sandbox/tmp/tmp.qx7DsXFRL8/E---3.1_13770.p',mDimNat) ).

fof(mSuccEqu,axiom,
    ! [X1,X2] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2) )
     => ( szszuzczcdt0(X1) = szszuzczcdt0(X2)
       => X1 = X2 ) ),
    file('/export/starexec/sandbox/tmp/tmp.qx7DsXFRL8/E---3.1_13770.p',mSuccEqu) ).

fof(mNatExtr,axiom,
    ! [X1] :
      ( ( aNaturalNumber0(X1)
        & X1 != sz00 )
     => ? [X2] :
          ( aNaturalNumber0(X2)
          & X1 = szszuzczcdt0(X2) ) ),
    file('/export/starexec/sandbox/tmp/tmp.qx7DsXFRL8/E---3.1_13770.p',mNatExtr) ).

fof(m__1329_01,hypothesis,
    ( aDimensionOf0(xs) = aDimensionOf0(xt)
    & aDimensionOf0(xt) != sz00 ),
    file('/export/starexec/sandbox/tmp/tmp.qx7DsXFRL8/E---3.1_13770.p',m__1329_01) ).

fof(m__1329,hypothesis,
    ( aVector0(xs)
    & aVector0(xt) ),
    file('/export/starexec/sandbox/tmp/tmp.qx7DsXFRL8/E---3.1_13770.p',m__1329) ).

fof(m__,conjecture,
    aDimensionOf0(sziznziztdt0(xs)) = aDimensionOf0(sziznziztdt0(xt)),
    file('/export/starexec/sandbox/tmp/tmp.qx7DsXFRL8/E---3.1_13770.p',m__) ).

fof(c_0_7,plain,
    ! [X9,X10,X11,X12] :
      ( ( aVector0(X10)
        | X10 != sziznziztdt0(X9)
        | aDimensionOf0(X9) = sz00
        | ~ aVector0(X9) )
      & ( szszuzczcdt0(aDimensionOf0(X10)) = aDimensionOf0(X9)
        | X10 != sziznziztdt0(X9)
        | aDimensionOf0(X9) = sz00
        | ~ aVector0(X9) )
      & ( ~ aNaturalNumber0(X11)
        | sdtlbdtrb0(X10,X11) = sdtlbdtrb0(X9,X11)
        | X10 != sziznziztdt0(X9)
        | aDimensionOf0(X9) = sz00
        | ~ aVector0(X9) )
      & ( aNaturalNumber0(esk2_2(X9,X12))
        | ~ aVector0(X12)
        | szszuzczcdt0(aDimensionOf0(X12)) != aDimensionOf0(X9)
        | X12 = sziznziztdt0(X9)
        | aDimensionOf0(X9) = sz00
        | ~ aVector0(X9) )
      & ( sdtlbdtrb0(X12,esk2_2(X9,X12)) != sdtlbdtrb0(X9,esk2_2(X9,X12))
        | ~ aVector0(X12)
        | szszuzczcdt0(aDimensionOf0(X12)) != aDimensionOf0(X9)
        | X12 = sziznziztdt0(X9)
        | aDimensionOf0(X9) = sz00
        | ~ aVector0(X9) ) ),
    inference(distribute,[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)],[mDefInit])])])])])]) ).

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

cnf(c_0_9,plain,
    ( aVector0(X1)
    | aDimensionOf0(X2) = sz00
    | X1 != sziznziztdt0(X2)
    | ~ aVector0(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

fof(c_0_10,plain,
    ! [X14,X15] :
      ( ~ aNaturalNumber0(X14)
      | ~ aNaturalNumber0(X15)
      | szszuzczcdt0(X14) != szszuzczcdt0(X15)
      | X14 = X15 ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSuccEqu])]) ).

cnf(c_0_11,plain,
    ( szszuzczcdt0(aDimensionOf0(X1)) = aDimensionOf0(X2)
    | aDimensionOf0(X2) = sz00
    | X1 != sziznziztdt0(X2)
    | ~ aVector0(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

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

cnf(c_0_13,plain,
    ( aDimensionOf0(X1) = sz00
    | aVector0(sziznziztdt0(X1))
    | ~ aVector0(X1) ),
    inference(er,[status(thm)],[c_0_9]) ).

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

cnf(c_0_15,plain,
    ( szszuzczcdt0(aDimensionOf0(sziznziztdt0(X1))) = aDimensionOf0(X1)
    | aDimensionOf0(X1) = sz00
    | ~ aVector0(X1) ),
    inference(er,[status(thm)],[c_0_11]) ).

cnf(c_0_16,plain,
    ( aDimensionOf0(X1) = sz00
    | aNaturalNumber0(aDimensionOf0(sziznziztdt0(X1)))
    | ~ aVector0(X1) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

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

cnf(c_0_18,plain,
    ( aDimensionOf0(sziznziztdt0(X1)) = X2
    | aDimensionOf0(X1) = sz00
    | aDimensionOf0(X1) != szszuzczcdt0(X2)
    | ~ aVector0(X1)
    | ~ aNaturalNumber0(X2) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).

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

cnf(c_0_20,plain,
    ( esk1_1(aDimensionOf0(X1)) = aDimensionOf0(sziznziztdt0(X1))
    | aDimensionOf0(X1) = sz00
    | ~ aVector0(X1)
    | ~ aNaturalNumber0(esk1_1(aDimensionOf0(X1))) ),
    inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19])]),c_0_12]) ).

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

cnf(c_0_22,hypothesis,
    aVector0(xs),
    inference(split_conjunct,[status(thm)],[m__1329]) ).

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

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

cnf(c_0_25,hypothesis,
    ( esk1_1(aDimensionOf0(xt)) = aDimensionOf0(sziznziztdt0(xs))
    | ~ aNaturalNumber0(esk1_1(aDimensionOf0(xt))) ),
    inference(sr,[status(thm)],[inference(cn,[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_26,plain,
    ( aNaturalNumber0(esk1_1(X1))
    | X1 = sz00
    | ~ aNaturalNumber0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_27,hypothesis,
    aNaturalNumber0(aDimensionOf0(xt)),
    inference(spm,[status(thm)],[c_0_12,c_0_24]) ).

fof(c_0_28,negated_conjecture,
    aDimensionOf0(sziznziztdt0(xs)) != aDimensionOf0(sziznziztdt0(xt)),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).

cnf(c_0_29,hypothesis,
    esk1_1(aDimensionOf0(xt)) = aDimensionOf0(sziznziztdt0(xs)),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]),c_0_23]) ).

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

cnf(c_0_31,hypothesis,
    ~ aNaturalNumber0(aDimensionOf0(sziznziztdt0(xs))),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_29]),c_0_24])]),c_0_30]),c_0_23]) ).

cnf(c_0_32,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_16]),c_0_21]),c_0_22])]),c_0_23]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem    : RNG047+1 : TPTP v8.1.2. Released v4.0.0.
% 0.06/0.14  % Command    : run_E %s %d THM
% 0.14/0.35  % Computer : n009.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   : 2400
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Mon Oct  2 19:44:59 EDT 2023
% 0.14/0.35  % CPUTime    : 
% 0.20/0.48  Running first-order theorem proving
% 0.20/0.48  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/tmp/tmp.qx7DsXFRL8/E---3.1_13770.p
% 0.20/0.50  # Version: 3.1pre001
% 0.20/0.50  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50  # Starting sh5l with 300s (1) cores
% 0.20/0.50  # new_bool_3 with pid 13849 completed with status 0
% 0.20/0.50  # Result found by new_bool_3
% 0.20/0.50  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50  # Search class: FGHSF-FFSS21-SFFFFFNN
% 0.20/0.50  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.50  # SAT001_MinMin_p005000_rr_RG with pid 13852 completed with status 0
% 0.20/0.50  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.50  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50  # Search class: FGHSF-FFSS21-SFFFFFNN
% 0.20/0.50  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.50  # Preprocessing time       : 0.001 s
% 0.20/0.50  # Presaturation interreduction done
% 0.20/0.50  
% 0.20/0.50  # Proof found!
% 0.20/0.50  # SZS status Theorem
% 0.20/0.50  # SZS output start CNFRefutation
% See solution above
% 0.20/0.50  # Parsed axioms                        : 35
% 0.20/0.50  # Removed by relevancy pruning/SinE    : 22
% 0.20/0.50  # Initial clauses                      : 21
% 0.20/0.50  # Removed in clause preprocessing      : 3
% 0.20/0.50  # Initial clauses in saturation        : 18
% 0.20/0.50  # Processed clauses                    : 53
% 0.20/0.50  # ...of these trivial                  : 1
% 0.20/0.50  # ...subsumed                          : 3
% 0.20/0.50  # ...remaining for further processing  : 49
% 0.20/0.50  # Other redundant clauses eliminated   : 6
% 0.20/0.50  # Clauses deleted for lack of memory   : 0
% 0.20/0.50  # Backward-subsumed                    : 1
% 0.20/0.50  # Backward-rewritten                   : 1
% 0.20/0.50  # Generated clauses                    : 37
% 0.20/0.50  # ...of the previous two non-redundant : 27
% 0.20/0.50  # ...aggressively subsumed             : 0
% 0.20/0.50  # Contextual simplify-reflections      : 2
% 0.20/0.50  # Paramodulations                      : 29
% 0.20/0.50  # Factorizations                       : 0
% 0.20/0.50  # NegExts                              : 0
% 0.20/0.50  # Equation resolutions                 : 8
% 0.20/0.50  # Total rewrite steps                  : 23
% 0.20/0.50  # Propositional unsat checks           : 0
% 0.20/0.50  #    Propositional check models        : 0
% 0.20/0.50  #    Propositional check unsatisfiable : 0
% 0.20/0.50  #    Propositional clauses             : 0
% 0.20/0.50  #    Propositional clauses after purity: 0
% 0.20/0.50  #    Propositional unsat core size     : 0
% 0.20/0.50  #    Propositional preprocessing time  : 0.000
% 0.20/0.50  #    Propositional encoding time       : 0.000
% 0.20/0.50  #    Propositional solver time         : 0.000
% 0.20/0.50  #    Success case prop preproc time    : 0.000
% 0.20/0.50  #    Success case prop encoding time   : 0.000
% 0.20/0.50  #    Success case prop solver time     : 0.000
% 0.20/0.50  # Current number of processed clauses  : 26
% 0.20/0.50  #    Positive orientable unit clauses  : 6
% 0.20/0.50  #    Positive unorientable unit clauses: 0
% 0.20/0.50  #    Negative unit clauses             : 4
% 0.20/0.50  #    Non-unit-clauses                  : 16
% 0.20/0.50  # Current number of unprocessed clauses: 9
% 0.20/0.50  # ...number of literals in the above   : 46
% 0.20/0.50  # Current number of archived formulas  : 0
% 0.20/0.50  # Current number of archived clauses   : 20
% 0.20/0.50  # Clause-clause subsumption calls (NU) : 87
% 0.20/0.50  # Rec. Clause-clause subsumption calls : 18
% 0.20/0.50  # Non-unit clause-clause subsumptions  : 5
% 0.20/0.50  # Unit Clause-clause subsumption calls : 7
% 0.20/0.50  # Rewrite failures with RHS unbound    : 0
% 0.20/0.50  # BW rewrite match attempts            : 1
% 0.20/0.50  # BW rewrite match successes           : 1
% 0.20/0.50  # Condensation attempts                : 0
% 0.20/0.50  # Condensation successes               : 0
% 0.20/0.50  # Termbank termtop insertions          : 2007
% 0.20/0.50  
% 0.20/0.50  # -------------------------------------------------
% 0.20/0.50  # User time                : 0.007 s
% 0.20/0.50  # System time              : 0.000 s
% 0.20/0.50  # Total time               : 0.008 s
% 0.20/0.50  # Maximum resident set size: 1864 pages
% 0.20/0.50  
% 0.20/0.50  # -------------------------------------------------
% 0.20/0.50  # User time                : 0.009 s
% 0.20/0.50  # System time              : 0.003 s
% 0.20/0.50  # Total time               : 0.012 s
% 0.20/0.50  # Maximum resident set size: 1716 pages
% 0.20/0.50  % E---3.1 exiting
% 0.20/0.50  % E---3.1 exiting
%------------------------------------------------------------------------------