TSTP Solution File: SET847-2 by CSE_E---1.5

View Problem - Process Solution

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

% Computer : n008.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 14:35:55 EDT 2023

% Result   : Unsatisfiable 0.19s 0.58s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   24
% Syntax   : Number of formulae    :   44 (  12 unt;  13 typ;   0 def)
%            Number of atoms       :   54 (  13 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   52 (  29   ~;  23   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   24 (  10   >;  14   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :   11 (  11 usr;   3 con; 0-3 aty)
%            Number of variables   :   64 (  13 sgn;   0   !;   0   ?;   0   :)

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

tff(decl_23,type,
    tc_set: $i > $i ).

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

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

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

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

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

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

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

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

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

tff(decl_33,type,
    v_S: $i ).

tff(decl_34,type,
    t_a: $i ).

cnf(cls_conjecture_0,negated_conjecture,
    ~ c_in(X1,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).

cnf(cls_Set_OsubsetI_0,axiom,
    ( c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3)
    | c_lessequals(X1,X2,tc_set(X3)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OsubsetI_0) ).

cnf(cls_Set_Osubset__antisym_0,axiom,
    ( X2 = X1
    | ~ c_lessequals(X1,X2,tc_set(X3))
    | ~ c_lessequals(X2,X1,tc_set(X3)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_Osubset__antisym_0) ).

cnf(cls_Set_Oempty__subsetI_0,axiom,
    c_lessequals(c_emptyset,X1,tc_set(X2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_Oempty__subsetI_0) ).

cnf(cls_Zorn_Osucc__not__equals_0,axiom,
    ( ~ c_in(X1,c_minus(c_Zorn_Ochain(X2,X3),c_Zorn_Omaxchain(X2,X3),tc_set(tc_set(tc_set(X3)))),tc_set(tc_set(X3)))
    | c_Zorn_Osucc(X2,X1,X3) != X1 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Zorn_Osucc__not__equals_0) ).

cnf(cls_Set_ODiffI_0,axiom,
    ( c_in(X1,X4,X3)
    | c_in(X1,c_minus(X2,X4,tc_set(X3)),X3)
    | ~ c_in(X1,X2,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_ODiffI_0) ).

cnf(cls_Set_OemptyE_0,axiom,
    ~ c_in(X1,c_emptyset,X2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OemptyE_0) ).

cnf(cls_Zorn_OTFin__chain__lemma4_0,axiom,
    ( c_in(X1,c_Zorn_Ochain(X2,X3),tc_set(tc_set(X3)))
    | ~ c_in(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Zorn_OTFin__chain__lemma4_0) ).

cnf(cls_Zorn_OTFin__UnionI_0,axiom,
    ( c_in(c_Union(X1,tc_set(X3)),c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
    | ~ c_lessequals(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(tc_set(X3)))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Zorn_OTFin__UnionI_0) ).

cnf(cls_Zorn_Oequal__succ__Union_1,axiom,
    ( c_Union(c_Zorn_OTFin(X1,X2),tc_set(X2)) = c_Zorn_Osucc(X1,c_Union(c_Zorn_OTFin(X1,X2),tc_set(X2)),X2)
    | ~ c_in(c_Union(c_Zorn_OTFin(X1,X2),tc_set(X2)),c_Zorn_OTFin(X1,X2),tc_set(tc_set(X2))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Zorn_Oequal__succ__Union_1) ).

cnf(cls_Set_Osubset__refl_0,axiom,
    c_lessequals(X1,X1,tc_set(X2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_Osubset__refl_0) ).

cnf(c_0_11,negated_conjecture,
    ~ c_in(X1,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a))),
    cls_conjecture_0 ).

cnf(c_0_12,axiom,
    ( c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3)
    | c_lessequals(X1,X2,tc_set(X3)) ),
    cls_Set_OsubsetI_0 ).

cnf(c_0_13,axiom,
    ( X2 = X1
    | ~ c_lessequals(X1,X2,tc_set(X3))
    | ~ c_lessequals(X2,X1,tc_set(X3)) ),
    cls_Set_Osubset__antisym_0 ).

cnf(c_0_14,negated_conjecture,
    c_lessequals(c_Zorn_Omaxchain(v_S,t_a),X1,tc_set(tc_set(tc_set(t_a)))),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_15,negated_conjecture,
    ( X1 = c_Zorn_Omaxchain(v_S,t_a)
    | ~ c_lessequals(X1,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(tc_set(t_a)))) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_16,axiom,
    c_lessequals(c_emptyset,X1,tc_set(X2)),
    cls_Set_Oempty__subsetI_0 ).

cnf(c_0_17,axiom,
    ( ~ c_in(X1,c_minus(c_Zorn_Ochain(X2,X3),c_Zorn_Omaxchain(X2,X3),tc_set(tc_set(tc_set(X3)))),tc_set(tc_set(X3)))
    | c_Zorn_Osucc(X2,X1,X3) != X1 ),
    cls_Zorn_Osucc__not__equals_0 ).

cnf(c_0_18,negated_conjecture,
    c_Zorn_Omaxchain(v_S,t_a) = c_emptyset,
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_19,negated_conjecture,
    ( c_Zorn_Osucc(v_S,X1,t_a) != X1
    | ~ c_in(X1,c_minus(c_Zorn_Ochain(v_S,t_a),c_emptyset,tc_set(tc_set(tc_set(t_a)))),tc_set(tc_set(t_a))) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_20,axiom,
    ( c_in(X1,X4,X3)
    | c_in(X1,c_minus(X2,X4,tc_set(X3)),X3)
    | ~ c_in(X1,X2,X3) ),
    cls_Set_ODiffI_0 ).

cnf(c_0_21,axiom,
    ~ c_in(X1,c_emptyset,X2),
    cls_Set_OemptyE_0 ).

cnf(c_0_22,negated_conjecture,
    ( c_Zorn_Osucc(v_S,X1,t_a) != X1
    | ~ c_in(X1,c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a))) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).

cnf(c_0_23,axiom,
    ( c_in(X1,c_Zorn_Ochain(X2,X3),tc_set(tc_set(X3)))
    | ~ c_in(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3))) ),
    cls_Zorn_OTFin__chain__lemma4_0 ).

cnf(c_0_24,negated_conjecture,
    ( c_Zorn_Osucc(v_S,X1,t_a) != X1
    | ~ c_in(X1,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_25,axiom,
    ( c_in(c_Union(X1,tc_set(X3)),c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
    | ~ c_lessequals(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(tc_set(X3)))) ),
    cls_Zorn_OTFin__UnionI_0 ).

cnf(c_0_26,axiom,
    ( c_Union(c_Zorn_OTFin(X1,X2),tc_set(X2)) = c_Zorn_Osucc(X1,c_Union(c_Zorn_OTFin(X1,X2),tc_set(X2)),X2)
    | ~ c_in(c_Union(c_Zorn_OTFin(X1,X2),tc_set(X2)),c_Zorn_OTFin(X1,X2),tc_set(tc_set(X2))) ),
    cls_Zorn_Oequal__succ__Union_1 ).

cnf(c_0_27,axiom,
    c_lessequals(X1,X1,tc_set(X2)),
    cls_Set_Osubset__refl_0 ).

cnf(c_0_28,negated_conjecture,
    ( c_Zorn_Osucc(v_S,c_Union(X1,tc_set(t_a)),t_a) != c_Union(X1,tc_set(t_a))
    | ~ c_lessequals(X1,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(tc_set(t_a)))) ),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_29,plain,
    c_Zorn_Osucc(X1,c_Union(c_Zorn_OTFin(X1,X2),tc_set(X2)),X2) = c_Union(c_Zorn_OTFin(X1,X2),tc_set(X2)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_25]),c_0_27])]) ).

cnf(c_0_30,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_27])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : SET847-2 : TPTP v8.1.2. Released v3.2.0.
% 0.11/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34  % Computer : n008.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   : Sat Aug 26 09:23:02 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.19/0.56  start to proof: theBenchmark
% 0.19/0.58  % Version  : CSE_E---1.5
% 0.19/0.58  % Problem  : theBenchmark.p
% 0.19/0.58  % Proof found
% 0.19/0.58  % SZS status Theorem for theBenchmark.p
% 0.19/0.58  % SZS output start Proof
% See solution above
% 0.19/0.58  % Total time : 0.006000 s
% 0.19/0.58  % SZS output end Proof
% 0.19/0.58  % Total time : 0.009000 s
%------------------------------------------------------------------------------