%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV282-2 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n009.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 02:54:13 PM UTC 2026
% Result : Unsatisfiable 0.52s 0.49s
% Output : CNFRefutation 0.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 32
% Number of leaves : 13
% Syntax : Number of clauses : 78 ( 27 unt; 36 nHn; 37 RR)
% Number of literals : 178 ( 96 equ; 35 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 7 con; 0-3 aty)
% Number of variables : 111 ( 25 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Public_ONonce__supply__lemma_0,axiom,
( ~ c_lessequals(v_sko__urX(X2),X1,tc_nat)
| ~ c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(X2),tc_Message_Omsg) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Public_ONonce__supply__lemma_0) ).
cnf(cls_Nat_Odiff__is__0__eq_0,axiom,
( c_minus(X1,X2,tc_nat) != c_0
| c_lessequals(X1,X2,tc_nat) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Nat_Odiff__is__0__eq_0) ).
cnf(cls_conjecture_0,negated_conjecture,
( c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_evs),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(X2),c_Event_Oused(v_evs_H_H),tc_Message_Omsg)
| X1 = X3
| X3 = X2
| X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_Nat_Odiff__self__eq__0_0,axiom,
c_minus(X1,X1,tc_nat) = c_0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Nat_Odiff__self__eq__0_0) ).
cnf(cls_Nat_Onot__add__less2_0,axiom,
~ c_less(c_plus(X1,X2,tc_nat),X2,tc_nat),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Nat_Onot__add__less2_0) ).
cnf(cls_Nat_Ole__add1_0,axiom,
c_lessequals(X1,c_plus(X1,X2,tc_nat),tc_nat),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Nat_Ole__add1_0) ).
cnf(cls_Nat_Oless__Suc__eq__le_1,axiom,
( ~ c_lessequals(X1,X2,tc_nat)
| c_less(X1,c_Suc(X2),tc_nat) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Nat_Oless__Suc__eq__le_1) ).
cnf(cls_Nat_OlessI_0,axiom,
c_less(X1,c_Suc(X1),tc_nat),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Nat_OlessI_0) ).
cnf(cls_Binomial_Obinomial__1_0,axiom,
c_Binomial_Obinomial(X1,c_Suc(c_0)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Binomial_Obinomial__1_0) ).
cnf(cls_Nat_OOne__nat__def_0,axiom,
c_1 = c_Suc(c_0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Nat_OOne__nat__def_0) ).
cnf(cls_Nat_Onat__add__left__cancel__le_0,axiom,
( ~ c_lessequals(c_plus(X1,X2,tc_nat),c_plus(X1,X3,tc_nat),tc_nat)
| c_lessequals(X2,X3,tc_nat) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Nat_Onat__add__left__cancel__le_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/sandbox2/benchmark/theBenchmark.p',cls_Binomial_Obinomial__Suc__Suc_0) ).
cnf(cls_Binomial_Obinomial__n__0_0,axiom,
c_Binomial_Obinomial(X1,c_0) = c_1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Binomial_Obinomial__n__0_0) ).
cnf(c_0_13,plain,
( ~ c_lessequals(v_sko__urX(X2),X1,tc_nat)
| ~ c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(X2),tc_Message_Omsg) ),
inference(fof_simplification,[status(thm)],[cls_Public_ONonce__supply__lemma_0]) ).
cnf(c_0_14,plain,
( c_minus(X1,X2,tc_nat) != c_0
| c_lessequals(X1,X2,tc_nat) ),
inference(fof_simplification,[status(thm)],[cls_Nat_Odiff__is__0__eq_0]) ).
cnf(c_0_15,plain,
( ~ c_lessequals(v_sko__urX(X2),X1,tc_nat)
| ~ c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(X2),tc_Message_Omsg) ),
c_0_13 ).
cnf(c_0_16,negated_conjecture,
( c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_evs),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(X2),c_Event_Oused(v_evs_H_H),tc_Message_Omsg)
| X1 = X3
| X3 = X2
| X1 = X2 ),
cls_conjecture_0 ).
cnf(c_0_17,plain,
( c_minus(X1,X2,tc_nat) != c_0
| c_lessequals(X1,X2,tc_nat) ),
c_0_14 ).
cnf(c_0_18,axiom,
c_minus(X1,X1,tc_nat) = c_0,
cls_Nat_Odiff__self__eq__0_0 ).
cnf(c_0_19,negated_conjecture,
( ~ c_lessequals(v_sko__urX(v_evs_H),X2,tc_nat)
| c_in(c_Message_Omsg_ONonce(X3),c_Event_Oused(v_evs),tc_Message_Omsg)
| c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_evs_H_H),tc_Message_Omsg)
| X3 = X1
| X3 = X2
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
c_lessequals(X1,X1,tc_nat),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
( c_in(c_Message_Omsg_ONonce(X2),c_Event_Oused(v_evs_H_H),tc_Message_Omsg)
| c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_evs),tc_Message_Omsg)
| X1 = X2
| X2 = v_sko__urX(v_evs_H)
| X1 = v_sko__urX(v_evs_H) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,negated_conjecture,
( ~ c_lessequals(v_sko__urX(v_evs_H_H),X1,tc_nat)
| c_in(c_Message_Omsg_ONonce(X2),c_Event_Oused(v_evs),tc_Message_Omsg)
| X2 = X1
| X2 = v_sko__urX(v_evs_H)
| X1 = v_sko__urX(v_evs_H) ),
inference(spm,[status(thm)],[c_0_15,c_0_21]) ).
cnf(c_0_23,negated_conjecture,
( c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_evs),tc_Message_Omsg)
| X1 = v_sko__urX(v_evs_H)
| X1 = v_sko__urX(v_evs_H_H)
| v_sko__urX(v_evs_H_H) = v_sko__urX(v_evs_H) ),
inference(spm,[status(thm)],[c_0_22,c_0_20]) ).
cnf(c_0_24,plain,
~ c_less(c_plus(X1,X2,tc_nat),X2,tc_nat),
inference(fof_simplification,[status(thm)],[cls_Nat_Onot__add__less2_0]) ).
cnf(c_0_25,negated_conjecture,
( ~ c_lessequals(v_sko__urX(v_evs),X1,tc_nat)
| X1 = v_sko__urX(v_evs_H_H)
| X1 = v_sko__urX(v_evs_H)
| v_sko__urX(v_evs_H_H) = v_sko__urX(v_evs_H) ),
inference(spm,[status(thm)],[c_0_15,c_0_23]) ).
cnf(c_0_26,axiom,
c_lessequals(X1,c_plus(X1,X2,tc_nat),tc_nat),
cls_Nat_Ole__add1_0 ).
cnf(c_0_27,plain,
( ~ c_lessequals(X1,X2,tc_nat)
| c_less(X1,c_Suc(X2),tc_nat) ),
inference(fof_simplification,[status(thm)],[cls_Nat_Oless__Suc__eq__le_1]) ).
cnf(c_0_28,plain,
~ c_less(c_plus(X1,X2,tc_nat),X2,tc_nat),
c_0_24 ).
cnf(c_0_29,negated_conjecture,
( v_sko__urX(v_evs_H_H) = v_sko__urX(v_evs_H)
| c_plus(v_sko__urX(v_evs),X1,tc_nat) = v_sko__urX(v_evs_H)
| c_plus(v_sko__urX(v_evs),X1,tc_nat) = v_sko__urX(v_evs_H_H) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,plain,
( ~ c_lessequals(X1,X2,tc_nat)
| c_less(X1,c_Suc(X2),tc_nat) ),
c_0_27 ).
cnf(c_0_31,negated_conjecture,
( ~ c_less(v_sko__urX(v_evs_H_H),X1,tc_nat)
| v_sko__urX(v_evs_H_H) = v_sko__urX(v_evs_H)
| c_plus(v_sko__urX(v_evs),X1,tc_nat) = v_sko__urX(v_evs_H) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,axiom,
c_less(X1,c_Suc(X1),tc_nat),
cls_Nat_OlessI_0 ).
cnf(c_0_33,plain,
~ c_lessequals(c_plus(X1,c_Suc(X2),tc_nat),X2,tc_nat),
inference(spm,[status(thm)],[c_0_28,c_0_30]) ).
cnf(c_0_34,negated_conjecture,
( v_sko__urX(v_evs_H_H) = v_sko__urX(v_evs_H)
| c_plus(v_sko__urX(v_evs),c_Suc(v_sko__urX(v_evs_H_H)),tc_nat) = v_sko__urX(v_evs_H) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
( ~ c_lessequals(v_sko__urX(v_evs_H_H),X1,tc_nat)
| v_sko__urX(v_evs_H_H) = v_sko__urX(v_evs_H)
| c_plus(v_sko__urX(v_evs),c_Suc(X1),tc_nat) = v_sko__urX(v_evs_H) ),
inference(spm,[status(thm)],[c_0_33,c_0_29]) ).
cnf(c_0_36,negated_conjecture,
( c_lessequals(v_sko__urX(v_evs),v_sko__urX(v_evs_H),tc_nat)
| v_sko__urX(v_evs_H_H) = v_sko__urX(v_evs_H) ),
inference(spm,[status(thm)],[c_0_26,c_0_34]) ).
cnf(c_0_37,negated_conjecture,
( v_sko__urX(v_evs_H_H) = v_sko__urX(v_evs_H)
| v_sko__urX(v_evs) = v_sko__urX(v_evs_H)
| v_sko__urX(v_evs) = v_sko__urX(v_evs_H_H) ),
inference(spm,[status(thm)],[c_0_25,c_0_20]) ).
cnf(c_0_38,axiom,
c_Binomial_Obinomial(X1,c_Suc(c_0)) = X1,
cls_Binomial_Obinomial__1_0 ).
cnf(c_0_39,axiom,
c_1 = c_Suc(c_0),
cls_Nat_OOne__nat__def_0 ).
cnf(c_0_40,negated_conjecture,
( ~ c_lessequals(v_sko__urX(v_evs_H_H),X1,tc_nat)
| ~ c_lessequals(v_sko__urX(v_evs_H),X1,tc_nat)
| v_sko__urX(v_evs_H_H) = v_sko__urX(v_evs_H) ),
inference(spm,[status(thm)],[c_0_33,c_0_35]) ).
cnf(c_0_41,negated_conjecture,
( c_lessequals(v_sko__urX(v_evs_H_H),v_sko__urX(v_evs_H),tc_nat)
| v_sko__urX(v_evs_H_H) = v_sko__urX(v_evs_H)
| v_sko__urX(v_evs) = v_sko__urX(v_evs_H) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,plain,
( ~ c_lessequals(c_plus(X1,X2,tc_nat),c_plus(X1,X3,tc_nat),tc_nat)
| c_lessequals(X2,X3,tc_nat) ),
inference(fof_simplification,[status(thm)],[cls_Nat_Onat__add__left__cancel__le_0]) ).
cnf(c_0_43,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_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_38,c_0_39]) ).
cnf(c_0_46,negated_conjecture,
( v_sko__urX(v_evs_H_H) = v_sko__urX(v_evs_H)
| v_sko__urX(v_evs) = v_sko__urX(v_evs_H) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_20])]) ).
cnf(c_0_47,plain,
( ~ c_lessequals(c_plus(X1,X2,tc_nat),c_plus(X1,X3,tc_nat),tc_nat)
| c_lessequals(X2,X3,tc_nat) ),
c_0_42 ).
cnf(c_0_48,plain,
c_plus(c_1,X1,tc_nat) = c_Suc(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_39]),c_0_44]),c_0_45]),c_0_45]) ).
cnf(c_0_49,negated_conjecture,
( v_sko__urX(v_evs_H_H) = v_sko__urX(v_evs_H)
| c_plus(v_sko__urX(v_evs_H),c_Suc(v_sko__urX(v_evs_H_H)),tc_nat) = v_sko__urX(v_evs_H) ),
inference(spm,[status(thm)],[c_0_34,c_0_46]) ).
cnf(c_0_50,plain,
( ~ c_lessequals(c_Suc(X1),c_Suc(X2),tc_nat)
| c_lessequals(X1,X2,tc_nat) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_48]) ).
cnf(c_0_51,negated_conjecture,
( c_lessequals(c_Suc(v_sko__urX(v_evs_H_H)),X1,tc_nat)
| v_sko__urX(v_evs_H_H) = v_sko__urX(v_evs_H) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_49]),c_0_26])]) ).
cnf(c_0_52,negated_conjecture,
( c_lessequals(v_sko__urX(v_evs_H_H),X1,tc_nat)
| v_sko__urX(v_evs_H_H) = v_sko__urX(v_evs_H) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_53,negated_conjecture,
( ~ c_lessequals(v_sko__urX(v_evs),X2,tc_nat)
| c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_evs_H_H),tc_Message_Omsg)
| X2 = X1
| X2 = v_sko__urX(v_evs_H)
| X1 = v_sko__urX(v_evs_H) ),
inference(spm,[status(thm)],[c_0_15,c_0_21]) ).
cnf(c_0_54,negated_conjecture,
( ~ c_lessequals(v_sko__urX(v_evs_H),X1,tc_nat)
| v_sko__urX(v_evs_H_H) = v_sko__urX(v_evs_H) ),
inference(spm,[status(thm)],[c_0_40,c_0_52]) ).
cnf(c_0_55,negated_conjecture,
( c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_evs_H_H),tc_Message_Omsg)
| X1 = v_sko__urX(v_evs_H)
| v_sko__urX(v_evs) = X1
| v_sko__urX(v_evs) = v_sko__urX(v_evs_H) ),
inference(spm,[status(thm)],[c_0_53,c_0_20]) ).
cnf(c_0_56,negated_conjecture,
v_sko__urX(v_evs_H_H) = v_sko__urX(v_evs_H),
inference(spm,[status(thm)],[c_0_54,c_0_26]) ).
cnf(c_0_57,negated_conjecture,
( ~ c_lessequals(v_sko__urX(v_evs_H),X1,tc_nat)
| v_sko__urX(v_evs) = X1
| X1 = v_sko__urX(v_evs_H)
| v_sko__urX(v_evs) = v_sko__urX(v_evs_H) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_55]),c_0_56]) ).
cnf(c_0_58,negated_conjecture,
( v_sko__urX(v_evs) = v_sko__urX(v_evs_H)
| 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) = v_sko__urX(v_evs) ),
inference(spm,[status(thm)],[c_0_57,c_0_26]) ).
cnf(c_0_59,negated_conjecture,
( ~ c_less(v_sko__urX(v_evs),X1,tc_nat)
| v_sko__urX(v_evs) = v_sko__urX(v_evs_H)
| c_plus(v_sko__urX(v_evs_H),X1,tc_nat) = v_sko__urX(v_evs_H) ),
inference(spm,[status(thm)],[c_0_28,c_0_58]) ).
cnf(c_0_60,negated_conjecture,
( ~ c_lessequals(v_sko__urX(v_evs_H),X2,tc_nat)
| c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_evs),tc_Message_Omsg)
| X1 = X2
| X2 = v_sko__urX(v_evs_H)
| X1 = v_sko__urX(v_evs_H) ),
inference(rw,[status(thm)],[c_0_22,c_0_56]) ).
cnf(c_0_61,negated_conjecture,
( v_sko__urX(v_evs) = v_sko__urX(v_evs_H)
| c_plus(v_sko__urX(v_evs_H),c_Suc(v_sko__urX(v_evs)),tc_nat) = v_sko__urX(v_evs_H) ),
inference(spm,[status(thm)],[c_0_59,c_0_32]) ).
cnf(c_0_62,negated_conjecture,
( c_in(c_Message_Omsg_ONonce(X2),c_Event_Oused(v_evs),tc_Message_Omsg)
| X2 = v_sko__urX(v_evs_H)
| X2 = c_plus(v_sko__urX(v_evs_H),X1,tc_nat)
| c_plus(v_sko__urX(v_evs_H),X1,tc_nat) = v_sko__urX(v_evs_H) ),
inference(spm,[status(thm)],[c_0_60,c_0_26]) ).
cnf(c_0_63,negated_conjecture,
( c_lessequals(c_Suc(v_sko__urX(v_evs)),X1,tc_nat)
| v_sko__urX(v_evs) = v_sko__urX(v_evs_H) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_61]),c_0_26])]) ).
cnf(c_0_64,negated_conjecture,
( c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_evs),tc_Message_Omsg)
| c_lessequals(X2,X3,tc_nat)
| X1 = v_sko__urX(v_evs_H)
| X1 = c_plus(v_sko__urX(v_evs_H),X2,tc_nat) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_62]),c_0_26])]) ).
cnf(c_0_65,negated_conjecture,
( c_lessequals(v_sko__urX(v_evs),X1,tc_nat)
| v_sko__urX(v_evs) = v_sko__urX(v_evs_H) ),
inference(spm,[status(thm)],[c_0_50,c_0_63]) ).
cnf(c_0_66,negated_conjecture,
( ~ c_less(X1,X2,tc_nat)
| c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_evs),tc_Message_Omsg)
| c_lessequals(X2,X3,tc_nat)
| X1 = v_sko__urX(v_evs_H) ),
inference(spm,[status(thm)],[c_0_28,c_0_64]) ).
cnf(c_0_67,negated_conjecture,
( v_sko__urX(v_evs) = v_sko__urX(v_evs_H)
| c_plus(v_sko__urX(v_evs_H),c_Suc(X1),tc_nat) = v_sko__urX(v_evs_H) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_58]),c_0_65]) ).
cnf(c_0_68,negated_conjecture,
( c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_evs),tc_Message_Omsg)
| c_lessequals(c_Suc(X1),X2,tc_nat)
| X1 = v_sko__urX(v_evs_H) ),
inference(spm,[status(thm)],[c_0_66,c_0_32]) ).
cnf(c_0_69,plain,
~ c_lessequals(c_Suc(c_Suc(X1)),X1,tc_nat),
inference(spm,[status(thm)],[c_0_33,c_0_48]) ).
cnf(c_0_70,negated_conjecture,
( c_lessequals(c_Suc(X1),X2,tc_nat)
| v_sko__urX(v_evs) = v_sko__urX(v_evs_H) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_67]),c_0_26])]) ).
cnf(c_0_71,negated_conjecture,
( c_in(c_Message_Omsg_ONonce(X1),c_Event_Oused(v_evs),tc_Message_Omsg)
| c_lessequals(X1,X2,tc_nat)
| X1 = v_sko__urX(v_evs_H) ),
inference(spm,[status(thm)],[c_0_50,c_0_68]) ).
cnf(c_0_72,negated_conjecture,
v_sko__urX(v_evs) = v_sko__urX(v_evs_H),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_73,negated_conjecture,
( ~ c_lessequals(v_sko__urX(v_evs_H),X1,tc_nat)
| c_lessequals(X1,X2,tc_nat)
| X1 = v_sko__urX(v_evs_H) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_71]),c_0_72]) ).
cnf(c_0_74,negated_conjecture,
( c_lessequals(c_plus(v_sko__urX(v_evs_H),X1,tc_nat),X2,tc_nat)
| c_plus(v_sko__urX(v_evs_H),X1,tc_nat) = v_sko__urX(v_evs_H) ),
inference(spm,[status(thm)],[c_0_73,c_0_26]) ).
cnf(c_0_75,negated_conjecture,
c_plus(v_sko__urX(v_evs_H),c_Suc(X1),tc_nat) = v_sko__urX(v_evs_H),
inference(spm,[status(thm)],[c_0_33,c_0_74]) ).
cnf(c_0_76,negated_conjecture,
c_lessequals(c_Suc(X1),X2,tc_nat),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_75]),c_0_26])]) ).
cnf(c_0_77,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_69,c_0_76])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV282-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n009.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 08:38:12 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.52/0.49 % Version: 3.5.1
% 0.52/0.49 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.52/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.52/0.49 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.52/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.52/0.49 % Starting new_bool_1 with 300s (1) cores
% 0.52/0.49 % Starting sh5l with 300s (1) cores
% 0.52/0.49 % sh5l with pid 1340257 completed with status 0
% 0.52/0.49 % Result found by sh5l
% 0.52/0.49 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.52/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.52/0.49 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.52/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.52/0.49 % Starting new_bool_1 with 300s (1) cores
% 0.52/0.49 % Starting sh5l with 300s (1) cores
% 0.52/0.49 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.52/0.49 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.52/0.49 % Search class: FGHSM-FFSF31-MFFFFFNN
% 0.52/0.49 % partial match(1): FGHSM-FFMF31-MFFFFFNN
% 0.52/0.49 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.52/0.49 % Starting SubtermCWHack with 31s (1) cores
% 0.52/0.49 % SubtermCWHack with pid 1340264 completed with status 0
% 0.52/0.49 % Result found by SubtermCWHack
% 0.52/0.49 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.52/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.52/0.49 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.52/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.52/0.49 % Starting new_bool_1 with 300s (1) cores
% 0.52/0.49 % Starting sh5l with 300s (1) cores
% 0.52/0.49 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.52/0.49 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.52/0.49 % Search class: FGHSM-FFSF31-MFFFFFNN
% 0.52/0.49 % partial match(1): FGHSM-FFMF31-MFFFFFNN
% 0.52/0.49 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.52/0.49 % Starting SubtermCWHack with 31s (1) cores
% 0.52/0.49 % Preprocessing time : 0.001 s
% 0.52/0.49
% 0.52/0.49 % Proof found!
% 0.52/0.49 % SZS status Unsatisfiable
% 0.52/0.49 % SZS output start CNFRefutation
% See solution above
% 0.52/0.49 % Parsed axioms : 14
% 0.52/0.49 % Removed by relevancy pruning/SinE : 1
% 0.52/0.49 % Initial clauses : 13
% 0.52/0.49 % Removed in clause preprocessing : 0
% 0.52/0.49 % Initial clauses in saturation : 13
% 0.52/0.49 % Processed clauses : 188
% 0.52/0.49 % ...of these trivial : 3
% 0.52/0.49 % ...subsumed : 55
% 0.52/0.49 % ...remaining for further processing : 130
% 0.52/0.49 % Other redundant clauses eliminated : 12
% 0.52/0.49 % Clauses deleted for lack of memory : 0
% 0.52/0.49 % Backward-subsumed : 18
% 0.52/0.49 % Backward-rewritten : 40
% 0.52/0.49 % Generated clauses : 1981
% 0.52/0.49 % ...of the previous two non-redundant : 1878
% 0.52/0.49 % ...aggressively subsumed : 0
% 0.52/0.49 % Contextual simplify-reflections : 1
% 0.52/0.49 % Paramodulations : 1936
% 0.52/0.49 % Factorizations : 33
% 0.52/0.49 % NegExts : 0
% 0.52/0.49 % Equation resolutions : 12
% 0.52/0.49 % Disequality decompositions : 0
% 0.52/0.49 % Total rewrite steps : 437
% 0.52/0.49 % ...of those cached : 372
% 0.52/0.49 % Propositional unsat checks : 0
% 0.52/0.49 % Propositional check models : 0
% 0.52/0.49 % Propositional check unsatisfiable : 0
% 0.52/0.49 % Propositional clauses : 0
% 0.52/0.49 % Propositional clauses after purity: 0
% 0.52/0.49 % Propositional unsat core size : 0
% 0.52/0.49 % Propositional preprocessing time : 0.000
% 0.52/0.49 % Propositional encoding time : 0.000
% 0.52/0.49 % Propositional solver time : 0.000
% 0.52/0.49 % Success case prop preproc time : 0.000
% 0.52/0.49 % Success case prop encoding time : 0.000
% 0.52/0.49 % Success case prop solver time : 0.000
% 0.52/0.49 % Current number of processed clauses : 72
% 0.52/0.49 % Positive orientable unit clauses : 24
% 0.52/0.49 % Positive unorientable unit clauses: 0
% 0.52/0.49 % Negative unit clauses : 11
% 0.52/0.49 % Non-unit-clauses : 37
% 0.52/0.49 % Current number of unprocessed clauses: 1645
% 0.52/0.49 % ...number of literals in the above : 10667
% 0.52/0.49 % Current number of archived formulas : 0
% 0.52/0.49 % Current number of archived clauses : 58
% 0.52/0.49 % Clause-clause subsumption calls (NU) : 1082
% 0.52/0.49 % Rec. Clause-clause subsumption calls : 508
% 0.52/0.49 % Non-unit clause-clause subsumptions : 56
% 0.52/0.49 % Unit Clause-clause subsumption calls : 168
% 0.52/0.49 % Rewrite failures with RHS unbound : 0
% 0.52/0.49 % BW rewrite match attempts : 17
% 0.52/0.49 % BW rewrite match successes : 12
% 0.52/0.49 % Condensation attempts : 0
% 0.52/0.49 % Condensation successes : 0
% 0.52/0.49 % Termbank termtop insertions : 39938
% 0.52/0.49 % Search garbage collected termcells : 18
% 0.52/0.49
% 0.52/0.49 % -------------------------------------------------
% 0.52/0.49 % User time : 0.054 s
% 0.52/0.49 % System time : 0.005 s
% 0.52/0.49 % Total time : 0.059 s
% 0.52/0.49 % Maximum resident set size: 3644 pages
% 0.52/0.49
% 0.52/0.49 % -------------------------------------------------
% 0.52/0.49 % User time : 0.056 s
% 0.52/0.49 % System time : 0.008 s
% 0.52/0.49 % Total time : 0.064 s
% 0.52/0.49 % Maximum resident set size: 4608 pages
% 0.52/0.49 % E exiting
%------------------------------------------------------------------------------