↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SET045+1 : TPTP v9.2.1. Released v2.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 : n013.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 05:07:00 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(pel41_1,axiom,
    ! [X1] :
    ? [X2] :
    ! [X3] :
      ( element(X3,X2)
    <=> ( element(X3,X1)
        & ~ element(X3,X3) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel41_1) ).

fof(pel41,conjecture,
    ~ ? [X1] :
      ! [X3] : element(X3,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel41) ).

fof(c_0_2,plain,
    ! [X1] :
    ? [X2] :
    ! [X3] :
      ( element(X3,X2)
    <=> ( element(X3,X1)
        & ~ element(X3,X3) ) ),
    inference(fof_simplification,[status(thm)],[pel41_1]) ).

fof(c_0_3,negated_conjecture,
    ~ ~ ? [X1] :
        ! [X3] : element(X3,X1),
    inference(assume_negation,[status(cth)],[pel41]) ).

fof(c_0_4,plain,
    ! [X9,X11,X12] :
      ( ( element(X11,X9)
        | ~ element(X11,esk1_1(X9)) )
      & ( ~ element(X11,X11)
        | ~ element(X11,esk1_1(X9)) )
      & ( ~ element(X12,X9)
        | element(X12,X12)
        | element(X12,esk1_1(X9)) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])])]) ).

fof(c_0_5,negated_conjecture,
    ! [X14] : element(X14,esk2_0),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).

cnf(c_0_6,plain,
    ( element(X1,X1)
    | element(X1,esk1_1(X2))
    | ~ element(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,negated_conjecture,
    element(X1,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_8,plain,
    ( ~ element(X1,X1)
    | ~ element(X1,esk1_1(X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_9,negated_conjecture,
    ( element(X1,esk1_1(esk2_0))
    | element(X1,X1) ),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_10,negated_conjecture,
    element(esk1_1(X1),esk1_1(esk2_0)),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_9]) ).

cnf(c_0_11,negated_conjecture,
    ~ element(esk1_1(X1),esk1_1(X1)),
    inference(spm,[status(thm)],[c_0_8,c_0_10]) ).

cnf(c_0_12,negated_conjecture,
    $false,
    inference(spm,[status(thm)],[c_0_11,c_0_10]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SET045+1 : TPTP v9.2.1. Released v2.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 : n013.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 02:05:41 EDT 2026
% 0.16/0.33  % CPUTime    : 
% 0.16/0.34  % start to proof: theBenchmark
% 1.26/1.72  % Version  : CSE_E---1.7
% 1.26/1.72  % Problem  : theBenchmark.p
% 1.26/1.72  % SZS status Theorem for theBenchmark.p
% 1.26/1.72  % SZS output start CNFRefutation
% See solution above
% 1.26/1.72  % Total time : 1.371s
%------------------------------------------------------------------------------