↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SEU163+1 : TPTP v9.2.1. Released v3.3.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 : n019.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:10:52 PM UTC 2026

% Result   : Theorem 0.16s 1.53s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   16 (   6 unt;   0 def)
%            Number of atoms       :   26 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   21 (  11   ~;   4   |;   1   &)
%                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-1 aty)
%            Number of variables   :   22 (   1 sgn  17   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(antisymmetry_r2_hidden,axiom,
    ! [X1,X2] :
      ( in(X1,X2)
     => ~ in(X2,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',antisymmetry_r2_hidden) ).

fof(t92_zfmisc_1,conjecture,
    ! [X1,X2] :
      ( in(X1,X2)
     => subset(X1,union(X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t92_zfmisc_1) ).

fof(l50_zfmisc_1,axiom,
    ! [X1,X2] :
      ( in(X1,X2)
     => subset(X1,union(X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l50_zfmisc_1) ).

fof(reflexivity_r1_tarski,axiom,
    ! [X1,X2] : subset(X1,X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).

fof(i_0_4,plain,
    ! [X1,X2] :
      ( in(X1,X2)
     => ~ in(X2,X1) ),
    inference(fof_simplification,[status(thm)],[antisymmetry_r2_hidden]) ).

fof(i_0_5,negated_conjecture,
    ~ ! [X1,X2] :
        ( in(X1,X2)
       => subset(X1,union(X2)) ),
    inference(assume_negation,[status(cth)],[t92_zfmisc_1]) ).

fof(i_0_6,plain,
    ! [X12,X13] :
      ( ~ in(X12,X13)
      | ~ in(X13,X12) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_4])]) ).

fof(i_0_7,plain,
    ! [X16,X17] :
      ( ~ in(X16,X17)
      | subset(X16,union(X17)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l50_zfmisc_1])]) ).

fof(i_0_8,negated_conjecture,
    ( in(esk1_0,esk2_0)
    & ~ subset(esk1_0,union(esk2_0)) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_5])])]) ).

fof(i_0_9,plain,
    ! [X11] : subset(X11,X11),
    inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).

cnf(i_0_10,plain,
    ( ~ in(X1,X2)
    | ~ in(X2,X1) ),
    inference(split_conjunct,[status(thm)],[i_0_6]),
    [final] ).

cnf(i_0_11,plain,
    ( subset(X1,union(X2))
    | ~ in(X1,X2) ),
    inference(split_conjunct,[status(thm)],[i_0_7]),
    [final] ).

cnf(i_0_12,negated_conjecture,
    ~ subset(esk1_0,union(esk2_0)),
    inference(split_conjunct,[status(thm)],[i_0_8]),
    [final] ).

cnf(i_0_13,plain,
    subset(X1,X1),
    inference(split_conjunct,[status(thm)],[i_0_9]),
    [final] ).

cnf(i_0_14,negated_conjecture,
    in(esk1_0,esk2_0),
    inference(split_conjunct,[status(thm)],[i_0_8]),
    [final] ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07  % Problem    : SEU163+1 : TPTP v9.2.1. Released v3.3.0.
% 0.00/0.07  % 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.08/0.26  % Computer : n019.cluster.edu
% 0.08/0.26  % Model    : x86_64 x86_64
% 0.08/0.26  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.26  % Memory   : 8042.1875MB
% 0.08/0.26  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.08/0.26  % CPULimit   : 300
% 0.08/0.26  % WCLimit    : 300
% 0.08/0.26  % DateTime   : Tue May  5 02:46:14 EDT 2026
% 0.08/0.26  % CPUTime    : 
% 0.08/0.27  % start to proof: theBenchmark
% 0.16/1.53  % Version  : CSE_E---1.7
% 0.16/1.53  % Problem  : theBenchmark.p
% 0.16/1.53  % SZS status Theorem for theBenchmark.p
% 0.16/1.53  % SZS output start CNFRefutation
% See solution above
% 0.16/1.55  % Total time : 1.266s
%------------------------------------------------------------------------------