TSTP Solution File: SWV398+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWV398+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:44:32 EDT 2023
% Result : Theorem 162.16s 21.12s
% Output : CNFRefutation 162.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 11
% Syntax : Number of formulae : 76 ( 10 unt; 0 def)
% Number of atoms : 218 ( 51 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 209 ( 67 ~; 112 |; 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 : 16 ( 16 usr; 5 con; 0-3 aty)
% Number of variables : 223 ( 64 sgn; 76 !; 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/sandbox/tmp/tmp.EagTHRz53s/E---3.1_3549.p',ax47) ).
fof(stricly_smaller_definition,axiom,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( less_than(X1,X2)
& ~ less_than(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.EagTHRz53s/E---3.1_3549.p',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/sandbox/tmp/tmp.EagTHRz53s/E---3.1_3549.p',ax48) ).
fof(totality,axiom,
! [X1,X2] :
( less_than(X1,X2)
| less_than(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.EagTHRz53s/E---3.1_3549.p',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/sandbox/tmp/tmp.EagTHRz53s/E---3.1_3549.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/sandbox/tmp/tmp.EagTHRz53s/E---3.1_3549.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/sandbox/tmp/tmp.EagTHRz53s/E---3.1_3549.p',ax37) ).
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/sandbox/tmp/tmp.EagTHRz53s/E---3.1_3549.p',ax49) ).
fof(reflexivity,axiom,
! [X1] : less_than(X1,X1),
file('/export/starexec/sandbox/tmp/tmp.EagTHRz53s/E---3.1_3549.p',reflexivity) ).
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/sandbox/tmp/tmp.EagTHRz53s/E---3.1_3549.p',l34_l35) ).
fof(ax36,axiom,
! [X1,X2] : check_cpq(triple(X1,create_slb,X2)),
file('/export/starexec/sandbox/tmp/tmp.EagTHRz53s/E---3.1_3549.p',ax36) ).
fof(c_0_11,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_12,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_13,plain,
! [X57,X58,X59] :
( X58 = create_slb
| ~ contains_slb(X58,findmin_pqp_res(X57))
| ~ strictly_less_than(findmin_pqp_res(X57),lookup_slb(X58,findmin_pqp_res(X57)))
| findmin_cpq_eff(triple(X57,X58,X59)) = triple(X57,update_slb(X58,findmin_pqp_res(X57)),bad) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax48])])]) ).
fof(c_0_14,plain,
! [X82,X83,X84] :
( X83 = create_slb
| contains_slb(X83,findmin_pqp_res(X82))
| findmin_cpq_eff(triple(X82,X83,X84)) = triple(X82,update_slb(X83,findmin_pqp_res(X82)),bad) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_11])])]) ).
fof(c_0_15,plain,
! [X51,X52] :
( ( less_than(X51,X52)
| ~ strictly_less_than(X51,X52) )
& ( ~ less_than(X52,X51)
| ~ strictly_less_than(X51,X52) )
& ( ~ less_than(X51,X52)
| less_than(X52,X51)
| strictly_less_than(X51,X52) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])]) ).
fof(c_0_16,plain,
! [X44,X45] :
( less_than(X44,X45)
| less_than(X45,X44) ),
inference(variable_rename,[status(thm)],[totality]) ).
cnf(c_0_17,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_13]) ).
cnf(c_0_18,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_14]) ).
cnf(c_0_19,plain,
( less_than(X2,X1)
| strictly_less_than(X1,X2)
| ~ less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_21,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_22,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_17,c_0_18]) ).
cnf(c_0_23,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1) ),
inference(csr,[status(thm)],[c_0_19,c_0_20]) ).
fof(c_0_24,lemma,
! [X22,X23,X24,X25,X26,X27,X28,X31] :
( ( ~ check_cpq(triple(X22,X23,X24))
| ~ pair_in_list(X23,X25,X26)
| less_than(X26,X25) )
& ( pair_in_list(X28,esk4_2(X27,X28),esk5_2(X27,X28))
| check_cpq(triple(X27,X28,X31)) )
& ( ~ less_than(esk5_2(X27,X28),esk4_2(X27,X28))
| check_cpq(triple(X27,X28,X31)) ) ),
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,
! [X12,X13,X14,X15,X16] :
( ( ~ check_cpq(triple(X12,insert_slb(X13,pair(X15,X16)),X14))
| check_cpq(triple(X12,X13,X14))
| ~ less_than(X16,X15) )
& ( ~ check_cpq(triple(X12,X13,X14))
| check_cpq(triple(X12,insert_slb(X13,pair(X15,X16)),X14))
| ~ less_than(X16,X15) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax37])])]) ).
fof(c_0_26,negated_conjecture,
( ~ check_cpq(triple(esk1_0,esk2_0,esk3_0))
& check_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0))) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])]) ).
cnf(c_0_27,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_22,c_0_23]) ).
cnf(c_0_28,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_29,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]) ).
fof(c_0_30,plain,
! [X85,X86,X87] :
( X86 = create_slb
| ~ contains_slb(X86,findmin_pqp_res(X85))
| ~ less_than(lookup_slb(X86,findmin_pqp_res(X85)),findmin_pqp_res(X85))
| findmin_cpq_eff(triple(X85,X86,X87)) = triple(X85,update_slb(X86,findmin_pqp_res(X85)),X87) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax49])])]) ).
cnf(c_0_31,negated_conjecture,
check_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0))),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_32,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_27,c_0_27]) ).
cnf(c_0_33,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_18,c_0_18]) ).
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_28,c_0_29]) ).
cnf(c_0_35,lemma,
( pair_in_list(X1,esk4_2(X2,X1),esk5_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(esk5_2(X1,X2),esk4_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_37,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_30]) ).
cnf(c_0_38,negated_conjecture,
( esk2_0 = create_slb
| check_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,X1)))
| less_than(lookup_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0)) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_39,negated_conjecture,
( esk2_0 = create_slb
| check_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,X1)))
| contains_slb(esk2_0,findmin_pqp_res(esk1_0)) ),
inference(spm,[status(thm)],[c_0_31,c_0_33]) ).
cnf(c_0_40,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_41,negated_conjecture,
( triple(esk1_0,update_slb(esk2_0,findmin_pqp_res(esk1_0)),X1) = findmin_cpq_eff(triple(esk1_0,esk2_0,X1))
| esk2_0 = create_slb
| check_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,X2))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).
cnf(c_0_42,lemma,
( esk2_0 = create_slb
| check_cpq(triple(X1,insert_slb(update_slb(esk2_0,findmin_pqp_res(esk1_0)),pair(X2,X3)),X4))
| check_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,X5)))
| ~ check_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,X6)))
| ~ less_than(X3,X2) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
fof(c_0_43,plain,
! [X46] : less_than(X46,X46),
inference(variable_rename,[status(thm)],[reflexivity]) ).
cnf(c_0_44,negated_conjecture,
( esk2_0 = create_slb
| check_cpq(triple(X1,insert_slb(update_slb(esk2_0,findmin_pqp_res(esk1_0)),pair(X2,X3)),X4))
| check_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,X5)))
| ~ less_than(X3,X2) ),
inference(spm,[status(thm)],[c_0_42,c_0_31]) ).
cnf(c_0_45,plain,
less_than(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_46,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_47,negated_conjecture,
( esk2_0 = create_slb
| check_cpq(triple(X1,insert_slb(update_slb(esk2_0,findmin_pqp_res(esk1_0)),pair(X2,X2)),X3))
| check_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,X4))) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_48,negated_conjecture,
( esk2_0 = create_slb
| check_cpq(triple(esk1_0,update_slb(esk2_0,findmin_pqp_res(esk1_0)),bad))
| contains_slb(esk2_0,findmin_pqp_res(esk1_0)) ),
inference(spm,[status(thm)],[c_0_39,c_0_18]) ).
cnf(c_0_49,negated_conjecture,
( esk2_0 = create_slb
| check_cpq(triple(X1,update_slb(esk2_0,findmin_pqp_res(esk1_0)),X2))
| check_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,X3))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_45])]) ).
cnf(c_0_50,lemma,
( esk2_0 = create_slb
| contains_slb(esk2_0,findmin_pqp_res(esk1_0))
| less_than(X1,X2)
| ~ pair_in_list(update_slb(esk2_0,findmin_pqp_res(esk1_0)),X2,X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_48]) ).
cnf(c_0_51,negated_conjecture,
( esk2_0 = create_slb
| check_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,X1)))
| check_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,X2)))
| check_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,X3))) ),
inference(spm,[status(thm)],[c_0_49,c_0_41]) ).
cnf(c_0_52,negated_conjecture,
( esk2_0 = create_slb
| check_cpq(triple(esk1_0,update_slb(esk2_0,findmin_pqp_res(esk1_0)),bad))
| less_than(lookup_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0)) ),
inference(spm,[status(thm)],[c_0_38,c_0_27]) ).
cnf(c_0_53,lemma,
( esk2_0 = create_slb
| check_cpq(triple(X1,update_slb(esk2_0,findmin_pqp_res(esk1_0)),X2))
| contains_slb(esk2_0,findmin_pqp_res(esk1_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_35]),c_0_36]) ).
cnf(c_0_54,negated_conjecture,
( esk2_0 = create_slb
| check_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,X1)))
| check_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,X2))) ),
inference(ef,[status(thm)],[c_0_51]) ).
cnf(c_0_55,negated_conjecture,
( triple(esk1_0,update_slb(esk2_0,findmin_pqp_res(esk1_0)),X1) = findmin_cpq_eff(triple(esk1_0,esk2_0,X1))
| esk2_0 = create_slb
| check_cpq(triple(esk1_0,update_slb(esk2_0,findmin_pqp_res(esk1_0)),bad)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_52]),c_0_53]) ).
cnf(c_0_56,negated_conjecture,
( esk2_0 = create_slb
| check_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,X1))) ),
inference(ef,[status(thm)],[c_0_54]) ).
fof(c_0_57,lemma,
! [X60,X61,X62,X63] :
( ( pair_in_list(update_slb(X60,X63),esk6_2(X60,X63),esk7_2(X60,X63))
| ~ pair_in_list(X60,X61,X62)
| ~ strictly_less_than(X61,X62) )
& ( strictly_less_than(esk6_2(X60,X63),esk7_2(X60,X63))
| ~ pair_in_list(X60,X61,X62)
| ~ strictly_less_than(X61,X62) ) ),
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_58,lemma,
( esk2_0 = create_slb
| check_cpq(triple(X1,insert_slb(update_slb(esk2_0,findmin_pqp_res(esk1_0)),pair(X2,X3)),X4))
| ~ less_than(X3,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_55]),c_0_56]),c_0_40]) ).
cnf(c_0_59,lemma,
( strictly_less_than(esk6_2(X1,X2),esk7_2(X1,X2))
| ~ pair_in_list(X1,X3,X4)
| ~ strictly_less_than(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_60,lemma,
( esk2_0 = create_slb
| check_cpq(triple(X1,insert_slb(update_slb(esk2_0,findmin_pqp_res(esk1_0)),pair(X2,X2)),X3)) ),
inference(spm,[status(thm)],[c_0_58,c_0_45]) ).
cnf(c_0_61,lemma,
( pair_in_list(update_slb(X1,X2),esk6_2(X1,X2),esk7_2(X1,X2))
| ~ pair_in_list(X1,X3,X4)
| ~ strictly_less_than(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_62,lemma,
( check_cpq(triple(X1,X2,X3))
| strictly_less_than(esk6_2(X2,X4),esk7_2(X2,X4))
| ~ strictly_less_than(esk4_2(X1,X2),esk5_2(X1,X2)) ),
inference(spm,[status(thm)],[c_0_59,c_0_35]) ).
cnf(c_0_63,lemma,
( esk2_0 = create_slb
| check_cpq(triple(X1,update_slb(esk2_0,findmin_pqp_res(esk1_0)),X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_60]),c_0_45])]) ).
cnf(c_0_64,lemma,
( check_cpq(triple(X1,X2,X3))
| pair_in_list(update_slb(X2,X4),esk6_2(X2,X4),esk7_2(X2,X4))
| ~ strictly_less_than(esk4_2(X1,X2),esk5_2(X1,X2)) ),
inference(spm,[status(thm)],[c_0_61,c_0_35]) ).
cnf(c_0_65,plain,
( ~ less_than(X1,X2)
| ~ strictly_less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_66,lemma,
( check_cpq(triple(X1,X2,X3))
| strictly_less_than(esk6_2(X2,X4),esk7_2(X2,X4)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_23]),c_0_36]) ).
cnf(c_0_67,lemma,
( esk2_0 = create_slb
| less_than(X1,X2)
| ~ pair_in_list(update_slb(esk2_0,findmin_pqp_res(esk1_0)),X2,X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_63]) ).
cnf(c_0_68,lemma,
( check_cpq(triple(X1,X2,X3))
| pair_in_list(update_slb(X2,X4),esk6_2(X2,X4),esk7_2(X2,X4)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_23]),c_0_36]) ).
cnf(c_0_69,lemma,
( check_cpq(triple(X1,X2,X3))
| ~ less_than(esk7_2(X2,X4),esk6_2(X2,X4)) ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_70,negated_conjecture,
~ check_cpq(triple(esk1_0,esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_71,lemma,
( esk2_0 = create_slb
| check_cpq(triple(X1,esk2_0,X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_69]) ).
fof(c_0_72,plain,
! [X10,X11] : check_cpq(triple(X10,create_slb,X11)),
inference(variable_rename,[status(thm)],[ax36]) ).
cnf(c_0_73,negated_conjecture,
esk2_0 = create_slb,
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_74,plain,
check_cpq(triple(X1,create_slb,X2)),
inference(split_conjunct,[status(thm)],[c_0_72]) ).
cnf(c_0_75,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_73]),c_0_74])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SWV398+1 : TPTP v8.1.2. Released v3.3.0.
% 0.11/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n022.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 2400
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue Oct 3 04:04:54 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.22/0.50 Running first-order theorem proving
% 0.22/0.50 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/tmp/tmp.EagTHRz53s/E---3.1_3549.p
% 162.16/21.12 # Version: 3.1pre001
% 162.16/21.12 # Preprocessing class: FSMSSMSSSSSNFFN.
% 162.16/21.12 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 162.16/21.12 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 162.16/21.12 # Starting new_bool_3 with 300s (1) cores
% 162.16/21.12 # Starting new_bool_1 with 300s (1) cores
% 162.16/21.12 # Starting sh5l with 300s (1) cores
% 162.16/21.12 # new_bool_1 with pid 3658 completed with status 0
% 162.16/21.12 # Result found by new_bool_1
% 162.16/21.12 # Preprocessing class: FSMSSMSSSSSNFFN.
% 162.16/21.12 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 162.16/21.12 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 162.16/21.12 # Starting new_bool_3 with 300s (1) cores
% 162.16/21.12 # Starting new_bool_1 with 300s (1) cores
% 162.16/21.12 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 162.16/21.12 # Search class: FGHSM-FFMF31-MFFFFFNN
% 162.16/21.12 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 162.16/21.12 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 181s (1) cores
% 162.16/21.12 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with pid 3664 completed with status 0
% 162.16/21.12 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN
% 162.16/21.12 # Preprocessing class: FSMSSMSSSSSNFFN.
% 162.16/21.12 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 162.16/21.12 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 162.16/21.12 # Starting new_bool_3 with 300s (1) cores
% 162.16/21.12 # Starting new_bool_1 with 300s (1) cores
% 162.16/21.12 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 162.16/21.12 # Search class: FGHSM-FFMF31-MFFFFFNN
% 162.16/21.12 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 162.16/21.12 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 181s (1) cores
% 162.16/21.12 # Preprocessing time : 0.002 s
% 162.16/21.12 # Presaturation interreduction done
% 162.16/21.12
% 162.16/21.12 # Proof found!
% 162.16/21.12 # SZS status Theorem
% 162.16/21.12 # SZS output start CNFRefutation
% See solution above
% 162.16/21.12 # Parsed axioms : 44
% 162.16/21.12 # Removed by relevancy pruning/SinE : 16
% 162.16/21.12 # Initial clauses : 40
% 162.16/21.12 # Removed in clause preprocessing : 0
% 162.16/21.12 # Initial clauses in saturation : 40
% 162.16/21.12 # Processed clauses : 22844
% 162.16/21.12 # ...of these trivial : 2
% 162.16/21.12 # ...subsumed : 18215
% 162.16/21.12 # ...remaining for further processing : 4627
% 162.16/21.12 # Other redundant clauses eliminated : 11
% 162.16/21.12 # Clauses deleted for lack of memory : 0
% 162.16/21.12 # Backward-subsumed : 404
% 162.16/21.12 # Backward-rewritten : 151
% 162.16/21.12 # Generated clauses : 977160
% 162.16/21.12 # ...of the previous two non-redundant : 967252
% 162.16/21.12 # ...aggressively subsumed : 0
% 162.16/21.12 # Contextual simplify-reflections : 98
% 162.16/21.12 # Paramodulations : 972802
% 162.16/21.12 # Factorizations : 4348
% 162.16/21.12 # NegExts : 0
% 162.16/21.12 # Equation resolutions : 11
% 162.16/21.12 # Total rewrite steps : 32028
% 162.16/21.12 # Propositional unsat checks : 0
% 162.16/21.12 # Propositional check models : 0
% 162.16/21.12 # Propositional check unsatisfiable : 0
% 162.16/21.12 # Propositional clauses : 0
% 162.16/21.12 # Propositional clauses after purity: 0
% 162.16/21.12 # Propositional unsat core size : 0
% 162.16/21.12 # Propositional preprocessing time : 0.000
% 162.16/21.12 # Propositional encoding time : 0.000
% 162.16/21.12 # Propositional solver time : 0.000
% 162.16/21.12 # Success case prop preproc time : 0.000
% 162.16/21.12 # Success case prop encoding time : 0.000
% 162.16/21.12 # Success case prop solver time : 0.000
% 162.16/21.12 # Current number of processed clauses : 4030
% 162.16/21.12 # Positive orientable unit clauses : 14
% 162.16/21.12 # Positive unorientable unit clauses: 0
% 162.16/21.12 # Negative unit clauses : 4
% 162.16/21.12 # Non-unit-clauses : 4012
% 162.16/21.12 # Current number of unprocessed clauses: 942297
% 162.16/21.12 # ...number of literals in the above : 6858822
% 162.16/21.12 # Current number of archived formulas : 0
% 162.16/21.12 # Current number of archived clauses : 595
% 162.16/21.12 # Clause-clause subsumption calls (NU) : 4420077
% 162.16/21.12 # Rec. Clause-clause subsumption calls : 677994
% 162.16/21.12 # Non-unit clause-clause subsumptions : 16959
% 162.16/21.12 # Unit Clause-clause subsumption calls : 1444
% 162.16/21.12 # Rewrite failures with RHS unbound : 0
% 162.16/21.12 # BW rewrite match attempts : 33
% 162.16/21.12 # BW rewrite match successes : 4
% 162.16/21.12 # Condensation attempts : 0
% 162.16/21.12 # Condensation successes : 0
% 162.16/21.12 # Termbank termtop insertions : 25762478
% 162.16/21.12
% 162.16/21.12 # -------------------------------------------------
% 162.16/21.12 # User time : 19.489 s
% 162.16/21.12 # System time : 0.604 s
% 162.16/21.12 # Total time : 20.092 s
% 162.16/21.12 # Maximum resident set size: 1852 pages
% 162.16/21.12
% 162.16/21.12 # -------------------------------------------------
% 162.16/21.12 # User time : 19.489 s
% 162.16/21.12 # System time : 0.609 s
% 162.16/21.12 # Total time : 20.097 s
% 162.16/21.12 # Maximum resident set size: 1724 pages
% 162.16/21.12 % E---3.1 exiting
% 162.16/21.12 % E---3.1 exiting
%------------------------------------------------------------------------------