↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : NUM550+3 : 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 : n003.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.72s
% Output   : CNFRefutation 1.30s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   16 (   7 unt;   0 def)
%            Number of atoms       :   40 (  18 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   39 (  15   ~;   7   |;  14   &)
%                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   6 con; 0-2 aty)
%            Number of variables   :    8 (   0 sgn   5   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(m__,conjecture,
    ~ ( ~ ? [X1] : aElementOf0(X1,xQ)
      & xQ = slcrc0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).

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/sandbox/benchmark/theBenchmark.p',m__2270) ).

fof(mCardEmpty,axiom,
    ! [X1] :
      ( aSet0(X1)
     => ( sbrdtbr0(X1) = sz00
      <=> X1 = slcrc0 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mCardEmpty) ).

fof(m__2202_02,hypothesis,
    ( aSet0(xS)
    & aSet0(xT)
    & xk != sz00 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2202_02) ).

fof(c_0_4,negated_conjecture,
    ~ ~ ( ~ ? [X1] : aElementOf0(X1,xQ)
        & xQ = slcrc0 ),
    inference(assume_negation,[status(cth)],[m__]) ).

fof(c_0_5,hypothesis,
    ! [X256] :
      ( aSet0(xQ)
      & ( ~ aElementOf0(X256,xQ)
        | aElementOf0(X256,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,
    ! [X257] :
      ( ~ aElementOf0(X257,xQ)
      & xQ = slcrc0 ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).

fof(c_0_7,plain,
    ! [X193] :
      ( ( sbrdtbr0(X193) != sz00
        | X193 = slcrc0
        | ~ aSet0(X193) )
      & ( X193 != slcrc0
        | sbrdtbr0(X193) = sz00
        | ~ aSet0(X193) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mCardEmpty])])]) ).

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

cnf(c_0_9,negated_conjecture,
    xQ = slcrc0,
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

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

cnf(c_0_11,plain,
    ( sbrdtbr0(X1) = sz00
    | X1 != slcrc0
    | ~ aSet0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_12,hypothesis,
    sbrdtbr0(slcrc0) = xk,
    inference(rw,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_13,hypothesis,
    aSet0(slcrc0),
    inference(rw,[status(thm)],[c_0_10,c_0_9]) ).

cnf(c_0_14,hypothesis,
    xk != sz00,
    inference(split_conjunct,[status(thm)],[m__2202_02]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : NUM550+3 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.12  % 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.16/0.32  % Computer : n003.cluster.edu
% 0.16/0.32  % Model    : x86_64 x86_64
% 0.16/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.32  % Memory   : 8042.1875MB
% 0.16/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.32  % CPULimit   : 300
% 0.16/0.32  % WCLimit    : 300
% 0.16/0.32  % DateTime   : Tue May  5 00:44:11 EDT 2026
% 0.16/0.33  % CPUTime    : 
% 0.16/0.34  % start to proof: theBenchmark
% 1.30/1.72  % Version  : CSE_E---1.7
% 1.30/1.72  % Problem  : theBenchmark.p
% 1.30/1.72  % SZS status Theorem for theBenchmark.p
% 1.30/1.72  % SZS output start CNFRefutation
% See solution above
% 1.30/1.72  % Total time : 1.372s
%------------------------------------------------------------------------------