↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SEU294+2 : 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 : n029.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:11:23 PM UTC 2026

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

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

fof(t3_subset,axiom,
    ! [X1,X2] :
      ( element(X1,powerset(X2))
    <=> subset(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_subset) ).

fof(cc2_finset_1,axiom,
    ! [X1] :
      ( finite(X1)
     => ! [X2] :
          ( element(X2,powerset(X1))
         => finite(X2) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cc2_finset_1) ).

fof(c_0_3,negated_conjecture,
    ~ ! [X1,X2] :
        ( ( subset(X1,X2)
          & finite(X2) )
       => finite(X1) ),
    inference(assume_negation,[status(cth)],[t13_finset_1]) ).

fof(c_0_4,plain,
    ! [X2110,X2111] :
      ( ( ~ element(X2110,powerset(X2111))
        | subset(X2110,X2111) )
      & ( ~ subset(X2110,X2111)
        | element(X2110,powerset(X2111)) ) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])]) ).

fof(c_0_5,negated_conjecture,
    ( subset(esk232_0,esk233_0)
    & finite(esk233_0)
    & ~ finite(esk232_0) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).

fof(c_0_6,plain,
    ! [X1040,X1041] :
      ( ~ finite(X1040)
      | ~ element(X1041,powerset(X1040))
      | finite(X1041) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc2_finset_1])])]) ).

cnf(c_0_7,plain,
    ( element(X1,powerset(X2))
    | ~ subset(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_8,negated_conjecture,
    subset(esk232_0,esk233_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,plain,
    ( finite(X2)
    | ~ finite(X1)
    | ~ element(X2,powerset(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,negated_conjecture,
    element(esk232_0,powerset(esk233_0)),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_11,negated_conjecture,
    finite(esk233_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_12,negated_conjecture,
    ~ finite(esk232_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_13,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]),c_0_12]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SEU294+2 : TPTP v9.2.1. Released v3.3.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.15/0.32  % Computer : n029.cluster.edu
% 0.15/0.32  % Model    : x86_64 x86_64
% 0.15/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.32  % Memory   : 8042.1875MB
% 0.15/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.32  % CPULimit   : 300
% 0.15/0.32  % WCLimit    : 300
% 0.15/0.32  % DateTime   : Tue May  5 02:55:14 EDT 2026
% 0.15/0.33  % CPUTime    : 
% 0.15/0.34  % start to proof: theBenchmark
% 2.16/1.97  % Version  : CSE_E---1.7
% 2.16/1.97  % Problem  : theBenchmark.p
% 2.16/1.97  % SZS status Theorem for theBenchmark.p
% 2.16/1.97  % SZS output start CNFRefutation
% See solution above
% 2.16/1.98  % Total time : 1.489s
%------------------------------------------------------------------------------