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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : SEU150+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 : n027.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:48 EDT 2023

% Result   : Theorem 0.20s 0.60s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   32
% Syntax   : Number of formulae    :   50 (  12 unt;  28 typ;   0 def)
%            Number of atoms       :   32 (  31 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   19 (   9   ~;   6   |;   1   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   44 (  22   >;  22   *;   0   +;   0  <<)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :   23 (  23 usr;   6 con; 0-3 aty)
%            Number of variables   :   33 (   4 sgn;  18   !;   0   ?;   0   :)

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

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

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

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

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

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

tff(decl_28,type,
    singleton: $i > $i ).

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

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

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

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

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

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

tff(decl_35,type,
    esk2_1: $i > $i ).

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

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

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

tff(decl_39,type,
    esk6_2: ( $i * $i ) > $i ).

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

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

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

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

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

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

tff(decl_46,type,
    esk13_2: ( $i * $i ) > $i ).

tff(decl_47,type,
    esk14_0: $i ).

tff(decl_48,type,
    esk15_0: $i ).

tff(decl_49,type,
    esk16_0: $i ).

fof(t9_zfmisc_1,conjecture,
    ! [X1,X2,X3] :
      ( singleton(X1) = unordered_pair(X2,X3)
     => X2 = X3 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t9_zfmisc_1) ).

fof(t8_zfmisc_1,lemma,
    ! [X1,X2,X3] :
      ( singleton(X1) = unordered_pair(X2,X3)
     => X1 = X2 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_zfmisc_1) ).

fof(t69_enumset1,lemma,
    ! [X1] : unordered_pair(X1,X1) = singleton(X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t69_enumset1) ).

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

fof(c_0_4,negated_conjecture,
    ~ ! [X1,X2,X3] :
        ( singleton(X1) = unordered_pair(X2,X3)
       => X2 = X3 ),
    inference(assume_negation,[status(cth)],[t9_zfmisc_1]) ).

fof(c_0_5,lemma,
    ! [X174,X175,X176] :
      ( singleton(X174) != unordered_pair(X175,X176)
      | X174 = X175 ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t8_zfmisc_1])]) ).

fof(c_0_6,lemma,
    ! [X159] : unordered_pair(X159,X159) = singleton(X159),
    inference(variable_rename,[status(thm)],[t69_enumset1]) ).

fof(c_0_7,negated_conjecture,
    ( singleton(esk14_0) = unordered_pair(esk15_0,esk16_0)
    & esk15_0 != esk16_0 ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).

cnf(c_0_8,lemma,
    ( X1 = X2
    | singleton(X1) != unordered_pair(X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,lemma,
    unordered_pair(X1,X1) = singleton(X1),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,negated_conjecture,
    singleton(esk14_0) = unordered_pair(esk15_0,esk16_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_11,lemma,
    ( X1 = X2
    | unordered_pair(X1,X1) != unordered_pair(X2,X3) ),
    inference(rw,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_12,negated_conjecture,
    unordered_pair(esk15_0,esk16_0) = unordered_pair(esk14_0,esk14_0),
    inference(rw,[status(thm)],[c_0_10,c_0_9]) ).

fof(c_0_13,plain,
    ! [X9,X10] : unordered_pair(X9,X10) = unordered_pair(X10,X9),
    inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).

cnf(c_0_14,negated_conjecture,
    ( esk14_0 = X1
    | unordered_pair(esk15_0,esk16_0) != unordered_pair(X1,X2) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

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

cnf(c_0_16,negated_conjecture,
    esk14_0 = esk15_0,
    inference(er,[status(thm)],[c_0_14]) ).

cnf(c_0_17,lemma,
    ( X1 = X2
    | unordered_pair(X1,X1) != unordered_pair(X3,X2) ),
    inference(spm,[status(thm)],[c_0_11,c_0_15]) ).

cnf(c_0_18,negated_conjecture,
    unordered_pair(esk15_0,esk16_0) = unordered_pair(esk15_0,esk15_0),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_16]),c_0_16]) ).

cnf(c_0_19,negated_conjecture,
    ( X1 = esk16_0
    | unordered_pair(X1,X1) != unordered_pair(esk15_0,esk15_0) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_20,negated_conjecture,
    esk15_0 != esk16_0,
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SEU150+2 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34  % Computer : n027.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Wed Aug 23 19:56:17 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.20/0.57  start to proof: theBenchmark
% 0.20/0.60  % Version  : CSE_E---1.5
% 0.20/0.60  % Problem  : theBenchmark.p
% 0.20/0.60  % Proof found
% 0.20/0.60  % SZS status Theorem for theBenchmark.p
% 0.20/0.60  % SZS output start Proof
% See solution above
% 0.20/0.60  % Total time : 0.018000 s
% 0.20/0.60  % SZS output end Proof
% 0.20/0.60  % Total time : 0.022000 s
%------------------------------------------------------------------------------