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

View Problem - Process Solution

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

% Computer : n006.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:58 EDT 2023

% Result   : Unsatisfiable 0.20s 0.60s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   16
% Syntax   : Number of formulae    :   25 (   5 unt;  10 typ;   0 def)
%            Number of atoms       :   35 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   31 (  11   ~;  20   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   16 (   6   >;  10   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   4 con; 0-4 aty)
%            Number of variables   :   29 (   0 sgn;   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    v_Y: $i ).

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

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

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

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

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

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

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

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

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

cnf(cls_Zorn_OUnion__lemma0_2,axiom,
    ( c_lessequals(X1,c_Union(X3,X4),tc_set(X4))
    | c_lessequals(c_Union(X3,X4),X2,tc_set(X4))
    | ~ c_lessequals(X1,c_Zorn_OUnion__lemma0__1(X2,X1,X3,X4),tc_set(X4)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_OUnion__lemma0_2) ).

cnf(cls_conjecture_4,negated_conjecture,
    ( c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),X1,tc_set(tc_set(t_a)))
    | c_lessequals(X1,v_m,tc_set(tc_set(t_a)))
    | ~ c_in(X1,v_Y,tc_set(tc_set(t_a))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_4) ).

cnf(cls_Zorn_OUnion__lemma0_0,axiom,
    ( c_in(c_Zorn_OUnion__lemma0__1(X1,X2,X3,X4),X3,tc_set(X4))
    | c_lessequals(X2,c_Union(X3,X4),tc_set(X4))
    | c_lessequals(c_Union(X3,X4),X1,tc_set(X4)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_OUnion__lemma0_0) ).

cnf(cls_conjecture_3,negated_conjecture,
    ~ c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).

cnf(cls_Zorn_OUnion__lemma0_1,axiom,
    ( c_lessequals(X2,c_Union(X3,X4),tc_set(X4))
    | c_lessequals(c_Union(X3,X4),X1,tc_set(X4))
    | ~ c_lessequals(c_Zorn_OUnion__lemma0__1(X1,X2,X3,X4),X1,tc_set(X4)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_OUnion__lemma0_1) ).

cnf(cls_conjecture_2,negated_conjecture,
    ~ c_lessequals(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).

cnf(c_0_6,axiom,
    ( c_lessequals(X1,c_Union(X3,X4),tc_set(X4))
    | c_lessequals(c_Union(X3,X4),X2,tc_set(X4))
    | ~ c_lessequals(X1,c_Zorn_OUnion__lemma0__1(X2,X1,X3,X4),tc_set(X4)) ),
    cls_Zorn_OUnion__lemma0_2 ).

cnf(c_0_7,negated_conjecture,
    ( c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),X1,tc_set(tc_set(t_a)))
    | c_lessequals(X1,v_m,tc_set(tc_set(t_a)))
    | ~ c_in(X1,v_Y,tc_set(tc_set(t_a))) ),
    cls_conjecture_4 ).

cnf(c_0_8,negated_conjecture,
    ( c_lessequals(c_Zorn_OUnion__lemma0__1(X1,c_Zorn_Osucc(v_S,v_m,t_a),X2,tc_set(t_a)),v_m,tc_set(tc_set(t_a)))
    | c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Union(X2,tc_set(t_a)),tc_set(tc_set(t_a)))
    | c_lessequals(c_Union(X2,tc_set(t_a)),X1,tc_set(tc_set(t_a)))
    | ~ c_in(c_Zorn_OUnion__lemma0__1(X1,c_Zorn_Osucc(v_S,v_m,t_a),X2,tc_set(t_a)),v_Y,tc_set(tc_set(t_a))) ),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_9,axiom,
    ( c_in(c_Zorn_OUnion__lemma0__1(X1,X2,X3,X4),X3,tc_set(X4))
    | c_lessequals(X2,c_Union(X3,X4),tc_set(X4))
    | c_lessequals(c_Union(X3,X4),X1,tc_set(X4)) ),
    cls_Zorn_OUnion__lemma0_0 ).

cnf(c_0_10,negated_conjecture,
    ~ c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a))),
    cls_conjecture_3 ).

cnf(c_0_11,axiom,
    ( c_lessequals(X2,c_Union(X3,X4),tc_set(X4))
    | c_lessequals(c_Union(X3,X4),X1,tc_set(X4))
    | ~ c_lessequals(c_Zorn_OUnion__lemma0__1(X1,X2,X3,X4),X1,tc_set(X4)) ),
    cls_Zorn_OUnion__lemma0_1 ).

cnf(c_0_12,negated_conjecture,
    ( c_lessequals(c_Zorn_OUnion__lemma0__1(X1,c_Zorn_Osucc(v_S,v_m,t_a),v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a)))
    | c_lessequals(c_Union(v_Y,tc_set(t_a)),X1,tc_set(tc_set(t_a))) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).

cnf(c_0_13,negated_conjecture,
    ~ c_lessequals(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))),
    cls_conjecture_2 ).

cnf(c_0_14,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_10]),c_0_13]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SET852-2 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.14/0.34  % Computer : n006.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   : Sat Aug 26 10:48:22 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 0.20/0.58  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.004000 s
% 0.20/0.60  % SZS output end Proof
% 0.20/0.60  % Total time : 0.006000 s
%------------------------------------------------------------------------------