↑ Up

ET---2.0.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : NUM622+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n008.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:30 EDT 2022

% Result   : Theorem 0.23s 1.42s
% Output   : CNFRefutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   45 (  16 unt;   0 def)
%            Number of atoms       :  139 (  32 equ)
%            Maximal formula atoms :   19 (   3 avg)
%            Number of connectives :  155 (  61   ~;  61   |;  23   &)
%                                         (   3 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    9 (   7 usr;   1 prp; 0-2 aty)
%            Number of functors    :   17 (  17 usr;   9 con; 0-2 aty)
%            Number of variables   :   43 (   3 sgn  24   !;   1   ?)

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

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/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDefMin) ).

fof(m__4660,hypothesis,
    ( aFunction0(xe)
    & szDzozmdt0(xe) = szNzAzT0
    & ! [X1] :
        ( aElementOf0(X1,szNzAzT0)
       => sdtlpdtrp0(xe,X1) = szmzizndt0(sdtlpdtrp0(xN,X1)) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__4660) ).

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

fof(m__5461,hypothesis,
    aSubsetOf0(sdtlpdtrp0(xN,xn),sdtlpdtrp0(xN,xm)),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__5461) ).

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

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

fof(m__,conjecture,
    aElementOf0(xp,sdtlpdtrp0(xN,xm)),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).

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

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

fof(mEmpFin,axiom,
    isFinite0(slcrc0),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mEmpFin) ).

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

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,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])])])])])])]) ).

fof(c_0_14,hypothesis,
    ! [X2] :
      ( aFunction0(xe)
      & szDzozmdt0(xe) = szNzAzT0
      & ( ~ aElementOf0(X2,szNzAzT0)
        | sdtlpdtrp0(xe,X2) = szmzizndt0(sdtlpdtrp0(xN,X2)) ) ),
    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)],[m__4660])])])])]) ).

fof(c_0_15,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_16,plain,
    ( aElementOf0(X3,X1)
    | ~ aSet0(X1)
    | ~ aSubsetOf0(X2,X1)
    | ~ aElementOf0(X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_17,hypothesis,
    aSubsetOf0(sdtlpdtrp0(xN,xn),sdtlpdtrp0(xN,xm)),
    inference(split_conjunct,[status(thm)],[m__5461]) ).

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

cnf(c_0_19,hypothesis,
    ( sdtlpdtrp0(xe,X1) = szmzizndt0(sdtlpdtrp0(xN,X1))
    | ~ aElementOf0(X1,szNzAzT0) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

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

cnf(c_0_21,hypothesis,
    ( aElementOf0(X1,sdtlpdtrp0(xN,xm))
    | ~ aElementOf0(X1,sdtlpdtrp0(xN,xn))
    | ~ aSet0(sdtlpdtrp0(xN,xm)) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_22,hypothesis,
    ( sdtlpdtrp0(xN,X1) = slcrc0
    | aElementOf0(X2,sdtlpdtrp0(xN,X1))
    | X2 != sdtlpdtrp0(xe,X1)
    | ~ aElementOf0(X1,szNzAzT0) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).

cnf(c_0_23,hypothesis,
    sdtlpdtrp0(xe,xn) = xp,
    inference(split_conjunct,[status(thm)],[m__5309]) ).

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

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

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

fof(c_0_27,negated_conjecture,
    ~ aElementOf0(xp,sdtlpdtrp0(xN,xm)),
    inference(assume_negation,[status(cth)],[m__]) ).

cnf(c_0_28,hypothesis,
    ( sdtlpdtrp0(xN,xn) = slcrc0
    | aElementOf0(X1,sdtlpdtrp0(xN,xm))
    | X1 != xp
    | ~ aSet0(sdtlpdtrp0(xN,xm)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24])]) ).

cnf(c_0_29,hypothesis,
    ( aSet0(sdtlpdtrp0(xN,X1))
    | ~ aElementOf0(X1,szNzAzT0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_20]),c_0_26])]) ).

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

fof(c_0_31,negated_conjecture,
    ~ aElementOf0(xp,sdtlpdtrp0(xN,xm)),
    inference(fof_simplification,[status(thm)],[c_0_27]) ).

fof(c_0_32,plain,
    ! [X2] :
      ( ~ aSet0(X2)
      | ~ isCountable0(X2)
      | ~ isFinite0(X2) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[mCountNFin])])]) ).

cnf(c_0_33,hypothesis,
    ( sdtlpdtrp0(xN,xn) = slcrc0
    | aElementOf0(X1,sdtlpdtrp0(xN,xm))
    | X1 != xp ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).

cnf(c_0_34,negated_conjecture,
    ~ aElementOf0(xp,sdtlpdtrp0(xN,xm)),
    inference(split_conjunct,[status(thm)],[c_0_31]) ).

cnf(c_0_35,plain,
    ( ~ isFinite0(X1)
    | ~ isCountable0(X1)
    | ~ aSet0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_32]) ).

cnf(c_0_36,plain,
    isFinite0(slcrc0),
    inference(split_conjunct,[status(thm)],[mEmpFin]) ).

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

cnf(c_0_38,hypothesis,
    sdtlpdtrp0(xN,xn) = slcrc0,
    inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_33]),c_0_34]) ).

cnf(c_0_39,plain,
    ( ~ isCountable0(slcrc0)
    | ~ aSet0(slcrc0) ),
    inference(spm,[status(thm)],[c_0_35,c_0_36]) ).

cnf(c_0_40,hypothesis,
    isCountable0(slcrc0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_24])]) ).

fof(c_0_41,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_42,plain,
    ~ aSet0(slcrc0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40])]) ).

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

cnf(c_0_44,plain,
    $false,
    inference(spm,[status(thm)],[c_0_42,c_0_43]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : NUM622+1 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.13  % Command  : run_ET %s %d
% 0.12/0.34  % Computer : n008.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 : Wed Jul  6 12:26:08 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.025 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             : 45
% 0.23/1.42  # Proof object clause steps            : 25
% 0.23/1.42  # Proof object formula steps           : 20
% 0.23/1.42  # Proof object conjectures             : 4
% 0.23/1.42  # Proof object clause conjectures      : 1
% 0.23/1.42  # Proof object formula conjectures     : 3
% 0.23/1.42  # Proof object initial clauses used    : 15
% 0.23/1.42  # Proof object initial formulas used   : 12
% 0.23/1.42  # Proof object generating inferences   : 9
% 0.23/1.42  # Proof object simplifying inferences  : 13
% 0.23/1.42  # Training examples: 0 positive, 0 negative
% 0.23/1.42  # Parsed axioms                        : 119
% 0.23/1.42  # Removed by relevancy pruning/SinE    : 18
% 0.23/1.42  # Initial clauses                      : 184
% 0.23/1.42  # Removed in clause preprocessing      : 6
% 0.23/1.42  # Initial clauses in saturation        : 178
% 0.23/1.42  # Processed clauses                    : 583
% 0.23/1.42  # ...of these trivial                  : 6
% 0.23/1.42  # ...subsumed                          : 145
% 0.23/1.42  # ...remaining for further processing  : 432
% 0.23/1.42  # Other redundant clauses eliminated   : 12
% 0.23/1.42  # Clauses deleted for lack of memory   : 0
% 0.23/1.42  # Backward-subsumed                    : 15
% 0.23/1.42  # Backward-rewritten                   : 26
% 0.23/1.42  # Generated clauses                    : 1342
% 0.23/1.42  # ...of the previous two non-trivial   : 1243
% 0.23/1.42  # Contextual simplify-reflections      : 53
% 0.23/1.42  # Paramodulations                      : 1306
% 0.23/1.42  # Factorizations                       : 0
% 0.23/1.42  # Equation resolutions                 : 35
% 0.23/1.42  # Current number of processed clauses  : 388
% 0.23/1.42  #    Positive orientable unit clauses  : 94
% 0.23/1.42  #    Positive unorientable unit clauses: 0
% 0.23/1.42  #    Negative unit clauses             : 32
% 0.23/1.42  #    Non-unit-clauses                  : 262
% 0.23/1.42  # Current number of unprocessed clauses: 775
% 0.23/1.42  # ...number of literals in the above   : 3930
% 0.23/1.42  # Current number of archived formulas  : 0
% 0.23/1.42  # Current number of archived clauses   : 42
% 0.23/1.42  # Clause-clause subsumption calls (NU) : 12658
% 0.23/1.42  # Rec. Clause-clause subsumption calls : 6204
% 0.23/1.42  # Non-unit clause-clause subsumptions  : 85
% 0.23/1.42  # Unit Clause-clause subsumption calls : 3210
% 0.23/1.42  # Rewrite failures with RHS unbound    : 0
% 0.23/1.42  # BW rewrite match attempts            : 8
% 0.23/1.42  # BW rewrite match successes           : 7
% 0.23/1.42  # Condensation attempts                : 0
% 0.23/1.42  # Condensation successes               : 0
% 0.23/1.42  # Termbank termtop insertions          : 33768
% 0.23/1.42  
% 0.23/1.42  # -------------------------------------------------
% 0.23/1.42  # User time                : 0.083 s
% 0.23/1.42  # System time              : 0.002 s
% 0.23/1.42  # Total time               : 0.085 s
% 0.23/1.42  # Maximum resident set size: 5352 pages
% 0.23/23.42  eprover: CPU time limit exceeded, terminating
% 0.23/23.44  eprover: Cannot stat file /export/starexec/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47  eprover: No such file or directory
% 0.23/23.47  eprover: Cannot stat file /export/starexec/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.49  eprover: No such file or directory
% 0.23/23.50  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.50  eprover: No such file or directory
%------------------------------------------------------------------------------