TSTP Solution File: SEU133+2 by CSE_E---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : SEU133+2 : 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 : n001.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:22:38 EDT 2023

% Result   : Theorem 0.21s 0.80s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   23
% Syntax   : Number of formulae    :   36 (   6 unt;  20 typ;   0 def)
%            Number of atoms       :   55 (   9 equ)
%            Maximal formula atoms :   20 (   3 avg)
%            Number of connectives :   61 (  22   ~;  24   |;   9   &)
%                                         (   5 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   31 (  15   >;  16   *;   0   +;   0  <<)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :   16 (  16 usr;   5 con; 0-3 aty)
%            Number of variables   :   44 (   3 sgn;  28   !;   0   ?;   0   :)

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

tff(decl_23,type,
    set_union2: ( $i * $i ) > $i ).

tff(decl_24,type,
    set_intersection2: ( $i * $i ) > $i ).

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

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

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

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

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

tff(decl_30,type,
    esk1_1: $i > $i ).

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

tff(decl_32,type,
    esk3_2: ( $i * $i ) > $i ).

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

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

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

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

tff(decl_37,type,
    esk8_2: ( $i * $i ) > $i ).

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

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

tff(decl_40,type,
    esk11_2: ( $i * $i ) > $i ).

tff(decl_41,type,
    esk12_2: ( $i * $i ) > $i ).

fof(d4_xboole_0,axiom,
    ! [X1,X2,X3] :
      ( X3 = set_difference(X1,X2)
    <=> ! [X4] :
          ( in(X4,X3)
        <=> ( in(X4,X1)
            & ~ in(X4,X2) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_xboole_0) ).

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(t36_xboole_1,conjecture,
    ! [X1,X2] : subset(set_difference(X1,X2),X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t36_xboole_1) ).

fof(c_0_3,plain,
    ! [X1,X2,X3] :
      ( X3 = set_difference(X1,X2)
    <=> ! [X4] :
          ( in(X4,X3)
        <=> ( in(X4,X1)
            & ~ in(X4,X2) ) ) ),
    inference(fof_simplification,[status(thm)],[d4_xboole_0]) ).

fof(c_0_4,plain,
    ! [X41,X42,X43,X44,X45,X46,X47,X48] :
      ( ( in(X44,X41)
        | ~ in(X44,X43)
        | X43 != set_difference(X41,X42) )
      & ( ~ in(X44,X42)
        | ~ in(X44,X43)
        | X43 != set_difference(X41,X42) )
      & ( ~ in(X45,X41)
        | in(X45,X42)
        | in(X45,X43)
        | X43 != set_difference(X41,X42) )
      & ( ~ in(esk5_3(X46,X47,X48),X48)
        | ~ in(esk5_3(X46,X47,X48),X46)
        | in(esk5_3(X46,X47,X48),X47)
        | X48 = set_difference(X46,X47) )
      & ( in(esk5_3(X46,X47,X48),X46)
        | in(esk5_3(X46,X47,X48),X48)
        | X48 = set_difference(X46,X47) )
      & ( ~ in(esk5_3(X46,X47,X48),X47)
        | in(esk5_3(X46,X47,X48),X48)
        | X48 = set_difference(X46,X47) ) ),
    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)],[c_0_3])])])])])]) ).

cnf(c_0_5,plain,
    ( in(X1,X2)
    | ~ in(X1,X3)
    | X3 != set_difference(X2,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

fof(c_0_6,plain,
    ! [X26,X27,X28,X29,X30] :
      ( ( ~ subset(X26,X27)
        | ~ in(X28,X26)
        | in(X28,X27) )
      & ( in(esk3_2(X29,X30),X29)
        | subset(X29,X30) )
      & ( ~ in(esk3_2(X29,X30),X30)
        | subset(X29,X30) ) ),
    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_7,negated_conjecture,
    ~ ! [X1,X2] : subset(set_difference(X1,X2),X1),
    inference(assume_negation,[status(cth)],[t36_xboole_1]) ).

cnf(c_0_8,plain,
    ( in(X1,X2)
    | ~ in(X1,set_difference(X2,X3)) ),
    inference(er,[status(thm)],[c_0_5]) ).

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

fof(c_0_10,negated_conjecture,
    ~ subset(set_difference(esk9_0,esk10_0),esk9_0),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).

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

cnf(c_0_12,plain,
    ( subset(set_difference(X1,X2),X3)
    | in(esk3_2(set_difference(X1,X2),X3),X1) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_13,negated_conjecture,
    ~ subset(set_difference(esk9_0,esk10_0),esk9_0),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_14,plain,
    subset(set_difference(X1,X2),X1),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_15,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem    : SEU133+2 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.14  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.15/0.35  % Computer : n001.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 300
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Wed Aug 23 19:41:09 EDT 2023
% 0.15/0.36  % CPUTime  : 
% 0.21/0.58  start to proof: theBenchmark
% 0.21/0.80  % Version  : CSE_E---1.5
% 0.21/0.80  % Problem  : theBenchmark.p
% 0.21/0.80  % Proof found
% 0.21/0.80  % SZS status Theorem for theBenchmark.p
% 0.21/0.80  % SZS output start Proof
% See solution above
% 0.21/0.81  % Total time : 0.215000 s
% 0.21/0.81  % SZS output end Proof
% 0.21/0.81  % Total time : 0.218000 s
%------------------------------------------------------------------------------