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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : SEU124+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 : n024.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:33 EDT 2023

% Result   : Theorem 0.18s 0.56s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   30 (  10 unt;  11 typ;   0 def)
%            Number of atoms       :   55 (  11 equ)
%            Maximal formula atoms :   20 (   2 avg)
%            Number of connectives :   57 (  21   ~;  25   |;   7   &)
%                                         (   3 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   12 (   6   >;   6   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-3 aty)
%            Number of variables   :   48 (   4 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,
    subset: ( $i * $i ) > $o ).

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

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

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

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

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

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

tff(decl_31,type,
    esk5_0: $i ).

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

fof(d2_xboole_0,axiom,
    ! [X1,X2,X3] :
      ( X3 = set_union2(X1,X2)
    <=> ! [X4] :
          ( in(X4,X3)
        <=> ( in(X4,X1)
            | in(X4,X2) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_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(t7_xboole_1,conjecture,
    ! [X1,X2] : subset(X1,set_union2(X1,X2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_xboole_1) ).

fof(commutativity_k2_xboole_0,axiom,
    ! [X1,X2] : set_union2(X1,X2) = set_union2(X2,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).

fof(c_0_4,plain,
    ! [X9,X10,X11,X12,X13,X14,X15,X16] :
      ( ( ~ in(X12,X11)
        | in(X12,X9)
        | in(X12,X10)
        | X11 != set_union2(X9,X10) )
      & ( ~ in(X13,X9)
        | in(X13,X11)
        | X11 != set_union2(X9,X10) )
      & ( ~ in(X13,X10)
        | in(X13,X11)
        | X11 != set_union2(X9,X10) )
      & ( ~ in(esk1_3(X14,X15,X16),X14)
        | ~ in(esk1_3(X14,X15,X16),X16)
        | X16 = set_union2(X14,X15) )
      & ( ~ in(esk1_3(X14,X15,X16),X15)
        | ~ in(esk1_3(X14,X15,X16),X16)
        | X16 = set_union2(X14,X15) )
      & ( in(esk1_3(X14,X15,X16),X16)
        | in(esk1_3(X14,X15,X16),X14)
        | in(esk1_3(X14,X15,X16),X15)
        | X16 = set_union2(X14,X15) ) ),
    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)],[d2_xboole_0])])])])])]) ).

fof(c_0_5,plain,
    ! [X18,X19,X20,X21,X22] :
      ( ( ~ subset(X18,X19)
        | ~ in(X20,X18)
        | in(X20,X19) )
      & ( in(esk2_2(X21,X22),X21)
        | subset(X21,X22) )
      & ( ~ in(esk2_2(X21,X22),X22)
        | subset(X21,X22) ) ),
    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_6,plain,
    ( in(X1,X3)
    | ~ in(X1,X2)
    | X3 != set_union2(X4,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

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

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

fof(c_0_9,negated_conjecture,
    ~ ! [X1,X2] : subset(X1,set_union2(X1,X2)),
    inference(assume_negation,[status(cth)],[t7_xboole_1]) ).

cnf(c_0_10,plain,
    ( subset(X1,set_union2(X2,X3))
    | ~ in(esk2_2(X1,set_union2(X2,X3)),X3) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

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

fof(c_0_12,plain,
    ! [X7,X8] : set_union2(X7,X8) = set_union2(X8,X7),
    inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).

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

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

cnf(c_0_15,plain,
    set_union2(X1,X2) = set_union2(X2,X1),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

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

cnf(c_0_17,plain,
    subset(X1,set_union2(X1,X2)),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_18,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem    : SEU124+1 : TPTP v8.1.2. Released v3.3.0.
% 0.06/0.12  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.11/0.33  % Computer : n024.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit   : 300
% 0.11/0.33  % WCLimit    : 300
% 0.11/0.33  % DateTime   : Wed Aug 23 14:26:25 EDT 2023
% 0.11/0.33  % CPUTime  : 
% 0.18/0.54  start to proof: theBenchmark
% 0.18/0.56  % Version  : CSE_E---1.5
% 0.18/0.56  % Problem  : theBenchmark.p
% 0.18/0.56  % Proof found
% 0.18/0.56  % SZS status Theorem for theBenchmark.p
% 0.18/0.56  % SZS output start Proof
% See solution above
% 0.18/0.56  % Total time : 0.011000 s
% 0.18/0.56  % SZS output end Proof
% 0.18/0.56  % Total time : 0.012000 s
%------------------------------------------------------------------------------