%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV404+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n008.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 4.96s 1.13s
% Output : CNFRefutation 4.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 10
% Syntax : Number of formulae : 68 ( 13 unt; 0 def)
% Number of atoms : 187 ( 67 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 168 ( 49 ~; 87 |; 19 &)
% ( 2 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 5 con; 0-3 aty)
% Number of variables : 131 ( 25 sgn 72 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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/sandbox/benchmark/Axioms/SWV007+3.ax',ax47) ).
fof(l40_co,conjecture,
! [X1,X2,X3] :
( ( ok(removemin_cpq_eff(triple(X1,X2,X3)))
& check_cpq(removemin_cpq_eff(triple(X1,X2,X3))) )
=> check_cpq(triple(X1,X2,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l40_co) ).
fof(l40_l27,lemma,
! [X1,X2,X3,X4] :
( ( ok(remove_cpq(triple(X1,X2,X3),X4))
& check_cpq(remove_cpq(triple(X1,X2,X3),X4)) )
=> check_cpq(triple(X1,X2,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l40_l27) ).
fof(ax52,axiom,
! [X1] : removemin_cpq_eff(X1) = remove_cpq(findmin_cpq_eff(X1),findmin_cpq_res(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax52) ).
fof(l40_l34,lemma,
! [X1,X2,X3] :
( ~ check_cpq(triple(X1,X2,X3))
=> ~ check_cpq(findmin_cpq_eff(triple(X1,X2,X3))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l40_l34) ).
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/sandbox/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/sandbox/benchmark/Axioms/SWV007+0.ax',stricly_smaller_definition) ).
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/sandbox/benchmark/Axioms/SWV007+3.ax',ax49) ).
fof(totality,axiom,
! [X1,X2] :
( less_than(X2,X1)
| less_than(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+0.ax',totality) ).
fof(ax36,axiom,
! [X1,X2] : check_cpq(triple(X1,create_slb,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax36) ).
fof(c_0_10,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_11,negated_conjecture,
~ ! [X1,X2,X3] :
( ( ok(removemin_cpq_eff(triple(X1,X2,X3)))
& check_cpq(removemin_cpq_eff(triple(X1,X2,X3))) )
=> check_cpq(triple(X1,X2,X3)) ),
inference(assume_negation,[status(cth)],[l40_co]) ).
fof(c_0_12,lemma,
! [X119,X120,X121,X122] :
( check_cpq(triple(X119,X120,X121))
| ~ ok(remove_cpq(triple(X119,X120,X121),X122))
| ~ check_cpq(remove_cpq(triple(X119,X120,X121),X122)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l40_l27])])]) ).
fof(c_0_13,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_10])])]) ).
fof(c_0_14,negated_conjecture,
( ~ check_cpq(triple(esk1_0,esk2_0,esk3_0))
& ok(removemin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)))
& check_cpq(removemin_cpq_eff(triple(esk1_0,esk2_0,esk3_0))) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).
fof(c_0_15,plain,
! [X117] : removemin_cpq_eff(X117) = remove_cpq(findmin_cpq_eff(X117),findmin_cpq_res(X117)),
inference(variable_rename,[status(thm)],[ax52]) ).
fof(c_0_16,lemma,
! [X1,X2,X3] :
( ~ check_cpq(triple(X1,X2,X3))
=> ~ check_cpq(findmin_cpq_eff(triple(X1,X2,X3))) ),
inference(fof_simplification,[status(thm)],[l40_l34]) ).
cnf(c_0_17,lemma,
( ~ ok(remove_cpq(triple(X1,X2,X3),X4))
| ~ check_cpq(remove_cpq(triple(X1,X2,X3),X4))
| check_cpq(triple(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,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_13]) ).
cnf(c_0_19,negated_conjecture,
ok(removemin_cpq_eff(triple(esk1_0,esk2_0,esk3_0))),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
removemin_cpq_eff(X1) = remove_cpq(findmin_cpq_eff(X1),findmin_cpq_res(X1)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,negated_conjecture,
check_cpq(removemin_cpq_eff(triple(esk1_0,esk2_0,esk3_0))),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_22,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_23,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_24,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]) ).
fof(c_0_25,lemma,
! [X123,X124,X125] :
( ~ check_cpq(findmin_cpq_eff(triple(X123,X124,X125)))
| check_cpq(triple(X123,X124,X125)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])]) ).
cnf(c_0_26,lemma,
( ~ check_cpq(remove_cpq(findmin_cpq_eff(triple(X2,X1,X3)),X4))
| ~ ok(remove_cpq(findmin_cpq_eff(triple(X2,X1,X3)),X4))
| contains_slb(X1,findmin_pqp_res(X2))
| check_cpq(findmin_cpq_eff(triple(X2,X1,X3)))
| X1 = create_slb ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_27,negated_conjecture,
ok(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)),findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0)))),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_28,negated_conjecture,
check_cpq(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)),findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0)))),
inference(rw,[status(thm)],[c_0_21,c_0_20]) ).
fof(c_0_29,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_22])])])]) ).
fof(c_0_30,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_23])])])]) ).
fof(c_0_31,plain,
! [X9,X10] :
( less_than(X10,X9)
| less_than(X9,X10) ),
inference(variable_rename,[status(thm)],[totality]) ).
fof(c_0_32,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_24])])])]) ).
cnf(c_0_33,lemma,
( ~ check_cpq(findmin_cpq_eff(triple(X1,X2,X3)))
| check_cpq(triple(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_34,negated_conjecture,
( contains_slb(esk2_0,findmin_pqp_res(esk1_0))
| check_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)))
| esk2_0 = create_slb ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).
cnf(c_0_35,negated_conjecture,
~ check_cpq(triple(esk1_0,esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_36,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_29]) ).
cnf(c_0_37,plain,
( ~ less_than(X1,X2)
| strictly_less_than(X1,X2)
| less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_38,plain,
( less_than(X2,X1)
| less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_39,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_32]) ).
cnf(c_0_40,lemma,
( contains_slb(esk2_0,findmin_pqp_res(esk1_0))
| esk2_0 = create_slb ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).
cnf(c_0_41,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_36,c_0_18]) ).
cnf(c_0_42,plain,
( less_than(X2,X1)
| strictly_less_than(X1,X2) ),
inference(csr,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_43,lemma,
( ~ less_than(lookup_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0))
| esk2_0 = create_slb
| triple(esk1_0,update_slb(esk2_0,findmin_pqp_res(esk1_0)),X1) = findmin_cpq_eff(triple(esk1_0,esk2_0,X1)) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,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_41,c_0_42]) ).
cnf(c_0_45,lemma,
( esk2_0 = create_slb
| triple(esk1_0,update_slb(esk2_0,findmin_pqp_res(esk1_0)),X2) = findmin_cpq_eff(triple(esk1_0,esk2_0,X2))
| findmin_cpq_eff(triple(esk1_0,esk2_0,X1)) = triple(esk1_0,update_slb(esk2_0,findmin_pqp_res(esk1_0)),bad) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_46,lemma,
( findmin_cpq_eff(triple(esk1_0,esk2_0,X1)) != findmin_cpq_eff(triple(esk1_0,esk2_0,bad))
| esk2_0 = create_slb
| triple(esk1_0,update_slb(esk2_0,findmin_pqp_res(esk1_0)),bad) = findmin_cpq_eff(triple(esk1_0,esk2_0,bad)) ),
inference(ef,[status(thm)],[c_0_45]) ).
cnf(c_0_47,lemma,
( esk2_0 = create_slb
| triple(esk1_0,update_slb(esk2_0,findmin_pqp_res(esk1_0)),bad) = findmin_cpq_eff(triple(esk1_0,esk2_0,bad)) ),
inference(er,[status(thm)],[c_0_46]) ).
cnf(c_0_48,lemma,
( less_than(lookup_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0))
| esk2_0 = create_slb
| findmin_cpq_eff(triple(esk1_0,esk2_0,X1)) = findmin_cpq_eff(triple(esk1_0,esk2_0,bad)) ),
inference(spm,[status(thm)],[c_0_44,c_0_47]) ).
cnf(c_0_49,lemma,
( less_than(lookup_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0))
| esk2_0 = create_slb
| findmin_cpq_eff(triple(esk1_0,esk2_0,X1)) = findmin_cpq_eff(triple(esk1_0,esk2_0,X2)) ),
inference(spm,[status(thm)],[c_0_48,c_0_48]) ).
cnf(c_0_50,lemma,
( ~ check_cpq(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,bad)),X1))
| ~ ok(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,bad)),X1))
| check_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,bad)))
| esk2_0 = create_slb ),
inference(spm,[status(thm)],[c_0_17,c_0_47]) ).
cnf(c_0_51,negated_conjecture,
( less_than(lookup_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0))
| ok(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,X1)),findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0))))
| esk2_0 = create_slb ),
inference(spm,[status(thm)],[c_0_27,c_0_49]) ).
cnf(c_0_52,negated_conjecture,
( less_than(lookup_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0))
| check_cpq(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,X1)),findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0))))
| esk2_0 = create_slb ),
inference(spm,[status(thm)],[c_0_28,c_0_49]) ).
cnf(c_0_53,lemma,
( less_than(lookup_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0))
| check_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,bad)))
| esk2_0 = create_slb ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]) ).
cnf(c_0_54,lemma,
( check_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,bad)))
| esk2_0 = create_slb
| triple(esk1_0,update_slb(esk2_0,findmin_pqp_res(esk1_0)),X1) = findmin_cpq_eff(triple(esk1_0,esk2_0,X1)) ),
inference(spm,[status(thm)],[c_0_43,c_0_53]) ).
cnf(c_0_55,lemma,
( ~ check_cpq(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,X1)),X2))
| ~ ok(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,X1)),X2))
| check_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,X1)))
| check_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,bad)))
| esk2_0 = create_slb ),
inference(spm,[status(thm)],[c_0_17,c_0_54]) ).
cnf(c_0_56,lemma,
( ~ check_cpq(triple(esk1_0,update_slb(esk2_0,findmin_pqp_res(esk1_0)),bad))
| check_cpq(triple(esk1_0,esk2_0,X2))
| esk2_0 = create_slb
| triple(esk1_0,update_slb(esk2_0,findmin_pqp_res(esk1_0)),X1) = findmin_cpq_eff(triple(esk1_0,esk2_0,X1)) ),
inference(spm,[status(thm)],[c_0_33,c_0_45]) ).
cnf(c_0_57,negated_conjecture,
( check_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,bad)))
| check_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)))
| esk2_0 = create_slb ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_27]),c_0_28])]) ).
cnf(c_0_58,lemma,
( ~ check_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,bad)))
| check_cpq(triple(esk1_0,esk2_0,X2))
| esk2_0 = create_slb
| triple(esk1_0,update_slb(esk2_0,findmin_pqp_res(esk1_0)),X1) = findmin_cpq_eff(triple(esk1_0,esk2_0,X1)) ),
inference(spm,[status(thm)],[c_0_56,c_0_47]) ).
cnf(c_0_59,lemma,
( check_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,bad)))
| esk2_0 = create_slb ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_57]),c_0_35]) ).
cnf(c_0_60,lemma,
( check_cpq(triple(esk1_0,esk2_0,X2))
| esk2_0 = create_slb
| triple(esk1_0,update_slb(esk2_0,findmin_pqp_res(esk1_0)),X1) = findmin_cpq_eff(triple(esk1_0,esk2_0,X1)) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_61,lemma,
( ~ check_cpq(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,X1)),X3))
| ~ ok(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,X1)),X3))
| check_cpq(triple(esk1_0,esk2_0,X2))
| check_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,X1)))
| esk2_0 = create_slb ),
inference(spm,[status(thm)],[c_0_17,c_0_60]) ).
cnf(c_0_62,negated_conjecture,
( check_cpq(triple(esk1_0,esk2_0,X1))
| check_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)))
| esk2_0 = create_slb ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_27]),c_0_28])]) ).
cnf(c_0_63,lemma,
( check_cpq(triple(esk1_0,esk2_0,X1))
| esk2_0 = create_slb ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_62]),c_0_35]) ).
fof(c_0_64,plain,
! [X64,X65] : check_cpq(triple(X64,create_slb,X65)),
inference(variable_rename,[status(thm)],[ax36]) ).
cnf(c_0_65,negated_conjecture,
esk2_0 = create_slb,
inference(spm,[status(thm)],[c_0_35,c_0_63]) ).
cnf(c_0_66,plain,
check_cpq(triple(X1,create_slb,X2)),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_67,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_65]),c_0_66])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV404+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n008.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:45:24 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 4.96/1.13 % Version: 3.5.1
% 4.96/1.13 % Preprocessing class: FSMSSMSSSSSNFFN.
% 4.96/1.13 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.96/1.13 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.96/1.13 % Starting new_bool_3 with 300s (1) cores
% 4.96/1.13 % Starting new_bool_1 with 300s (1) cores
% 4.96/1.13 % Starting sh5l with 300s (1) cores
% 4.96/1.13 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 622138 completed with status 0
% 4.96/1.13 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 4.96/1.13 % Preprocessing class: FSMSSMSSSSSNFFN.
% 4.96/1.13 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.96/1.13 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.96/1.13 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.96/1.13 % No SInE strategy applied
% 4.96/1.13 % Search class: FGHSM-FFMF31-MFFFFFNN
% 4.96/1.13 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 4.96/1.13 % Starting SubtermCWHack with 136s (1) cores
% 4.96/1.13 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 4.96/1.13 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 4.96/1.13 % Starting new_bool_3 with 136s (1) cores
% 4.96/1.13 % Starting new_bool_1 with 136s (1) cores
% 4.96/1.13 % new_bool_3 with pid 622148 completed with status 0
% 4.96/1.13 % Result found by new_bool_3
% 4.96/1.13 % Preprocessing class: FSMSSMSSSSSNFFN.
% 4.96/1.13 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.96/1.13 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.96/1.13 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.96/1.13 % No SInE strategy applied
% 4.96/1.13 % Search class: FGHSM-FFMF31-MFFFFFNN
% 4.96/1.13 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 4.96/1.13 % Starting SubtermCWHack with 136s (1) cores
% 4.96/1.13 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 4.96/1.13 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 4.96/1.13 % Starting new_bool_3 with 136s (1) cores
% 4.96/1.13 % Preprocessing time : 0.002 s
% 4.96/1.13 % Presaturation interreduction done
% 4.96/1.13
% 4.96/1.13 % Proof found!
% 4.96/1.13 % SZS status Theorem
% 4.96/1.13 % SZS output start CNFRefutation
% See solution above
% 4.96/1.13 % Parsed axioms : 44
% 4.96/1.13 % Removed by relevancy pruning/SinE : 0
% 4.96/1.13 % Initial clauses : 57
% 4.96/1.13 % Removed in clause preprocessing : 4
% 4.96/1.13 % Initial clauses in saturation : 53
% 4.96/1.13 % Processed clauses : 2942
% 4.96/1.13 % ...of these trivial : 111
% 4.96/1.13 % ...subsumed : 747
% 4.96/1.13 % ...remaining for further processing : 2084
% 4.96/1.13 % Other redundant clauses eliminated : 3
% 4.96/1.13 % Clauses deleted for lack of memory : 0
% 4.96/1.13 % Backward-subsumed : 32
% 4.96/1.13 % Backward-rewritten : 281
% 4.96/1.13 % Generated clauses : 27758
% 4.96/1.13 % ...of the previous two non-redundant : 27400
% 4.96/1.13 % ...aggressively subsumed : 0
% 4.96/1.13 % Contextual simplify-reflections : 4
% 4.96/1.13 % Paramodulations : 27738
% 4.96/1.13 % Factorizations : 15
% 4.96/1.13 % NegExts : 0
% 4.96/1.13 % Equation resolutions : 6
% 4.96/1.13 % Disequality decompositions : 0
% 4.96/1.13 % Total rewrite steps : 6382
% 4.96/1.13 % ...of those cached : 6202
% 4.96/1.13 % Propositional unsat checks : 0
% 4.96/1.13 % Propositional check models : 0
% 4.96/1.13 % Propositional check unsatisfiable : 0
% 4.96/1.13 % Propositional clauses : 0
% 4.96/1.13 % Propositional clauses after purity: 0
% 4.96/1.13 % Propositional unsat core size : 0
% 4.96/1.13 % Propositional preprocessing time : 0.000
% 4.96/1.13 % Propositional encoding time : 0.000
% 4.96/1.13 % Propositional solver time : 0.000
% 4.96/1.13 % Success case prop preproc time : 0.000
% 4.96/1.13 % Success case prop encoding time : 0.000
% 4.96/1.13 % Success case prop solver time : 0.000
% 4.96/1.13 % Current number of processed clauses : 1716
% 4.96/1.13 % Positive orientable unit clauses : 1239
% 4.96/1.13 % Positive unorientable unit clauses: 0
% 4.96/1.13 % Negative unit clauses : 46
% 4.96/1.13 % Non-unit-clauses : 431
% 4.96/1.13 % Current number of unprocessed clauses: 24538
% 4.96/1.13 % ...number of literals in the above : 85852
% 4.96/1.13 % Current number of archived formulas : 0
% 4.96/1.13 % Current number of archived clauses : 368
% 4.96/1.13 % Clause-clause subsumption calls (NU) : 141285
% 4.96/1.13 % Rec. Clause-clause subsumption calls : 22872
% 4.96/1.13 % Non-unit clause-clause subsumptions : 679
% 4.96/1.13 % Unit Clause-clause subsumption calls : 235012
% 4.96/1.13 % Rewrite failures with RHS unbound : 0
% 4.96/1.13 % BW rewrite match attempts : 297363
% 4.96/1.13 % BW rewrite match successes : 1
% 4.96/1.13 % Condensation attempts : 0
% 4.96/1.13 % Condensation successes : 0
% 4.96/1.13 % Termbank termtop insertions : 847314
% 4.96/1.13 % Search garbage collected termcells : 616
% 4.96/1.13
% 4.96/1.13 % -------------------------------------------------
% 4.96/1.13 % User time : 0.600 s
% 4.96/1.13 % System time : 0.032 s
% 4.96/1.13 % Total time : 0.632 s
% 4.96/1.13 % Maximum resident set size: 3380 pages
% 4.96/1.13
% 4.96/1.13 % -------------------------------------------------
% 4.96/1.13 % User time : 3.059 s
% 4.96/1.13 % System time : 0.166 s
% 4.96/1.13 % Total time : 3.226 s
% 4.96/1.13 % Maximum resident set size: 4608 pages
% 4.96/1.13 % E exiting
%------------------------------------------------------------------------------