%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV033+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n019.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:53:33 PM UTC 2026
% Result : Theorem 9.69s 1.98s
% Output : CNFRefutation 9.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 95 ( 26 unt; 0 def)
% Number of atoms : 299 ( 124 equ)
% Maximal formula atoms : 56 ( 3 avg)
% Number of connectives : 281 ( 77 ~; 137 |; 48 &)
% ( 1 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 11 con; 0-3 aty)
% Number of variables : 83 ( 3 sgn 54 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(gauss_init_0045,conjecture,
( ( ! [X4] :
( ( leq(X4,minus(pv1376,n1))
& leq(n0,X4) )
=> a_select2(s_values7_init,X4) = init )
& ! [X14] :
( ( leq(X14,n2)
& leq(n0,X14) )
=> ! [X18] :
( ( leq(X18,n3)
& leq(n0,X18) )
=> a_select3(simplex7_init,X18,X14) = init ) )
& leq(pv1376,n3)
& leq(n0,pv1376)
& init = init )
=> ( ! [X22] :
( ( leq(X22,minus(plus(n1,pv1376),n1))
& leq(n0,X22) )
=> a_select2(tptp_update2(s_values7_init,pv1376,init),X22) = init )
& ! [X20] :
( ( leq(X20,n2)
& leq(n0,X20) )
=> ! [X21] :
( ( leq(X21,n3)
& leq(n0,X21) )
=> a_select3(simplex7_init,X21,X20) = init ) )
& init = init ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gauss_init_0045) ).
fof(sel2_update_2,axiom,
! [X5,X7,X1,X17,X25] :
( ( a_select2(X1,X7) = X17
& X5 != X7 )
=> a_select2(tptp_update2(X1,X5,X25),X7) = X17 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',sel2_update_2) ).
fof(leq_gt2,axiom,
! [X1,X2] :
( ( X1 != X2
& leq(X1,X2) )
=> gt(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',leq_gt2) ).
fof(pred_succ,axiom,
! [X1] : pred(succ(X1)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',pred_succ) ).
fof(succ_plus_1_r,axiom,
! [X1] : plus(X1,n1) = succ(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',succ_plus_1_r) ).
fof(pred_minus_1,axiom,
! [X1] : minus(X1,n1) = pred(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',pred_minus_1) ).
fof(succ_plus_1_l,axiom,
! [X1] : plus(n1,X1) = succ(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',succ_plus_1_l) ).
fof(leq_gt_pred,axiom,
! [X1,X2] :
( leq(X1,pred(X2))
<=> gt(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',leq_gt_pred) ).
fof(sel2_update_1,axiom,
! [X1,X7,X17] : a_select2(tptp_update2(X1,X7,X17),X7) = X17,
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',sel2_update_1) ).
fof(c_0_9,negated_conjecture,
~ ( ( ! [X4] :
( ( leq(X4,minus(pv1376,n1))
& leq(n0,X4) )
=> a_select2(s_values7_init,X4) = init )
& ! [X14] :
( ( leq(X14,n2)
& leq(n0,X14) )
=> ! [X18] :
( ( leq(X18,n3)
& leq(n0,X18) )
=> a_select3(simplex7_init,X18,X14) = init ) )
& leq(pv1376,n3)
& leq(n0,pv1376)
& init = init )
=> ( ! [X22] :
( ( leq(X22,minus(plus(n1,pv1376),n1))
& leq(n0,X22) )
=> a_select2(tptp_update2(s_values7_init,pv1376,init),X22) = init )
& ! [X20] :
( ( leq(X20,n2)
& leq(n0,X20) )
=> ! [X21] :
( ( leq(X21,n3)
& leq(n0,X21) )
=> a_select3(simplex7_init,X21,X20) = init ) )
& init = init ) ),
inference(assume_negation,[status(cth)],[gauss_init_0045]) ).
fof(c_0_10,plain,
! [X5,X7,X1,X17,X25] :
( ( a_select2(X1,X7) = X17
& X5 != X7 )
=> a_select2(tptp_update2(X1,X5,X25),X7) = X17 ),
inference(fof_simplification,[status(thm)],[sel2_update_2]) ).
fof(c_0_11,plain,
! [X1,X2] :
( ( X1 != X2
& leq(X1,X2) )
=> gt(X2,X1) ),
inference(fof_simplification,[status(thm)],[leq_gt2]) ).
fof(c_0_12,negated_conjecture,
! [X186,X187,X188] :
( ( init != init
| a_select3(simplex7_init,esk25_0,esk24_0) != init
| a_select2(tptp_update2(s_values7_init,pv1376,init),esk26_0) != init )
& ( init != init
| a_select3(simplex7_init,esk25_0,esk24_0) != init
| leq(esk26_0,minus(plus(n1,pv1376),n1)) )
& ( init != init
| a_select3(simplex7_init,esk25_0,esk24_0) != init
| leq(n0,esk26_0) )
& ( init != init
| leq(esk25_0,n3)
| a_select2(tptp_update2(s_values7_init,pv1376,init),esk26_0) != init )
& ( init != init
| leq(esk25_0,n3)
| leq(esk26_0,minus(plus(n1,pv1376),n1)) )
& ( init != init
| leq(esk25_0,n3)
| leq(n0,esk26_0) )
& ( init != init
| leq(n0,esk25_0)
| a_select2(tptp_update2(s_values7_init,pv1376,init),esk26_0) != init )
& ( init != init
| leq(n0,esk25_0)
| leq(esk26_0,minus(plus(n1,pv1376),n1)) )
& ( init != init
| leq(n0,esk25_0)
| leq(n0,esk26_0) )
& ( init != init
| leq(esk24_0,n2)
| a_select2(tptp_update2(s_values7_init,pv1376,init),esk26_0) != init )
& ( init != init
| leq(esk24_0,n2)
| leq(esk26_0,minus(plus(n1,pv1376),n1)) )
& ( init != init
| leq(esk24_0,n2)
| leq(n0,esk26_0) )
& ( init != init
| leq(n0,esk24_0)
| a_select2(tptp_update2(s_values7_init,pv1376,init),esk26_0) != init )
& ( init != init
| leq(n0,esk24_0)
| leq(esk26_0,minus(plus(n1,pv1376),n1)) )
& ( init != init
| leq(n0,esk24_0)
| leq(n0,esk26_0) )
& ( a_select2(s_values7_init,X188) = init
| ~ leq(X188,minus(pv1376,n1))
| ~ leq(n0,X188) )
& ( a_select3(simplex7_init,X187,X186) = init
| ~ leq(X187,n3)
| ~ leq(n0,X187)
| ~ leq(X186,n2)
| ~ leq(n0,X186) )
& leq(pv1376,n3)
& leq(n0,pv1376)
& init = init ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])])]) ).
fof(c_0_13,plain,
! [X146] : pred(succ(X146)) = X146,
inference(variable_rename,[status(thm)],[pred_succ]) ).
fof(c_0_14,plain,
! [X135] : plus(X135,n1) = succ(X135),
inference(variable_rename,[status(thm)],[succ_plus_1_r]) ).
fof(c_0_15,plain,
! [X145] : minus(X145,n1) = pred(X145),
inference(variable_rename,[status(thm)],[pred_minus_1]) ).
fof(c_0_16,plain,
! [X136] : plus(n1,X136) = succ(X136),
inference(variable_rename,[status(thm)],[succ_plus_1_l]) ).
fof(c_0_17,plain,
! [X176,X177,X178,X179,X180] :
( a_select2(tptp_update2(X178,X176,X180),X177) = X179
| a_select2(X178,X177) != X179
| X176 = X177 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
fof(c_0_18,plain,
! [X46,X47] :
( ( leq(X46,pred(X47))
| ~ gt(X47,X46) )
& ( gt(X47,X46)
| ~ leq(X46,pred(X47)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_gt_pred])])]) ).
fof(c_0_19,plain,
! [X44,X45] :
( gt(X45,X44)
| X44 = X45
| ~ leq(X44,X45) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).
cnf(c_0_20,negated_conjecture,
( $false
| a_select3(simplex7_init,esk25_0,esk24_0) != init
| leq(esk26_0,minus(plus(n1,pv1376),n1)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,plain,
pred(succ(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,plain,
plus(X1,n1) = succ(X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,plain,
minus(X1,n1) = pred(X1),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,plain,
plus(n1,X1) = succ(X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_25,negated_conjecture,
( $false
| leq(n0,esk24_0)
| leq(esk26_0,minus(plus(n1,pv1376),n1)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_26,negated_conjecture,
( $false
| leq(n0,esk25_0)
| leq(esk26_0,minus(plus(n1,pv1376),n1)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_27,negated_conjecture,
( $false
| leq(esk24_0,n2)
| leq(esk26_0,minus(plus(n1,pv1376),n1)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_28,negated_conjecture,
( $false
| leq(esk25_0,n3)
| leq(esk26_0,minus(plus(n1,pv1376),n1)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_29,negated_conjecture,
( $false
| a_select3(simplex7_init,esk25_0,esk24_0) != init
| a_select2(tptp_update2(s_values7_init,pv1376,init),esk26_0) != init ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_30,plain,
( a_select2(X3,X2) != X4
| a_select2(tptp_update2(X3,X1,X5),X2) = X4
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_31,plain,
( ~ gt(X1,X2)
| leq(X2,pred(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_32,negated_conjecture,
( $false
| a_select3(simplex7_init,esk25_0,esk24_0) != init
| leq(n0,esk26_0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_33,negated_conjecture,
( $false
| leq(n0,esk24_0)
| leq(n0,esk26_0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_34,negated_conjecture,
( $false
| leq(n0,esk25_0)
| leq(n0,esk26_0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_35,negated_conjecture,
( $false
| leq(esk24_0,n2)
| leq(n0,esk26_0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_36,negated_conjecture,
( $false
| leq(esk25_0,n3)
| leq(n0,esk26_0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_37,plain,
( ~ leq(X1,X2)
| gt(X2,X1)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_38,negated_conjecture,
( a_select3(simplex7_init,esk25_0,esk24_0) != init
| leq(esk26_0,minus(plus(n1,pv1376),n1)) ),
inference(cn,[status(thm)],[c_0_20]) ).
cnf(c_0_39,plain,
minus(plus(X1,n1),n1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_40,plain,
plus(n1,X1) = plus(X1,n1),
inference(rw,[status(thm)],[c_0_24,c_0_22]) ).
cnf(c_0_41,negated_conjecture,
( $false
| a_select2(tptp_update2(s_values7_init,pv1376,init),esk26_0) != init
| leq(n0,esk24_0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_42,negated_conjecture,
( leq(esk26_0,minus(plus(n1,pv1376),n1))
| leq(n0,esk24_0) ),
inference(cn,[status(thm)],[c_0_25]) ).
cnf(c_0_43,negated_conjecture,
( $false
| a_select2(tptp_update2(s_values7_init,pv1376,init),esk26_0) != init
| leq(n0,esk25_0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_44,negated_conjecture,
( leq(esk26_0,minus(plus(n1,pv1376),n1))
| leq(n0,esk25_0) ),
inference(cn,[status(thm)],[c_0_26]) ).
cnf(c_0_45,negated_conjecture,
( $false
| a_select2(tptp_update2(s_values7_init,pv1376,init),esk26_0) != init
| leq(esk24_0,n2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_46,negated_conjecture,
( leq(esk26_0,minus(plus(n1,pv1376),n1))
| leq(esk24_0,n2) ),
inference(cn,[status(thm)],[c_0_27]) ).
cnf(c_0_47,negated_conjecture,
( $false
| a_select2(tptp_update2(s_values7_init,pv1376,init),esk26_0) != init
| leq(esk25_0,n3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_48,negated_conjecture,
( leq(esk26_0,minus(plus(n1,pv1376),n1))
| leq(esk25_0,n3) ),
inference(cn,[status(thm)],[c_0_28]) ).
cnf(c_0_49,negated_conjecture,
( a_select2(tptp_update2(s_values7_init,pv1376,init),esk26_0) != init
| a_select3(simplex7_init,esk25_0,esk24_0) != init ),
inference(cn,[status(thm)],[c_0_29]) ).
cnf(c_0_50,plain,
( X2 = X4
| a_select2(tptp_update2(X1,X2,X3),X4) = a_select2(X1,X4) ),
inference(er,[status(thm)],[c_0_30]) ).
cnf(c_0_51,negated_conjecture,
( ~ leq(X1,minus(pv1376,n1))
| ~ leq(n0,X1)
| a_select2(s_values7_init,X1) = init ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_52,plain,
( ~ gt(X1,X2)
| leq(X2,minus(X1,n1)) ),
inference(rw,[status(thm)],[c_0_31,c_0_23]) ).
cnf(c_0_53,negated_conjecture,
( a_select3(simplex7_init,esk25_0,esk24_0) != init
| leq(n0,esk26_0) ),
inference(cn,[status(thm)],[c_0_32]) ).
cnf(c_0_54,negated_conjecture,
( ~ leq(X2,n3)
| ~ leq(n0,X2)
| ~ leq(X1,n2)
| ~ leq(n0,X1)
| a_select3(simplex7_init,X2,X1) = init ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_55,negated_conjecture,
( leq(n0,esk26_0)
| leq(n0,esk24_0) ),
inference(cn,[status(thm)],[c_0_33]) ).
cnf(c_0_56,negated_conjecture,
( leq(n0,esk26_0)
| leq(n0,esk25_0) ),
inference(cn,[status(thm)],[c_0_34]) ).
cnf(c_0_57,negated_conjecture,
( leq(esk24_0,n2)
| leq(n0,esk26_0) ),
inference(cn,[status(thm)],[c_0_35]) ).
cnf(c_0_58,negated_conjecture,
( leq(esk25_0,n3)
| leq(n0,esk26_0) ),
inference(cn,[status(thm)],[c_0_36]) ).
cnf(c_0_59,negated_conjecture,
( a_select3(simplex7_init,esk25_0,esk24_0) != init
| gt(minus(plus(n1,pv1376),n1),esk26_0)
| minus(plus(n1,pv1376),n1) = esk26_0 ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_60,plain,
minus(plus(n1,X1),n1) = X1,
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_61,negated_conjecture,
( a_select2(tptp_update2(s_values7_init,pv1376,init),esk26_0) != init
| leq(n0,esk24_0) ),
inference(cn,[status(thm)],[c_0_41]) ).
cnf(c_0_62,negated_conjecture,
( gt(minus(plus(n1,pv1376),n1),esk26_0)
| leq(n0,esk24_0)
| minus(plus(n1,pv1376),n1) = esk26_0 ),
inference(spm,[status(thm)],[c_0_37,c_0_42]) ).
cnf(c_0_63,negated_conjecture,
( a_select2(tptp_update2(s_values7_init,pv1376,init),esk26_0) != init
| leq(n0,esk25_0) ),
inference(cn,[status(thm)],[c_0_43]) ).
cnf(c_0_64,negated_conjecture,
( gt(minus(plus(n1,pv1376),n1),esk26_0)
| leq(n0,esk25_0)
| minus(plus(n1,pv1376),n1) = esk26_0 ),
inference(spm,[status(thm)],[c_0_37,c_0_44]) ).
cnf(c_0_65,negated_conjecture,
( a_select2(tptp_update2(s_values7_init,pv1376,init),esk26_0) != init
| leq(esk24_0,n2) ),
inference(cn,[status(thm)],[c_0_45]) ).
cnf(c_0_66,negated_conjecture,
( gt(minus(plus(n1,pv1376),n1),esk26_0)
| leq(esk24_0,n2)
| minus(plus(n1,pv1376),n1) = esk26_0 ),
inference(spm,[status(thm)],[c_0_37,c_0_46]) ).
cnf(c_0_67,negated_conjecture,
( a_select2(tptp_update2(s_values7_init,pv1376,init),esk26_0) != init
| leq(esk25_0,n3) ),
inference(cn,[status(thm)],[c_0_47]) ).
cnf(c_0_68,negated_conjecture,
( gt(minus(plus(n1,pv1376),n1),esk26_0)
| leq(esk25_0,n3)
| minus(plus(n1,pv1376),n1) = esk26_0 ),
inference(spm,[status(thm)],[c_0_37,c_0_48]) ).
cnf(c_0_69,negated_conjecture,
( a_select2(s_values7_init,esk26_0) != init
| a_select3(simplex7_init,esk25_0,esk24_0) != init
| pv1376 = esk26_0 ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_70,negated_conjecture,
( ~ gt(pv1376,X1)
| ~ leq(n0,X1)
| a_select2(s_values7_init,X1) = init ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_71,negated_conjecture,
leq(n0,esk26_0),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55]),c_0_56]),c_0_57]),c_0_58]) ).
cnf(c_0_72,negated_conjecture,
( a_select3(simplex7_init,esk25_0,esk24_0) != init
| gt(pv1376,esk26_0)
| pv1376 = esk26_0 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_60]),c_0_60]) ).
cnf(c_0_73,negated_conjecture,
( a_select2(s_values7_init,esk26_0) != init
| leq(n0,esk24_0)
| pv1376 = esk26_0 ),
inference(spm,[status(thm)],[c_0_61,c_0_50]) ).
cnf(c_0_74,negated_conjecture,
( gt(pv1376,esk26_0)
| leq(n0,esk24_0)
| pv1376 = esk26_0 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_60]),c_0_60]) ).
cnf(c_0_75,negated_conjecture,
( a_select2(s_values7_init,esk26_0) != init
| leq(n0,esk25_0)
| pv1376 = esk26_0 ),
inference(spm,[status(thm)],[c_0_63,c_0_50]) ).
cnf(c_0_76,negated_conjecture,
( gt(pv1376,esk26_0)
| leq(n0,esk25_0)
| pv1376 = esk26_0 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_60]),c_0_60]) ).
cnf(c_0_77,negated_conjecture,
( a_select2(s_values7_init,esk26_0) != init
| leq(esk24_0,n2)
| pv1376 = esk26_0 ),
inference(spm,[status(thm)],[c_0_65,c_0_50]) ).
cnf(c_0_78,negated_conjecture,
( gt(pv1376,esk26_0)
| leq(esk24_0,n2)
| pv1376 = esk26_0 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_60]),c_0_60]) ).
cnf(c_0_79,negated_conjecture,
( a_select2(s_values7_init,esk26_0) != init
| leq(esk25_0,n3)
| pv1376 = esk26_0 ),
inference(spm,[status(thm)],[c_0_67,c_0_50]) ).
cnf(c_0_80,negated_conjecture,
( gt(pv1376,esk26_0)
| leq(esk25_0,n3)
| pv1376 = esk26_0 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_60]),c_0_60]) ).
cnf(c_0_81,negated_conjecture,
( a_select3(simplex7_init,esk25_0,esk24_0) != init
| pv1376 = esk26_0 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_71])]),c_0_72]) ).
cnf(c_0_82,negated_conjecture,
( leq(n0,esk24_0)
| pv1376 = esk26_0 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_70]),c_0_71])]),c_0_74]) ).
cnf(c_0_83,negated_conjecture,
( leq(n0,esk25_0)
| pv1376 = esk26_0 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_70]),c_0_71])]),c_0_76]) ).
cnf(c_0_84,negated_conjecture,
( leq(esk24_0,n2)
| pv1376 = esk26_0 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_70]),c_0_71])]),c_0_78]) ).
cnf(c_0_85,negated_conjecture,
( leq(esk25_0,n3)
| pv1376 = esk26_0 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_70]),c_0_71])]),c_0_80]) ).
fof(c_0_86,plain,
! [X173,X174,X175] : a_select2(tptp_update2(X173,X174,X175),X174) = X175,
inference(variable_rename,[status(thm)],[sel2_update_1]) ).
cnf(c_0_87,negated_conjecture,
pv1376 = esk26_0,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_54]),c_0_82]),c_0_83]),c_0_84]),c_0_85]) ).
cnf(c_0_88,plain,
a_select2(tptp_update2(X1,X2,X3),X2) = X3,
inference(split_conjunct,[status(thm)],[c_0_86]) ).
cnf(c_0_89,negated_conjecture,
a_select3(simplex7_init,esk25_0,esk24_0) != init,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_87]),c_0_88])]) ).
cnf(c_0_90,negated_conjecture,
leq(n0,esk24_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_87]),c_0_88])]) ).
cnf(c_0_91,negated_conjecture,
leq(esk24_0,n2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_87]),c_0_88])]) ).
cnf(c_0_92,negated_conjecture,
leq(n0,esk25_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_87]),c_0_88])]) ).
cnf(c_0_93,negated_conjecture,
~ leq(esk25_0,n3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_54]),c_0_90])]),c_0_91]),c_0_92])]) ).
cnf(c_0_94,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_87]),c_0_88])]),c_0_93]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV033+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n019.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % 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:28:34 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.45 Running first-order theorem proving
% 0.15/0.45 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
% 9.69/1.98 % Version: 3.5.1
% 9.69/1.98 % Preprocessing class: FSLSSMSMSSSNFFN.
% 9.69/1.98 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 9.69/1.98 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 9.69/1.98 % Starting new_bool_3 with 300s (1) cores
% 9.69/1.98 % Starting new_bool_1 with 300s (1) cores
% 9.69/1.98 % Starting sh5l with 300s (1) cores
% 9.69/1.98 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2139481 completed with status 0
% 9.69/1.98 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 9.69/1.98 % Preprocessing class: FSLSSMSMSSSNFFN.
% 9.69/1.98 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 9.69/1.98 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 9.69/1.98 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 9.69/1.98 % No SInE strategy applied
% 9.69/1.98 % Search class: FGHSM-FSLM33-DFFFFFNN
% 9.69/1.98 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 9.69/1.98 % Starting SubtermCWHack with 136s (1) cores
% 9.69/1.98 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 9.69/1.98 % Starting U----_206b_01_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 9.69/1.98 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 9.69/1.98 % Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 9.69/1.98 % G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with pid 2139491 completed with status 0
% 9.69/1.98 % Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN
% 9.69/1.98 % Preprocessing class: FSLSSMSMSSSNFFN.
% 9.69/1.98 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 9.69/1.98 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 9.69/1.98 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 9.69/1.98 % No SInE strategy applied
% 9.69/1.98 % Search class: FGHSM-FSLM33-DFFFFFNN
% 9.69/1.98 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 9.69/1.98 % Starting SubtermCWHack with 136s (1) cores
% 9.69/1.98 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 9.69/1.98 % Starting U----_206b_01_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 9.69/1.98 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 9.69/1.98 % Preprocessing time : 0.013 s
% 9.69/1.98
% 9.69/1.98 % Proof found!
% 9.69/1.98 % SZS status Theorem
% 9.69/1.98 % SZS output start CNFRefutation
% See solution above
% 9.69/1.98 % Parsed axioms : 85
% 9.69/1.98 % Removed by relevancy pruning/SinE : 0
% 9.69/1.98 % Initial clauses : 212
% 9.69/1.98 % Removed in clause preprocessing : 3
% 9.69/1.98 % Initial clauses in saturation : 209
% 9.69/1.98 % Processed clauses : 1521
% 9.69/1.98 % ...of these trivial : 30
% 9.69/1.98 % ...subsumed : 657
% 9.69/1.98 % ...remaining for further processing : 833
% 9.69/1.98 % Other redundant clauses eliminated : 8
% 9.69/1.98 % Clauses deleted for lack of memory : 0
% 9.69/1.98 % Backward-subsumed : 52
% 9.69/1.98 % Backward-rewritten : 193
% 9.69/1.98 % Generated clauses : 11937
% 9.69/1.98 % ...of the previous two non-redundant : 11001
% 9.69/1.98 % ...aggressively subsumed : 0
% 9.69/1.98 % Contextual simplify-reflections : 33
% 9.69/1.98 % Paramodulations : 11840
% 9.69/1.98 % Factorizations : 87
% 9.69/1.98 % NegExts : 0
% 9.69/1.98 % Equation resolutions : 10
% 9.69/1.98 % Disequality decompositions : 0
% 9.69/1.98 % Total rewrite steps : 12357
% 9.69/1.98 % ...of those cached : 12197
% 9.69/1.98 % Propositional unsat checks : 0
% 9.69/1.98 % Propositional check models : 0
% 9.69/1.98 % Propositional check unsatisfiable : 0
% 9.69/1.98 % Propositional clauses : 0
% 9.69/1.98 % Propositional clauses after purity: 0
% 9.69/1.98 % Propositional unsat core size : 0
% 9.69/1.98 % Propositional preprocessing time : 0.000
% 9.69/1.98 % Propositional encoding time : 0.000
% 9.69/1.98 % Propositional solver time : 0.000
% 9.69/1.98 % Success case prop preproc time : 0.000
% 9.69/1.98 % Success case prop encoding time : 0.000
% 9.69/1.98 % Success case prop solver time : 0.000
% 9.69/1.98 % Current number of processed clauses : 587
% 9.69/1.98 % Positive orientable unit clauses : 96
% 9.69/1.98 % Positive unorientable unit clauses: 5
% 9.69/1.98 % Negative unit clauses : 101
% 9.69/1.98 % Non-unit-clauses : 385
% 9.69/1.98 % Current number of unprocessed clauses: 9601
% 9.69/1.98 % ...number of literals in the above : 56552
% 9.69/1.98 % Current number of archived formulas : 0
% 9.69/1.98 % Current number of archived clauses : 247
% 9.69/1.98 % Clause-clause subsumption calls (NU) : 79133
% 9.69/1.98 % Rec. Clause-clause subsumption calls : 7962
% 9.69/1.98 % Non-unit clause-clause subsumptions : 283
% 9.69/1.98 % Unit Clause-clause subsumption calls : 20996
% 9.69/1.98 % Rewrite failures with RHS unbound : 0
% 9.69/1.98 % BW rewrite match attempts : 35
% 9.69/1.98 % BW rewrite match successes : 28
% 9.69/1.98 % Condensation attempts : 0
% 9.69/1.98 % Condensation successes : 0
% 9.69/1.98 % Termbank termtop insertions : 266026
% 9.69/1.98 % Search garbage collected termcells : 2451
% 9.69/1.98
% 9.69/1.98 % -------------------------------------------------
% 9.69/1.98 % User time : 0.693 s
% 9.69/1.98 % System time : 0.029 s
% 9.69/1.98 % Total time : 0.722 s
% 9.69/1.98 % Maximum resident set size: 4204 pages
% 9.69/1.98
% 9.69/1.98 % -------------------------------------------------
% 9.69/1.98 % User time : 5.375 s
% 9.69/1.98 % System time : 0.200 s
% 9.69/1.98 % Total time : 5.575 s
% 9.69/1.98 % Maximum resident set size: 4864 pages
% 9.69/1.98 % E exiting
%------------------------------------------------------------------------------