↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SEU094+1 : TPTP v9.2.1. Released v3.2.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 : n023.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:37 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(t13_finset_1,axiom,
    ! [X1,X2] :
      ( ( subset(X1,X2)
        & finite(X2) )
     => finite(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_finset_1) ).

fof(t100_zfmisc_1,axiom,
    ! [X1] : subset(X1,powerset(union(X1))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t100_zfmisc_1) ).

fof(t24_finset_1,axiom,
    ! [X1] :
      ( finite(X1)
    <=> finite(powerset(X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t24_finset_1) ).

fof(t25_finset_1,conjecture,
    ! [X1] :
      ( ( finite(X1)
        & ! [X2] :
            ( in(X2,X1)
           => finite(X2) ) )
    <=> finite(union(X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t25_finset_1) ).

fof(l22_finset_1,axiom,
    ! [X1] :
      ( ( finite(X1)
        & ! [X2] :
            ( in(X2,X1)
           => finite(X2) ) )
     => finite(union(X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l22_finset_1) ).

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

fof(c_0_6,plain,
    ! [X133,X134] :
      ( ~ subset(X133,X134)
      | ~ finite(X134)
      | finite(X133) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t13_finset_1])]) ).

fof(c_0_7,plain,
    ! [X132] : subset(X132,powerset(union(X132))),
    inference(variable_rename,[status(thm)],[t100_zfmisc_1]) ).

cnf(c_0_8,plain,
    ( finite(X1)
    | ~ subset(X1,X2)
    | ~ finite(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_9,plain,
    subset(X1,powerset(union(X1))),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

fof(c_0_10,plain,
    ! [X137] :
      ( ( ~ finite(X137)
        | finite(powerset(X137)) )
      & ( ~ finite(powerset(X137))
        | finite(X137) ) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t24_finset_1])]) ).

fof(c_0_11,negated_conjecture,
    ~ ! [X1] :
        ( ( finite(X1)
          & ! [X2] :
              ( in(X2,X1)
             => finite(X2) ) )
      <=> finite(union(X1)) ),
    inference(assume_negation,[status(cth)],[t25_finset_1]) ).

cnf(c_0_12,plain,
    ( finite(X1)
    | ~ finite(powerset(union(X1))) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_13,plain,
    ( finite(powerset(X1))
    | ~ finite(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

fof(c_0_14,negated_conjecture,
    ! [X140] :
      ( ( in(esk29_0,esk28_0)
        | ~ finite(esk28_0)
        | ~ finite(union(esk28_0)) )
      & ( ~ finite(esk29_0)
        | ~ finite(esk28_0)
        | ~ finite(union(esk28_0)) )
      & ( finite(esk28_0)
        | finite(union(esk28_0)) )
      & ( ~ in(X140,esk28_0)
        | finite(X140)
        | finite(union(esk28_0)) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])])]) ).

fof(c_0_15,plain,
    ! [X100] :
      ( ( in(esk2_1(X100),X100)
        | ~ finite(X100)
        | finite(union(X100)) )
      & ( ~ finite(esk2_1(X100))
        | ~ finite(X100)
        | finite(union(X100)) ) ),
    inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l22_finset_1])])])]) ).

cnf(c_0_16,plain,
    ( finite(X1)
    | ~ finite(union(X1)) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_17,negated_conjecture,
    ( finite(esk28_0)
    | finite(union(esk28_0)) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_18,plain,
    ( in(esk2_1(X1),X1)
    | finite(union(X1))
    | ~ finite(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_19,negated_conjecture,
    finite(esk28_0),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

fof(c_0_20,plain,
    ! [X156,X157] :
      ( ~ in(X156,X157)
      | subset(X156,union(X157)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t92_zfmisc_1])]) ).

cnf(c_0_21,negated_conjecture,
    ( finite(X1)
    | finite(union(esk28_0))
    | ~ in(X1,esk28_0) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_22,negated_conjecture,
    ( finite(union(esk28_0))
    | in(esk2_1(esk28_0),esk28_0) ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_23,plain,
    ( subset(X1,union(X2))
    | ~ in(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_24,plain,
    ( finite(union(X1))
    | ~ finite(esk2_1(X1))
    | ~ finite(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_25,negated_conjecture,
    ( finite(esk2_1(esk28_0))
    | finite(union(esk28_0)) ),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_26,negated_conjecture,
    ( in(esk29_0,esk28_0)
    | ~ finite(esk28_0)
    | ~ finite(union(esk28_0)) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_27,negated_conjecture,
    ( ~ finite(esk29_0)
    | ~ finite(esk28_0)
    | ~ finite(union(esk28_0)) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_28,plain,
    ( finite(X1)
    | ~ finite(union(X2))
    | ~ in(X1,X2) ),
    inference(spm,[status(thm)],[c_0_8,c_0_23]) ).

cnf(c_0_29,negated_conjecture,
    finite(union(esk28_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_19])]) ).

cnf(c_0_30,negated_conjecture,
    ( in(esk29_0,esk28_0)
    | ~ finite(union(esk28_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_19])]) ).

cnf(c_0_31,negated_conjecture,
    ( ~ finite(union(esk28_0))
    | ~ finite(esk29_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_19])]) ).

cnf(c_0_32,negated_conjecture,
    ( finite(X1)
    | ~ in(X1,esk28_0) ),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_33,negated_conjecture,
    in(esk29_0,esk28_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_29])]) ).

cnf(c_0_34,negated_conjecture,
    ~ finite(esk29_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_29])]) ).

cnf(c_0_35,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : SEU094+1 : TPTP v9.2.1. Released v3.2.0.
% 0.00/0.11  % 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.13/0.32  % Computer : n023.cluster.edu
% 0.13/0.32  % Model    : x86_64 x86_64
% 0.13/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32  % Memory   : 8042.1875MB
% 0.13/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32  % CPULimit   : 300
% 0.13/0.32  % WCLimit    : 300
% 0.13/0.32  % DateTime   : Tue May  5 02:43:39 EDT 2026
% 0.13/0.33  % CPUTime    : 
% 0.13/0.33  % start to proof: theBenchmark
% 1.27/1.71  % Version  : CSE_E---1.7
% 1.27/1.71  % Problem  : theBenchmark.p
% 1.27/1.71  % SZS status Theorem for theBenchmark.p
% 1.27/1.71  % SZS output start CNFRefutation
% See solution above
% 1.27/1.71  % Total time : 1.369s
%------------------------------------------------------------------------------