↑ Up

CSE_E---1.7.THM-CRf.s

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

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

% Comments : 
%------------------------------------------------------------------------------
fof(m__,conjecture,
    ( ! [X1] :
        ( aElementOf0(X1,xP)
       => aElementOf0(X1,xQ) )
    | aSubsetOf0(xP,xQ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

fof(m__5164,hypothesis,
    ( aSet0(xP)
    & ! [X1] :
        ( aElementOf0(X1,xQ)
       => sdtlseqdt0(szmzizndt0(xQ),X1) )
    & ! [X1] :
        ( aElementOf0(X1,xP)
      <=> ( aElement0(X1)
          & aElementOf0(X1,xQ)
          & X1 != szmzizndt0(xQ) ) )
    & xP = sdtmndt0(xQ,szmzizndt0(xQ)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5164) ).

fof(c_0_2,negated_conjecture,
    ~ ( ! [X1] :
          ( aElementOf0(X1,xP)
         => aElementOf0(X1,xQ) )
      | aSubsetOf0(xP,xQ) ),
    inference(assume_negation,[status(cth)],[m__]) ).

fof(c_0_3,hypothesis,
    ! [X501,X502] :
      ( aSet0(xP)
      & ( ~ aElementOf0(X501,xQ)
        | sdtlseqdt0(szmzizndt0(xQ),X501) )
      & ( aElement0(X502)
        | ~ aElementOf0(X502,xP) )
      & ( aElementOf0(X502,xQ)
        | ~ aElementOf0(X502,xP) )
      & ( X502 != szmzizndt0(xQ)
        | ~ aElementOf0(X502,xP) )
      & ( ~ aElement0(X502)
        | ~ aElementOf0(X502,xQ)
        | X502 = szmzizndt0(xQ)
        | aElementOf0(X502,xP) )
      & xP = sdtmndt0(xQ,szmzizndt0(xQ)) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__5164])])])]) ).

fof(c_0_4,negated_conjecture,
    ( aElementOf0(esk42_0,xP)
    & ~ aElementOf0(esk42_0,xQ)
    & ~ aSubsetOf0(xP,xQ) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).

cnf(c_0_5,hypothesis,
    ( aElementOf0(X1,xQ)
    | ~ aElementOf0(X1,xP) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_6,negated_conjecture,
    aElementOf0(esk42_0,xP),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,negated_conjecture,
    ~ aElementOf0(esk42_0,xQ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_8,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : NUM609+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.16/0.33  % Computer : n004.cluster.edu
% 0.16/0.33  % Model    : x86_64 x86_64
% 0.16/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33  % Memory   : 8042.1875MB
% 0.16/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33  % CPULimit   : 300
% 0.16/0.33  % WCLimit    : 300
% 0.16/0.33  % DateTime   : Tue May  5 00:50:17 EDT 2026
% 0.16/0.33  % CPUTime    : 
% 0.16/0.34  % start to proof: theBenchmark
% 2.72/2.41  % Version  : CSE_E---1.7
% 2.72/2.41  % Problem  : theBenchmark.p
% 2.72/2.41  % SZS status Theorem for theBenchmark.p
% 2.72/2.41  % SZS output start CNFRefutation
% See solution above
% 2.72/2.42  % Total time : 1.774s
%------------------------------------------------------------------------------