↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : NUM630+1 : TPTP v9.2.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %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  : 300s
% DateTime : Tue May  5 04:58:12 PM UTC 2026

% Result   : Theorem 1.89s 1.85s
% Output   : CNFRefutation 1.89s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   16 (  10 unt;   0 def)
%            Number of atoms       :   40 (  15 equ)
%            Maximal formula atoms :   10 (   2 avg)
%            Number of connectives :   36 (  12   ~;  10   |;  12   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   3 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   20 (  20 usr;  12 con; 0-2 aty)
%            Number of variables   :    7 (   0 sgn   4   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(m__4151,hypothesis,
    ( aFunction0(xC)
    & szDzozmdt0(xC) = szNzAzT0
    & ! [X1] :
        ( aElementOf0(X1,szNzAzT0)
       => ( aFunction0(sdtlpdtrp0(xC,X1))
          & szDzozmdt0(sdtlpdtrp0(xC,X1)) = slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))),xk)
          & ! [X2] :
              ( ( aSet0(X2)
                & aElementOf0(X2,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))),xk)) )
             => sdtlpdtrp0(sdtlpdtrp0(xC,X1),X2) = sdtlpdtrp0(xc,sdtpldt0(X2,szmzizndt0(sdtlpdtrp0(xN,X1)))) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4151) ).

fof(m__,conjecture,
    sdtlpdtrp0(xc,sdtpldt0(xP,szmzizndt0(sdtlpdtrp0(xN,xn)))) = sdtlpdtrp0(sdtlpdtrp0(xC,xn),xP),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

fof(m__5585,hypothesis,
    xD = sdtmndt0(sdtlpdtrp0(xN,xn),szmzizndt0(sdtlpdtrp0(xN,xn))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5585) ).

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

fof(m__5599,hypothesis,
    aElementOf0(xP,slbdtsldtrb0(xD,xk)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5599) ).

fof(m__5164,hypothesis,
    ( aSet0(xP)
    & xP = sdtmndt0(xQ,szmzizndt0(xQ)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5164) ).

fof(c_0_6,hypothesis,
    ! [X353,X354] :
      ( aFunction0(xC)
      & szDzozmdt0(xC) = szNzAzT0
      & ( aFunction0(sdtlpdtrp0(xC,X353))
        | ~ aElementOf0(X353,szNzAzT0) )
      & ( szDzozmdt0(sdtlpdtrp0(xC,X353)) = slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X353),szmzizndt0(sdtlpdtrp0(xN,X353))),xk)
        | ~ aElementOf0(X353,szNzAzT0) )
      & ( ~ aSet0(X354)
        | ~ aElementOf0(X354,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X353),szmzizndt0(sdtlpdtrp0(xN,X353))),xk))
        | sdtlpdtrp0(sdtlpdtrp0(xC,X353),X354) = sdtlpdtrp0(xc,sdtpldt0(X354,szmzizndt0(sdtlpdtrp0(xN,X353))))
        | ~ aElementOf0(X353,szNzAzT0) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__4151])])])]) ).

fof(c_0_7,negated_conjecture,
    sdtlpdtrp0(xc,sdtpldt0(xP,szmzizndt0(sdtlpdtrp0(xN,xn)))) != sdtlpdtrp0(sdtlpdtrp0(xC,xn),xP),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).

cnf(c_0_8,hypothesis,
    ( sdtlpdtrp0(sdtlpdtrp0(xC,X2),X1) = sdtlpdtrp0(xc,sdtpldt0(X1,szmzizndt0(sdtlpdtrp0(xN,X2))))
    | ~ aSet0(X1)
    | ~ aElementOf0(X1,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X2),szmzizndt0(sdtlpdtrp0(xN,X2))),xk))
    | ~ aElementOf0(X2,szNzAzT0) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_9,hypothesis,
    xD = sdtmndt0(sdtlpdtrp0(xN,xn),szmzizndt0(sdtlpdtrp0(xN,xn))),
    inference(split_conjunct,[status(thm)],[m__5585]) ).

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

cnf(c_0_11,negated_conjecture,
    sdtlpdtrp0(xc,sdtpldt0(xP,szmzizndt0(sdtlpdtrp0(xN,xn)))) != sdtlpdtrp0(sdtlpdtrp0(xC,xn),xP),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_12,hypothesis,
    ( sdtlpdtrp0(xc,sdtpldt0(X1,szmzizndt0(sdtlpdtrp0(xN,xn)))) = sdtlpdtrp0(sdtlpdtrp0(xC,xn),X1)
    | ~ aElementOf0(X1,slbdtsldtrb0(xD,xk))
    | ~ aSet0(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]) ).

cnf(c_0_13,hypothesis,
    aElementOf0(xP,slbdtsldtrb0(xD,xk)),
    inference(split_conjunct,[status(thm)],[m__5599]) ).

cnf(c_0_14,hypothesis,
    aSet0(xP),
    inference(split_conjunct,[status(thm)],[m__5164]) ).

cnf(c_0_15,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14])]),
    [proof] ).

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