%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV398+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n018.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:39 PM UTC 2026
% Result : Theorem 95.21s 14.39s
% Output : CNFRefutation 95.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 11
% Syntax : Number of formulae : 70 ( 10 unt; 0 def)
% Number of atoms : 201 ( 45 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 201 ( 70 ~; 94 |; 21 &)
% ( 4 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 17 ( 17 usr; 6 con; 0-3 aty)
% Number of variables : 208 ( 50 sgn 87 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
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(ax47,axiom,
! [X1,X2,X3,X4] :
( ( ~ contains_slb(X2,findmin_pqp_res(X1))
& X2 != create_slb )
=> 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(ax48,axiom,
! [X1,X2,X3,X4] :
( ( strictly_less_than(findmin_pqp_res(X1),lookup_slb(X2,findmin_pqp_res(X1)))
& contains_slb(X2,findmin_pqp_res(X1))
& X2 != create_slb )
=> 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(stricly_smaller_definition,axiom,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( ~ less_than(X2,X1)
& less_than(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax',stricly_smaller_definition) ).
fof(totality,axiom,
! [X1,X2] :
( less_than(X2,X1)
| less_than(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax',totality) ).
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(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] :
( ( less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1))
& contains_slb(X2,findmin_pqp_res(X1))
& X2 != create_slb )
=> 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] :
( strictly_less_than(X2,X3)
& pair_in_list(X1,X2,X3) )
=> ! [X4] :
? [X5,X6] :
( strictly_less_than(X5,X6)
& pair_in_list(update_slb(X1,X4),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_11,negated_conjecture,
~ ! [X1,X2,X3] :
( ~ check_cpq(triple(X1,X2,X3))
=> ~ check_cpq(findmin_cpq_eff(triple(X1,X2,X3))) ),
inference(assume_negation,[status(cth)],[l24_co]) ).
fof(c_0_12,plain,
! [X1,X2,X3,X4] :
( ( ~ contains_slb(X2,findmin_pqp_res(X1))
& X2 != create_slb )
=> 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,X3,X4] :
( ( strictly_less_than(findmin_pqp_res(X1),lookup_slb(X2,findmin_pqp_res(X1)))
& contains_slb(X2,findmin_pqp_res(X1))
& X2 != create_slb )
=> findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad) ),
inference(fof_simplification,[status(thm)],[ax48]) ).
fof(c_0_14,plain,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( ~ less_than(X2,X1)
& less_than(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[stricly_smaller_definition]) ).
fof(c_0_15,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)],[c_0_11]) ).
fof(c_0_16,plain,
! [X104,X105,X106] :
( findmin_cpq_eff(triple(X104,X105,X106)) = triple(X104,update_slb(X105,findmin_pqp_res(X104)),bad)
| contains_slb(X105,findmin_pqp_res(X104))
| X105 = create_slb ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_12])])]) ).
fof(c_0_17,plain,
! [X107,X108,X109] :
( findmin_cpq_eff(triple(X107,X108,X109)) = triple(X107,update_slb(X108,findmin_pqp_res(X107)),bad)
| ~ strictly_less_than(findmin_pqp_res(X107),lookup_slb(X108,findmin_pqp_res(X107)))
| ~ contains_slb(X108,findmin_pqp_res(X107))
| X108 = create_slb ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_13])])])]) ).
fof(c_0_18,plain,
! [X13,X14] :
( ( strictly_less_than(X13,X14)
| less_than(X14,X13)
| ~ less_than(X13,X14) )
& ( ~ strictly_less_than(X13,X14)
| ~ less_than(X14,X13) )
& ( ~ strictly_less_than(X13,X14)
| less_than(X13,X14) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])]) ).
fof(c_0_19,plain,
! [X10,X11] :
( less_than(X11,X10)
| less_than(X10,X11) ),
inference(variable_rename,[status(thm)],[totality]) ).
fof(c_0_20,lemma,
! [X120,X121,X122,X123,X124,X125,X126,X129] :
( ( check_cpq(triple(X125,X126,X129))
| ~ less_than(esk2_2(X125,X126),esk1_2(X125,X126)) )
& ( check_cpq(triple(X125,X126,X129))
| pair_in_list(X126,esk1_2(X125,X126),esk2_2(X125,X126)) )
& ( less_than(X124,X123)
| ~ pair_in_list(X121,X123,X124)
| ~ check_cpq(triple(X120,X121,X122)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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_21,plain,
! [X67,X68,X69,X70,X71] :
( ( ~ less_than(X71,X70)
| check_cpq(triple(X67,insert_slb(X68,pair(X70,X71)),X69))
| ~ check_cpq(triple(X67,X68,X69)) )
& ( ~ less_than(X71,X70)
| check_cpq(triple(X67,X68,X69))
| ~ check_cpq(triple(X67,insert_slb(X68,pair(X70,X71)),X69)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax37])])])]) ).
fof(c_0_22,negated_conjecture,
( check_cpq(findmin_cpq_eff(triple(esk5_0,esk6_0,esk7_0)))
& ~ check_cpq(triple(esk5_0,esk6_0,esk7_0)) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])]) ).
cnf(c_0_23,plain,
( findmin_cpq_eff(triple(X2,X1,X3)) = triple(X2,update_slb(X1,findmin_pqp_res(X2)),bad)
| contains_slb(X1,findmin_pqp_res(X2))
| X1 = create_slb ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
( ~ strictly_less_than(findmin_pqp_res(X2),lookup_slb(X1,findmin_pqp_res(X2)))
| ~ contains_slb(X1,findmin_pqp_res(X2))
| findmin_cpq_eff(triple(X2,X1,X3)) = triple(X2,update_slb(X1,findmin_pqp_res(X2)),bad)
| X1 = create_slb ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
( ~ less_than(X1,X2)
| strictly_less_than(X1,X2)
| less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,plain,
( less_than(X2,X1)
| less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,lemma,
( ~ pair_in_list(X2,X4,X5)
| ~ check_cpq(triple(X1,X2,X3))
| less_than(X5,X4) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,plain,
( ~ less_than(X5,X4)
| ~ check_cpq(triple(X1,X2,X3))
| check_cpq(triple(X1,insert_slb(X2,pair(X4,X5)),X3)) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_29,negated_conjecture,
check_cpq(findmin_cpq_eff(triple(esk5_0,esk6_0,esk7_0))),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_30,plain,
( contains_slb(X2,findmin_pqp_res(X1))
| X2 = create_slb
| findmin_cpq_eff(triple(X1,X2,X3)) = findmin_cpq_eff(triple(X1,X2,X4)) ),
inference(spm,[status(thm)],[c_0_23,c_0_23]) ).
cnf(c_0_31,plain,
( ~ strictly_less_than(findmin_pqp_res(X1),lookup_slb(X2,findmin_pqp_res(X1)))
| X2 = create_slb
| findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad) ),
inference(csr,[status(thm)],[c_0_24,c_0_23]) ).
cnf(c_0_32,plain,
( less_than(X2,X1)
| strictly_less_than(X1,X2) ),
inference(csr,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_33,lemma,
( ~ less_than(X7,X6)
| ~ pair_in_list(insert_slb(X4,pair(X6,X7)),X2,X1)
| ~ check_cpq(triple(X3,X4,X5))
| less_than(X1,X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,lemma,
( check_cpq(triple(X2,X1,X3))
| pair_in_list(X1,esk1_2(X2,X1),esk2_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_35,lemma,
( ~ less_than(esk2_2(X1,X2),esk1_2(X1,X2))
| check_cpq(triple(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_36,negated_conjecture,
( contains_slb(esk6_0,findmin_pqp_res(esk5_0))
| check_cpq(findmin_cpq_eff(triple(esk5_0,esk6_0,X1)))
| esk6_0 = create_slb ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_37,plain,
( less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1))
| X2 = create_slb
| findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,lemma,
( ~ less_than(X4,X3)
| ~ check_cpq(triple(X6,X2,X7))
| check_cpq(triple(X1,insert_slb(X2,pair(X3,X4)),X5)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).
cnf(c_0_39,negated_conjecture,
( contains_slb(esk6_0,findmin_pqp_res(esk5_0))
| check_cpq(triple(esk5_0,update_slb(esk6_0,findmin_pqp_res(esk5_0)),bad))
| esk6_0 = create_slb ),
inference(spm,[status(thm)],[c_0_36,c_0_23]) ).
fof(c_0_40,plain,
! [X15] : less_than(bottom,X15),
inference(variable_rename,[status(thm)],[bottom_smallest]) ).
fof(c_0_41,plain,
! [X1,X2,X3,X4] :
( ( less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1))
& contains_slb(X2,findmin_pqp_res(X1))
& X2 != create_slb )
=> findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),X3) ),
inference(fof_simplification,[status(thm)],[ax49]) ).
cnf(c_0_42,plain,
( less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1))
| X2 = create_slb
| findmin_cpq_eff(triple(X1,X2,X3)) = findmin_cpq_eff(triple(X1,X2,X4)) ),
inference(spm,[status(thm)],[c_0_37,c_0_37]) ).
cnf(c_0_43,negated_conjecture,
( ~ less_than(X3,X2)
| contains_slb(esk6_0,findmin_pqp_res(esk5_0))
| check_cpq(triple(X1,insert_slb(update_slb(esk6_0,findmin_pqp_res(esk5_0)),pair(X2,X3)),X4))
| esk6_0 = create_slb ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,plain,
less_than(bottom,X1),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
fof(c_0_45,lemma,
! [X130,X131,X132,X133] :
( ( ~ strictly_less_than(X131,X132)
| ~ pair_in_list(X130,X131,X132)
| strictly_less_than(esk3_2(X130,X133),esk4_2(X130,X133)) )
& ( ~ strictly_less_than(X131,X132)
| ~ pair_in_list(X130,X131,X132)
| pair_in_list(update_slb(X130,X133),esk3_2(X130,X133),esk4_2(X130,X133)) ) ),
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)],[l34_l35])])])])])]) ).
fof(c_0_46,plain,
! [X110,X111,X112] :
( findmin_cpq_eff(triple(X110,X111,X112)) = triple(X110,update_slb(X111,findmin_pqp_res(X110)),X112)
| ~ less_than(lookup_slb(X111,findmin_pqp_res(X110)),findmin_pqp_res(X110))
| ~ contains_slb(X111,findmin_pqp_res(X110))
| X111 = create_slb ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_41])])])]) ).
cnf(c_0_47,negated_conjecture,
( less_than(lookup_slb(esk6_0,findmin_pqp_res(esk5_0)),findmin_pqp_res(esk5_0))
| check_cpq(findmin_cpq_eff(triple(esk5_0,esk6_0,X1)))
| esk6_0 = create_slb ),
inference(spm,[status(thm)],[c_0_29,c_0_42]) ).
cnf(c_0_48,plain,
( ~ less_than(X4,X3)
| ~ check_cpq(triple(X1,insert_slb(X2,pair(X3,X4)),X5))
| check_cpq(triple(X1,X2,X5)) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_49,negated_conjecture,
( contains_slb(esk6_0,findmin_pqp_res(esk5_0))
| check_cpq(triple(X1,insert_slb(update_slb(esk6_0,findmin_pqp_res(esk5_0)),pair(X2,bottom)),X3))
| esk6_0 = create_slb ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_50,lemma,
( ~ strictly_less_than(X3,X4)
| ~ pair_in_list(X1,X3,X4)
| strictly_less_than(esk3_2(X1,X2),esk4_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_51,plain,
( ~ less_than(lookup_slb(X1,findmin_pqp_res(X2)),findmin_pqp_res(X2))
| ~ contains_slb(X1,findmin_pqp_res(X2))
| findmin_cpq_eff(triple(X2,X1,X3)) = triple(X2,update_slb(X1,findmin_pqp_res(X2)),X3)
| X1 = create_slb ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_52,negated_conjecture,
( less_than(lookup_slb(esk6_0,findmin_pqp_res(esk5_0)),findmin_pqp_res(esk5_0))
| check_cpq(triple(esk5_0,update_slb(esk6_0,findmin_pqp_res(esk5_0)),bad))
| esk6_0 = create_slb ),
inference(spm,[status(thm)],[c_0_47,c_0_37]) ).
cnf(c_0_53,negated_conjecture,
( contains_slb(esk6_0,findmin_pqp_res(esk5_0))
| check_cpq(triple(X1,update_slb(esk6_0,findmin_pqp_res(esk5_0)),X2))
| esk6_0 = create_slb ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_44])]) ).
cnf(c_0_54,lemma,
( ~ strictly_less_than(X3,X4)
| ~ pair_in_list(X1,X3,X4)
| pair_in_list(update_slb(X1,X2),esk3_2(X1,X2),esk4_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_55,lemma,
( ~ strictly_less_than(esk1_2(X1,X2),esk2_2(X1,X2))
| strictly_less_than(esk3_2(X2,X4),esk4_2(X2,X4))
| check_cpq(triple(X1,X2,X3)) ),
inference(spm,[status(thm)],[c_0_50,c_0_34]) ).
cnf(c_0_56,negated_conjecture,
( check_cpq(triple(esk5_0,update_slb(esk6_0,findmin_pqp_res(esk5_0)),bad))
| esk6_0 = create_slb
| triple(esk5_0,update_slb(esk6_0,findmin_pqp_res(esk5_0)),X1) = findmin_cpq_eff(triple(esk5_0,esk6_0,X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]) ).
cnf(c_0_57,lemma,
( ~ strictly_less_than(esk1_2(X1,X2),esk2_2(X1,X2))
| pair_in_list(update_slb(X2,X4),esk3_2(X2,X4),esk4_2(X2,X4))
| check_cpq(triple(X1,X2,X3)) ),
inference(spm,[status(thm)],[c_0_54,c_0_34]) ).
cnf(c_0_58,plain,
( ~ strictly_less_than(X2,X1)
| ~ less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_59,lemma,
( strictly_less_than(esk3_2(X2,X4),esk4_2(X2,X4))
| check_cpq(triple(X1,X2,X3)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_32]),c_0_35]) ).
cnf(c_0_60,lemma,
( ~ pair_in_list(update_slb(esk6_0,findmin_pqp_res(esk5_0)),X2,X1)
| ~ check_cpq(findmin_cpq_eff(triple(esk5_0,esk6_0,X3)))
| less_than(X1,X2)
| esk6_0 = create_slb ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_56]),c_0_27]) ).
cnf(c_0_61,lemma,
( pair_in_list(update_slb(X2,X4),esk3_2(X2,X4),esk4_2(X2,X4))
| check_cpq(triple(X1,X2,X3)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_32]),c_0_35]) ).
cnf(c_0_62,lemma,
( ~ less_than(esk4_2(X2,X4),esk3_2(X2,X4))
| check_cpq(triple(X1,X2,X3)) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_63,lemma,
( ~ check_cpq(findmin_cpq_eff(triple(esk5_0,esk6_0,X3)))
| check_cpq(triple(X1,esk6_0,X2))
| esk6_0 = create_slb ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_62]) ).
cnf(c_0_64,negated_conjecture,
~ check_cpq(triple(esk5_0,esk6_0,esk7_0)),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_65,negated_conjecture,
( check_cpq(triple(X1,esk6_0,X2))
| esk6_0 = create_slb ),
inference(spm,[status(thm)],[c_0_63,c_0_29]) ).
fof(c_0_66,plain,
! [X65,X66] : check_cpq(triple(X65,create_slb,X66)),
inference(variable_rename,[status(thm)],[ax36]) ).
cnf(c_0_67,negated_conjecture,
esk6_0 = create_slb,
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_68,plain,
check_cpq(triple(X1,create_slb,X2)),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_69,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_67]),c_0_68])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV398+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.35 % Computer : n018.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Mon Sep 21 08:46:59 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.14/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 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
% 95.21/14.39 % Version: 3.5.1
% 95.21/14.39 % Preprocessing class: FSMSSMSSSSSNFFN.
% 95.21/14.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 95.21/14.39 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 95.21/14.39 % Starting new_bool_3 with 300s (1) cores
% 95.21/14.39 % Starting new_bool_1 with 300s (1) cores
% 95.21/14.39 % Starting sh5l with 300s (1) cores
% 95.21/14.39 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1497506 completed with status 0
% 95.21/14.39 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 95.21/14.39 % Preprocessing class: FSMSSMSSSSSNFFN.
% 95.21/14.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 95.21/14.39 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 95.21/14.39 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 95.21/14.39 % No SInE strategy applied
% 95.21/14.39 % Search class: FGHSM-FFMF31-MFFFFFNN
% 95.21/14.39 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 95.21/14.39 % Starting SubtermCWHack with 136s (1) cores
% 95.21/14.39 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 95.21/14.39 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 95.21/14.39 % Starting new_bool_3 with 136s (1) cores
% 95.21/14.39 % Starting new_bool_1 with 136s (1) cores
% 95.21/14.39 % G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with pid 1497530 completed with status 0
% 95.21/14.39 % Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN
% 95.21/14.39 % Preprocessing class: FSMSSMSSSSSNFFN.
% 95.21/14.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 95.21/14.39 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 95.21/14.39 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 95.21/14.39 % No SInE strategy applied
% 95.21/14.39 % Search class: FGHSM-FFMF31-MFFFFFNN
% 95.21/14.39 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 95.21/14.39 % Starting SubtermCWHack with 136s (1) cores
% 95.21/14.39 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 95.21/14.39 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 95.21/14.39 % Preprocessing time : 0.003 s
% 95.21/14.39
% 95.21/14.39 % Proof found!
% 95.21/14.39 % SZS status Theorem
% 95.21/14.39 % SZS output start CNFRefutation
% See solution above
% 95.21/14.39 % Parsed axioms : 44
% 95.21/14.39 % Removed by relevancy pruning/SinE : 0
% 95.21/14.39 % Initial clauses : 59
% 95.21/14.39 % Removed in clause preprocessing : 4
% 95.21/14.39 % Initial clauses in saturation : 55
% 95.21/14.39 % Processed clauses : 6675
% 95.21/14.39 % ...of these trivial : 6
% 95.21/14.39 % ...subsumed : 4257
% 95.21/14.39 % ...remaining for further processing : 2412
% 95.21/14.39 % Other redundant clauses eliminated : 3
% 95.21/14.39 % Clauses deleted for lack of memory : 0
% 95.21/14.39 % Backward-subsumed : 176
% 95.21/14.39 % Backward-rewritten : 78
% 95.21/14.39 % Generated clauses : 356236
% 95.21/14.39 % ...of the previous two non-redundant : 350855
% 95.21/14.39 % ...aggressively subsumed : 0
% 95.21/14.39 % Contextual simplify-reflections : 65
% 95.21/14.39 % Paramodulations : 355765
% 95.21/14.39 % Factorizations : 468
% 95.21/14.39 % NegExts : 0
% 95.21/14.39 % Equation resolutions : 4
% 95.21/14.39 % Disequality decompositions : 0
% 95.21/14.39 % Total rewrite steps : 22976
% 95.21/14.39 % ...of those cached : 21530
% 95.21/14.39 % Propositional unsat checks : 0
% 95.21/14.39 % Propositional check models : 0
% 95.21/14.39 % Propositional check unsatisfiable : 0
% 95.21/14.39 % Propositional clauses : 0
% 95.21/14.39 % Propositional clauses after purity: 0
% 95.21/14.39 % Propositional unsat core size : 0
% 95.21/14.39 % Propositional preprocessing time : 0.000
% 95.21/14.39 % Propositional encoding time : 0.000
% 95.21/14.39 % Propositional solver time : 0.000
% 95.21/14.39 % Success case prop preproc time : 0.000
% 95.21/14.39 % Success case prop encoding time : 0.000
% 95.21/14.39 % Success case prop solver time : 0.000
% 95.21/14.39 % Current number of processed clauses : 2156
% 95.21/14.39 % Positive orientable unit clauses : 77
% 95.21/14.39 % Positive unorientable unit clauses: 0
% 95.21/14.39 % Negative unit clauses : 251
% 95.21/14.39 % Non-unit-clauses : 1828
% 95.21/14.39 % Current number of unprocessed clauses: 343875
% 95.21/14.39 % ...number of literals in the above : 2096258
% 95.21/14.39 % Current number of archived formulas : 0
% 95.21/14.39 % Current number of archived clauses : 256
% 95.21/14.39 % Clause-clause subsumption calls (NU) : 717798
% 95.21/14.39 % Rec. Clause-clause subsumption calls : 126652
% 95.21/14.39 % Non-unit clause-clause subsumptions : 3945
% 95.21/14.39 % Unit Clause-clause subsumption calls : 131735
% 95.21/14.39 % Rewrite failures with RHS unbound : 0
% 95.21/14.39 % BW rewrite match attempts : 1529
% 95.21/14.39 % BW rewrite match successes : 5
% 95.21/14.39 % Condensation attempts : 0
% 95.21/14.39 % Condensation successes : 0
% 95.21/14.39 % Termbank termtop insertions : 9657605
% 95.21/14.39 % Search garbage collected termcells : 714
% 95.21/14.39
% 95.21/14.39 % -------------------------------------------------
% 95.21/14.39 % User time : 13.185 s
% 95.21/14.39 % System time : 0.398 s
% 95.21/14.39 % Total time : 13.584 s
% 95.21/14.39 % Maximum resident set size: 3688 pages
% 95.21/14.39
% 95.21/14.39 % -------------------------------------------------
% 95.21/14.39 % User time : 65.972 s
% 95.21/14.39 % System time : 2.095 s
% 95.21/14.39 % Total time : 68.068 s
% 95.21/14.39 % Maximum resident set size: 4864 pages
% 95.21/14.39 % E exiting
%------------------------------------------------------------------------------