TSTP Solution File: NUM620+1 by ET---2.0

View Problem - Process Solution

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

% Computer : n029.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 09:34:29 EDT 2022

% Result   : Theorem 0.22s 1.41s
% Output   : CNFRefutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   43 (  10 unt;   0 def)
%            Number of atoms       :  139 (  32 equ)
%            Maximal formula atoms :   19 (   3 avg)
%            Number of connectives :  162 (  66   ~;  62   |;  22   &)
%                                         (   3 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :   18 (  18 usr;  10 con; 0-2 aty)
%            Number of variables   :   43 (   3 sgn  24   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(m__,conjecture,
    ( aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn)))
   => aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).

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

fof(m__3671,hypothesis,
    ! [X1] :
      ( aElementOf0(X1,szNzAzT0)
     => ( aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
        & isCountable0(sdtlpdtrp0(xN,X1)) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__3671) ).

fof(mNATSet,axiom,
    ( aSet0(szNzAzT0)
    & isCountable0(szNzAzT0) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mNATSet) ).

fof(mDefMin,axiom,
    ! [X1] :
      ( ( aSubsetOf0(X1,szNzAzT0)
        & X1 != slcrc0 )
     => ! [X2] :
          ( X2 = szmzizndt0(X1)
        <=> ( aElementOf0(X2,X1)
            & ! [X3] :
                ( aElementOf0(X3,X1)
               => sdtlseqdt0(X2,X3) ) ) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDefMin) ).

fof(mSuccNum,axiom,
    ! [X1] :
      ( aElementOf0(X1,szNzAzT0)
     => ( aElementOf0(szszuzczcdt0(X1),szNzAzT0)
        & szszuzczcdt0(X1) != sz00 ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mSuccNum) ).

fof(m__5401,hypothesis,
    xx = szmzizndt0(sdtlpdtrp0(xN,xm)),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__5401) ).

fof(mCountNFin_01,axiom,
    ! [X1] :
      ( ( aSet0(X1)
        & isCountable0(X1) )
     => X1 != slcrc0 ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mCountNFin_01) ).

fof(mDefEmp,axiom,
    ! [X1] :
      ( X1 = slcrc0
    <=> ( aSet0(X1)
        & ~ ? [X2] : aElementOf0(X2,X1) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDefEmp) ).

fof(m__5309,hypothesis,
    ( aElementOf0(xn,sdtlbdtrb0(xd,szDzizrdt0(xd)))
    & aElementOf0(xn,szNzAzT0)
    & sdtlpdtrp0(xe,xn) = xp ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__5309) ).

fof(m__5389,hypothesis,
    ( aElementOf0(xm,szNzAzT0)
    & xx = sdtlpdtrp0(xe,xm) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__5389) ).

fof(c_0_11,negated_conjecture,
    ~ ( aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn)))
     => aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))) ),
    inference(assume_negation,[status(cth)],[m__]) ).

fof(c_0_12,plain,
    ! [X4,X5,X6,X5] :
      ( ( aSet0(X5)
        | ~ aSubsetOf0(X5,X4)
        | ~ aSet0(X4) )
      & ( ~ aElementOf0(X6,X5)
        | aElementOf0(X6,X4)
        | ~ aSubsetOf0(X5,X4)
        | ~ aSet0(X4) )
      & ( aElementOf0(esk8_2(X4,X5),X5)
        | ~ aSet0(X5)
        | aSubsetOf0(X5,X4)
        | ~ aSet0(X4) )
      & ( ~ aElementOf0(esk8_2(X4,X5),X4)
        | ~ aSet0(X5)
        | aSubsetOf0(X5,X4)
        | ~ aSet0(X4) ) ),
    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)],[mDefSub])])])])])])]) ).

fof(c_0_13,negated_conjecture,
    ( aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn)))
    & ~ aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))) ),
    inference(fof_nnf,[status(thm)],[c_0_11]) ).

fof(c_0_14,hypothesis,
    ! [X2] :
      ( ( aSubsetOf0(sdtlpdtrp0(xN,X2),szNzAzT0)
        | ~ aElementOf0(X2,szNzAzT0) )
      & ( isCountable0(sdtlpdtrp0(xN,X2))
        | ~ aElementOf0(X2,szNzAzT0) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3671])])]) ).

cnf(c_0_15,plain,
    ( aElementOf0(X3,X1)
    | ~ aSet0(X1)
    | ~ aSubsetOf0(X2,X1)
    | ~ aElementOf0(X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_16,negated_conjecture,
    aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn))),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_17,plain,
    ( aSet0(X2)
    | ~ aSet0(X1)
    | ~ aSubsetOf0(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_18,hypothesis,
    ( aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
    | ~ aElementOf0(X1,szNzAzT0) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_19,plain,
    aSet0(szNzAzT0),
    inference(split_conjunct,[status(thm)],[mNATSet]) ).

cnf(c_0_20,negated_conjecture,
    ( aElementOf0(X1,sdtlpdtrp0(xN,szszuzczcdt0(xn)))
    | ~ aElementOf0(X1,sdtlpdtrp0(xN,xm))
    | ~ aSet0(sdtlpdtrp0(xN,szszuzczcdt0(xn))) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_21,hypothesis,
    ( aSet0(sdtlpdtrp0(xN,X1))
    | ~ aElementOf0(X1,szNzAzT0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).

fof(c_0_22,plain,
    ! [X4,X5,X6,X5] :
      ( ( aElementOf0(X5,X4)
        | X5 != szmzizndt0(X4)
        | ~ aSubsetOf0(X4,szNzAzT0)
        | X4 = slcrc0 )
      & ( ~ aElementOf0(X6,X4)
        | sdtlseqdt0(X5,X6)
        | X5 != szmzizndt0(X4)
        | ~ aSubsetOf0(X4,szNzAzT0)
        | X4 = slcrc0 )
      & ( aElementOf0(esk16_2(X4,X5),X4)
        | ~ aElementOf0(X5,X4)
        | X5 = szmzizndt0(X4)
        | ~ aSubsetOf0(X4,szNzAzT0)
        | X4 = slcrc0 )
      & ( ~ sdtlseqdt0(X5,esk16_2(X4,X5))
        | ~ aElementOf0(X5,X4)
        | X5 = szmzizndt0(X4)
        | ~ aSubsetOf0(X4,szNzAzT0)
        | X4 = slcrc0 ) ),
    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)],[mDefMin])])])])])])]) ).

cnf(c_0_23,negated_conjecture,
    ~ aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_24,hypothesis,
    ( aElementOf0(X1,sdtlpdtrp0(xN,szszuzczcdt0(xn)))
    | ~ aElementOf0(X1,sdtlpdtrp0(xN,xm))
    | ~ aElementOf0(szszuzczcdt0(xn),szNzAzT0) ),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

fof(c_0_25,plain,
    ! [X2] :
      ( ( aElementOf0(szszuzczcdt0(X2),szNzAzT0)
        | ~ aElementOf0(X2,szNzAzT0) )
      & ( szszuzczcdt0(X2) != sz00
        | ~ aElementOf0(X2,szNzAzT0) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSuccNum])])]) ).

cnf(c_0_26,plain,
    ( X1 = slcrc0
    | aElementOf0(X2,X1)
    | ~ aSubsetOf0(X1,szNzAzT0)
    | X2 != szmzizndt0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_22]) ).

cnf(c_0_27,hypothesis,
    xx = szmzizndt0(sdtlpdtrp0(xN,xm)),
    inference(split_conjunct,[status(thm)],[m__5401]) ).

fof(c_0_28,plain,
    ! [X2] :
      ( ~ aSet0(X2)
      | ~ isCountable0(X2)
      | X2 != slcrc0 ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mCountNFin_01])]) ).

fof(c_0_29,plain,
    ! [X3,X4,X3] :
      ( ( aSet0(X3)
        | X3 != slcrc0 )
      & ( ~ aElementOf0(X4,X3)
        | X3 != slcrc0 )
      & ( ~ aSet0(X3)
        | aElementOf0(esk19_1(X3),X3)
        | X3 = slcrc0 ) ),
    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)],[mDefEmp])])])])])])]) ).

cnf(c_0_30,negated_conjecture,
    ( ~ aElementOf0(xx,sdtlpdtrp0(xN,xm))
    | ~ aElementOf0(szszuzczcdt0(xn),szNzAzT0) ),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_31,plain,
    ( aElementOf0(szszuzczcdt0(X1),szNzAzT0)
    | ~ aElementOf0(X1,szNzAzT0) ),
    inference(split_conjunct,[status(thm)],[c_0_25]) ).

cnf(c_0_32,hypothesis,
    aElementOf0(xn,szNzAzT0),
    inference(split_conjunct,[status(thm)],[m__5309]) ).

cnf(c_0_33,hypothesis,
    ( sdtlpdtrp0(xN,xm) = slcrc0
    | aElementOf0(X1,sdtlpdtrp0(xN,xm))
    | X1 != xx
    | ~ aSubsetOf0(sdtlpdtrp0(xN,xm),szNzAzT0) ),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_34,hypothesis,
    aElementOf0(xm,szNzAzT0),
    inference(split_conjunct,[status(thm)],[m__5389]) ).

cnf(c_0_35,plain,
    ( X1 != slcrc0
    | ~ isCountable0(X1)
    | ~ aSet0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_28]) ).

cnf(c_0_36,hypothesis,
    ( isCountable0(sdtlpdtrp0(xN,X1))
    | ~ aElementOf0(X1,szNzAzT0) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_37,plain,
    ( aSet0(X1)
    | X1 != slcrc0 ),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

cnf(c_0_38,negated_conjecture,
    ~ aElementOf0(xx,sdtlpdtrp0(xN,xm)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).

cnf(c_0_39,hypothesis,
    ( sdtlpdtrp0(xN,xm) = slcrc0
    | aElementOf0(X1,sdtlpdtrp0(xN,xm))
    | X1 != xx ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_18]),c_0_34])]) ).

cnf(c_0_40,hypothesis,
    ( sdtlpdtrp0(xN,X1) != slcrc0
    | ~ aElementOf0(X1,szNzAzT0) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]) ).

cnf(c_0_41,hypothesis,
    sdtlpdtrp0(xN,xm) = slcrc0,
    inference(spm,[status(thm)],[c_0_38,c_0_39]) ).

cnf(c_0_42,hypothesis,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_34])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : NUM620+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12  % Command  : run_ET %s %d
% 0.12/0.33  % Computer : n029.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Wed Jul  6 17:57:13 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.22/1.41  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.41  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.41  # Preprocessing time       : 0.025 s
% 0.22/1.41  
% 0.22/1.41  # Proof found!
% 0.22/1.41  # SZS status Theorem
% 0.22/1.41  # SZS output start CNFRefutation
% See solution above
% 0.22/1.41  # Proof object total steps             : 43
% 0.22/1.41  # Proof object clause steps            : 24
% 0.22/1.41  # Proof object formula steps           : 19
% 0.22/1.41  # Proof object conjectures             : 8
% 0.22/1.41  # Proof object clause conjectures      : 5
% 0.22/1.41  # Proof object formula conjectures     : 3
% 0.22/1.41  # Proof object initial clauses used    : 14
% 0.22/1.41  # Proof object initial formulas used   : 11
% 0.22/1.41  # Proof object generating inferences   : 10
% 0.22/1.41  # Proof object simplifying inferences  : 9
% 0.22/1.41  # Training examples: 0 positive, 0 negative
% 0.22/1.41  # Parsed axioms                        : 117
% 0.22/1.41  # Removed by relevancy pruning/SinE    : 16
% 0.22/1.41  # Initial clauses                      : 185
% 0.22/1.41  # Removed in clause preprocessing      : 6
% 0.22/1.41  # Initial clauses in saturation        : 179
% 0.22/1.41  # Processed clauses                    : 347
% 0.22/1.41  # ...of these trivial                  : 2
% 0.22/1.41  # ...subsumed                          : 45
% 0.22/1.41  # ...remaining for further processing  : 300
% 0.22/1.41  # Other redundant clauses eliminated   : 10
% 0.22/1.41  # Clauses deleted for lack of memory   : 0
% 0.22/1.41  # Backward-subsumed                    : 1
% 0.22/1.41  # Backward-rewritten                   : 30
% 0.22/1.41  # Generated clauses                    : 748
% 0.22/1.41  # ...of the previous two non-trivial   : 701
% 0.22/1.41  # Contextual simplify-reflections      : 23
% 0.22/1.41  # Paramodulations                      : 721
% 0.22/1.41  # Factorizations                       : 0
% 0.22/1.41  # Equation resolutions                 : 27
% 0.22/1.41  # Current number of processed clauses  : 267
% 0.22/1.41  #    Positive orientable unit clauses  : 73
% 0.22/1.41  #    Positive unorientable unit clauses: 0
% 0.22/1.41  #    Negative unit clauses             : 24
% 0.22/1.41  #    Non-unit-clauses                  : 170
% 0.22/1.41  # Current number of unprocessed clauses: 500
% 0.22/1.41  # ...number of literals in the above   : 2419
% 0.22/1.41  # Current number of archived formulas  : 0
% 0.22/1.41  # Current number of archived clauses   : 31
% 0.22/1.41  # Clause-clause subsumption calls (NU) : 5990
% 0.22/1.41  # Rec. Clause-clause subsumption calls : 2133
% 0.22/1.41  # Non-unit clause-clause subsumptions  : 27
% 0.22/1.41  # Unit Clause-clause subsumption calls : 2224
% 0.22/1.41  # Rewrite failures with RHS unbound    : 0
% 0.22/1.41  # BW rewrite match attempts            : 5
% 0.22/1.41  # BW rewrite match successes           : 5
% 0.22/1.41  # Condensation attempts                : 0
% 0.22/1.41  # Condensation successes               : 0
% 0.22/1.41  # Termbank termtop insertions          : 24778
% 0.22/1.41  
% 0.22/1.41  # -------------------------------------------------
% 0.22/1.41  # User time                : 0.059 s
% 0.22/1.41  # System time              : 0.001 s
% 0.22/1.41  # Total time               : 0.060 s
% 0.22/1.41  # Maximum resident set size: 4828 pages
% 0.22/23.41  eprover: CPU time limit exceeded, terminating
% 0.22/23.42  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.42  eprover: No such file or directory
% 0.22/23.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.43  eprover: No such file or directory
% 0.22/23.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.43  eprover: No such file or directory
% 0.22/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.44  eprover: No such file or directory
% 0.22/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.44  eprover: No such file or directory
% 0.22/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.45  eprover: No such file or directory
% 0.22/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.45  eprover: No such file or directory
% 0.22/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.46  eprover: No such file or directory
% 0.22/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.47  eprover: No such file or directory
% 0.22/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.47  eprover: No such file or directory
% 0.22/23.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.48  eprover: No such file or directory
%------------------------------------------------------------------------------