↑ Up

ET---2.0.THM-CRf.s

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

% Computer : n004.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:33:34 EDT 2022

% Result   : Theorem 0.24s 1.41s
% Output   : CNFRefutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   30 (   8 unt;   0 def)
%            Number of atoms       :  138 (  30 equ)
%            Maximal formula atoms :   19 (   4 avg)
%            Number of connectives :  164 (  56   ~;  50   |;  42   &)
%                                         (   2 <=>;  14  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   7 con; 0-2 aty)
%            Number of variables   :   44 (   3 sgn  28   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
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(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(m__1802,hypothesis,
    ( aElementOf0(szmzizndt0(xS),xS)
    & ! [X1] :
        ( aElementOf0(X1,xS)
       => sdtlseqdt0(szmzizndt0(xS),X1) )
    & aElementOf0(szmzizndt0(xS),xT)
    & aElementOf0(szmzizndt0(xT),xT)
    & ! [X1] :
        ( aElementOf0(X1,xT)
       => sdtlseqdt0(szmzizndt0(xT),X1) )
    & aElementOf0(szmzizndt0(xT),xS) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1802) ).

fof(m__1779,hypothesis,
    ( aSet0(xS)
    & ! [X1] :
        ( aElementOf0(X1,xS)
       => aElementOf0(X1,szNzAzT0) )
    & aSubsetOf0(xS,szNzAzT0)
    & aSet0(xT)
    & ! [X1] :
        ( aElementOf0(X1,xT)
       => aElementOf0(X1,szNzAzT0) )
    & aSubsetOf0(xT,szNzAzT0)
    & ~ ( ~ ? [X1] : aElementOf0(X1,xS)
        | xS = slcrc0 )
    & ~ ( ~ ? [X1] : aElementOf0(X1,xT)
        | xT = slcrc0 ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1779) ).

fof(m__,conjecture,
    ( ( aElementOf0(szmzizndt0(xS),xS)
      & ! [X1] :
          ( aElementOf0(X1,xS)
         => sdtlseqdt0(szmzizndt0(xS),X1) ) )
   => ( ! [X1] :
          ( aElementOf0(X1,xT)
         => sdtlseqdt0(szmzizndt0(xS),X1) )
      | szmzizndt0(xS) = szmzizndt0(xT) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).

fof(mLessASymm,axiom,
    ! [X1,X2] :
      ( ( aElementOf0(X1,szNzAzT0)
        & aElementOf0(X2,szNzAzT0) )
     => ( ( sdtlseqdt0(X1,X2)
          & sdtlseqdt0(X2,X1) )
       => X1 = X2 ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mLessASymm) ).

fof(c_0_6,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(esk6_2(X4,X5),X4)
        | ~ aElementOf0(X5,X4)
        | X5 = szmzizndt0(X4)
        | ~ aSubsetOf0(X4,szNzAzT0)
        | X4 = slcrc0 )
      & ( ~ sdtlseqdt0(X5,esk6_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_7,plain,
    ! [X3,X4,X3] :
      ( ( aSet0(X3)
        | X3 != slcrc0 )
      & ( ~ aElementOf0(X4,X3)
        | X3 != slcrc0 )
      & ( ~ aSet0(X3)
        | aElementOf0(esk4_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_8,plain,
    ( X1 = slcrc0
    | sdtlseqdt0(X2,X3)
    | ~ aSubsetOf0(X1,szNzAzT0)
    | X2 != szmzizndt0(X1)
    | ~ aElementOf0(X3,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_9,plain,
    ( X1 != slcrc0
    | ~ aElementOf0(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

fof(c_0_10,hypothesis,
    ! [X2,X3] :
      ( aElementOf0(szmzizndt0(xS),xS)
      & ( ~ aElementOf0(X2,xS)
        | sdtlseqdt0(szmzizndt0(xS),X2) )
      & aElementOf0(szmzizndt0(xS),xT)
      & aElementOf0(szmzizndt0(xT),xT)
      & ( ~ aElementOf0(X3,xT)
        | sdtlseqdt0(szmzizndt0(xT),X3) )
      & aElementOf0(szmzizndt0(xT),xS) ),
    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__1802])])])])]) ).

fof(c_0_11,hypothesis,
    ! [X2,X3] :
      ( aSet0(xS)
      & ( ~ aElementOf0(X2,xS)
        | aElementOf0(X2,szNzAzT0) )
      & aSubsetOf0(xS,szNzAzT0)
      & aSet0(xT)
      & ( ~ aElementOf0(X3,xT)
        | aElementOf0(X3,szNzAzT0) )
      & aSubsetOf0(xT,szNzAzT0)
      & aElementOf0(esk1_0,xS)
      & xS != slcrc0
      & aElementOf0(esk2_0,xT)
      & xT != slcrc0 ),
    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__1779])])])])])]) ).

cnf(c_0_12,plain,
    ( sdtlseqdt0(X1,X2)
    | X1 != szmzizndt0(X3)
    | ~ aSubsetOf0(X3,szNzAzT0)
    | ~ aElementOf0(X2,X3) ),
    inference(csr,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_13,hypothesis,
    aElementOf0(szmzizndt0(xT),xS),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_14,hypothesis,
    aSubsetOf0(xS,szNzAzT0),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

fof(c_0_15,negated_conjecture,
    ~ ( ( aElementOf0(szmzizndt0(xS),xS)
        & ! [X1] :
            ( aElementOf0(X1,xS)
           => sdtlseqdt0(szmzizndt0(xS),X1) ) )
     => ( ! [X1] :
            ( aElementOf0(X1,xT)
           => sdtlseqdt0(szmzizndt0(xS),X1) )
        | szmzizndt0(xS) = szmzizndt0(xT) ) ),
    inference(assume_negation,[status(cth)],[m__]) ).

fof(c_0_16,plain,
    ! [X3,X4] :
      ( ~ aElementOf0(X3,szNzAzT0)
      | ~ aElementOf0(X4,szNzAzT0)
      | ~ sdtlseqdt0(X3,X4)
      | ~ sdtlseqdt0(X4,X3)
      | X3 = X4 ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLessASymm])]) ).

cnf(c_0_17,hypothesis,
    ( sdtlseqdt0(X1,szmzizndt0(xT))
    | X1 != szmzizndt0(xS) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).

fof(c_0_18,negated_conjecture,
    ! [X2] :
      ( aElementOf0(szmzizndt0(xS),xS)
      & ( ~ aElementOf0(X2,xS)
        | sdtlseqdt0(szmzizndt0(xS),X2) )
      & aElementOf0(esk3_0,xT)
      & ~ sdtlseqdt0(szmzizndt0(xS),esk3_0)
      & szmzizndt0(xS) != szmzizndt0(xT) ),
    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)],[c_0_15])])])])])]) ).

cnf(c_0_19,plain,
    ( X1 = X2
    | ~ sdtlseqdt0(X2,X1)
    | ~ sdtlseqdt0(X1,X2)
    | ~ aElementOf0(X2,szNzAzT0)
    | ~ aElementOf0(X1,szNzAzT0) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_20,hypothesis,
    sdtlseqdt0(szmzizndt0(xS),szmzizndt0(xT)),
    inference(er,[status(thm)],[c_0_17]) ).

cnf(c_0_21,negated_conjecture,
    szmzizndt0(xS) != szmzizndt0(xT),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_22,hypothesis,
    ( ~ sdtlseqdt0(szmzizndt0(xT),szmzizndt0(xS))
    | ~ aElementOf0(szmzizndt0(xS),szNzAzT0)
    | ~ aElementOf0(szmzizndt0(xT),szNzAzT0) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).

cnf(c_0_23,hypothesis,
    ( sdtlseqdt0(szmzizndt0(xT),X1)
    | ~ aElementOf0(X1,xT) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_24,hypothesis,
    aElementOf0(szmzizndt0(xS),xT),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_25,hypothesis,
    ( ~ aElementOf0(szmzizndt0(xS),szNzAzT0)
    | ~ aElementOf0(szmzizndt0(xT),szNzAzT0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).

cnf(c_0_26,hypothesis,
    ( aElementOf0(X1,szNzAzT0)
    | ~ aElementOf0(X1,xS) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_27,hypothesis,
    aElementOf0(szmzizndt0(xS),xS),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_28,hypothesis,
    ~ aElementOf0(szmzizndt0(xT),szNzAzT0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).

cnf(c_0_29,hypothesis,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_26]),c_0_13])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : NUM539+2 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.13  % Command  : run_ET %s %d
% 0.14/0.34  % Computer : n004.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Wed Jul  6 15:13:22 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.24/1.41  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.41  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.41  # Preprocessing time       : 0.020 s
% 0.24/1.41  
% 0.24/1.41  # Proof found!
% 0.24/1.41  # SZS status Theorem
% 0.24/1.41  # SZS output start CNFRefutation
% See solution above
% 0.24/1.41  # Proof object total steps             : 30
% 0.24/1.41  # Proof object clause steps            : 17
% 0.24/1.41  # Proof object formula steps           : 13
% 0.24/1.41  # Proof object conjectures             : 4
% 0.24/1.41  # Proof object clause conjectures      : 1
% 0.24/1.41  # Proof object formula conjectures     : 3
% 0.24/1.41  # Proof object initial clauses used    : 10
% 0.24/1.41  # Proof object initial formulas used   : 6
% 0.24/1.41  # Proof object generating inferences   : 6
% 0.24/1.41  # Proof object simplifying inferences  : 10
% 0.24/1.41  # Training examples: 0 positive, 0 negative
% 0.24/1.41  # Parsed axioms                        : 51
% 0.24/1.41  # Removed by relevancy pruning/SinE    : 3
% 0.24/1.41  # Initial clauses                      : 97
% 0.24/1.41  # Removed in clause preprocessing      : 5
% 0.24/1.41  # Initial clauses in saturation        : 92
% 0.24/1.41  # Processed clauses                    : 151
% 0.24/1.41  # ...of these trivial                  : 3
% 0.24/1.41  # ...subsumed                          : 23
% 0.24/1.41  # ...remaining for further processing  : 125
% 0.24/1.41  # Other redundant clauses eliminated   : 10
% 0.24/1.41  # Clauses deleted for lack of memory   : 0
% 0.24/1.41  # Backward-subsumed                    : 2
% 0.24/1.41  # Backward-rewritten                   : 0
% 0.24/1.41  # Generated clauses                    : 272
% 0.24/1.41  # ...of the previous two non-trivial   : 238
% 0.24/1.41  # Contextual simplify-reflections      : 17
% 0.24/1.41  # Paramodulations                      : 248
% 0.24/1.41  # Factorizations                       : 0
% 0.24/1.41  # Equation resolutions                 : 24
% 0.24/1.41  # Current number of processed clauses  : 121
% 0.24/1.41  #    Positive orientable unit clauses  : 25
% 0.24/1.41  #    Positive unorientable unit clauses: 0
% 0.24/1.41  #    Negative unit clauses             : 8
% 0.24/1.41  #    Non-unit-clauses                  : 88
% 0.24/1.41  # Current number of unprocessed clauses: 178
% 0.24/1.41  # ...number of literals in the above   : 886
% 0.24/1.41  # Current number of archived formulas  : 0
% 0.24/1.41  # Current number of archived clauses   : 2
% 0.24/1.41  # Clause-clause subsumption calls (NU) : 1848
% 0.24/1.41  # Rec. Clause-clause subsumption calls : 476
% 0.24/1.41  # Non-unit clause-clause subsumptions  : 23
% 0.24/1.41  # Unit Clause-clause subsumption calls : 121
% 0.24/1.41  # Rewrite failures with RHS unbound    : 0
% 0.24/1.41  # BW rewrite match attempts            : 0
% 0.24/1.41  # BW rewrite match successes           : 0
% 0.24/1.41  # Condensation attempts                : 0
% 0.24/1.41  # Condensation successes               : 0
% 0.24/1.41  # Termbank termtop insertions          : 9954
% 0.24/1.41  
% 0.24/1.41  # -------------------------------------------------
% 0.24/1.41  # User time                : 0.030 s
% 0.24/1.41  # System time              : 0.002 s
% 0.24/1.41  # Total time               : 0.032 s
% 0.24/1.41  # Maximum resident set size: 3460 pages
%------------------------------------------------------------------------------