↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : RNG105+1 : TPTP v9.2.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d

% Computer : n005.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  : 300s
% DateTime : Tue May  5 05:05:21 PM UTC 2026

% Result   : Theorem 1.29s 1.72s
% Output   : CNFRefutation 1.29s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   31 (  13 unt;   0 def)
%            Number of atoms       :   94 (  21 equ)
%            Maximal formula atoms :   32 (   3 avg)
%            Number of connectives :  106 (  43   ~;  42   |;  16   &)
%                                         (   2 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   19 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   6 con; 0-3 aty)
%            Number of variables   :   29 (   0 sgn  18   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(mDefPrIdeal,axiom,
    ! [X1] :
      ( aElement0(X1)
     => ! [X2] :
          ( X2 = slsdtgt0(X1)
        <=> ( aSet0(X2)
            & ! [X3] :
                ( aElementOf0(X3,X2)
              <=> ? [X4] :
                    ( aElement0(X4)
                    & sdtasdt0(X1,X4) = X3 ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefPrIdeal) ).

fof(m__,conjecture,
    ( aElementOf0(sdtpldt0(xx,xy),slsdtgt0(xc))
    & aElementOf0(sdtasdt0(xz,xx),slsdtgt0(xc)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).

fof(m__2043,hypothesis,
    sdtasdt0(xz,xx) = sdtasdt0(xc,sdtasdt0(xu,xz)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2043) ).

fof(m__1905,hypothesis,
    aElement0(xc),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1905) ).

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

fof(m__1933,hypothesis,
    ( aElementOf0(xx,slsdtgt0(xc))
    & aElementOf0(xy,slsdtgt0(xc))
    & aElement0(xz) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1933) ).

fof(m__1956,hypothesis,
    ( aElement0(xu)
    & sdtasdt0(xc,xu) = xx ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1956) ).

fof(m__2010,hypothesis,
    sdtpldt0(xx,xy) = sdtasdt0(xc,sdtpldt0(xu,xv)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2010) ).

fof(mSortsB,axiom,
    ! [X1,X2] :
      ( ( aElement0(X1)
        & aElement0(X2) )
     => aElement0(sdtpldt0(X1,X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsB) ).

fof(m__1979,hypothesis,
    ( aElement0(xv)
    & sdtasdt0(xc,xv) = xy ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1979) ).

fof(c_0_10,plain,
    ! [X183,X184,X185,X187,X188,X189,X191] :
      ( ( aSet0(X184)
        | X184 != slsdtgt0(X183)
        | ~ aElement0(X183) )
      & ( aElement0(esk18_3(X183,X184,X185))
        | ~ aElementOf0(X185,X184)
        | X184 != slsdtgt0(X183)
        | ~ aElement0(X183) )
      & ( sdtasdt0(X183,esk18_3(X183,X184,X185)) = X185
        | ~ aElementOf0(X185,X184)
        | X184 != slsdtgt0(X183)
        | ~ aElement0(X183) )
      & ( ~ aElement0(X188)
        | sdtasdt0(X183,X188) != X187
        | aElementOf0(X187,X184)
        | X184 != slsdtgt0(X183)
        | ~ aElement0(X183) )
      & ( ~ aElementOf0(esk19_2(X183,X189),X189)
        | ~ aElement0(X191)
        | sdtasdt0(X183,X191) != esk19_2(X183,X189)
        | ~ aSet0(X189)
        | X189 = slsdtgt0(X183)
        | ~ aElement0(X183) )
      & ( aElement0(esk20_2(X183,X189))
        | aElementOf0(esk19_2(X183,X189),X189)
        | ~ aSet0(X189)
        | X189 = slsdtgt0(X183)
        | ~ aElement0(X183) )
      & ( sdtasdt0(X183,esk20_2(X183,X189)) = esk19_2(X183,X189)
        | aElementOf0(esk19_2(X183,X189),X189)
        | ~ aSet0(X189)
        | X189 = slsdtgt0(X183)
        | ~ aElement0(X183) ) ),
    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)],[mDefPrIdeal])])])])])]) ).

cnf(c_0_11,plain,
    ( aElementOf0(X3,X4)
    | ~ aElement0(X1)
    | sdtasdt0(X2,X1) != X3
    | X4 != slsdtgt0(X2)
    | ~ aElement0(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

fof(c_0_12,negated_conjecture,
    ~ ( aElementOf0(sdtpldt0(xx,xy),slsdtgt0(xc))
      & aElementOf0(sdtasdt0(xz,xx),slsdtgt0(xc)) ),
    inference(assume_negation,[status(cth)],[m__]) ).

cnf(c_0_13,plain,
    ( aElementOf0(sdtasdt0(X1,X2),slsdtgt0(X1))
    | ~ aElement0(X1)
    | ~ aElement0(X2) ),
    inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_11])]) ).

cnf(c_0_14,hypothesis,
    sdtasdt0(xz,xx) = sdtasdt0(xc,sdtasdt0(xu,xz)),
    inference(split_conjunct,[status(thm)],[m__2043]) ).

cnf(c_0_15,hypothesis,
    aElement0(xc),
    inference(split_conjunct,[status(thm)],[m__1905]) ).

fof(c_0_16,plain,
    ! [X93,X94] :
      ( ~ aElement0(X93)
      | ~ aElement0(X94)
      | aElement0(sdtasdt0(X93,X94)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])]) ).

fof(c_0_17,negated_conjecture,
    ( ~ aElementOf0(sdtpldt0(xx,xy),slsdtgt0(xc))
    | ~ aElementOf0(sdtasdt0(xz,xx),slsdtgt0(xc)) ),
    inference(fof_nnf,[status(thm)],[c_0_12]) ).

cnf(c_0_18,hypothesis,
    ( aElementOf0(sdtasdt0(xz,xx),slsdtgt0(xc))
    | ~ aElement0(sdtasdt0(xu,xz)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).

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

cnf(c_0_20,hypothesis,
    aElement0(xz),
    inference(split_conjunct,[status(thm)],[m__1933]) ).

cnf(c_0_21,hypothesis,
    aElement0(xu),
    inference(split_conjunct,[status(thm)],[m__1956]) ).

cnf(c_0_22,negated_conjecture,
    ( ~ aElementOf0(sdtpldt0(xx,xy),slsdtgt0(xc))
    | ~ aElementOf0(sdtasdt0(xz,xx),slsdtgt0(xc)) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_23,hypothesis,
    aElementOf0(sdtasdt0(xz,xx),slsdtgt0(xc)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21])]) ).

cnf(c_0_24,hypothesis,
    sdtpldt0(xx,xy) = sdtasdt0(xc,sdtpldt0(xu,xv)),
    inference(split_conjunct,[status(thm)],[m__2010]) ).

cnf(c_0_25,negated_conjecture,
    ~ aElementOf0(sdtpldt0(xx,xy),slsdtgt0(xc)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]) ).

fof(c_0_26,plain,
    ! [X91,X92] :
      ( ~ aElement0(X91)
      | ~ aElement0(X92)
      | aElement0(sdtpldt0(X91,X92)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB])]) ).

cnf(c_0_27,hypothesis,
    ~ aElement0(sdtpldt0(xu,xv)),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_24]),c_0_15])]),c_0_25]) ).

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

cnf(c_0_29,hypothesis,
    aElement0(xv),
    inference(split_conjunct,[status(thm)],[m__1979]) ).

cnf(c_0_30,hypothesis,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_21])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : RNG105+1 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.11  % Command    : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.32  % Computer : n005.cluster.edu
% 0.15/0.32  % Model    : x86_64 x86_64
% 0.15/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.32  % Memory   : 8042.1875MB
% 0.15/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.32  % CPULimit   : 300
% 0.15/0.32  % WCLimit    : 300
% 0.15/0.32  % DateTime   : Tue May  5 01:50:45 EDT 2026
% 0.15/0.33  % CPUTime    : 
% 0.15/0.34  % start to proof: theBenchmark
% 1.29/1.72  % Version  : CSE_E---1.7
% 1.29/1.72  % Problem  : theBenchmark.p
% 1.29/1.72  % SZS status Theorem for theBenchmark.p
% 1.29/1.72  % SZS output start CNFRefutation
% See solution above
% 1.29/1.72  % Total time : 1.369s
%------------------------------------------------------------------------------