TSTP Solution File: SWV282-2 by E---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : SWV282-2 : TPTP v8.1.2. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% 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 : 2400s
% WCLimit  : 300s
% DateTime : Tue Oct 10 19:44:02 EDT 2023

% Result   : Unsatisfiable 0.20s 0.66s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   35
%            Number of leaves      :   14
% Syntax   : Number of clauses     :   89 (  31 unt;  43 nHn;  40 RR)
%            Number of literals    :  208 ( 124 equ;  36 neg)
%            Maximal clause size   :    6 (   2 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :   16 (  16 usr;   7 con; 0-3 aty)
%            Number of variables   :  111 (  20 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_Public_ONonce__supply__lemma_0,axiom,
    ( ~ c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(X2),tc_Message_Omsg)
    | ~ c_lessequals(v_sko__urX(X2),X1,tc_nat) ),
    file('/export/starexec/sandbox/tmp/tmp.tEw3g2P4Jf/E---3.1_29905.p',cls_Public_ONonce__supply__lemma_0) ).

cnf(cls_conjecture_0,negated_conjecture,
    ( X1 = X2
    | X3 = X2
    | X1 = X3
    | c_in(c_Message_Omsg_ONonce(X2),c_Event_Oused(v_evs_H_H),tc_Message_Omsg)
    | c_in(c_Message_Omsg_ONonce(X3),c_Event_Oused(v_evs_H),tc_Message_Omsg)
    | c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_evs),tc_Message_Omsg) ),
    file('/export/starexec/sandbox/tmp/tmp.tEw3g2P4Jf/E---3.1_29905.p',cls_conjecture_0) ).

cnf(cls_Nat_Odiff__is__0__eq_0,axiom,
    ( c_lessequals(X1,X2,tc_nat)
    | c_minus(X1,X2,tc_nat) != c_0 ),
    file('/export/starexec/sandbox/tmp/tmp.tEw3g2P4Jf/E---3.1_29905.p',cls_Nat_Odiff__is__0__eq_0) ).

cnf(cls_Nat_Odiff__self__eq__0_0,axiom,
    c_minus(X1,X1,tc_nat) = c_0,
    file('/export/starexec/sandbox/tmp/tmp.tEw3g2P4Jf/E---3.1_29905.p',cls_Nat_Odiff__self__eq__0_0) ).

cnf(cls_Nat_Ole__add1_0,axiom,
    c_lessequals(X1,c_plus(X1,X2,tc_nat),tc_nat),
    file('/export/starexec/sandbox/tmp/tmp.tEw3g2P4Jf/E---3.1_29905.p',cls_Nat_Ole__add1_0) ).

cnf(cls_Nat_Onot__add__less2_0,axiom,
    ~ c_less(c_plus(X1,X2,tc_nat),X2,tc_nat),
    file('/export/starexec/sandbox/tmp/tmp.tEw3g2P4Jf/E---3.1_29905.p',cls_Nat_Onot__add__less2_0) ).

cnf(cls_Nat_OlessI_0,axiom,
    c_less(X1,c_Suc(X1),tc_nat),
    file('/export/starexec/sandbox/tmp/tmp.tEw3g2P4Jf/E---3.1_29905.p',cls_Nat_OlessI_0) ).

cnf(cls_SetInterval_Ocard__atMost_0,axiom,
    c_Finite__Set_Ocard(c_SetInterval_OatMost(X1,tc_nat),tc_nat) = c_Suc(X1),
    file('/export/starexec/sandbox/tmp/tmp.tEw3g2P4Jf/E---3.1_29905.p',cls_SetInterval_Ocard__atMost_0) ).

cnf(cls_Binomial_Obinomial__1_0,axiom,
    c_Binomial_Obinomial(X1,c_Suc(c_0)) = X1,
    file('/export/starexec/sandbox/tmp/tmp.tEw3g2P4Jf/E---3.1_29905.p',cls_Binomial_Obinomial__1_0) ).

cnf(cls_Nat_OOne__nat__def_0,axiom,
    c_1 = c_Suc(c_0),
    file('/export/starexec/sandbox/tmp/tmp.tEw3g2P4Jf/E---3.1_29905.p',cls_Nat_OOne__nat__def_0) ).

cnf(cls_Binomial_Obinomial__Suc__Suc_0,axiom,
    c_Binomial_Obinomial(c_Suc(X1),c_Suc(X2)) = c_plus(c_Binomial_Obinomial(X1,X2),c_Binomial_Obinomial(X1,c_Suc(X2)),tc_nat),
    file('/export/starexec/sandbox/tmp/tmp.tEw3g2P4Jf/E---3.1_29905.p',cls_Binomial_Obinomial__Suc__Suc_0) ).

cnf(cls_Nat_Oless__Suc__eq__le_1,axiom,
    ( c_less(X1,c_Suc(X2),tc_nat)
    | ~ c_lessequals(X1,X2,tc_nat) ),
    file('/export/starexec/sandbox/tmp/tmp.tEw3g2P4Jf/E---3.1_29905.p',cls_Nat_Oless__Suc__eq__le_1) ).

cnf(cls_Binomial_Obinomial__n__0_0,axiom,
    c_Binomial_Obinomial(X1,c_0) = c_1,
    file('/export/starexec/sandbox/tmp/tmp.tEw3g2P4Jf/E---3.1_29905.p',cls_Binomial_Obinomial__n__0_0) ).

cnf(cls_Nat_Onat__add__left__cancel__le_0,axiom,
    ( c_lessequals(X2,X3,tc_nat)
    | ~ c_lessequals(c_plus(X1,X2,tc_nat),c_plus(X1,X3,tc_nat),tc_nat) ),
    file('/export/starexec/sandbox/tmp/tmp.tEw3g2P4Jf/E---3.1_29905.p',cls_Nat_Onat__add__left__cancel__le_0) ).

cnf(c_0_14,axiom,
    ( ~ c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(X2),tc_Message_Omsg)
    | ~ c_lessequals(v_sko__urX(X2),X1,tc_nat) ),
    cls_Public_ONonce__supply__lemma_0 ).

cnf(c_0_15,negated_conjecture,
    ( X1 = X2
    | X3 = X2
    | X1 = X3
    | c_in(c_Message_Omsg_ONonce(X2),c_Event_Oused(v_evs_H_H),tc_Message_Omsg)
    | c_in(c_Message_Omsg_ONonce(X3),c_Event_Oused(v_evs_H),tc_Message_Omsg)
    | c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_evs),tc_Message_Omsg) ),
    cls_conjecture_0 ).

cnf(c_0_16,axiom,
    ( c_lessequals(X1,X2,tc_nat)
    | c_minus(X1,X2,tc_nat) != c_0 ),
    cls_Nat_Odiff__is__0__eq_0 ).

cnf(c_0_17,axiom,
    c_minus(X1,X1,tc_nat) = c_0,
    cls_Nat_Odiff__self__eq__0_0 ).

cnf(c_0_18,negated_conjecture,
    ( X1 = X2
    | X1 = X3
    | X2 = X3
    | c_in(c_Message_Omsg_ONonce(X2),c_Event_Oused(v_evs_H_H),tc_Message_Omsg)
    | c_in(c_Message_Omsg_ONonce(X3),c_Event_Oused(v_evs_H),tc_Message_Omsg)
    | ~ c_lessequals(v_sko__urX(v_evs),X1,tc_nat) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_19,plain,
    c_lessequals(X1,X1,tc_nat),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_20,negated_conjecture,
    ( v_sko__urX(v_evs) = X1
    | v_sko__urX(v_evs) = X2
    | X2 = X1
    | c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_evs_H),tc_Message_Omsg)
    | c_in(c_Message_Omsg_ONonce(X2),c_Event_Oused(v_evs_H_H),tc_Message_Omsg) ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_21,negated_conjecture,
    ( v_sko__urX(v_evs) = X1
    | v_sko__urX(v_evs) = X2
    | X1 = X2
    | c_in(c_Message_Omsg_ONonce(X2),c_Event_Oused(v_evs_H),tc_Message_Omsg)
    | ~ c_lessequals(v_sko__urX(v_evs_H_H),X1,tc_nat) ),
    inference(spm,[status(thm)],[c_0_14,c_0_20]) ).

cnf(c_0_22,negated_conjecture,
    ( v_sko__urX(v_evs) = v_sko__urX(v_evs_H_H)
    | v_sko__urX(v_evs_H_H) = X1
    | v_sko__urX(v_evs) = X1
    | c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_evs_H),tc_Message_Omsg) ),
    inference(spm,[status(thm)],[c_0_21,c_0_19]) ).

cnf(c_0_23,negated_conjecture,
    ( v_sko__urX(v_evs) = v_sko__urX(v_evs_H_H)
    | v_sko__urX(v_evs) = X1
    | v_sko__urX(v_evs_H_H) = X1
    | ~ c_lessequals(v_sko__urX(v_evs_H),X1,tc_nat) ),
    inference(spm,[status(thm)],[c_0_14,c_0_22]) ).

cnf(c_0_24,axiom,
    c_lessequals(X1,c_plus(X1,X2,tc_nat),tc_nat),
    cls_Nat_Ole__add1_0 ).

cnf(c_0_25,axiom,
    ~ c_less(c_plus(X1,X2,tc_nat),X2,tc_nat),
    cls_Nat_Onot__add__less2_0 ).

cnf(c_0_26,negated_conjecture,
    ( c_plus(v_sko__urX(v_evs_H),X1,tc_nat) = v_sko__urX(v_evs_H_H)
    | c_plus(v_sko__urX(v_evs_H),X1,tc_nat) = v_sko__urX(v_evs)
    | v_sko__urX(v_evs) = v_sko__urX(v_evs_H_H) ),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_27,axiom,
    c_less(X1,c_Suc(X1),tc_nat),
    cls_Nat_OlessI_0 ).

cnf(c_0_28,axiom,
    c_Finite__Set_Ocard(c_SetInterval_OatMost(X1,tc_nat),tc_nat) = c_Suc(X1),
    cls_SetInterval_Ocard__atMost_0 ).

cnf(c_0_29,negated_conjecture,
    ( c_plus(v_sko__urX(v_evs_H),X1,tc_nat) = v_sko__urX(v_evs_H_H)
    | v_sko__urX(v_evs) = v_sko__urX(v_evs_H_H)
    | ~ c_less(v_sko__urX(v_evs),X1,tc_nat) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_30,plain,
    c_less(X1,c_Finite__Set_Ocard(c_SetInterval_OatMost(X1,tc_nat),tc_nat),tc_nat),
    inference(rw,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_31,negated_conjecture,
    ( c_plus(v_sko__urX(v_evs_H),c_Finite__Set_Ocard(c_SetInterval_OatMost(v_sko__urX(v_evs),tc_nat),tc_nat),tc_nat) = v_sko__urX(v_evs_H_H)
    | v_sko__urX(v_evs) = v_sko__urX(v_evs_H_H) ),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_32,negated_conjecture,
    ( v_sko__urX(v_evs) = X1
    | v_sko__urX(v_evs) = X2
    | X1 = X2
    | c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_evs_H_H),tc_Message_Omsg)
    | ~ c_lessequals(v_sko__urX(v_evs_H),X2,tc_nat) ),
    inference(spm,[status(thm)],[c_0_14,c_0_20]) ).

cnf(c_0_33,negated_conjecture,
    ( v_sko__urX(v_evs) = v_sko__urX(v_evs_H_H)
    | c_lessequals(v_sko__urX(v_evs_H),v_sko__urX(v_evs_H_H),tc_nat) ),
    inference(spm,[status(thm)],[c_0_24,c_0_31]) ).

cnf(c_0_34,negated_conjecture,
    ( v_sko__urX(v_evs) = v_sko__urX(v_evs_H_H)
    | X1 = v_sko__urX(v_evs_H_H)
    | v_sko__urX(v_evs) = X1
    | c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_evs_H_H),tc_Message_Omsg) ),
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

cnf(c_0_35,axiom,
    c_Binomial_Obinomial(X1,c_Suc(c_0)) = X1,
    cls_Binomial_Obinomial__1_0 ).

cnf(c_0_36,axiom,
    c_1 = c_Suc(c_0),
    cls_Nat_OOne__nat__def_0 ).

cnf(c_0_37,negated_conjecture,
    ( v_sko__urX(v_evs) = v_sko__urX(v_evs_H_H)
    | v_sko__urX(v_evs) = X1
    | X1 = v_sko__urX(v_evs_H_H)
    | ~ c_lessequals(v_sko__urX(v_evs_H_H),X1,tc_nat) ),
    inference(spm,[status(thm)],[c_0_14,c_0_34]) ).

cnf(c_0_38,axiom,
    c_Binomial_Obinomial(c_Suc(X1),c_Suc(X2)) = c_plus(c_Binomial_Obinomial(X1,X2),c_Binomial_Obinomial(X1,c_Suc(X2)),tc_nat),
    cls_Binomial_Obinomial__Suc__Suc_0 ).

cnf(c_0_39,plain,
    c_Binomial_Obinomial(X1,c_Finite__Set_Ocard(c_SetInterval_OatMost(c_0,tc_nat),tc_nat)) = X1,
    inference(rw,[status(thm)],[c_0_35,c_0_28]) ).

cnf(c_0_40,plain,
    c_1 = c_Finite__Set_Ocard(c_SetInterval_OatMost(c_0,tc_nat),tc_nat),
    inference(rw,[status(thm)],[c_0_36,c_0_28]) ).

cnf(c_0_41,negated_conjecture,
    ( c_plus(v_sko__urX(v_evs_H_H),X1,tc_nat) = v_sko__urX(v_evs_H_H)
    | c_plus(v_sko__urX(v_evs_H_H),X1,tc_nat) = v_sko__urX(v_evs)
    | v_sko__urX(v_evs) = v_sko__urX(v_evs_H_H) ),
    inference(spm,[status(thm)],[c_0_37,c_0_24]) ).

cnf(c_0_42,axiom,
    ( c_less(X1,c_Suc(X2),tc_nat)
    | ~ c_lessequals(X1,X2,tc_nat) ),
    cls_Nat_Oless__Suc__eq__le_1 ).

cnf(c_0_43,plain,
    c_Binomial_Obinomial(c_Finite__Set_Ocard(c_SetInterval_OatMost(X1,tc_nat),tc_nat),c_Finite__Set_Ocard(c_SetInterval_OatMost(X2,tc_nat),tc_nat)) = c_plus(c_Binomial_Obinomial(X1,X2),c_Binomial_Obinomial(X1,c_Finite__Set_Ocard(c_SetInterval_OatMost(X2,tc_nat),tc_nat)),tc_nat),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_28]),c_0_28]),c_0_28]) ).

cnf(c_0_44,axiom,
    c_Binomial_Obinomial(X1,c_0) = c_1,
    cls_Binomial_Obinomial__n__0_0 ).

cnf(c_0_45,plain,
    c_Binomial_Obinomial(X1,c_1) = X1,
    inference(rw,[status(thm)],[c_0_39,c_0_40]) ).

cnf(c_0_46,negated_conjecture,
    ( c_plus(v_sko__urX(v_evs_H_H),X1,tc_nat) = v_sko__urX(v_evs_H_H)
    | v_sko__urX(v_evs) = v_sko__urX(v_evs_H_H)
    | ~ c_less(v_sko__urX(v_evs),X1,tc_nat) ),
    inference(spm,[status(thm)],[c_0_25,c_0_41]) ).

cnf(c_0_47,plain,
    ( c_less(X1,c_Finite__Set_Ocard(c_SetInterval_OatMost(X2,tc_nat),tc_nat),tc_nat)
    | ~ c_lessequals(X1,X2,tc_nat) ),
    inference(rw,[status(thm)],[c_0_42,c_0_28]) ).

cnf(c_0_48,axiom,
    ( c_lessequals(X2,X3,tc_nat)
    | ~ c_lessequals(c_plus(X1,X2,tc_nat),c_plus(X1,X3,tc_nat),tc_nat) ),
    cls_Nat_Onat__add__left__cancel__le_0 ).

cnf(c_0_49,plain,
    c_plus(c_1,X1,tc_nat) = c_Finite__Set_Ocard(c_SetInterval_OatMost(X1,tc_nat),tc_nat),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_40]),c_0_44]),c_0_45]),c_0_45]) ).

cnf(c_0_50,negated_conjecture,
    ( c_plus(v_sko__urX(v_evs_H_H),c_Finite__Set_Ocard(c_SetInterval_OatMost(v_sko__urX(v_evs),tc_nat),tc_nat),tc_nat) = v_sko__urX(v_evs_H_H)
    | v_sko__urX(v_evs) = v_sko__urX(v_evs_H_H) ),
    inference(spm,[status(thm)],[c_0_46,c_0_30]) ).

cnf(c_0_51,negated_conjecture,
    ( v_sko__urX(v_evs) = v_sko__urX(v_evs_H)
    | X1 = v_sko__urX(v_evs_H)
    | v_sko__urX(v_evs) = X1
    | c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_evs_H_H),tc_Message_Omsg) ),
    inference(spm,[status(thm)],[c_0_32,c_0_19]) ).

cnf(c_0_52,plain,
    ~ c_lessequals(c_plus(X1,c_Finite__Set_Ocard(c_SetInterval_OatMost(X2,tc_nat),tc_nat),tc_nat),X2,tc_nat),
    inference(spm,[status(thm)],[c_0_25,c_0_47]) ).

cnf(c_0_53,plain,
    ( c_lessequals(X1,X2,tc_nat)
    | ~ c_lessequals(c_Finite__Set_Ocard(c_SetInterval_OatMost(X1,tc_nat),tc_nat),c_Finite__Set_Ocard(c_SetInterval_OatMost(X2,tc_nat),tc_nat),tc_nat) ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_49]) ).

cnf(c_0_54,negated_conjecture,
    ( v_sko__urX(v_evs) = v_sko__urX(v_evs_H_H)
    | c_lessequals(c_Finite__Set_Ocard(c_SetInterval_OatMost(v_sko__urX(v_evs),tc_nat),tc_nat),X1,tc_nat) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_50]),c_0_24])]) ).

cnf(c_0_55,negated_conjecture,
    ( v_sko__urX(v_evs) = v_sko__urX(v_evs_H)
    | v_sko__urX(v_evs) = X1
    | X1 = v_sko__urX(v_evs_H)
    | ~ c_lessequals(v_sko__urX(v_evs_H_H),X1,tc_nat) ),
    inference(spm,[status(thm)],[c_0_14,c_0_51]) ).

cnf(c_0_56,negated_conjecture,
    ( c_plus(v_sko__urX(v_evs_H),c_Finite__Set_Ocard(c_SetInterval_OatMost(X1,tc_nat),tc_nat),tc_nat) = v_sko__urX(v_evs_H_H)
    | v_sko__urX(v_evs) = v_sko__urX(v_evs_H_H)
    | ~ c_lessequals(v_sko__urX(v_evs),X1,tc_nat) ),
    inference(spm,[status(thm)],[c_0_52,c_0_26]) ).

cnf(c_0_57,negated_conjecture,
    ( v_sko__urX(v_evs) = v_sko__urX(v_evs_H_H)
    | c_lessequals(v_sko__urX(v_evs),X1,tc_nat) ),
    inference(spm,[status(thm)],[c_0_53,c_0_54]) ).

cnf(c_0_58,negated_conjecture,
    ( c_plus(v_sko__urX(v_evs_H_H),X1,tc_nat) = v_sko__urX(v_evs_H)
    | c_plus(v_sko__urX(v_evs_H_H),X1,tc_nat) = v_sko__urX(v_evs)
    | v_sko__urX(v_evs) = v_sko__urX(v_evs_H) ),
    inference(spm,[status(thm)],[c_0_55,c_0_24]) ).

cnf(c_0_59,negated_conjecture,
    ( c_plus(v_sko__urX(v_evs_H),c_Finite__Set_Ocard(c_SetInterval_OatMost(X1,tc_nat),tc_nat),tc_nat) = v_sko__urX(v_evs_H_H)
    | v_sko__urX(v_evs) = v_sko__urX(v_evs_H_H) ),
    inference(spm,[status(thm)],[c_0_56,c_0_57]) ).

cnf(c_0_60,negated_conjecture,
    ( c_plus(v_sko__urX(v_evs_H_H),X1,tc_nat) = v_sko__urX(v_evs_H)
    | v_sko__urX(v_evs) = v_sko__urX(v_evs_H)
    | ~ c_less(v_sko__urX(v_evs),X1,tc_nat) ),
    inference(spm,[status(thm)],[c_0_25,c_0_58]) ).

cnf(c_0_61,negated_conjecture,
    ( c_plus(v_sko__urX(v_evs_H),X1,tc_nat) = v_sko__urX(v_evs_H_H)
    | v_sko__urX(v_evs) = v_sko__urX(v_evs_H_H)
    | c_lessequals(v_sko__urX(v_evs_H),v_sko__urX(v_evs),tc_nat) ),
    inference(spm,[status(thm)],[c_0_24,c_0_26]) ).

cnf(c_0_62,negated_conjecture,
    ( v_sko__urX(v_evs) = v_sko__urX(v_evs_H_H)
    | ~ c_lessequals(v_sko__urX(v_evs_H_H),X1,tc_nat) ),
    inference(spm,[status(thm)],[c_0_52,c_0_59]) ).

cnf(c_0_63,negated_conjecture,
    ( c_plus(v_sko__urX(v_evs_H_H),c_Finite__Set_Ocard(c_SetInterval_OatMost(v_sko__urX(v_evs),tc_nat),tc_nat),tc_nat) = v_sko__urX(v_evs_H)
    | v_sko__urX(v_evs) = v_sko__urX(v_evs_H) ),
    inference(spm,[status(thm)],[c_0_60,c_0_30]) ).

cnf(c_0_64,negated_conjecture,
    ( v_sko__urX(v_evs) = v_sko__urX(v_evs_H_H)
    | c_lessequals(v_sko__urX(v_evs_H),v_sko__urX(v_evs),tc_nat)
    | ~ c_lessequals(v_sko__urX(v_evs_H_H),X1,tc_nat) ),
    inference(spm,[status(thm)],[c_0_52,c_0_61]) ).

cnf(c_0_65,negated_conjecture,
    v_sko__urX(v_evs) = v_sko__urX(v_evs_H_H),
    inference(spm,[status(thm)],[c_0_62,c_0_24]) ).

cnf(c_0_66,negated_conjecture,
    ( v_sko__urX(v_evs) = v_sko__urX(v_evs_H)
    | ~ c_lessequals(v_sko__urX(v_evs_H),v_sko__urX(v_evs),tc_nat) ),
    inference(spm,[status(thm)],[c_0_52,c_0_63]) ).

cnf(c_0_67,negated_conjecture,
    ( v_sko__urX(v_evs) = v_sko__urX(v_evs_H_H)
    | c_lessequals(v_sko__urX(v_evs_H),v_sko__urX(v_evs),tc_nat) ),
    inference(spm,[status(thm)],[c_0_64,c_0_24]) ).

cnf(c_0_68,negated_conjecture,
    ( c_plus(v_sko__urX(v_evs_H_H),X1,tc_nat) = v_sko__urX(v_evs_H_H)
    | c_plus(v_sko__urX(v_evs_H_H),X1,tc_nat) = v_sko__urX(v_evs_H)
    | v_sko__urX(v_evs_H_H) = v_sko__urX(v_evs_H) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_65]),c_0_65]) ).

cnf(c_0_69,negated_conjecture,
    ( v_sko__urX(v_evs) = v_sko__urX(v_evs_H_H)
    | v_sko__urX(v_evs) = v_sko__urX(v_evs_H) ),
    inference(spm,[status(thm)],[c_0_66,c_0_67]) ).

cnf(c_0_70,negated_conjecture,
    ( c_plus(v_sko__urX(v_evs_H_H),X1,tc_nat) = v_sko__urX(v_evs_H)
    | v_sko__urX(v_evs_H_H) = v_sko__urX(v_evs_H)
    | c_lessequals(X1,X2,tc_nat) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_68]),c_0_24])]) ).

cnf(c_0_71,negated_conjecture,
    ( v_sko__urX(v_evs) = v_sko__urX(v_evs_H)
    | v_sko__urX(v_evs_H_H) != v_sko__urX(v_evs_H) ),
    inference(ef,[status(thm)],[c_0_69]) ).

cnf(c_0_72,negated_conjecture,
    ( v_sko__urX(v_evs_H_H) = v_sko__urX(v_evs_H)
    | c_lessequals(X1,X2,tc_nat)
    | ~ c_less(v_sko__urX(v_evs_H),X1,tc_nat) ),
    inference(spm,[status(thm)],[c_0_25,c_0_70]) ).

cnf(c_0_73,negated_conjecture,
    ( v_sko__urX(v_evs) = v_sko__urX(v_evs_H)
    | ~ c_lessequals(v_sko__urX(v_evs_H),v_sko__urX(v_evs_H_H),tc_nat) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_69]),c_0_71]) ).

cnf(c_0_74,negated_conjecture,
    ( v_sko__urX(v_evs_H_H) = v_sko__urX(v_evs_H)
    | c_lessequals(c_Finite__Set_Ocard(c_SetInterval_OatMost(v_sko__urX(v_evs_H),tc_nat),tc_nat),X1,tc_nat) ),
    inference(spm,[status(thm)],[c_0_72,c_0_30]) ).

cnf(c_0_75,negated_conjecture,
    ( X1 = X2
    | X1 = X3
    | X2 = X3
    | c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_evs),tc_Message_Omsg)
    | c_in(c_Message_Omsg_ONonce(X2),c_Event_Oused(v_evs_H_H),tc_Message_Omsg)
    | ~ c_lessequals(v_sko__urX(v_evs_H),X3,tc_nat) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_76,negated_conjecture,
    ( v_sko__urX(v_evs_H_H) = v_sko__urX(v_evs_H)
    | ~ c_lessequals(v_sko__urX(v_evs_H),v_sko__urX(v_evs_H_H),tc_nat) ),
    inference(rw,[status(thm)],[c_0_73,c_0_65]) ).

cnf(c_0_77,negated_conjecture,
    ( v_sko__urX(v_evs_H_H) = v_sko__urX(v_evs_H)
    | c_lessequals(v_sko__urX(v_evs_H),X1,tc_nat) ),
    inference(spm,[status(thm)],[c_0_53,c_0_74]) ).

cnf(c_0_78,negated_conjecture,
    ( X1 = v_sko__urX(v_evs_H)
    | X2 = v_sko__urX(v_evs_H)
    | X2 = X1
    | c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_evs_H_H),tc_Message_Omsg)
    | c_in(c_Message_Omsg_ONonce(X2),c_Event_Oused(v_evs),tc_Message_Omsg) ),
    inference(spm,[status(thm)],[c_0_75,c_0_19]) ).

cnf(c_0_79,negated_conjecture,
    v_sko__urX(v_evs_H_H) = v_sko__urX(v_evs_H),
    inference(spm,[status(thm)],[c_0_76,c_0_77]) ).

cnf(c_0_80,negated_conjecture,
    ( X1 = v_sko__urX(v_evs_H)
    | X2 = v_sko__urX(v_evs_H)
    | X1 = X2
    | c_in(c_Message_Omsg_ONonce(X2),c_Event_Oused(v_evs_H_H),tc_Message_Omsg)
    | ~ c_lessequals(v_sko__urX(v_evs_H),X1,tc_nat) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_78]),c_0_65]),c_0_79]) ).

cnf(c_0_81,negated_conjecture,
    ( c_plus(v_sko__urX(v_evs_H),X1,tc_nat) = v_sko__urX(v_evs_H)
    | c_plus(v_sko__urX(v_evs_H),X1,tc_nat) = X2
    | X2 = v_sko__urX(v_evs_H)
    | c_in(c_Message_Omsg_ONonce(X2),c_Event_Oused(v_evs_H_H),tc_Message_Omsg) ),
    inference(spm,[status(thm)],[c_0_80,c_0_24]) ).

cnf(c_0_82,negated_conjecture,
    ( c_plus(v_sko__urX(v_evs_H),X1,tc_nat) = v_sko__urX(v_evs_H)
    | X2 = v_sko__urX(v_evs_H)
    | c_in(c_Message_Omsg_ONonce(X2),c_Event_Oused(v_evs_H_H),tc_Message_Omsg)
    | ~ c_less(X2,X1,tc_nat) ),
    inference(spm,[status(thm)],[c_0_25,c_0_81]) ).

cnf(c_0_83,negated_conjecture,
    ( c_plus(v_sko__urX(v_evs_H),c_Finite__Set_Ocard(c_SetInterval_OatMost(X1,tc_nat),tc_nat),tc_nat) = v_sko__urX(v_evs_H)
    | X1 = v_sko__urX(v_evs_H)
    | c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_evs_H_H),tc_Message_Omsg) ),
    inference(spm,[status(thm)],[c_0_82,c_0_30]) ).

cnf(c_0_84,negated_conjecture,
    ( X1 = v_sko__urX(v_evs_H)
    | c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_evs_H_H),tc_Message_Omsg)
    | ~ c_lessequals(v_sko__urX(v_evs_H),X1,tc_nat) ),
    inference(spm,[status(thm)],[c_0_52,c_0_83]) ).

cnf(c_0_85,negated_conjecture,
    ( c_plus(v_sko__urX(v_evs_H),X1,tc_nat) = v_sko__urX(v_evs_H)
    | c_in(c_Message_Omsg_ONonce(c_plus(v_sko__urX(v_evs_H),X1,tc_nat)),c_Event_Oused(v_evs_H_H),tc_Message_Omsg) ),
    inference(spm,[status(thm)],[c_0_84,c_0_24]) ).

cnf(c_0_86,negated_conjecture,
    c_plus(v_sko__urX(v_evs_H),X1,tc_nat) = v_sko__urX(v_evs_H),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_85]),c_0_79]),c_0_24])]) ).

cnf(c_0_87,negated_conjecture,
    c_lessequals(X1,X2,tc_nat),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_86]),c_0_24])]) ).

cnf(c_0_88,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_87])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SWV282-2 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13  % Command    : run_E %s %d THM
% 0.17/0.34  % Computer : n025.cluster.edu
% 0.17/0.34  % Model    : x86_64 x86_64
% 0.17/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34  % Memory   : 8042.1875MB
% 0.17/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34  % CPULimit   : 2400
% 0.17/0.34  % WCLimit    : 300
% 0.17/0.34  % DateTime   : Tue Oct  3 04:11:21 EDT 2023
% 0.17/0.35  % CPUTime    : 
% 0.20/0.47  Running first-order theorem proving
% 0.20/0.47  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.tEw3g2P4Jf/E---3.1_29905.p
% 0.20/0.66  # Version: 3.1pre001
% 0.20/0.66  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.66  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.66  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.66  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.66  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.66  # Starting sh5l with 300s (1) cores
% 0.20/0.66  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 29983 completed with status 0
% 0.20/0.66  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.66  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.66  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.66  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.66  # No SInE strategy applied
% 0.20/0.66  # Search class: FGHSM-FFSF31-MFFFFFNN
% 0.20/0.66  # partial match(1): FGHSM-FFMF31-MFFFFFNN
% 0.20/0.66  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.66  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 811s (1) cores
% 0.20/0.66  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.66  # Starting new_bool_3 with 136s (1) cores
% 0.20/0.66  # Starting new_bool_1 with 136s (1) cores
% 0.20/0.66  # Starting sh5l with 136s (1) cores
% 0.20/0.66  # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with pid 29989 completed with status 0
% 0.20/0.66  # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN
% 0.20/0.66  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.66  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.66  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.66  # No SInE strategy applied
% 0.20/0.66  # Search class: FGHSM-FFSF31-MFFFFFNN
% 0.20/0.66  # partial match(1): FGHSM-FFMF31-MFFFFFNN
% 0.20/0.66  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.66  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 811s (1) cores
% 0.20/0.66  # Preprocessing time       : 0.001 s
% 0.20/0.66  # Presaturation interreduction done
% 0.20/0.66  
% 0.20/0.66  # Proof found!
% 0.20/0.66  # SZS status Unsatisfiable
% 0.20/0.66  # SZS output start CNFRefutation
% See solution above
% 0.20/0.66  # Parsed axioms                        : 14
% 0.20/0.66  # Removed by relevancy pruning/SinE    : 0
% 0.20/0.66  # Initial clauses                      : 14
% 0.20/0.66  # Removed in clause preprocessing      : 1
% 0.20/0.66  # Initial clauses in saturation        : 13
% 0.20/0.66  # Processed clauses                    : 304
% 0.20/0.66  # ...of these trivial                  : 1
% 0.20/0.66  # ...subsumed                          : 131
% 0.20/0.66  # ...remaining for further processing  : 172
% 0.20/0.66  # Other redundant clauses eliminated   : 40
% 0.20/0.66  # Clauses deleted for lack of memory   : 0
% 0.20/0.66  # Backward-subsumed                    : 14
% 0.20/0.66  # Backward-rewritten                   : 114
% 0.20/0.66  # Generated clauses                    : 5903
% 0.20/0.66  # ...of the previous two non-redundant : 5621
% 0.20/0.66  # ...aggressively subsumed             : 0
% 0.20/0.66  # Contextual simplify-reflections      : 2
% 0.20/0.66  # Paramodulations                      : 5600
% 0.20/0.66  # Factorizations                       : 263
% 0.20/0.66  # NegExts                              : 0
% 0.20/0.66  # Equation resolutions                 : 40
% 0.20/0.66  # Total rewrite steps                  : 598
% 0.20/0.66  # Propositional unsat checks           : 0
% 0.20/0.66  #    Propositional check models        : 0
% 0.20/0.66  #    Propositional check unsatisfiable : 0
% 0.20/0.66  #    Propositional clauses             : 0
% 0.20/0.66  #    Propositional clauses after purity: 0
% 0.20/0.66  #    Propositional unsat core size     : 0
% 0.20/0.66  #    Propositional preprocessing time  : 0.000
% 0.20/0.66  #    Propositional encoding time       : 0.000
% 0.20/0.66  #    Propositional solver time         : 0.000
% 0.20/0.66  #    Success case prop preproc time    : 0.000
% 0.20/0.66  #    Success case prop encoding time   : 0.000
% 0.20/0.66  #    Success case prop solver time     : 0.000
% 0.20/0.66  # Current number of processed clauses  : 31
% 0.20/0.66  #    Positive orientable unit clauses  : 13
% 0.20/0.66  #    Positive unorientable unit clauses: 0
% 0.20/0.66  #    Negative unit clauses             : 5
% 0.20/0.66  #    Non-unit-clauses                  : 13
% 0.20/0.66  # Current number of unprocessed clauses: 5213
% 0.20/0.66  # ...number of literals in the above   : 42521
% 0.20/0.66  # Current number of archived formulas  : 0
% 0.20/0.66  # Current number of archived clauses   : 142
% 0.20/0.66  # Clause-clause subsumption calls (NU) : 2569
% 0.20/0.66  # Rec. Clause-clause subsumption calls : 666
% 0.20/0.66  # Non-unit clause-clause subsumptions  : 135
% 0.20/0.66  # Unit Clause-clause subsumption calls : 78
% 0.20/0.66  # Rewrite failures with RHS unbound    : 0
% 0.20/0.66  # BW rewrite match attempts            : 41
% 0.20/0.66  # BW rewrite match successes           : 36
% 0.20/0.66  # Condensation attempts                : 0
% 0.20/0.66  # Condensation successes               : 0
% 0.20/0.66  # Termbank termtop insertions          : 156678
% 0.20/0.66  
% 0.20/0.66  # -------------------------------------------------
% 0.20/0.66  # User time                : 0.172 s
% 0.20/0.66  # System time              : 0.009 s
% 0.20/0.66  # Total time               : 0.180 s
% 0.20/0.66  # Maximum resident set size: 1724 pages
% 0.20/0.66  
% 0.20/0.66  # -------------------------------------------------
% 0.20/0.66  # User time                : 0.850 s
% 0.20/0.66  # System time              : 0.023 s
% 0.20/0.66  # Total time               : 0.873 s
% 0.20/0.66  # Maximum resident set size: 1684 pages
% 0.20/0.66  % E---3.1 exiting
% 0.20/0.66  % E---3.1 exiting
%------------------------------------------------------------------------------