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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : SWV261-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 : n007.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 21:37:21 EDT 2023

% Result   : Unsatisfiable 0.45s 0.61s
% Output   : CNFRefutation 0.45s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   21
% Syntax   : Number of formulae    :   40 (   8 unt;  11 typ;   0 def)
%            Number of atoms       :   56 (   4 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   50 (  23   ~;  27   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   17 (   7   >;  10   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    9 (   9 usr;   4 con; 0-3 aty)
%            Number of variables   :   78 (   4 sgn;   0   !;   0   ?;   0   :)

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

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

tff(decl_24,type,
    tc_Message_Omsg: $i ).

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

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

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

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

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

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

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

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

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

cnf(cls_Message_Oparts__mono_0,axiom,
    ( c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_set(tc_Message_Omsg))
    | ~ c_lessequals(X1,X2,tc_set(tc_Message_Omsg)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Message_Oparts__mono_0) ).

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

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

cnf(cls_Set_OinsertE_0,axiom,
    ( c_in(X1,X3,X4)
    | X1 = X2
    | ~ c_in(X1,c_insert(X2,X3,X4),X4) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OinsertE_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_Message_Oparts__Un__subset2_0,axiom,
    c_lessequals(c_Message_Oparts(c_union(X1,X2,tc_Message_Omsg)),c_union(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_Message_Omsg),tc_set(tc_Message_Omsg)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Message_Oparts__Un__subset2_0) ).

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

cnf(cls_conjecture_1,negated_conjecture,
    ~ c_lessequals(c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),c_union(c_Message_Oparts(v_G),c_Message_Oparts(v_H),tc_Message_Omsg),tc_set(tc_Message_Omsg)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).

cnf(cls_conjecture_0,negated_conjecture,
    c_in(v_X,v_G,tc_Message_Omsg),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).

cnf(c_0_10,axiom,
    ( c_lessequals(X4,X2,tc_set(X3))
    | ~ c_lessequals(X1,X2,tc_set(X3))
    | ~ c_lessequals(X4,X1,tc_set(X3)) ),
    cls_Set_Osubset__trans_0 ).

cnf(c_0_11,axiom,
    ( c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_set(tc_Message_Omsg))
    | ~ c_lessequals(X1,X2,tc_set(tc_Message_Omsg)) ),
    cls_Message_Oparts__mono_0 ).

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

cnf(c_0_13,axiom,
    ( c_in(X1,c_union(X4,X2,X3),X3)
    | ~ c_in(X1,X2,X3) ),
    cls_Set_OUnCI_0 ).

cnf(c_0_14,axiom,
    ( c_in(X1,X3,X4)
    | X1 = X2
    | ~ c_in(X1,c_insert(X2,X3,X4),X4) ),
    cls_Set_OinsertE_0 ).

cnf(c_0_15,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_16,plain,
    ( c_lessequals(c_Message_Oparts(X1),X2,tc_set(tc_Message_Omsg))
    | ~ c_lessequals(c_Message_Oparts(X3),X2,tc_set(tc_Message_Omsg))
    | ~ c_lessequals(X1,X3,tc_set(tc_Message_Omsg)) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_17,axiom,
    c_lessequals(c_Message_Oparts(c_union(X1,X2,tc_Message_Omsg)),c_union(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_Message_Omsg),tc_set(tc_Message_Omsg)),
    cls_Message_Oparts__Un__subset2_0 ).

cnf(c_0_18,axiom,
    ( c_in(X1,c_union(X2,X4,X3),X3)
    | ~ c_in(X1,X2,X3) ),
    cls_Set_OUnCI_1 ).

cnf(c_0_19,plain,
    ( c_lessequals(X1,c_union(X2,X3,X4),tc_set(X4))
    | ~ c_in(c_Main_OsubsetI__1(X1,c_union(X2,X3,X4),X4),X3,X4) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_20,plain,
    ( c_Main_OsubsetI__1(c_insert(X1,X2,X3),X4,X3) = X1
    | c_lessequals(c_insert(X1,X2,X3),X4,tc_set(X3))
    | c_in(c_Main_OsubsetI__1(c_insert(X1,X2,X3),X4,X3),X2,X3) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_21,negated_conjecture,
    ~ c_lessequals(c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),c_union(c_Message_Oparts(v_G),c_Message_Oparts(v_H),tc_Message_Omsg),tc_set(tc_Message_Omsg)),
    cls_conjecture_1 ).

cnf(c_0_22,plain,
    ( c_lessequals(c_Message_Oparts(X1),c_union(c_Message_Oparts(X2),c_Message_Oparts(X3),tc_Message_Omsg),tc_set(tc_Message_Omsg))
    | ~ c_lessequals(X1,c_union(X2,X3,tc_Message_Omsg),tc_set(tc_Message_Omsg)) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_23,plain,
    ( c_lessequals(X1,c_union(X2,X3,X4),tc_set(X4))
    | ~ c_in(c_Main_OsubsetI__1(X1,c_union(X2,X3,X4),X4),X2,X4) ),
    inference(spm,[status(thm)],[c_0_12,c_0_18]) ).

cnf(c_0_24,plain,
    ( c_Main_OsubsetI__1(c_insert(X1,X2,X3),c_union(X4,X2,X3),X3) = X1
    | c_lessequals(c_insert(X1,X2,X3),c_union(X4,X2,X3),tc_set(X3)) ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_25,negated_conjecture,
    ~ c_lessequals(c_insert(v_X,v_H,tc_Message_Omsg),c_union(v_G,v_H,tc_Message_Omsg),tc_set(tc_Message_Omsg)),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_26,plain,
    ( c_lessequals(c_insert(X1,X2,X3),c_union(X4,X2,X3),tc_set(X3))
    | ~ c_in(X1,X4,X3) ),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_27,negated_conjecture,
    c_in(v_X,v_G,tc_Message_Omsg),
    cls_conjecture_0 ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12  % Problem    : SWV261-2 : TPTP v8.1.2. Released v3.2.0.
% 0.08/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34  % Computer : n007.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   : Tue Aug 29 05:04:43 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.45/0.57  start to proof: theBenchmark
% 0.45/0.61  % Version  : CSE_E---1.5
% 0.45/0.61  % Problem  : theBenchmark.p
% 0.45/0.61  % Proof found
% 0.45/0.61  % SZS status Theorem for theBenchmark.p
% 0.45/0.61  % SZS output start Proof
% See solution above
% 0.45/0.61  % Total time : 0.033000 s
% 0.45/0.61  % SZS output end Proof
% 0.45/0.61  % Total time : 0.036000 s
%------------------------------------------------------------------------------