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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : SWV283-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 : n018.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:32 EDT 2023

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

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

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

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

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

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

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

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

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

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

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

tff(decl_32,type,
    v_list: $i ).

tff(decl_33,type,
    c_Event_Oused: $i > $i ).

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

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

tff(decl_36,type,
    v_xc: $i ).

cnf(cls_conjecture_9,negated_conjecture,
    ( c_in(c_Message_Omsg_ONonce(v_xd(X1)),c_Event_Oused(v_list),tc_Message_Omsg)
    | c_in(c_Message_Omsg_ONonce(v_xd(X1)),c_Message_Oparts(c_insert(v_xc,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg)
    | c_in(c_Message_Omsg_ONonce(v_xd(X2)),c_Event_Oused(v_list),tc_Message_Omsg)
    | c_in(c_Message_Omsg_ONonce(v_xd(X2)),c_Message_Oparts(c_insert(v_xc,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_9) ).

cnf(cls_Message_Omsg__Nonce__supply_0,axiom,
    ( ~ c_in(c_Message_Omsg_ONonce(X1),c_Message_Oparts(c_insert(X2,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg)
    | ~ c_lessequals(v_sko__upX(X2),X1,tc_nat) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Message_Omsg__Nonce__supply_0) ).

cnf(cls_conjecture_4,negated_conjecture,
    ( c_lessequals(X1,v_xd(X1),tc_nat)
    | c_lessequals(X2,v_xd(X2),tc_nat) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_4) ).

cnf(cls_conjecture_0,negated_conjecture,
    ( ~ c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_list),tc_Message_Omsg)
    | ~ c_lessequals(v_x,X1,tc_nat) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).

cnf(cls_Nat_Oadd__leE_0,axiom,
    ( c_lessequals(X2,X3,tc_nat)
    | ~ c_lessequals(c_plus(X1,X2,tc_nat),X3,tc_nat) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Nat_Oadd__leE_0) ).

cnf(cls_Nat_Oadd__leE_1,axiom,
    ( c_lessequals(X1,X3,tc_nat)
    | ~ c_lessequals(c_plus(X1,X2,tc_nat),X3,tc_nat) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Nat_Oadd__leE_1) ).

cnf(c_0_6,negated_conjecture,
    ( c_in(c_Message_Omsg_ONonce(v_xd(X1)),c_Event_Oused(v_list),tc_Message_Omsg)
    | c_in(c_Message_Omsg_ONonce(v_xd(X1)),c_Message_Oparts(c_insert(v_xc,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg)
    | c_in(c_Message_Omsg_ONonce(v_xd(X2)),c_Event_Oused(v_list),tc_Message_Omsg)
    | c_in(c_Message_Omsg_ONonce(v_xd(X2)),c_Message_Oparts(c_insert(v_xc,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg) ),
    cls_conjecture_9 ).

cnf(c_0_7,axiom,
    ( ~ c_in(c_Message_Omsg_ONonce(X1),c_Message_Oparts(c_insert(X2,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg)
    | ~ c_lessequals(v_sko__upX(X2),X1,tc_nat) ),
    cls_Message_Omsg__Nonce__supply_0 ).

cnf(c_0_8,negated_conjecture,
    ( c_in(c_Message_Omsg_ONonce(v_xd(X1)),c_Message_Oparts(c_insert(v_xc,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg)
    | c_in(c_Message_Omsg_ONonce(v_xd(X1)),c_Event_Oused(v_list),tc_Message_Omsg) ),
    inference(ef,[status(thm)],[c_0_6]) ).

cnf(c_0_9,negated_conjecture,
    ( c_lessequals(X1,v_xd(X1),tc_nat)
    | c_lessequals(X2,v_xd(X2),tc_nat) ),
    cls_conjecture_4 ).

cnf(c_0_10,negated_conjecture,
    ( ~ c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_list),tc_Message_Omsg)
    | ~ c_lessequals(v_x,X1,tc_nat) ),
    cls_conjecture_0 ).

cnf(c_0_11,negated_conjecture,
    ( c_in(c_Message_Omsg_ONonce(v_xd(X1)),c_Event_Oused(v_list),tc_Message_Omsg)
    | ~ c_lessequals(v_sko__upX(v_xc),v_xd(X1),tc_nat) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_12,axiom,
    ( c_lessequals(X2,X3,tc_nat)
    | ~ c_lessequals(c_plus(X1,X2,tc_nat),X3,tc_nat) ),
    cls_Nat_Oadd__leE_0 ).

cnf(c_0_13,negated_conjecture,
    c_lessequals(X1,v_xd(X1),tc_nat),
    inference(ef,[status(thm)],[c_0_9]) ).

cnf(c_0_14,negated_conjecture,
    ( ~ c_lessequals(v_sko__upX(v_xc),v_xd(X1),tc_nat)
    | ~ c_lessequals(v_x,v_xd(X1),tc_nat) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_15,negated_conjecture,
    c_lessequals(X1,v_xd(c_plus(X2,X1,tc_nat)),tc_nat),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_16,axiom,
    ( c_lessequals(X1,X3,tc_nat)
    | ~ c_lessequals(c_plus(X1,X2,tc_nat),X3,tc_nat) ),
    cls_Nat_Oadd__leE_1 ).

cnf(c_0_17,negated_conjecture,
    ~ c_lessequals(v_x,v_xd(c_plus(X1,v_sko__upX(v_xc),tc_nat)),tc_nat),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_18,negated_conjecture,
    c_lessequals(X1,v_xd(c_plus(X1,X2,tc_nat)),tc_nat),
    inference(spm,[status(thm)],[c_0_16,c_0_13]) ).

cnf(c_0_19,negated_conjecture,
    $false,
    inference(spm,[status(thm)],[c_0_17,c_0_18]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SWV283-2 : TPTP v8.1.2. Released v3.2.0.
% 0.07/0.13  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.34  % Computer : n018.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Tue Aug 29 06:07:17 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 0.19/0.56  start to proof: theBenchmark
% 0.19/0.57  % Version  : CSE_E---1.5
% 0.19/0.57  % Problem  : theBenchmark.p
% 0.19/0.57  % Proof found
% 0.19/0.57  % SZS status Theorem for theBenchmark.p
% 0.19/0.57  % SZS output start Proof
% See solution above
% 0.19/0.58  % Total time : 0.005000 s
% 0.19/0.58  % SZS output end Proof
% 0.19/0.58  % Total time : 0.008000 s
%------------------------------------------------------------------------------