TSTP Solution File: RNG120+4 by ET---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : RNG120+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n027.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  : 600s
% DateTime : Mon Jul 18 20:26:59 EDT 2022

% Result   : Theorem 0.23s 1.42s
% Output   : CNFRefutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   33 (   9 unt;   0 def)
%            Number of atoms       :  144 (  30 equ)
%            Maximal formula atoms :   33 (   4 avg)
%            Number of connectives :  168 (  57   ~;  49   |;  50   &)
%                                         (   3 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   32 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :   20 (  20 usr;  10 con; 0-2 aty)
%            Number of variables   :   57 (   3 sgn  37   !;  12   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(m__,conjecture,
    ( ? [X1,X2] :
        ( aElementOf0(X1,slsdtgt0(xa))
        & aElementOf0(X2,slsdtgt0(xb))
        & sdtpldt0(X1,X2) = smndt0(sdtasdt0(xq,xu)) )
    | aElementOf0(smndt0(sdtasdt0(xq,xu)),xI) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).

fof(mMulMnOne,axiom,
    ! [X1] :
      ( aElement0(X1)
     => ( sdtasdt0(smndt0(sz10),X1) = smndt0(X1)
        & smndt0(X1) = sdtasdt0(X1,smndt0(sz10)) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mMulMnOne) ).

fof(m__2174,hypothesis,
    ( aSet0(xI)
    & ! [X1] :
        ( aElementOf0(X1,xI)
       => ( ! [X2] :
              ( aElementOf0(X2,xI)
             => aElementOf0(sdtpldt0(X1,X2),xI) )
          & ! [X2] :
              ( aElement0(X2)
             => aElementOf0(sdtasdt0(X2,X1),xI) ) ) )
    & aIdeal0(xI)
    & ! [X1] :
        ( aElementOf0(X1,slsdtgt0(xa))
      <=> ? [X2] :
            ( aElement0(X2)
            & sdtasdt0(xa,X2) = X1 ) )
    & ! [X1] :
        ( aElementOf0(X1,slsdtgt0(xb))
      <=> ? [X2] :
            ( aElement0(X2)
            & sdtasdt0(xb,X2) = X1 ) )
    & ! [X1] :
        ( aElementOf0(X1,xI)
      <=> ? [X2,X3] :
            ( aElementOf0(X2,slsdtgt0(xa))
            & aElementOf0(X3,slsdtgt0(xb))
            & sdtpldt0(X2,X3) = X1 ) )
    & xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2174) ).

fof(mSortsU,axiom,
    ! [X1] :
      ( aElement0(X1)
     => aElement0(smndt0(X1)) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mSortsU) ).

fof(mSortsC_01,axiom,
    aElement0(sz10),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mSortsC_01) ).

fof(m__2273,hypothesis,
    ( ? [X1,X2] :
        ( aElementOf0(X1,slsdtgt0(xa))
        & aElementOf0(X2,slsdtgt0(xb))
        & sdtpldt0(X1,X2) = xu )
    & aElementOf0(xu,xI)
    & xu != sz00
    & ! [X1] :
        ( ( ( ? [X2,X3] :
                ( aElementOf0(X2,slsdtgt0(xa))
                & aElementOf0(X3,slsdtgt0(xb))
                & sdtpldt0(X2,X3) = X1 )
            | aElementOf0(X1,xI) )
          & X1 != sz00 )
       => ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2273) ).

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

fof(m__2666,hypothesis,
    ( aElement0(xq)
    & aElement0(xr)
    & xb = sdtpldt0(sdtasdt0(xq,xu),xr)
    & ( xr = sz00
      | iLess0(sbrdtbr0(xr),sbrdtbr0(xu)) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2666) ).

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

fof(c_0_9,negated_conjecture,
    ~ ( ? [X1,X2] :
          ( aElementOf0(X1,slsdtgt0(xa))
          & aElementOf0(X2,slsdtgt0(xb))
          & sdtpldt0(X1,X2) = smndt0(sdtasdt0(xq,xu)) )
      | aElementOf0(smndt0(sdtasdt0(xq,xu)),xI) ),
    inference(assume_negation,[status(cth)],[m__]) ).

fof(c_0_10,negated_conjecture,
    ! [X3,X4] :
      ( ( ~ aElementOf0(X3,slsdtgt0(xa))
        | ~ aElementOf0(X4,slsdtgt0(xb))
        | sdtpldt0(X3,X4) != smndt0(sdtasdt0(xq,xu)) )
      & ~ aElementOf0(smndt0(sdtasdt0(xq,xu)),xI) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])]) ).

fof(c_0_11,plain,
    ! [X2] :
      ( ( sdtasdt0(smndt0(sz10),X2) = smndt0(X2)
        | ~ aElement0(X2) )
      & ( smndt0(X2) = sdtasdt0(X2,smndt0(sz10))
        | ~ aElement0(X2) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulMnOne])])]) ).

cnf(c_0_12,negated_conjecture,
    ~ aElementOf0(smndt0(sdtasdt0(xq,xu)),xI),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_13,plain,
    ( sdtasdt0(smndt0(sz10),X1) = smndt0(X1)
    | ~ aElement0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

fof(c_0_14,hypothesis,
    ! [X4,X5,X6,X7,X7,X9,X10,X10,X12,X13,X13,X16,X17] :
      ( aSet0(xI)
      & ( ~ aElementOf0(X5,xI)
        | aElementOf0(sdtpldt0(X4,X5),xI)
        | ~ aElementOf0(X4,xI) )
      & ( ~ aElement0(X6)
        | aElementOf0(sdtasdt0(X6,X4),xI)
        | ~ aElementOf0(X4,xI) )
      & aIdeal0(xI)
      & ( aElement0(esk4_1(X7))
        | ~ aElementOf0(X7,slsdtgt0(xa)) )
      & ( sdtasdt0(xa,esk4_1(X7)) = X7
        | ~ aElementOf0(X7,slsdtgt0(xa)) )
      & ( ~ aElement0(X9)
        | sdtasdt0(xa,X9) != X7
        | aElementOf0(X7,slsdtgt0(xa)) )
      & ( aElement0(esk5_1(X10))
        | ~ aElementOf0(X10,slsdtgt0(xb)) )
      & ( sdtasdt0(xb,esk5_1(X10)) = X10
        | ~ aElementOf0(X10,slsdtgt0(xb)) )
      & ( ~ aElement0(X12)
        | sdtasdt0(xb,X12) != X10
        | aElementOf0(X10,slsdtgt0(xb)) )
      & ( aElementOf0(esk6_1(X13),slsdtgt0(xa))
        | ~ aElementOf0(X13,xI) )
      & ( aElementOf0(esk7_1(X13),slsdtgt0(xb))
        | ~ aElementOf0(X13,xI) )
      & ( sdtpldt0(esk6_1(X13),esk7_1(X13)) = X13
        | ~ aElementOf0(X13,xI) )
      & ( ~ aElementOf0(X16,slsdtgt0(xa))
        | ~ aElementOf0(X17,slsdtgt0(xb))
        | sdtpldt0(X16,X17) != X13
        | aElementOf0(X13,xI) )
      & xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__2174])])])])])])]) ).

cnf(c_0_15,negated_conjecture,
    ( ~ aElementOf0(sdtasdt0(smndt0(sz10),sdtasdt0(xq,xu)),xI)
    | ~ aElement0(sdtasdt0(xq,xu)) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_16,hypothesis,
    ( aElementOf0(sdtasdt0(X2,X1),xI)
    | ~ aElementOf0(X1,xI)
    | ~ aElement0(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

fof(c_0_17,plain,
    ! [X2] :
      ( ~ aElement0(X2)
      | aElement0(smndt0(X2)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsU])]) ).

cnf(c_0_18,hypothesis,
    ( ~ aElementOf0(sdtasdt0(xq,xu),xI)
    | ~ aElement0(sdtasdt0(xq,xu))
    | ~ aElement0(smndt0(sz10)) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_19,plain,
    ( aElement0(smndt0(X1))
    | ~ aElement0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_20,plain,
    aElement0(sz10),
    inference(split_conjunct,[status(thm)],[mSortsC_01]) ).

fof(c_0_21,hypothesis,
    ! [X6,X7,X8] :
      ( aElementOf0(esk17_0,slsdtgt0(xa))
      & aElementOf0(esk18_0,slsdtgt0(xb))
      & sdtpldt0(esk17_0,esk18_0) = xu
      & aElementOf0(xu,xI)
      & xu != sz00
      & ( ~ aElementOf0(X7,slsdtgt0(xa))
        | ~ aElementOf0(X8,slsdtgt0(xb))
        | sdtpldt0(X7,X8) != X6
        | X6 = sz00
        | ~ iLess0(sbrdtbr0(X6),sbrdtbr0(xu)) )
      & ( ~ aElementOf0(X6,xI)
        | X6 = sz00
        | ~ iLess0(sbrdtbr0(X6),sbrdtbr0(xu)) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[m__2273])])])])])])])]) ).

fof(c_0_22,plain,
    ! [X3,X4] :
      ( ~ aSet0(X3)
      | ~ aElementOf0(X4,X3)
      | aElement0(X4) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEOfElem])])])])]) ).

cnf(c_0_23,hypothesis,
    ( ~ aElementOf0(sdtasdt0(xq,xu),xI)
    | ~ aElement0(sdtasdt0(xq,xu)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).

cnf(c_0_24,hypothesis,
    aElementOf0(xu,xI),
    inference(split_conjunct,[status(thm)],[c_0_21]) ).

cnf(c_0_25,hypothesis,
    aElement0(xq),
    inference(split_conjunct,[status(thm)],[m__2666]) ).

fof(c_0_26,plain,
    ! [X3,X4] :
      ( ~ aElement0(X3)
      | ~ aElement0(X4)
      | aElement0(sdtasdt0(X3,X4)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])]) ).

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

cnf(c_0_28,hypothesis,
    aSet0(xI),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_29,hypothesis,
    ~ aElement0(sdtasdt0(xq,xu)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_16]),c_0_24]),c_0_25])]) ).

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

cnf(c_0_31,hypothesis,
    aElement0(xu),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_24]),c_0_28])]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : RNG120+4 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.13  % Command  : run_ET %s %d
% 0.12/0.34  % Computer : n027.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Mon May 30 16:59:16 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.23/1.42  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.42  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.42  # Preprocessing time       : 0.024 s
% 0.23/1.42  
% 0.23/1.42  # Proof found!
% 0.23/1.42  # SZS status Theorem
% 0.23/1.42  # SZS output start CNFRefutation
% See solution above
% 0.23/1.42  # Proof object total steps             : 33
% 0.23/1.42  # Proof object clause steps            : 16
% 0.23/1.42  # Proof object formula steps           : 17
% 0.23/1.42  # Proof object conjectures             : 5
% 0.23/1.42  # Proof object clause conjectures      : 2
% 0.23/1.42  # Proof object formula conjectures     : 3
% 0.23/1.42  # Proof object initial clauses used    : 10
% 0.23/1.42  # Proof object initial formulas used   : 9
% 0.23/1.42  # Proof object generating inferences   : 6
% 0.23/1.42  # Proof object simplifying inferences  : 10
% 0.23/1.42  # Training examples: 0 positive, 0 negative
% 0.23/1.42  # Parsed axioms                        : 52
% 0.23/1.42  # Removed by relevancy pruning/SinE    : 5
% 0.23/1.42  # Initial clauses                      : 185
% 0.23/1.42  # Removed in clause preprocessing      : 4
% 0.23/1.42  # Initial clauses in saturation        : 181
% 0.23/1.42  # Processed clauses                    : 273
% 0.23/1.42  # ...of these trivial                  : 13
% 0.23/1.42  # ...subsumed                          : 24
% 0.23/1.42  # ...remaining for further processing  : 236
% 0.23/1.42  # Other redundant clauses eliminated   : 29
% 0.23/1.42  # Clauses deleted for lack of memory   : 0
% 0.23/1.42  # Backward-subsumed                    : 1
% 0.23/1.42  # Backward-rewritten                   : 31
% 0.23/1.42  # Generated clauses                    : 1234
% 0.23/1.42  # ...of the previous two non-trivial   : 1130
% 0.23/1.42  # Contextual simplify-reflections      : 11
% 0.23/1.42  # Paramodulations                      : 1196
% 0.23/1.42  # Factorizations                       : 0
% 0.23/1.42  # Equation resolutions                 : 37
% 0.23/1.42  # Current number of processed clauses  : 203
% 0.23/1.42  #    Positive orientable unit clauses  : 57
% 0.23/1.42  #    Positive unorientable unit clauses: 0
% 0.23/1.42  #    Negative unit clauses             : 13
% 0.23/1.42  #    Non-unit-clauses                  : 133
% 0.23/1.42  # Current number of unprocessed clauses: 826
% 0.23/1.42  # ...number of literals in the above   : 3585
% 0.23/1.42  # Current number of archived formulas  : 0
% 0.23/1.42  # Current number of archived clauses   : 33
% 0.23/1.42  # Clause-clause subsumption calls (NU) : 2802
% 0.23/1.42  # Rec. Clause-clause subsumption calls : 1056
% 0.23/1.42  # Non-unit clause-clause subsumptions  : 25
% 0.23/1.42  # Unit Clause-clause subsumption calls : 713
% 0.23/1.42  # Rewrite failures with RHS unbound    : 0
% 0.23/1.42  # BW rewrite match attempts            : 3
% 0.23/1.42  # BW rewrite match successes           : 3
% 0.23/1.42  # Condensation attempts                : 0
% 0.23/1.42  # Condensation successes               : 0
% 0.23/1.42  # Termbank termtop insertions          : 27354
% 0.23/1.42  
% 0.23/1.42  # -------------------------------------------------
% 0.23/1.42  # User time                : 0.056 s
% 0.23/1.42  # System time              : 0.004 s
% 0.23/1.42  # Total time               : 0.060 s
% 0.23/1.42  # Maximum resident set size: 4672 pages
% 0.23/23.42  eprover: CPU time limit exceeded, terminating
% 0.23/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44  eprover: No such file or directory
% 0.23/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44  eprover: No such file or directory
% 0.23/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45  eprover: No such file or directory
% 0.23/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45  eprover: No such file or directory
% 0.23/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46  eprover: No such file or directory
% 0.23/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46  eprover: No such file or directory
% 0.23/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47  eprover: No such file or directory
% 0.23/23.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.48  eprover: No such file or directory
% 0.23/23.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.48  eprover: No such file or directory
% 0.23/23.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.49  eprover: No such file or directory
% 0.23/23.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.49  eprover: No such file or directory
%------------------------------------------------------------------------------