%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWV407+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 : n006.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 03:01:31 PM UTC 2026
% Result : Theorem 101.11s 15.28s
% Output : CNFRefutation 101.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 32
% Number of leaves : 12
% Syntax : Number of formulae : 87 ( 11 unt; 0 def)
% Number of atoms : 258 ( 76 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 244 ( 73 ~; 127 |; 26 &)
% ( 4 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 15 ( 15 usr; 6 con; 0-4 aty)
% Number of variables : 190 ( 35 sgn 101 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l43_co,conjecture,
! [X1,X2,X3] :
( ? [X4] :
( strictly_less_than(X4,findmin_cpq_res(triple(X1,X2,X3)))
& contains_cpq(triple(X1,X2,X3),X4) )
=> ~ check_cpq(findmin_cpq_eff(triple(X1,X2,X3))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l43_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(l43_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',l43_li4142) ).
fof(ax39,axiom,
! [X1,X2,X3,X4] :
( contains_cpq(triple(X1,X2,X3),X4)
<=> contains_slb(X2,X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax39) ).
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(l43_l44,lemma,
! [X1,X2,X3,X4] :
( ( strictly_less_than(X4,findmin_cpq_res(triple(X1,X2,X3)))
& contains_slb(X2,X4) )
=> ( ? [X5] :
( less_than(findmin_pqp_res(X1),X5)
& pair_in_list(update_slb(X2,findmin_pqp_res(X1)),X4,X5) )
| pair_in_list(update_slb(X2,findmin_pqp_res(X1)),X4,findmin_pqp_res(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l43_l44) ).
fof(ax51,axiom,
! [X1,X2,X3,X4] :
( X2 != create_slb
=> findmin_cpq_res(triple(X1,X2,X3)) = findmin_pqp_res(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax51) ).
fof(transitivity,axiom,
! [X1,X2,X3] :
( ( less_than(X2,X3)
& less_than(X1,X2) )
=> less_than(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax',transitivity) ).
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(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(totality,axiom,
! [X1,X2] :
( less_than(X2,X1)
| less_than(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax',totality) ).
fof(ax20,axiom,
! [X1] : ~ contains_slb(create_slb,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+2.ax',ax20) ).
fof(c_0_12,negated_conjecture,
~ ! [X1,X2,X3] :
( ? [X4] :
( strictly_less_than(X4,findmin_cpq_res(triple(X1,X2,X3)))
& contains_cpq(triple(X1,X2,X3),X4) )
=> ~ check_cpq(findmin_cpq_eff(triple(X1,X2,X3))) ),
inference(assume_negation,[status(cth)],[l43_co]) ).
fof(c_0_13,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_14,negated_conjecture,
~ ! [X1,X2,X3] :
( ? [X4] :
( strictly_less_than(X4,findmin_cpq_res(triple(X1,X2,X3)))
& contains_cpq(triple(X1,X2,X3),X4) )
=> ~ check_cpq(findmin_cpq_eff(triple(X1,X2,X3))) ),
inference(fof_simplification,[status(thm)],[c_0_12]) ).
fof(c_0_15,lemma,
! [X119,X120,X121,X122,X123,X124,X125,X128] :
( ( check_cpq(triple(X124,X125,X128))
| ~ less_than(esk2_2(X124,X125),esk1_2(X124,X125)) )
& ( check_cpq(triple(X124,X125,X128))
| pair_in_list(X125,esk1_2(X124,X125),esk2_2(X124,X125)) )
& ( less_than(X123,X122)
| ~ pair_in_list(X120,X122,X123)
| ~ check_cpq(triple(X119,X120,X121)) ) ),
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)],[l43_li4142])])])])])])]) ).
fof(c_0_16,plain,
! [X103,X104,X105] :
( findmin_cpq_eff(triple(X103,X104,X105)) = triple(X103,update_slb(X104,findmin_pqp_res(X103)),bad)
| contains_slb(X104,findmin_pqp_res(X103))
| X104 = create_slb ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_13])])]) ).
fof(c_0_17,plain,
! [X76,X77,X78,X79] :
( ( contains_cpq(triple(X76,X77,X78),X79)
| ~ contains_slb(X77,X79) )
& ( contains_slb(X77,X79)
| ~ contains_cpq(triple(X76,X77,X78),X79) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax39])])]) ).
fof(c_0_18,negated_conjecture,
( check_cpq(findmin_cpq_eff(triple(esk4_0,esk5_0,esk6_0)))
& strictly_less_than(esk7_0,findmin_cpq_res(triple(esk4_0,esk5_0,esk6_0)))
& contains_cpq(triple(esk4_0,esk5_0,esk6_0),esk7_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])]) ).
fof(c_0_19,plain,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( ~ less_than(X2,X1)
& less_than(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[stricly_smaller_definition]) ).
cnf(c_0_20,lemma,
( ~ pair_in_list(X2,X4,X5)
| ~ check_cpq(triple(X1,X2,X3))
| less_than(X5,X4) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,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]) ).
fof(c_0_22,lemma,
! [X129,X130,X131,X132] :
( ( ~ strictly_less_than(X132,findmin_cpq_res(triple(X129,X130,X131)))
| ~ contains_slb(X130,X132)
| pair_in_list(update_slb(X130,findmin_pqp_res(X129)),X132,findmin_pqp_res(X129))
| less_than(findmin_pqp_res(X129),esk3_4(X129,X130,X131,X132)) )
& ( ~ strictly_less_than(X132,findmin_cpq_res(triple(X129,X130,X131)))
| ~ contains_slb(X130,X132)
| pair_in_list(update_slb(X130,findmin_pqp_res(X129)),X132,findmin_pqp_res(X129))
| pair_in_list(update_slb(X130,findmin_pqp_res(X129)),X132,esk3_4(X129,X130,X131,X132)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l43_l44])])])])]) ).
cnf(c_0_23,plain,
( ~ contains_cpq(triple(X1,X2,X3),X4)
| contains_slb(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,negated_conjecture,
contains_cpq(triple(esk4_0,esk5_0,esk6_0),esk7_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_25,plain,
! [X12,X13] :
( ( strictly_less_than(X12,X13)
| less_than(X13,X12)
| ~ less_than(X12,X13) )
& ( ~ strictly_less_than(X12,X13)
| ~ less_than(X13,X12) )
& ( ~ strictly_less_than(X12,X13)
| less_than(X12,X13) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])])]) ).
fof(c_0_26,plain,
! [X1,X2,X3,X4] :
( X2 != create_slb
=> findmin_cpq_res(triple(X1,X2,X3)) = findmin_pqp_res(X1) ),
inference(fof_simplification,[status(thm)],[ax51]) ).
cnf(c_0_27,lemma,
( ~ pair_in_list(update_slb(X1,findmin_pqp_res(X2)),X4,X3)
| ~ check_cpq(findmin_cpq_eff(triple(X2,X1,X5)))
| less_than(X3,X4)
| contains_slb(X1,findmin_pqp_res(X2))
| X1 = create_slb ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_28,negated_conjecture,
check_cpq(findmin_cpq_eff(triple(esk4_0,esk5_0,esk6_0))),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_29,lemma,
( ~ strictly_less_than(X3,findmin_cpq_res(triple(X2,X1,X4)))
| ~ contains_slb(X1,X3)
| pair_in_list(update_slb(X1,findmin_pqp_res(X2)),X3,findmin_pqp_res(X2))
| pair_in_list(update_slb(X1,findmin_pqp_res(X2)),X3,esk3_4(X2,X1,X4,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_30,negated_conjecture,
strictly_less_than(esk7_0,findmin_cpq_res(triple(esk4_0,esk5_0,esk6_0))),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_31,negated_conjecture,
contains_slb(esk5_0,esk7_0),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_32,plain,
( ~ strictly_less_than(X2,X1)
| ~ less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_33,plain,
! [X114,X115,X116] :
( findmin_cpq_res(triple(X114,X115,X116)) = findmin_pqp_res(X114)
| X115 = create_slb ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_26])])]) ).
cnf(c_0_34,negated_conjecture,
( ~ pair_in_list(update_slb(esk5_0,findmin_pqp_res(esk4_0)),X2,X1)
| less_than(X1,X2)
| contains_slb(esk5_0,findmin_pqp_res(esk4_0))
| esk5_0 = create_slb ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_35,negated_conjecture,
( pair_in_list(update_slb(esk5_0,findmin_pqp_res(esk4_0)),esk7_0,findmin_pqp_res(esk4_0))
| pair_in_list(update_slb(esk5_0,findmin_pqp_res(esk4_0)),esk7_0,esk3_4(esk4_0,esk5_0,esk6_0,esk7_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).
cnf(c_0_36,negated_conjecture,
~ less_than(findmin_cpq_res(triple(esk4_0,esk5_0,esk6_0)),esk7_0),
inference(spm,[status(thm)],[c_0_32,c_0_30]) ).
cnf(c_0_37,plain,
( findmin_cpq_res(triple(X2,X1,X3)) = findmin_pqp_res(X2)
| X1 = create_slb ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
fof(c_0_38,plain,
! [X6,X7,X8] :
( less_than(X6,X8)
| ~ less_than(X7,X8)
| ~ less_than(X6,X7) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[transitivity])])]) ).
cnf(c_0_39,negated_conjecture,
( less_than(esk3_4(esk4_0,esk5_0,esk6_0,esk7_0),esk7_0)
| contains_slb(esk5_0,findmin_pqp_res(esk4_0))
| pair_in_list(update_slb(esk5_0,findmin_pqp_res(esk4_0)),esk7_0,findmin_pqp_res(esk4_0))
| esk5_0 = create_slb ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,negated_conjecture,
( ~ less_than(findmin_pqp_res(esk4_0),esk7_0)
| esk5_0 = create_slb ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,lemma,
( ~ strictly_less_than(X4,findmin_cpq_res(triple(X1,X2,X3)))
| ~ contains_slb(X2,X4)
| pair_in_list(update_slb(X2,findmin_pqp_res(X1)),X4,findmin_pqp_res(X1))
| less_than(findmin_pqp_res(X1),esk3_4(X1,X2,X3,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_42,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_43,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_44,plain,
( ~ less_than(X2,X3)
| ~ less_than(X1,X2)
| less_than(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_45,negated_conjecture,
( less_than(esk3_4(esk4_0,esk5_0,esk6_0,esk7_0),esk7_0)
| contains_slb(esk5_0,findmin_pqp_res(esk4_0))
| esk5_0 = create_slb ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_39]),c_0_40]) ).
cnf(c_0_46,negated_conjecture,
( less_than(findmin_pqp_res(esk4_0),esk3_4(esk4_0,esk5_0,esk6_0,esk7_0))
| pair_in_list(update_slb(esk5_0,findmin_pqp_res(esk4_0)),esk7_0,findmin_pqp_res(esk4_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_30]),c_0_31])]) ).
fof(c_0_47,plain,
! [X106,X107,X108] :
( findmin_cpq_eff(triple(X106,X107,X108)) = triple(X106,update_slb(X107,findmin_pqp_res(X106)),bad)
| ~ strictly_less_than(findmin_pqp_res(X106),lookup_slb(X107,findmin_pqp_res(X106)))
| ~ contains_slb(X107,findmin_pqp_res(X106))
| X107 = create_slb ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_42])])])]) ).
fof(c_0_48,plain,
! [X9,X10] :
( less_than(X10,X9)
| less_than(X9,X10) ),
inference(variable_rename,[status(thm)],[totality]) ).
fof(c_0_49,plain,
! [X109,X110,X111] :
( findmin_cpq_eff(triple(X109,X110,X111)) = triple(X109,update_slb(X110,findmin_pqp_res(X109)),X111)
| ~ less_than(lookup_slb(X110,findmin_pqp_res(X109)),findmin_pqp_res(X109))
| ~ contains_slb(X110,findmin_pqp_res(X109))
| X110 = create_slb ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_43])])])]) ).
cnf(c_0_50,negated_conjecture,
( ~ less_than(X1,esk3_4(esk4_0,esk5_0,esk6_0,esk7_0))
| less_than(X1,esk7_0)
| contains_slb(esk5_0,findmin_pqp_res(esk4_0))
| esk5_0 = create_slb ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_51,negated_conjecture,
( less_than(findmin_pqp_res(esk4_0),esk3_4(esk4_0,esk5_0,esk6_0,esk7_0))
| contains_slb(esk5_0,findmin_pqp_res(esk4_0))
| esk5_0 = create_slb ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_46]),c_0_40]) ).
cnf(c_0_52,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_47]) ).
cnf(c_0_53,plain,
( ~ less_than(X1,X2)
| strictly_less_than(X1,X2)
| less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_54,plain,
( less_than(X2,X1)
| less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_55,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_49]) ).
cnf(c_0_56,negated_conjecture,
( contains_slb(esk5_0,findmin_pqp_res(esk4_0))
| esk5_0 = create_slb ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_40]) ).
cnf(c_0_57,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_52,c_0_21]) ).
cnf(c_0_58,plain,
( less_than(X2,X1)
| strictly_less_than(X1,X2) ),
inference(csr,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_59,negated_conjecture,
( ~ less_than(lookup_slb(esk5_0,findmin_pqp_res(esk4_0)),findmin_pqp_res(esk4_0))
| esk5_0 = create_slb
| triple(esk4_0,update_slb(esk5_0,findmin_pqp_res(esk4_0)),X1) = findmin_cpq_eff(triple(esk4_0,esk5_0,X1)) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_60,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_57,c_0_58]) ).
cnf(c_0_61,negated_conjecture,
( esk5_0 = create_slb
| triple(esk4_0,update_slb(esk5_0,findmin_pqp_res(esk4_0)),X2) = findmin_cpq_eff(triple(esk4_0,esk5_0,X2))
| findmin_cpq_eff(triple(esk4_0,esk5_0,X1)) = triple(esk4_0,update_slb(esk5_0,findmin_pqp_res(esk4_0)),bad) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_62,negated_conjecture,
( findmin_cpq_eff(triple(esk4_0,esk5_0,X1)) != findmin_cpq_eff(triple(esk4_0,esk5_0,bad))
| esk5_0 = create_slb
| triple(esk4_0,update_slb(esk5_0,findmin_pqp_res(esk4_0)),bad) = findmin_cpq_eff(triple(esk4_0,esk5_0,bad)) ),
inference(ef,[status(thm)],[c_0_61]) ).
cnf(c_0_63,negated_conjecture,
( esk5_0 = create_slb
| triple(esk4_0,update_slb(esk5_0,findmin_pqp_res(esk4_0)),bad) = findmin_cpq_eff(triple(esk4_0,esk5_0,bad)) ),
inference(er,[status(thm)],[c_0_62]) ).
cnf(c_0_64,negated_conjecture,
( less_than(lookup_slb(esk5_0,findmin_pqp_res(esk4_0)),findmin_pqp_res(esk4_0))
| esk5_0 = create_slb
| findmin_cpq_eff(triple(esk4_0,esk5_0,X1)) = findmin_cpq_eff(triple(esk4_0,esk5_0,bad)) ),
inference(spm,[status(thm)],[c_0_60,c_0_63]) ).
cnf(c_0_65,negated_conjecture,
( less_than(lookup_slb(esk5_0,findmin_pqp_res(esk4_0)),findmin_pqp_res(esk4_0))
| esk5_0 = create_slb
| findmin_cpq_eff(triple(esk4_0,esk5_0,X1)) = findmin_cpq_eff(triple(esk4_0,esk5_0,X2)) ),
inference(spm,[status(thm)],[c_0_64,c_0_64]) ).
cnf(c_0_66,negated_conjecture,
( less_than(lookup_slb(esk5_0,findmin_pqp_res(esk4_0)),findmin_pqp_res(esk4_0))
| check_cpq(findmin_cpq_eff(triple(esk4_0,esk5_0,X1)))
| esk5_0 = create_slb ),
inference(spm,[status(thm)],[c_0_28,c_0_65]) ).
cnf(c_0_67,negated_conjecture,
( check_cpq(findmin_cpq_eff(triple(esk4_0,esk5_0,X2)))
| esk5_0 = create_slb
| triple(esk4_0,update_slb(esk5_0,findmin_pqp_res(esk4_0)),X1) = findmin_cpq_eff(triple(esk4_0,esk5_0,X1)) ),
inference(spm,[status(thm)],[c_0_59,c_0_66]) ).
cnf(c_0_68,lemma,
( ~ pair_in_list(update_slb(esk5_0,findmin_pqp_res(esk4_0)),X3,X2)
| ~ check_cpq(findmin_cpq_eff(triple(esk4_0,esk5_0,X4)))
| less_than(X2,X3)
| check_cpq(findmin_cpq_eff(triple(esk4_0,esk5_0,X1)))
| esk5_0 = create_slb ),
inference(spm,[status(thm)],[c_0_20,c_0_67]) ).
cnf(c_0_69,negated_conjecture,
( ~ pair_in_list(update_slb(esk5_0,findmin_pqp_res(esk4_0)),X3,X2)
| less_than(X2,X3)
| check_cpq(findmin_cpq_eff(triple(esk4_0,esk5_0,X1)))
| esk5_0 = create_slb ),
inference(spm,[status(thm)],[c_0_68,c_0_28]) ).
cnf(c_0_70,negated_conjecture,
( less_than(esk3_4(esk4_0,esk5_0,esk6_0,esk7_0),esk7_0)
| pair_in_list(update_slb(esk5_0,findmin_pqp_res(esk4_0)),esk7_0,findmin_pqp_res(esk4_0))
| check_cpq(findmin_cpq_eff(triple(esk4_0,esk5_0,X1)))
| esk5_0 = create_slb ),
inference(spm,[status(thm)],[c_0_69,c_0_35]) ).
cnf(c_0_71,negated_conjecture,
( less_than(esk3_4(esk4_0,esk5_0,esk6_0,esk7_0),esk7_0)
| check_cpq(findmin_cpq_eff(triple(esk4_0,esk5_0,X2)))
| check_cpq(findmin_cpq_eff(triple(esk4_0,esk5_0,X1)))
| esk5_0 = create_slb ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_40]) ).
cnf(c_0_72,lemma,
( ~ pair_in_list(update_slb(esk5_0,findmin_pqp_res(esk4_0)),X2,X1)
| ~ check_cpq(findmin_cpq_eff(triple(esk4_0,esk5_0,bad)))
| less_than(X1,X2)
| esk5_0 = create_slb ),
inference(spm,[status(thm)],[c_0_20,c_0_63]) ).
cnf(c_0_73,negated_conjecture,
( less_than(esk3_4(esk4_0,esk5_0,esk6_0,esk7_0),esk7_0)
| check_cpq(findmin_cpq_eff(triple(esk4_0,esk5_0,X1)))
| esk5_0 = create_slb ),
inference(ef,[status(thm)],[c_0_71]) ).
cnf(c_0_74,lemma,
( ~ pair_in_list(update_slb(esk5_0,findmin_pqp_res(esk4_0)),X2,X1)
| less_than(X1,X2)
| less_than(esk3_4(esk4_0,esk5_0,esk6_0,esk7_0),esk7_0)
| esk5_0 = create_slb ),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_75,negated_conjecture,
( less_than(esk3_4(esk4_0,esk5_0,esk6_0,esk7_0),esk7_0)
| pair_in_list(update_slb(esk5_0,findmin_pqp_res(esk4_0)),esk7_0,findmin_pqp_res(esk4_0))
| esk5_0 = create_slb ),
inference(spm,[status(thm)],[c_0_74,c_0_35]) ).
cnf(c_0_76,lemma,
( less_than(esk3_4(esk4_0,esk5_0,esk6_0,esk7_0),esk7_0)
| esk5_0 = create_slb ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_40]) ).
cnf(c_0_77,lemma,
( ~ less_than(X1,esk3_4(esk4_0,esk5_0,esk6_0,esk7_0))
| less_than(X1,esk7_0)
| esk5_0 = create_slb ),
inference(spm,[status(thm)],[c_0_44,c_0_76]) ).
cnf(c_0_78,negated_conjecture,
( less_than(findmin_pqp_res(esk4_0),esk3_4(esk4_0,esk5_0,esk6_0,esk7_0))
| check_cpq(findmin_cpq_eff(triple(esk4_0,esk5_0,X1)))
| esk5_0 = create_slb ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_46]),c_0_40]) ).
cnf(c_0_79,negated_conjecture,
( check_cpq(findmin_cpq_eff(triple(esk4_0,esk5_0,X1)))
| esk5_0 = create_slb ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_40]) ).
cnf(c_0_80,lemma,
( ~ pair_in_list(update_slb(esk5_0,findmin_pqp_res(esk4_0)),X2,X1)
| less_than(X1,X2)
| esk5_0 = create_slb ),
inference(spm,[status(thm)],[c_0_72,c_0_79]) ).
fof(c_0_81,plain,
! [X1] : ~ contains_slb(create_slb,X1),
inference(fof_simplification,[status(thm)],[ax20]) ).
cnf(c_0_82,negated_conjecture,
( less_than(findmin_pqp_res(esk4_0),esk3_4(esk4_0,esk5_0,esk6_0,esk7_0))
| esk5_0 = create_slb ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_46]),c_0_40]) ).
fof(c_0_83,plain,
! [X18] : ~ contains_slb(create_slb,X18),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_81])]) ).
cnf(c_0_84,lemma,
esk5_0 = create_slb,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_82]),c_0_40]) ).
cnf(c_0_85,plain,
~ contains_slb(create_slb,X1),
inference(split_conjunct,[status(thm)],[c_0_83]) ).
cnf(c_0_86,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_84]),c_0_85]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWV407+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.49 % Computer : n006.cluster.edu
% 0.18/0.49 % Model : x86_64 x86_64
% 0.18/0.49 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.49 % Memory : 8046.5625MB
% 0.18/0.49 % OS : Linux 6.8.0-71-generic
% 0.18/0.49 % CPULimit : 300
% 0.18/0.49 % WCLimit : 300
% 0.18/0.49 % DateTime : Mon Sep 21 08:45:12 UTC 2026
% 0.18/0.50 % CPUTime :
% 0.18/0.50 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.22/0.58 Running first-order theorem proving
% 0.22/0.58 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
% 101.11/15.28 % Version: 3.5.1
% 101.11/15.28 % Preprocessing class: FSLSSMSSSSSNFFN.
% 101.11/15.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 101.11/15.28 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 101.11/15.28 % Starting new_bool_3 with 300s (1) cores
% 101.11/15.28 % Starting new_bool_1 with 300s (1) cores
% 101.11/15.28 % Starting sh5l with 300s (1) cores
% 101.11/15.28 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2467265 completed with status 0
% 101.11/15.28 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 101.11/15.28 % Preprocessing class: FSLSSMSSSSSNFFN.
% 101.11/15.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 101.11/15.28 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 101.11/15.28 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 101.11/15.28 % No SInE strategy applied
% 101.11/15.28 % Search class: FGHSM-FFMS32-MFFFFFNN
% 101.11/15.28 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 101.11/15.28 % Starting SubtermCWHack with 136s (1) cores
% 101.11/15.28 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 101.11/15.28 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 226s (1) cores
% 101.11/15.28 % Starting new_bool_3 with 226s (1) cores
% 101.11/15.28 % Starting new_bool_1 with 226s (1) cores
% 101.11/15.28 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2467270 completed with status 0
% 101.11/15.28 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 101.11/15.28 % Preprocessing class: FSLSSMSSSSSNFFN.
% 101.11/15.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 101.11/15.28 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 101.11/15.28 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 101.11/15.28 % No SInE strategy applied
% 101.11/15.28 % Search class: FGHSM-FFMS32-MFFFFFNN
% 101.11/15.28 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 101.11/15.28 % Starting SubtermCWHack with 136s (1) cores
% 101.11/15.28 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 101.11/15.28 % Preprocessing time : 0.003 s
% 101.11/15.28 % Presaturation interreduction done
% 101.11/15.28
% 101.11/15.28 % Proof found!
% 101.11/15.28 % SZS status Theorem
% 101.11/15.28 % SZS output start CNFRefutation
% See solution above
% 101.11/15.28 % Parsed axioms : 44
% 101.11/15.28 % Removed by relevancy pruning/SinE : 0
% 101.11/15.28 % Initial clauses : 60
% 101.11/15.28 % Removed in clause preprocessing : 4
% 101.11/15.28 % Initial clauses in saturation : 56
% 101.11/15.28 % Processed clauses : 10960
% 101.11/15.28 % ...of these trivial : 329
% 101.11/15.28 % ...subsumed : 4087
% 101.11/15.28 % ...remaining for further processing : 6544
% 101.11/15.28 % Other redundant clauses eliminated : 3
% 101.11/15.28 % Clauses deleted for lack of memory : 0
% 101.11/15.28 % Backward-subsumed : 303
% 101.11/15.28 % Backward-rewritten : 1352
% 101.11/15.28 % Generated clauses : 386777
% 101.11/15.28 % ...of the previous two non-redundant : 378885
% 101.11/15.28 % ...aggressively subsumed : 0
% 101.11/15.28 % Contextual simplify-reflections : 110
% 101.11/15.28 % Paramodulations : 386527
% 101.11/15.28 % Factorizations : 245
% 101.11/15.28 % NegExts : 0
% 101.11/15.28 % Equation resolutions : 6
% 101.11/15.28 % Disequality decompositions : 0
% 101.11/15.28 % Total rewrite steps : 34055
% 101.11/15.28 % ...of those cached : 33285
% 101.11/15.28 % Propositional unsat checks : 1
% 101.11/15.28 % Propositional check models : 1
% 101.11/15.28 % Propositional check unsatisfiable : 0
% 101.11/15.28 % Propositional clauses : 0
% 101.11/15.28 % Propositional clauses after purity: 0
% 101.11/15.28 % Propositional unsat core size : 0
% 101.11/15.28 % Propositional preprocessing time : 0.000
% 101.11/15.28 % Propositional encoding time : 0.461
% 101.11/15.28 % Propositional solver time : 0.037
% 101.11/15.28 % Success case prop preproc time : 0.000
% 101.11/15.28 % Success case prop encoding time : 0.000
% 101.11/15.28 % Success case prop solver time : 0.000
% 101.11/15.28 % Current number of processed clauses : 4831
% 101.11/15.28 % Positive orientable unit clauses : 3938
% 101.11/15.28 % Positive unorientable unit clauses: 0
% 101.11/15.28 % Negative unit clauses : 25
% 101.11/15.28 % Non-unit-clauses : 868
% 101.11/15.28 % Current number of unprocessed clauses: 364624
% 101.11/15.28 % ...number of literals in the above : 1809781
% 101.11/15.28 % Current number of archived formulas : 0
% 101.11/15.28 % Current number of archived clauses : 1713
% 101.11/15.28 % Clause-clause subsumption calls (NU) : 797878
% 101.11/15.28 % Rec. Clause-clause subsumption calls : 183063
% 101.11/15.28 % Non-unit clause-clause subsumptions : 4344
% 101.11/15.28 % Unit Clause-clause subsumption calls : 98601
% 101.11/15.28 % Rewrite failures with RHS unbound : 0
% 101.11/15.28 % BW rewrite match attempts : 3429728
% 101.11/15.28 % BW rewrite match successes : 11
% 101.11/15.28 % Condensation attempts : 0
% 101.11/15.28 % Condensation successes : 0
% 101.11/15.28 % Termbank termtop insertions : 12670510
% 101.11/15.28 % Search garbage collected termcells : 728
% 101.11/15.28
% 101.11/15.28 % -------------------------------------------------
% 101.11/15.28 % User time : 13.895 s
% 101.11/15.28 % System time : 0.425 s
% 101.11/15.28 % Total time : 14.320 s
% 101.11/15.28 % Maximum resident set size: 3432 pages
% 101.11/15.28
% 101.11/15.28 % -------------------------------------------------
% 101.11/15.28 % User time : 69.612 s
% 101.11/15.28 % System time : 2.127 s
% 101.11/15.28 % Total time : 71.738 s
% 101.11/15.28 % Maximum resident set size: 4608 pages
% 101.11/15.28 % E exiting
%------------------------------------------------------------------------------