%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWV398+1 : TPTP v9.2.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n006.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 : Tue May 5 05:22:05 PM UTC 2026
% Result : Theorem 187.35s 108.27s
% Output : CNFRefutation 188.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 12
% Syntax : Number of formulae : 75 ( 13 unt; 0 def)
% Number of atoms : 206 ( 47 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 199 ( 68 ~; 101 |; 17 &)
% ( 4 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 19 ( 19 usr; 6 con; 0-3 aty)
% Number of variables : 230 ( 60 sgn 84 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax47,axiom,
! [X1,X2,X3,X4] :
( ( X2 != create_slb
& ~ contains_slb(X2,findmin_pqp_res(X1)) )
=> findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax47) ).
fof(stricly_smaller_definition,axiom,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( less_than(X1,X2)
& ~ less_than(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax',stricly_smaller_definition) ).
fof(ax48,axiom,
! [X1,X2,X3,X4] :
( ( X2 != create_slb
& contains_slb(X2,findmin_pqp_res(X1))
& strictly_less_than(findmin_pqp_res(X1),lookup_slb(X2,findmin_pqp_res(X1))) )
=> findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax48) ).
fof(totality,axiom,
! [X1,X2] :
( less_than(X1,X2)
| less_than(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax',totality) ).
fof(l24_co,conjecture,
! [X1,X2,X3] :
( ~ check_cpq(triple(X1,X2,X3))
=> ~ check_cpq(findmin_cpq_eff(triple(X1,X2,X3))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l24_co) ).
fof(l26_li4142,lemma,
! [X1,X2,X3] :
( check_cpq(triple(X1,X2,X3))
<=> ! [X4,X5] :
( pair_in_list(X2,X4,X5)
=> less_than(X5,X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l26_li4142) ).
fof(ax37,axiom,
! [X1,X2,X3,X4,X5] :
( less_than(X5,X4)
=> ( check_cpq(triple(X1,insert_slb(X2,pair(X4,X5)),X3))
<=> check_cpq(triple(X1,X2,X3)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax37) ).
fof(ax42,axiom,
! [X1,X2,X3,X4] : insert_cpq(triple(X1,X2,X3),X4) = triple(insert_pqp(X1,X4),insert_slb(X2,pair(X4,bottom)),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax42) ).
fof(bottom_smallest,axiom,
! [X1] : less_than(bottom,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax',bottom_smallest) ).
fof(ax49,axiom,
! [X1,X2,X3,X4] :
( ( X2 != create_slb
& contains_slb(X2,findmin_pqp_res(X1))
& less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1)) )
=> findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax49) ).
fof(l34_l35,lemma,
! [X1] :
( ? [X2,X3] :
( pair_in_list(X1,X2,X3)
& strictly_less_than(X2,X3) )
=> ! [X4] :
? [X5,X6] :
( pair_in_list(update_slb(X1,X4),X5,X6)
& strictly_less_than(X5,X6) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l34_l35) ).
fof(ax36,axiom,
! [X1,X2] : check_cpq(triple(X1,create_slb,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax36) ).
fof(c_0_12,plain,
! [X1,X2,X3,X4] :
( ( X2 != create_slb
& ~ contains_slb(X2,findmin_pqp_res(X1)) )
=> findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad) ),
inference(fof_simplification,[status(thm)],[ax47]) ).
fof(c_0_13,plain,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( less_than(X1,X2)
& ~ less_than(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[stricly_smaller_definition]) ).
fof(c_0_14,plain,
! [X238,X239,X240] :
( X239 = create_slb
| ~ contains_slb(X239,findmin_pqp_res(X238))
| ~ strictly_less_than(findmin_pqp_res(X238),lookup_slb(X239,findmin_pqp_res(X238)))
| findmin_cpq_eff(triple(X238,X239,X240)) = triple(X238,update_slb(X239,findmin_pqp_res(X238)),bad) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax48])])]) ).
fof(c_0_15,plain,
! [X235,X236,X237] :
( X236 = create_slb
| contains_slb(X236,findmin_pqp_res(X235))
| findmin_cpq_eff(triple(X235,X236,X237)) = triple(X235,update_slb(X236,findmin_pqp_res(X235)),bad) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_12])])]) ).
fof(c_0_16,plain,
! [X144,X145] :
( ( less_than(X144,X145)
| ~ strictly_less_than(X144,X145) )
& ( ~ less_than(X145,X144)
| ~ strictly_less_than(X144,X145) )
& ( ~ less_than(X144,X145)
| less_than(X145,X144)
| strictly_less_than(X144,X145) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).
fof(c_0_17,plain,
! [X141,X142] :
( less_than(X141,X142)
| less_than(X142,X141) ),
inference(variable_rename,[status(thm)],[totality]) ).
fof(c_0_18,negated_conjecture,
~ ! [X1,X2,X3] :
( ~ check_cpq(triple(X1,X2,X3))
=> ~ check_cpq(findmin_cpq_eff(triple(X1,X2,X3))) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[l24_co])]) ).
cnf(c_0_19,plain,
( X1 = create_slb
| findmin_cpq_eff(triple(X2,X1,X3)) = triple(X2,update_slb(X1,findmin_pqp_res(X2)),bad)
| ~ contains_slb(X1,findmin_pqp_res(X2))
| ~ strictly_less_than(findmin_pqp_res(X2),lookup_slb(X1,findmin_pqp_res(X2))) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( X1 = create_slb
| contains_slb(X1,findmin_pqp_res(X2))
| findmin_cpq_eff(triple(X2,X1,X3)) = triple(X2,update_slb(X1,findmin_pqp_res(X2)),bad) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
( less_than(X2,X1)
| strictly_less_than(X1,X2)
| ~ less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_23,negated_conjecture,
( ~ check_cpq(triple(esk5_0,esk6_0,esk7_0))
& check_cpq(findmin_cpq_eff(triple(esk5_0,esk6_0,esk7_0))) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])]) ).
fof(c_0_24,lemma,
! [X251,X252,X253,X254,X255,X256,X257,X260] :
( ( ~ check_cpq(triple(X251,X252,X253))
| ~ pair_in_list(X252,X254,X255)
| less_than(X255,X254) )
& ( pair_in_list(X257,esk1_2(X256,X257),esk2_2(X256,X257))
| check_cpq(triple(X256,X257,X260)) )
& ( ~ less_than(esk2_2(X256,X257),esk1_2(X256,X257))
| check_cpq(triple(X256,X257,X260)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[l26_li4142])])])])])]) ).
fof(c_0_25,plain,
! [X198,X199,X200,X201,X202] :
( ( ~ check_cpq(triple(X198,insert_slb(X199,pair(X201,X202)),X200))
| check_cpq(triple(X198,X199,X200))
| ~ less_than(X202,X201) )
& ( ~ check_cpq(triple(X198,X199,X200))
| check_cpq(triple(X198,insert_slb(X199,pair(X201,X202)),X200))
| ~ less_than(X202,X201) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax37])])]) ).
cnf(c_0_26,plain,
( findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)
| X2 = create_slb
| ~ strictly_less_than(findmin_pqp_res(X1),lookup_slb(X2,findmin_pqp_res(X1))) ),
inference(csr,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1) ),
inference(csr,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,negated_conjecture,
check_cpq(findmin_cpq_eff(triple(esk5_0,esk6_0,esk7_0))),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,plain,
( findmin_cpq_eff(triple(X1,X2,X3)) = findmin_cpq_eff(triple(X1,X2,X4))
| X2 = create_slb
| contains_slb(X2,findmin_pqp_res(X1)) ),
inference(spm,[status(thm)],[c_0_20,c_0_20]) ).
cnf(c_0_30,lemma,
( less_than(X5,X4)
| ~ check_cpq(triple(X1,X2,X3))
| ~ pair_in_list(X2,X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_31,plain,
( check_cpq(triple(X1,insert_slb(X2,pair(X4,X5)),X3))
| ~ check_cpq(triple(X1,X2,X3))
| ~ less_than(X5,X4) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_32,plain,
( findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)
| X2 = create_slb
| less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_33,negated_conjecture,
( esk6_0 = create_slb
| check_cpq(findmin_cpq_eff(triple(esk5_0,esk6_0,X1)))
| contains_slb(esk6_0,findmin_pqp_res(esk5_0)) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,lemma,
( less_than(X1,X2)
| ~ check_cpq(triple(X3,X4,X5))
| ~ pair_in_list(insert_slb(X4,pair(X6,X7)),X2,X1)
| ~ less_than(X7,X6) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,lemma,
( pair_in_list(X1,esk1_2(X2,X1),esk2_2(X2,X1))
| check_cpq(triple(X2,X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_36,lemma,
( check_cpq(triple(X1,X2,X3))
| ~ less_than(esk2_2(X1,X2),esk1_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_37,plain,
! [X217,X218,X219,X220] : insert_cpq(triple(X217,X218,X219),X220) = triple(insert_pqp(X217,X220),insert_slb(X218,pair(X220,bottom)),X219),
inference(variable_rename,[status(thm)],[ax42]) ).
fof(c_0_38,plain,
! [X146] : less_than(bottom,X146),
inference(variable_rename,[status(thm)],[bottom_smallest]) ).
fof(c_0_39,plain,
! [X241,X242,X243] :
( X242 = create_slb
| ~ contains_slb(X242,findmin_pqp_res(X241))
| ~ less_than(lookup_slb(X242,findmin_pqp_res(X241)),findmin_pqp_res(X241))
| findmin_cpq_eff(triple(X241,X242,X243)) = triple(X241,update_slb(X242,findmin_pqp_res(X241)),X243) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax49])])]) ).
cnf(c_0_40,plain,
( findmin_cpq_eff(triple(X1,X2,X3)) = findmin_cpq_eff(triple(X1,X2,X4))
| X2 = create_slb
| less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1)) ),
inference(spm,[status(thm)],[c_0_32,c_0_32]) ).
cnf(c_0_41,negated_conjecture,
( esk6_0 = create_slb
| check_cpq(triple(esk5_0,update_slb(esk6_0,findmin_pqp_res(esk5_0)),bad))
| contains_slb(esk6_0,findmin_pqp_res(esk5_0)) ),
inference(spm,[status(thm)],[c_0_33,c_0_20]) ).
cnf(c_0_42,lemma,
( check_cpq(triple(X1,insert_slb(X2,pair(X3,X4)),X5))
| ~ check_cpq(triple(X6,X2,X7))
| ~ less_than(X4,X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_43,plain,
insert_cpq(triple(X1,X2,X3),X4) = triple(insert_pqp(X1,X4),insert_slb(X2,pair(X4,bottom)),X3),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_44,plain,
less_than(bottom,X1),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_45,plain,
( X1 = create_slb
| findmin_cpq_eff(triple(X2,X1,X3)) = triple(X2,update_slb(X1,findmin_pqp_res(X2)),X3)
| ~ contains_slb(X1,findmin_pqp_res(X2))
| ~ less_than(lookup_slb(X1,findmin_pqp_res(X2)),findmin_pqp_res(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_46,negated_conjecture,
( esk6_0 = create_slb
| check_cpq(findmin_cpq_eff(triple(esk5_0,esk6_0,X1)))
| less_than(lookup_slb(esk6_0,findmin_pqp_res(esk5_0)),findmin_pqp_res(esk5_0)) ),
inference(spm,[status(thm)],[c_0_28,c_0_40]) ).
cnf(c_0_47,lemma,
( esk6_0 = create_slb
| contains_slb(esk6_0,findmin_pqp_res(esk5_0))
| less_than(X1,X2)
| ~ pair_in_list(update_slb(esk6_0,findmin_pqp_res(esk5_0)),X2,X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_41]) ).
cnf(c_0_48,lemma,
( check_cpq(insert_cpq(triple(X1,X2,X3),X4))
| ~ check_cpq(triple(X5,X2,X6)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44])]) ).
cnf(c_0_49,negated_conjecture,
( triple(esk5_0,update_slb(esk6_0,findmin_pqp_res(esk5_0)),X1) = findmin_cpq_eff(triple(esk5_0,esk6_0,X1))
| esk6_0 = create_slb
| check_cpq(findmin_cpq_eff(triple(esk5_0,esk6_0,X2))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_33]) ).
fof(c_0_50,lemma,
! [X261,X262,X263,X264] :
( ( pair_in_list(update_slb(X261,X264),esk3_2(X261,X264),esk4_2(X261,X264))
| ~ pair_in_list(X261,X262,X263)
| ~ strictly_less_than(X262,X263) )
& ( strictly_less_than(esk3_2(X261,X264),esk4_2(X261,X264))
| ~ pair_in_list(X261,X262,X263)
| ~ strictly_less_than(X262,X263) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l34_l35])])])])]) ).
cnf(c_0_51,plain,
( check_cpq(triple(X1,X2,X5))
| ~ check_cpq(triple(X1,insert_slb(X2,pair(X3,X4)),X5))
| ~ less_than(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_52,negated_conjecture,
( esk6_0 = create_slb
| check_cpq(triple(esk5_0,update_slb(esk6_0,findmin_pqp_res(esk5_0)),bad))
| less_than(lookup_slb(esk6_0,findmin_pqp_res(esk5_0)),findmin_pqp_res(esk5_0)) ),
inference(spm,[status(thm)],[c_0_46,c_0_32]) ).
cnf(c_0_53,lemma,
( esk6_0 = create_slb
| check_cpq(triple(X1,update_slb(esk6_0,findmin_pqp_res(esk5_0)),X2))
| contains_slb(esk6_0,findmin_pqp_res(esk5_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_35]),c_0_36]) ).
cnf(c_0_54,lemma,
( esk6_0 = create_slb
| check_cpq(insert_cpq(triple(X1,update_slb(esk6_0,findmin_pqp_res(esk5_0)),X2),X3))
| check_cpq(findmin_cpq_eff(triple(esk5_0,esk6_0,X4)))
| ~ check_cpq(findmin_cpq_eff(triple(esk5_0,esk6_0,X5))) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_55,lemma,
( strictly_less_than(esk3_2(X1,X2),esk4_2(X1,X2))
| ~ pair_in_list(X1,X3,X4)
| ~ strictly_less_than(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_56,plain,
( check_cpq(triple(insert_pqp(X1,X2),X3,X4))
| ~ check_cpq(insert_cpq(triple(X1,X3,X4),X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_43]),c_0_44])]) ).
cnf(c_0_57,negated_conjecture,
( triple(esk5_0,update_slb(esk6_0,findmin_pqp_res(esk5_0)),X1) = findmin_cpq_eff(triple(esk5_0,esk6_0,X1))
| esk6_0 = create_slb
| check_cpq(triple(esk5_0,update_slb(esk6_0,findmin_pqp_res(esk5_0)),bad)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_52]),c_0_53]) ).
cnf(c_0_58,negated_conjecture,
( esk6_0 = create_slb
| check_cpq(insert_cpq(triple(X1,update_slb(esk6_0,findmin_pqp_res(esk5_0)),X2),X3))
| check_cpq(findmin_cpq_eff(triple(esk5_0,esk6_0,X4))) ),
inference(spm,[status(thm)],[c_0_54,c_0_28]) ).
cnf(c_0_59,lemma,
( pair_in_list(update_slb(X1,X2),esk3_2(X1,X2),esk4_2(X1,X2))
| ~ pair_in_list(X1,X3,X4)
| ~ strictly_less_than(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_60,lemma,
( check_cpq(triple(X1,X2,X3))
| strictly_less_than(esk3_2(X2,X4),esk4_2(X2,X4))
| ~ strictly_less_than(esk1_2(X1,X2),esk2_2(X1,X2)) ),
inference(spm,[status(thm)],[c_0_55,c_0_35]) ).
cnf(c_0_61,lemma,
( less_than(X1,X2)
| ~ check_cpq(insert_cpq(triple(X3,X4,X5),X6))
| ~ pair_in_list(X4,X2,X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_56]) ).
cnf(c_0_62,lemma,
( esk6_0 = create_slb
| check_cpq(insert_cpq(triple(X1,update_slb(esk6_0,findmin_pqp_res(esk5_0)),X2),X3)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_57]),c_0_58]),c_0_48]) ).
cnf(c_0_63,lemma,
( check_cpq(triple(X1,X2,X3))
| pair_in_list(update_slb(X2,X4),esk3_2(X2,X4),esk4_2(X2,X4))
| ~ strictly_less_than(esk1_2(X1,X2),esk2_2(X1,X2)) ),
inference(spm,[status(thm)],[c_0_59,c_0_35]) ).
cnf(c_0_64,plain,
( ~ less_than(X1,X2)
| ~ strictly_less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_65,lemma,
( check_cpq(triple(X1,X2,X3))
| strictly_less_than(esk3_2(X2,X4),esk4_2(X2,X4)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_27]),c_0_36]) ).
cnf(c_0_66,lemma,
( esk6_0 = create_slb
| less_than(X1,X2)
| ~ pair_in_list(update_slb(esk6_0,findmin_pqp_res(esk5_0)),X2,X1) ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_67,lemma,
( check_cpq(triple(X1,X2,X3))
| pair_in_list(update_slb(X2,X4),esk3_2(X2,X4),esk4_2(X2,X4)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_27]),c_0_36]) ).
cnf(c_0_68,lemma,
( check_cpq(triple(X1,X2,X3))
| ~ less_than(esk4_2(X2,X4),esk3_2(X2,X4)) ),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_69,negated_conjecture,
~ check_cpq(triple(esk5_0,esk6_0,esk7_0)),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_70,lemma,
( esk6_0 = create_slb
| check_cpq(triple(X1,esk6_0,X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_68]) ).
fof(c_0_71,plain,
! [X196,X197] : check_cpq(triple(X196,create_slb,X197)),
inference(variable_rename,[status(thm)],[ax36]) ).
cnf(c_0_72,negated_conjecture,
esk6_0 = create_slb,
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_73,plain,
check_cpq(triple(X1,create_slb,X2)),
inference(split_conjunct,[status(thm)],[c_0_71]) ).
cnf(c_0_74,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_69,c_0_72]),c_0_73])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV398+1 : TPTP v9.2.1. Released v3.3.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.33 % Computer : n006.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Tue May 5 05:07:01 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 187.35/108.27 % Version : CSE_E---1.7
% 187.35/108.27 % Problem : theBenchmark.p
% 187.35/108.27 % SZS status Theorem for theBenchmark.p
% 187.35/108.27 % SZS output start CNFRefutation
% See solution above
% 188.06/109.00 % Total time : 79.728s
%------------------------------------------------------------------------------