↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : NUM613+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 : n019.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:02 PM UTC 2026

% Result   : Theorem 1.39s 1.76s
% Output   : CNFRefutation 1.39s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   17 (  11 unt;   0 def)
%            Number of atoms       :   31 (  19 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   24 (  10   ~;   8   |;   4   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-1 aty)
%            Number of variables   :    7 (   0 sgn   4   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(mSuccEquSucc,axiom,
    ! [X1,X2] :
      ( ( aElementOf0(X1,szNzAzT0)
        & aElementOf0(X2,szNzAzT0) )
     => ( szszuzczcdt0(X1) = szszuzczcdt0(X2)
       => X1 = X2 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSuccEquSucc) ).

fof(m__5255,hypothesis,
    ( sbrdtbr0(xQ) = szszuzczcdt0(xk)
    & szszuzczcdt0(sbrdtbr0(xP)) = sbrdtbr0(xQ)
    & aElementOf0(sbrdtbr0(xP),szNzAzT0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5255) ).

fof(m__3533,hypothesis,
    ( aElementOf0(xk,szNzAzT0)
    & szszuzczcdt0(xk) = xK ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3533) ).

fof(m__,conjecture,
    sbrdtbr0(xP) = xk,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

fof(c_0_4,plain,
    ! [X226,X227] :
      ( ~ aElementOf0(X226,szNzAzT0)
      | ~ aElementOf0(X227,szNzAzT0)
      | szszuzczcdt0(X226) != szszuzczcdt0(X227)
      | X226 = X227 ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSuccEquSucc])]) ).

cnf(c_0_5,hypothesis,
    sbrdtbr0(xQ) = szszuzczcdt0(xk),
    inference(split_conjunct,[status(thm)],[m__5255]) ).

cnf(c_0_6,hypothesis,
    szszuzczcdt0(xk) = xK,
    inference(split_conjunct,[status(thm)],[m__3533]) ).

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

cnf(c_0_8,hypothesis,
    aElementOf0(xk,szNzAzT0),
    inference(split_conjunct,[status(thm)],[m__3533]) ).

cnf(c_0_9,hypothesis,
    szszuzczcdt0(sbrdtbr0(xP)) = sbrdtbr0(xQ),
    inference(split_conjunct,[status(thm)],[m__5255]) ).

cnf(c_0_10,hypothesis,
    sbrdtbr0(xQ) = xK,
    inference(rw,[status(thm)],[c_0_5,c_0_6]) ).

fof(c_0_11,negated_conjecture,
    sbrdtbr0(xP) != xk,
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).

cnf(c_0_12,hypothesis,
    ( X1 = xk
    | szszuzczcdt0(X1) != xK
    | ~ aElementOf0(X1,szNzAzT0) ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_6]) ).

cnf(c_0_13,hypothesis,
    aElementOf0(sbrdtbr0(xP),szNzAzT0),
    inference(split_conjunct,[status(thm)],[m__5255]) ).

cnf(c_0_14,hypothesis,
    szszuzczcdt0(sbrdtbr0(xP)) = xK,
    inference(rw,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_15,negated_conjecture,
    sbrdtbr0(xP) != xk,
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : NUM613+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 : n019.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:50:44 EDT 2026
% 0.15/0.33  % CPUTime    : 
% 0.15/0.34  % start to proof: theBenchmark
% 1.39/1.76  % Version  : CSE_E---1.7
% 1.39/1.76  % Problem  : theBenchmark.p
% 1.39/1.76  % SZS status Theorem for theBenchmark.p
% 1.39/1.76  % SZS output start CNFRefutation
% See solution above
% 1.39/1.76  % Total time : 1.375s
%------------------------------------------------------------------------------