↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SET786+1 : TPTP v9.2.1. Released v2.5.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 : n018.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:08:29 PM UTC 2026

% Result   : Theorem 0.24s 1.61s
% Output   : CNFRefutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   13 (   2 unt;   0 def)
%            Number of atoms       :   34 (   0 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   37 (  16   ~;  15   |;   4   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   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   :   15 (   0 sgn   4   !;   4   ?)

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

fof(i_0_1,negated_conjecture,
    ~ ~ ? [X1] :
        ! [X2] :
          ( element(X2,X1)
        <=> ~ ? [X3] :
                ( element(X2,X3)
                & element(X3,X2) ) ),
    inference(assume_negation,[status(cth)],[thm25]) ).

fof(i_0_2,negated_conjecture,
    ! [X8,X9] :
      ( ( ~ element(X8,esk1_0)
        | ~ element(X8,X9)
        | ~ element(X9,X8) )
      & ( element(X8,esk2_1(X8))
        | element(X8,esk1_0) )
      & ( element(esk2_1(X8),X8)
        | element(X8,esk1_0) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_1])])])])]) ).

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

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

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

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

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

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

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

cnf(i_0_10,plain,
    ( ~ element(esk1_0,esk2_1(esk1_0))
    | element(esk1_0,esk1_0) ),
    inference(scs_inference,[],[i_0_4,i_0_3]) ).

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

cnf(i_0_12,plain,
    $false,
    inference(scs_inference,[],[i_0_11,i_0_3]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SET786+1 : TPTP v9.2.1. Released v2.5.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.33  % Computer : n018.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:35:32 EDT 2026
% 0.16/0.33  % CPUTime    : 
% 0.16/0.34  % start to proof: theBenchmark
% 0.24/1.61  % Version  : CSE_E---1.7
% 0.24/1.61  % Problem  : theBenchmark.p
% 0.24/1.61  % SZS status Theorem for theBenchmark.p
% 0.24/1.61  % SZS output start CNFRefutation
% See solution above
% 0.24/1.63  % Total time : 1.270s
%------------------------------------------------------------------------------