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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : SWV277-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 : n025.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:29 EDT 2023

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

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

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

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

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

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

tff(decl_27,type,
    c_Message_OkeysFor: $i > $i ).

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

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

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

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

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

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

cnf(cls_Message_Oanalz__subset__parts_0,axiom,
    c_lessequals(c_Message_Oanalz(X1),c_Message_Oparts(X1),tc_set(tc_Message_Omsg)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Message_Oanalz__subset__parts_0) ).

cnf(cls_conjecture_2,negated_conjecture,
    ~ c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(v_H)),tc_nat),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).

cnf(cls_conjecture_3,negated_conjecture,
    c_in(v_K,c_Message_OkeysFor(c_Message_Oanalz(v_H)),tc_nat),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3) ).

cnf(c_0_5,axiom,
    ( c_in(X1,X4,X3)
    | ~ c_in(X1,X2,X3)
    | ~ c_lessequals(X2,X4,tc_set(X3)) ),
    cls_Set_OsubsetD_0 ).

cnf(c_0_6,axiom,
    ( c_lessequals(c_Message_OkeysFor(X1),c_Message_OkeysFor(X2),tc_set(tc_nat))
    | ~ c_lessequals(X1,X2,tc_set(tc_Message_Omsg)) ),
    cls_Message_OkeysFor__mono_0 ).

cnf(c_0_7,plain,
    ( c_in(X1,c_Message_OkeysFor(X2),tc_nat)
    | ~ c_in(X1,c_Message_OkeysFor(X3),tc_nat)
    | ~ c_lessequals(X3,X2,tc_set(tc_Message_Omsg)) ),
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_8,axiom,
    c_lessequals(c_Message_Oanalz(X1),c_Message_Oparts(X1),tc_set(tc_Message_Omsg)),
    cls_Message_Oanalz__subset__parts_0 ).

cnf(c_0_9,negated_conjecture,
    ~ c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(v_H)),tc_nat),
    cls_conjecture_2 ).

cnf(c_0_10,plain,
    ( c_in(X1,c_Message_OkeysFor(c_Message_Oparts(X2)),tc_nat)
    | ~ c_in(X1,c_Message_OkeysFor(c_Message_Oanalz(X2)),tc_nat) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_11,negated_conjecture,
    c_in(v_K,c_Message_OkeysFor(c_Message_Oanalz(v_H)),tc_nat),
    cls_conjecture_3 ).

cnf(c_0_12,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SWV277-2 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.14/0.34  % Computer : n025.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   : Tue Aug 29 04:49:40 EDT 2023
% 0.14/0.34  % CPUTime  : 
% 0.20/0.57  start to proof: theBenchmark
% 0.20/0.58  % Version  : CSE_E---1.5
% 0.20/0.58  % Problem  : theBenchmark.p
% 0.20/0.58  % Proof found
% 0.20/0.58  % SZS status Theorem for theBenchmark.p
% 0.20/0.58  % SZS output start Proof
% See solution above
% 0.20/0.58  % Total time : 0.004000 s
% 0.20/0.58  % SZS output end Proof
% 0.20/0.58  % Total time : 0.007000 s
%------------------------------------------------------------------------------