↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : NUM548+3 : 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 : n022.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:57:47 PM UTC 2026

% Result   : Theorem 1.30s 1.73s
% Output   : CNFRefutation 1.30s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   13 (   8 unt;   0 def)
%            Number of atoms       :   32 (   3 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   28 (   9   ~;   7   |;   9   &)
%                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :    5 (   0 sgn   4   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(mCardNum,axiom,
    ! [X1] :
      ( aSet0(X1)
     => ( aElementOf0(sbrdtbr0(X1),szNzAzT0)
      <=> isFinite0(X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mCardNum) ).

fof(m__2270,hypothesis,
    ( aSet0(xQ)
    & ! [X1] :
        ( aElementOf0(X1,xQ)
       => aElementOf0(X1,xS) )
    & aSubsetOf0(xQ,xS)
    & sbrdtbr0(xQ) = xk
    & aElementOf0(xQ,slbdtsldtrb0(xS,xk)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2270) ).

fof(m__,conjecture,
    isFinite0(xQ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

fof(m__2202,hypothesis,
    aElementOf0(xk,szNzAzT0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2202) ).

fof(c_0_4,plain,
    ! [X191] :
      ( ( ~ aElementOf0(sbrdtbr0(X191),szNzAzT0)
        | isFinite0(X191)
        | ~ aSet0(X191) )
      & ( ~ isFinite0(X191)
        | aElementOf0(sbrdtbr0(X191),szNzAzT0)
        | ~ aSet0(X191) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mCardNum])])]) ).

fof(c_0_5,hypothesis,
    ! [X255] :
      ( aSet0(xQ)
      & ( ~ aElementOf0(X255,xQ)
        | aElementOf0(X255,xS) )
      & aSubsetOf0(xQ,xS)
      & sbrdtbr0(xQ) = xk
      & aElementOf0(xQ,slbdtsldtrb0(xS,xk)) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__2270])])]) ).

fof(c_0_6,negated_conjecture,
    ~ isFinite0(xQ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).

cnf(c_0_7,plain,
    ( isFinite0(X1)
    | ~ aElementOf0(sbrdtbr0(X1),szNzAzT0)
    | ~ aSet0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

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

cnf(c_0_9,hypothesis,
    aElementOf0(xk,szNzAzT0),
    inference(split_conjunct,[status(thm)],[m__2202]) ).

cnf(c_0_10,hypothesis,
    aSet0(xQ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_11,negated_conjecture,
    ~ isFinite0(xQ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_12,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]),c_0_10])]),c_0_11]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : NUM548+3 : 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 : n022.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:44:36 EDT 2026
% 0.15/0.33  % CPUTime    : 
% 0.15/0.34  % start to proof: theBenchmark
% 1.30/1.73  % Version  : CSE_E---1.7
% 1.30/1.73  % Problem  : theBenchmark.p
% 1.30/1.73  % SZS status Theorem for theBenchmark.p
% 1.30/1.73  % SZS output start CNFRefutation
% See solution above
% 1.30/1.73  % Total time : 1.372s
%------------------------------------------------------------------------------