↑ Up

CSE_E---1.7.THM-CRf.s

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

% Result   : Theorem 7.80s 5.67s
% Output   : CNFRefutation 7.80s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   24 (   4 unt;   0 def)
%            Number of atoms       :  104 (   0 equ)
%            Maximal formula atoms :   28 (   4 avg)
%            Number of connectives :  133 (  53   ~;  57   |;  10   &)
%                                         (   3 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   2 con; 0-3 aty)
%            Number of variables   :   54 (   0 sgn  24   !;   0   ?)

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

fof(t45_pre_topc,axiom,
    ! [X1] :
      ( top_str(X1)
     => ! [X2] :
          ( element(X2,powerset(the_carrier(X1)))
         => ! [X3] :
              ( in(X3,the_carrier(X1))
             => ( in(X3,topstr_closure(X1,X2))
              <=> ! [X4] :
                    ( element(X4,powerset(the_carrier(X1)))
                   => ( ( closed_subset(X4,X1)
                        & subset(X2,X4) )
                     => in(X3,X4) ) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t45_pre_topc) ).

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

fof(t48_pre_topc,conjecture,
    ! [X1] :
      ( top_str(X1)
     => ! [X2] :
          ( element(X2,powerset(the_carrier(X1)))
         => subset(X2,topstr_closure(X1,X2)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t48_pre_topc) ).

fof(c_0_4,plain,
    ! [X100,X101,X102,X103,X104] :
      ( ( ~ subset(X100,X101)
        | ~ in(X102,X100)
        | in(X102,X101) )
      & ( in(esk1_2(X103,X104),X103)
        | subset(X103,X104) )
      & ( ~ in(esk1_2(X103,X104),X104)
        | subset(X103,X104) ) ),
    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])])])])])]) ).

fof(c_0_5,plain,
    ! [X126,X127,X128,X129] :
      ( ( ~ in(X128,topstr_closure(X126,X127))
        | ~ element(X129,powerset(the_carrier(X126)))
        | ~ closed_subset(X129,X126)
        | ~ subset(X127,X129)
        | in(X128,X129)
        | ~ in(X128,the_carrier(X126))
        | ~ element(X127,powerset(the_carrier(X126)))
        | ~ top_str(X126) )
      & ( element(esk8_3(X126,X127,X128),powerset(the_carrier(X126)))
        | in(X128,topstr_closure(X126,X127))
        | ~ in(X128,the_carrier(X126))
        | ~ element(X127,powerset(the_carrier(X126)))
        | ~ top_str(X126) )
      & ( closed_subset(esk8_3(X126,X127,X128),X126)
        | in(X128,topstr_closure(X126,X127))
        | ~ in(X128,the_carrier(X126))
        | ~ element(X127,powerset(the_carrier(X126)))
        | ~ top_str(X126) )
      & ( subset(X127,esk8_3(X126,X127,X128))
        | in(X128,topstr_closure(X126,X127))
        | ~ in(X128,the_carrier(X126))
        | ~ element(X127,powerset(the_carrier(X126)))
        | ~ top_str(X126) )
      & ( ~ in(X128,esk8_3(X126,X127,X128))
        | in(X128,topstr_closure(X126,X127))
        | ~ in(X128,the_carrier(X126))
        | ~ element(X127,powerset(the_carrier(X126)))
        | ~ top_str(X126) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t45_pre_topc])])])])]) ).

fof(c_0_6,plain,
    ! [X124,X125] :
      ( ( ~ element(X124,powerset(X125))
        | subset(X124,X125) )
      & ( ~ subset(X124,X125)
        | element(X124,powerset(X125)) ) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])]) ).

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

cnf(c_0_8,plain,
    ( subset(X1,esk8_3(X2,X1,X3))
    | in(X3,topstr_closure(X2,X1))
    | ~ in(X3,the_carrier(X2))
    | ~ element(X1,powerset(the_carrier(X2)))
    | ~ top_str(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

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

cnf(c_0_10,plain,
    ( in(X1,topstr_closure(X2,X3))
    | ~ in(X1,esk8_3(X2,X3,X1))
    | ~ in(X1,the_carrier(X2))
    | ~ element(X3,powerset(the_carrier(X2)))
    | ~ top_str(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_11,plain,
    ( in(X1,esk8_3(X2,X3,X4))
    | in(X4,topstr_closure(X2,X3))
    | ~ top_str(X2)
    | ~ element(X3,powerset(the_carrier(X2)))
    | ~ in(X4,the_carrier(X2))
    | ~ in(X1,X3) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_12,plain,
    ( in(X1,X2)
    | ~ element(X3,powerset(X2))
    | ~ in(X1,X3) ),
    inference(spm,[status(thm)],[c_0_7,c_0_9]) ).

fof(c_0_13,negated_conjecture,
    ~ ! [X1] :
        ( top_str(X1)
       => ! [X2] :
            ( element(X2,powerset(the_carrier(X1)))
           => subset(X2,topstr_closure(X1,X2)) ) ),
    inference(assume_negation,[status(cth)],[t48_pre_topc]) ).

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

cnf(c_0_15,plain,
    ( in(X1,topstr_closure(X2,X3))
    | ~ top_str(X2)
    | ~ element(X3,powerset(the_carrier(X2)))
    | ~ in(X1,X3) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).

fof(c_0_16,negated_conjecture,
    ( top_str(esk9_0)
    & element(esk10_0,powerset(the_carrier(esk9_0)))
    & ~ subset(esk10_0,topstr_closure(esk9_0,esk10_0)) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).

cnf(c_0_17,plain,
    ( subset(X1,topstr_closure(X2,X3))
    | ~ top_str(X2)
    | ~ element(X3,powerset(the_carrier(X2)))
    | ~ in(esk1_2(X1,topstr_closure(X2,X3)),X3) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

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

cnf(c_0_19,negated_conjecture,
    ~ subset(esk10_0,topstr_closure(esk9_0,esk10_0)),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_20,plain,
    ( subset(X1,topstr_closure(X2,X1))
    | ~ top_str(X2)
    | ~ element(X1,powerset(the_carrier(X2))) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_21,negated_conjecture,
    top_str(esk9_0),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_22,negated_conjecture,
    element(esk10_0,powerset(the_carrier(esk9_0))),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : SEU317+1 : TPTP v9.2.1. Released v3.3.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.15/0.32  % Computer : n021.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:57:40 EDT 2026
% 0.15/0.32  % CPUTime    : 
% 0.15/0.33  % start to proof: theBenchmark
% 7.80/5.67  % Version  : CSE_E---1.7
% 7.80/5.67  % Problem  : theBenchmark.p
% 7.80/5.67  % SZS status Theorem for theBenchmark.p
% 7.80/5.67  % SZS output start CNFRefutation
% See solution above
% 7.80/5.69  % Total time : 4.371s
%------------------------------------------------------------------------------