↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SET044+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 : n012.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 0.15s 1.62s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   15 (   4 unt;   0 def)
%            Number of atoms       :   36 (   0 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   39 (  18   ~;  12   |;   3   &)
%                                         (   4 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    4 (   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   :   25 (   0 sgn  10   !;   4   ?)

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

fof(i_0_1,negated_conjecture,
    ~ ( ? [X1] :
        ! [X2] :
          ( element(X2,X1)
        <=> element(X2,X2) )
     => ~ ! [X3] :
          ? [X4] :
          ! [X5] :
            ( element(X5,X4)
          <=> ~ element(X5,X3) ) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[pel40])]) ).

fof(i_0_2,negated_conjecture,
    ! [X12,X13,X15,X16] :
      ( ( ~ element(X12,esk1_0)
        | element(X12,X12) )
      & ( ~ element(X12,X12)
        | element(X12,esk1_0) )
      & ( ~ element(X15,esk2_1(X13))
        | ~ element(X15,X13) )
      & ( element(X16,X13)
        | element(X16,esk2_1(X13)) ) ),
    inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_1])])])])]) ).

cnf(i_0_3,negated_conjecture,
    ( ~ element(X1,esk2_1(X2))
    | ~ element(X1,X2) ),
    inference(split_conjunct,[status(thm)],[i_0_2]),
    [final] ).

cnf(i_0_4,negated_conjecture,
    ( element(X1,esk1_0)
    | ~ element(X1,X1) ),
    inference(split_conjunct,[status(thm)],[i_0_2]),
    [final] ).

cnf(i_0_5,negated_conjecture,
    ( element(X1,X2)
    | element(X1,esk2_1(X2)) ),
    inference(split_conjunct,[status(thm)],[i_0_2]),
    [final] ).

cnf(i_0_6,negated_conjecture,
    ( element(X1,X1)
    | ~ element(X1,esk1_0) ),
    inference(split_conjunct,[status(thm)],[i_0_2]),
    [final] ).

cnf(i_0_7,plain,
    ( element(X1,esk2_1(X1))
    | element(X1,esk1_0) ),
    inference(scs_inference,[],[i_0_4,i_0_5]) ).

cnf(i_0_8,plain,
    ( ~ element(esk2_1(X1),X1)
    | ~ element(esk2_1(X1),esk1_0) ),
    inference(scs_inference,[],[i_0_6,i_0_3]) ).

cnf(i_0_9,plain,
    ( element(X1,esk1_0)
    | ~ element(X1,esk2_1(esk2_1(X1))) ),
    inference(scs_inference,[],[i_0_7,i_0_3]) ).

cnf(i_0_10,plain,
    ~ element(esk2_1(esk1_0),esk2_1(esk2_1(esk2_1(esk1_0)))),
    inference(scs_inference,[],[i_0_8,i_0_9]) ).

cnf(i_0_11,plain,
    ~ element(esk2_1(esk1_0),esk2_1(esk1_0)),
    inference(scs_inference,[],[i_0_4,i_0_8]) ).

cnf(i_0_12,plain,
    element(esk2_1(esk1_0),esk1_0),
    inference(scs_inference,[],[i_0_11,i_0_5]) ).

cnf(i_0_13,plain,
    ( element(X1,esk2_1(X2))
    | element(X1,X2) ),
    inference(rename_variables,[],[i_0_5]) ).

cnf(i_0_14,plain,
    $false,
    inference(scs_inference,[],[i_0_11,i_0_5,i_0_6]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14  % Problem    : SET044+1 : TPTP v9.2.1. Released v2.0.0.
% 0.07/0.14  % 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.08/0.35  % Computer : n012.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8042.1875MB
% 0.08/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.08/0.35  % CPULimit   : 300
% 0.08/0.35  % WCLimit    : 300
% 0.08/0.35  % DateTime   : Tue May  5 02:06:01 EDT 2026
% 0.08/0.35  % CPUTime    : 
% 0.08/0.36  % start to proof: theBenchmark
% 0.15/1.62  % Version  : CSE_E---1.7
% 0.15/1.62  % Problem  : theBenchmark.p
% 0.15/1.62  % SZS status Theorem for theBenchmark.p
% 0.15/1.62  % SZS output start CNFRefutation
% See solution above
% 0.15/1.64  % Total time : 1.263s
%------------------------------------------------------------------------------