TSTP Solution File: SEU355+1 by CSE_E---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : SEU355+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s

% Computer : n012.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 : Thu Aug 31 16:24:43 EDT 2023

% Result   : Theorem 0.20s 0.62s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   26
% Syntax   : Number of formulae    :   44 (   6 unt;  21 typ;   0 def)
%            Number of atoms       :   90 (   0 equ)
%            Maximal formula atoms :   18 (   3 avg)
%            Number of connectives :  106 (  39   ~;  42   |;  11   &)
%                                         (   2 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   25 (  13   >;  12   *;   0   +;   0  <<)
%            Number of predicates  :   10 (   9 usr;   1 prp; 0-3 aty)
%            Number of functors    :   12 (  12 usr;   8 con; 0-3 aty)
%            Number of variables   :   34 (   1 sgn;  24   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    in: ( $i * $i ) > $o ).

tff(decl_23,type,
    empty: $i > $o ).

tff(decl_24,type,
    finite: $i > $o ).

tff(decl_25,type,
    rel_str: $i > $o ).

tff(decl_26,type,
    the_carrier: $i > $i ).

tff(decl_27,type,
    element: ( $i * $i ) > $o ).

tff(decl_28,type,
    relstr_element_smaller: ( $i * $i * $i ) > $o ).

tff(decl_29,type,
    related: ( $i * $i * $i ) > $o ).

tff(decl_30,type,
    relstr_set_smaller: ( $i * $i * $i ) > $o ).

tff(decl_31,type,
    one_sorted_str: $i > $o ).

tff(decl_32,type,
    empty_set: $i ).

tff(decl_33,type,
    esk1_3: ( $i * $i * $i ) > $i ).

tff(decl_34,type,
    esk2_3: ( $i * $i * $i ) > $i ).

tff(decl_35,type,
    esk3_0: $i ).

tff(decl_36,type,
    esk4_0: $i ).

tff(decl_37,type,
    esk5_1: $i > $i ).

tff(decl_38,type,
    esk6_0: $i ).

tff(decl_39,type,
    esk7_0: $i ).

tff(decl_40,type,
    esk8_0: $i ).

tff(decl_41,type,
    esk9_0: $i ).

tff(decl_42,type,
    esk10_0: $i ).

fof(t6_yellow_0,conjecture,
    ! [X1] :
      ( rel_str(X1)
     => ! [X2] :
          ( element(X2,the_carrier(X1))
         => ( relstr_set_smaller(X1,empty_set,X2)
            & relstr_element_smaller(X1,empty_set,X2) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t6_yellow_0) ).

fof(d9_lattice3,axiom,
    ! [X1] :
      ( rel_str(X1)
     => ! [X2,X3] :
          ( element(X3,the_carrier(X1))
         => ( relstr_set_smaller(X1,X2,X3)
          <=> ! [X4] :
                ( element(X4,the_carrier(X1))
               => ( in(X4,X2)
                 => related(X1,X4,X3) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d9_lattice3) ).

fof(d8_lattice3,axiom,
    ! [X1] :
      ( rel_str(X1)
     => ! [X2,X3] :
          ( element(X3,the_carrier(X1))
         => ( relstr_element_smaller(X1,X2,X3)
          <=> ! [X4] :
                ( element(X4,the_carrier(X1))
               => ( in(X4,X2)
                 => related(X1,X3,X4) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d8_lattice3) ).

fof(t7_boole,axiom,
    ! [X1,X2] :
      ~ ( in(X1,X2)
        & empty(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_boole) ).

fof(fc1_xboole_0,axiom,
    empty(empty_set),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc1_xboole_0) ).

fof(c_0_5,negated_conjecture,
    ~ ! [X1] :
        ( rel_str(X1)
       => ! [X2] :
            ( element(X2,the_carrier(X1))
           => ( relstr_set_smaller(X1,empty_set,X2)
              & relstr_element_smaller(X1,empty_set,X2) ) ) ),
    inference(assume_negation,[status(cth)],[t6_yellow_0]) ).

fof(c_0_6,plain,
    ! [X13,X14,X15,X16] :
      ( ( ~ relstr_set_smaller(X13,X14,X15)
        | ~ element(X16,the_carrier(X13))
        | ~ in(X16,X14)
        | related(X13,X16,X15)
        | ~ element(X15,the_carrier(X13))
        | ~ rel_str(X13) )
      & ( element(esk2_3(X13,X14,X15),the_carrier(X13))
        | relstr_set_smaller(X13,X14,X15)
        | ~ element(X15,the_carrier(X13))
        | ~ rel_str(X13) )
      & ( in(esk2_3(X13,X14,X15),X14)
        | relstr_set_smaller(X13,X14,X15)
        | ~ element(X15,the_carrier(X13))
        | ~ rel_str(X13) )
      & ( ~ related(X13,esk2_3(X13,X14,X15),X15)
        | relstr_set_smaller(X13,X14,X15)
        | ~ element(X15,the_carrier(X13))
        | ~ rel_str(X13) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d9_lattice3])])])])]) ).

fof(c_0_7,negated_conjecture,
    ( rel_str(esk9_0)
    & element(esk10_0,the_carrier(esk9_0))
    & ( ~ relstr_set_smaller(esk9_0,empty_set,esk10_0)
      | ~ relstr_element_smaller(esk9_0,empty_set,esk10_0) ) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).

cnf(c_0_8,plain,
    ( in(esk2_3(X1,X2,X3),X2)
    | relstr_set_smaller(X1,X2,X3)
    | ~ element(X3,the_carrier(X1))
    | ~ rel_str(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_9,negated_conjecture,
    element(esk10_0,the_carrier(esk9_0)),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_10,negated_conjecture,
    rel_str(esk9_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

fof(c_0_11,plain,
    ! [X8,X9,X10,X11] :
      ( ( ~ relstr_element_smaller(X8,X9,X10)
        | ~ element(X11,the_carrier(X8))
        | ~ in(X11,X9)
        | related(X8,X10,X11)
        | ~ element(X10,the_carrier(X8))
        | ~ rel_str(X8) )
      & ( element(esk1_3(X8,X9,X10),the_carrier(X8))
        | relstr_element_smaller(X8,X9,X10)
        | ~ element(X10,the_carrier(X8))
        | ~ rel_str(X8) )
      & ( in(esk1_3(X8,X9,X10),X9)
        | relstr_element_smaller(X8,X9,X10)
        | ~ element(X10,the_carrier(X8))
        | ~ rel_str(X8) )
      & ( ~ related(X8,X10,esk1_3(X8,X9,X10))
        | relstr_element_smaller(X8,X9,X10)
        | ~ element(X10,the_carrier(X8))
        | ~ rel_str(X8) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d8_lattice3])])])])]) ).

cnf(c_0_12,negated_conjecture,
    ( ~ relstr_set_smaller(esk9_0,empty_set,esk10_0)
    | ~ relstr_element_smaller(esk9_0,empty_set,esk10_0) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_13,negated_conjecture,
    ( relstr_set_smaller(esk9_0,X1,esk10_0)
    | in(esk2_3(esk9_0,X1,esk10_0),X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]) ).

cnf(c_0_14,plain,
    ( in(esk1_3(X1,X2,X3),X2)
    | relstr_element_smaller(X1,X2,X3)
    | ~ element(X3,the_carrier(X1))
    | ~ rel_str(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

fof(c_0_15,plain,
    ! [X33,X34] :
      ( ~ in(X33,X34)
      | ~ empty(X34) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])]) ).

cnf(c_0_16,negated_conjecture,
    ( in(esk2_3(esk9_0,empty_set,esk10_0),empty_set)
    | ~ relstr_element_smaller(esk9_0,empty_set,esk10_0) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_17,negated_conjecture,
    ( relstr_element_smaller(esk9_0,X1,esk10_0)
    | in(esk1_3(esk9_0,X1,esk10_0),X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_9]),c_0_10])]) ).

cnf(c_0_18,plain,
    ( ~ in(X1,X2)
    | ~ empty(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_19,negated_conjecture,
    ( in(esk1_3(esk9_0,empty_set,esk10_0),empty_set)
    | in(esk2_3(esk9_0,empty_set,esk10_0),empty_set) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_20,plain,
    empty(empty_set),
    inference(split_conjunct,[status(thm)],[fc1_xboole_0]) ).

cnf(c_0_21,negated_conjecture,
    in(esk1_3(esk9_0,empty_set,esk10_0),empty_set),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13  % Problem    : SEU355+1 : TPTP v8.1.2. Released v3.3.0.
% 0.11/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.14/0.34  % Computer : n012.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Wed Aug 23 15:56:57 EDT 2023
% 0.14/0.34  % CPUTime  : 
% 0.20/0.56  start to proof: theBenchmark
% 0.20/0.62  % Version  : CSE_E---1.5
% 0.20/0.62  % Problem  : theBenchmark.p
% 0.20/0.62  % Proof found
% 0.20/0.62  % SZS status Theorem for theBenchmark.p
% 0.20/0.62  % SZS output start Proof
% See solution above
% 0.20/0.62  % Total time : 0.045000 s
% 0.20/0.62  % SZS output end Proof
% 0.20/0.62  % Total time : 0.048000 s
%------------------------------------------------------------------------------