↑ Up

CSE_E---1.7.THM-CRf.s

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

% Result   : Theorem 1.24s 1.71s
% Output   : CNFRefutation 1.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   23 (   3 unt;   0 def)
%            Number of atoms       :   65 (   7 equ)
%            Maximal formula atoms :   12 (   2 avg)
%            Number of connectives :   68 (  26   ~;  28   |;   7   &)
%                                         (   3 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   50 (   0 sgn  27   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(d1_zfmisc_1,axiom,
    ! [X1,X2] :
      ( X2 = powerset(X1)
    <=> ! [X3] :
          ( in(X3,X2)
        <=> subset(X3,X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_zfmisc_1) ).

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

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

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

fof(c_0_4,plain,
    ! [X23,X24,X25,X26,X27,X28] :
      ( ( ~ in(X25,X24)
        | subset(X25,X23)
        | X24 != powerset(X23) )
      & ( ~ subset(X26,X23)
        | in(X26,X24)
        | X24 != powerset(X23) )
      & ( ~ in(esk1_2(X27,X28),X28)
        | ~ subset(esk1_2(X27,X28),X27)
        | X28 = powerset(X27) )
      & ( in(esk1_2(X27,X28),X28)
        | subset(esk1_2(X27,X28),X27)
        | X28 = powerset(X27) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_zfmisc_1])])])])])]) ).

fof(c_0_5,negated_conjecture,
    ~ ! [X1,X2] :
        ( subset(X1,X2)
       => subset(powerset(X1),powerset(X2)) ),
    inference(assume_negation,[status(cth)],[t79_zfmisc_1]) ).

fof(c_0_6,plain,
    ! [X30,X31,X32,X33,X34] :
      ( ( ~ subset(X30,X31)
        | ~ in(X32,X30)
        | in(X32,X31) )
      & ( in(esk2_2(X33,X34),X33)
        | subset(X33,X34) )
      & ( ~ in(esk2_2(X33,X34),X34)
        | subset(X33,X34) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_tarski])])])])])]) ).

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

fof(c_0_8,plain,
    ! [X39,X40,X41] :
      ( ~ subset(X39,X40)
      | ~ subset(X40,X41)
      | subset(X39,X41) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_xboole_1])]) ).

fof(c_0_9,negated_conjecture,
    ( subset(esk5_0,esk6_0)
    & ~ subset(powerset(esk5_0),powerset(esk6_0)) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).

cnf(c_0_10,plain,
    ( subset(X1,X2)
    | ~ in(esk2_2(X1,X2),X2) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_11,plain,
    ( in(X1,powerset(X2))
    | ~ subset(X1,X2) ),
    inference(er,[status(thm)],[c_0_7]) ).

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

cnf(c_0_13,negated_conjecture,
    subset(esk5_0,esk6_0),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_14,plain,
    ( subset(X1,X3)
    | ~ in(X1,X2)
    | X2 != powerset(X3) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_15,plain,
    ( subset(X1,powerset(X2))
    | ~ subset(esk2_2(X1,powerset(X2)),X2) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_16,negated_conjecture,
    ( subset(X1,esk6_0)
    | ~ subset(X1,esk5_0) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_17,plain,
    ( subset(X1,X2)
    | ~ in(X1,powerset(X2)) ),
    inference(er,[status(thm)],[c_0_14]) ).

cnf(c_0_18,plain,
    ( in(esk2_2(X1,X2),X1)
    | subset(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_19,negated_conjecture,
    ( subset(X1,powerset(esk6_0))
    | ~ subset(esk2_2(X1,powerset(esk6_0)),esk5_0) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_20,plain,
    ( subset(esk2_2(powerset(X1),X2),X1)
    | subset(powerset(X1),X2) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_21,negated_conjecture,
    ~ subset(powerset(esk5_0),powerset(esk6_0)),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_22,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),
    [proof] ).

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