TSTP Solution File: SWV407+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWV407+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 09:52:59 EDT 2024
% Result : Theorem 75.17s 9.89s
% Output : CNFRefutation 75.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 31
% Number of leaves : 12
% Syntax : Number of formulae : 86 ( 11 unt; 0 def)
% Number of atoms : 255 ( 76 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 240 ( 71 ~; 127 |; 25 &)
% ( 4 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 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 : 186 ( 35 sgn 98 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax47,axiom,
! [X1,X2,X3,X4] :
( ( X2 != create_slb
& ~ contains_slb(X2,findmin_pqp_res(X1)) )
=> findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad) ),
file('/export/starexec/sandbox2/tmp/tmp.kPhcKTseOC/E---3.1_13877.p',ax47) ).
fof(l43_co,conjecture,
! [X1,X2,X3] :
( ? [X4] :
( contains_cpq(triple(X1,X2,X3),X4)
& strictly_less_than(X4,findmin_cpq_res(triple(X1,X2,X3))) )
=> ~ check_cpq(findmin_cpq_eff(triple(X1,X2,X3))) ),
file('/export/starexec/sandbox2/tmp/tmp.kPhcKTseOC/E---3.1_13877.p',l43_co) ).
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/tmp/tmp.kPhcKTseOC/E---3.1_13877.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/tmp/tmp.kPhcKTseOC/E---3.1_13877.p',ax39) ).
fof(stricly_smaller_definition,axiom,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( less_than(X1,X2)
& ~ less_than(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.kPhcKTseOC/E---3.1_13877.p',stricly_smaller_definition) ).
fof(l43_l44,lemma,
! [X1,X2,X3,X4] :
( ( contains_slb(X2,X4)
& strictly_less_than(X4,findmin_cpq_res(triple(X1,X2,X3))) )
=> ( pair_in_list(update_slb(X2,findmin_pqp_res(X1)),X4,findmin_pqp_res(X1))
| ? [X5] :
( pair_in_list(update_slb(X2,findmin_pqp_res(X1)),X4,X5)
& less_than(findmin_pqp_res(X1),X5) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.kPhcKTseOC/E---3.1_13877.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/tmp/tmp.kPhcKTseOC/E---3.1_13877.p',ax51) ).
fof(transitivity,axiom,
! [X1,X2,X3] :
( ( less_than(X1,X2)
& less_than(X2,X3) )
=> less_than(X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.kPhcKTseOC/E---3.1_13877.p',transitivity) ).
fof(ax48,axiom,
! [X1,X2,X3,X4] :
( ( X2 != create_slb
& contains_slb(X2,findmin_pqp_res(X1))
& strictly_less_than(findmin_pqp_res(X1),lookup_slb(X2,findmin_pqp_res(X1))) )
=> findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad) ),
file('/export/starexec/sandbox2/tmp/tmp.kPhcKTseOC/E---3.1_13877.p',ax48) ).
fof(ax49,axiom,
! [X1,X2,X3,X4] :
( ( X2 != create_slb
& contains_slb(X2,findmin_pqp_res(X1))
& less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1)) )
=> findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),X3) ),
file('/export/starexec/sandbox2/tmp/tmp.kPhcKTseOC/E---3.1_13877.p',ax49) ).
fof(totality,axiom,
! [X1,X2] :
( less_than(X1,X2)
| less_than(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.kPhcKTseOC/E---3.1_13877.p',totality) ).
fof(ax20,axiom,
! [X1] : ~ contains_slb(create_slb,X1),
file('/export/starexec/sandbox2/tmp/tmp.kPhcKTseOC/E---3.1_13877.p',ax20) ).
fof(c_0_12,plain,
! [X1,X2,X3,X4] :
( ( X2 != create_slb
& ~ contains_slb(X2,findmin_pqp_res(X1)) )
=> findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad) ),
inference(fof_simplification,[status(thm)],[ax47]) ).
fof(c_0_13,negated_conjecture,
~ ! [X1,X2,X3] :
( ? [X4] :
( contains_cpq(triple(X1,X2,X3),X4)
& strictly_less_than(X4,findmin_cpq_res(triple(X1,X2,X3))) )
=> ~ check_cpq(findmin_cpq_eff(triple(X1,X2,X3))) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[l43_co])]) ).
fof(c_0_14,lemma,
! [X119,X120,X121,X122,X123,X124,X125,X128] :
( ( ~ check_cpq(triple(X119,X120,X121))
| ~ pair_in_list(X120,X122,X123)
| less_than(X123,X122) )
& ( pair_in_list(X125,esk1_2(X124,X125),esk2_2(X124,X125))
| check_cpq(triple(X124,X125,X128)) )
& ( ~ less_than(esk2_2(X124,X125),esk1_2(X124,X125))
| check_cpq(triple(X124,X125,X128)) ) ),
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_15,plain,
! [X103,X104,X105] :
( X104 = create_slb
| contains_slb(X104,findmin_pqp_res(X103))
| findmin_cpq_eff(triple(X103,X104,X105)) = triple(X103,update_slb(X104,findmin_pqp_res(X103)),bad) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_12])])]) ).
fof(c_0_16,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_17,negated_conjecture,
( contains_cpq(triple(esk4_0,esk5_0,esk6_0),esk7_0)
& strictly_less_than(esk7_0,findmin_cpq_res(triple(esk4_0,esk5_0,esk6_0)))
& check_cpq(findmin_cpq_eff(triple(esk4_0,esk5_0,esk6_0))) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).
fof(c_0_18,plain,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( less_than(X1,X2)
& ~ less_than(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[stricly_smaller_definition]) ).
cnf(c_0_19,lemma,
( less_than(X5,X4)
| ~ check_cpq(triple(X1,X2,X3))
| ~ pair_in_list(X2,X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( X1 = create_slb
| contains_slb(X1,findmin_pqp_res(X2))
| findmin_cpq_eff(triple(X2,X1,X3)) = triple(X2,update_slb(X1,findmin_pqp_res(X2)),bad) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_21,lemma,
! [X129,X130,X131,X132] :
( ( pair_in_list(update_slb(X130,findmin_pqp_res(X129)),X132,esk3_4(X129,X130,X131,X132))
| pair_in_list(update_slb(X130,findmin_pqp_res(X129)),X132,findmin_pqp_res(X129))
| ~ contains_slb(X130,X132)
| ~ strictly_less_than(X132,findmin_cpq_res(triple(X129,X130,X131))) )
& ( less_than(findmin_pqp_res(X129),esk3_4(X129,X130,X131,X132))
| pair_in_list(update_slb(X130,findmin_pqp_res(X129)),X132,findmin_pqp_res(X129))
| ~ contains_slb(X130,X132)
| ~ strictly_less_than(X132,findmin_cpq_res(triple(X129,X130,X131))) ) ),
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_22,plain,
( contains_slb(X2,X4)
| ~ contains_cpq(triple(X1,X2,X3),X4) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,negated_conjecture,
contains_cpq(triple(esk4_0,esk5_0,esk6_0),esk7_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_24,plain,
! [X12,X13] :
( ( less_than(X12,X13)
| ~ strictly_less_than(X12,X13) )
& ( ~ less_than(X13,X12)
| ~ strictly_less_than(X12,X13) )
& ( ~ less_than(X12,X13)
| less_than(X13,X12)
| strictly_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_18])])])]) ).
fof(c_0_25,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_26,lemma,
( X1 = create_slb
| contains_slb(X1,findmin_pqp_res(X2))
| less_than(X3,X4)
| ~ check_cpq(findmin_cpq_eff(triple(X2,X1,X5)))
| ~ pair_in_list(update_slb(X1,findmin_pqp_res(X2)),X4,X3) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,negated_conjecture,
check_cpq(findmin_cpq_eff(triple(esk4_0,esk5_0,esk6_0))),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_28,lemma,
( pair_in_list(update_slb(X1,findmin_pqp_res(X2)),X3,esk3_4(X2,X1,X4,X3))
| pair_in_list(update_slb(X1,findmin_pqp_res(X2)),X3,findmin_pqp_res(X2))
| ~ contains_slb(X1,X3)
| ~ strictly_less_than(X3,findmin_cpq_res(triple(X2,X1,X4))) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_29,negated_conjecture,
strictly_less_than(esk7_0,findmin_cpq_res(triple(esk4_0,esk5_0,esk6_0))),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_30,negated_conjecture,
contains_slb(esk5_0,esk7_0),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_31,plain,
( ~ less_than(X1,X2)
| ~ strictly_less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_32,plain,
! [X114,X115,X116] :
( X115 = create_slb
| findmin_cpq_res(triple(X114,X115,X116)) = findmin_pqp_res(X114) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_25])])]) ).
cnf(c_0_33,negated_conjecture,
( esk5_0 = create_slb
| contains_slb(esk5_0,findmin_pqp_res(esk4_0))
| less_than(X1,X2)
| ~ pair_in_list(update_slb(esk5_0,findmin_pqp_res(esk4_0)),X2,X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_34,negated_conjecture,
( pair_in_list(update_slb(esk5_0,findmin_pqp_res(esk4_0)),esk7_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_28,c_0_29]),c_0_30])]) ).
cnf(c_0_35,negated_conjecture,
~ less_than(findmin_cpq_res(triple(esk4_0,esk5_0,esk6_0)),esk7_0),
inference(spm,[status(thm)],[c_0_31,c_0_29]) ).
cnf(c_0_36,plain,
( X1 = create_slb
| findmin_cpq_res(triple(X2,X1,X3)) = findmin_pqp_res(X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
fof(c_0_37,plain,
! [X6,X7,X8] :
( ~ less_than(X6,X7)
| ~ less_than(X7,X8)
| less_than(X6,X8) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[transitivity])])]) ).
cnf(c_0_38,negated_conjecture,
( esk5_0 = create_slb
| pair_in_list(update_slb(esk5_0,findmin_pqp_res(esk4_0)),esk7_0,findmin_pqp_res(esk4_0))
| contains_slb(esk5_0,findmin_pqp_res(esk4_0))
| less_than(esk3_4(esk4_0,esk5_0,esk6_0,esk7_0),esk7_0) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,negated_conjecture,
( esk5_0 = create_slb
| ~ less_than(findmin_pqp_res(esk4_0),esk7_0) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,lemma,
( less_than(findmin_pqp_res(X1),esk3_4(X1,X2,X3,X4))
| pair_in_list(update_slb(X2,findmin_pqp_res(X1)),X4,findmin_pqp_res(X1))
| ~ contains_slb(X2,X4)
| ~ strictly_less_than(X4,findmin_cpq_res(triple(X1,X2,X3))) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_41,plain,
! [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) ),
inference(fof_simplification,[status(thm)],[ax48]) ).
fof(c_0_42,plain,
! [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) ),
inference(fof_simplification,[status(thm)],[ax49]) ).
cnf(c_0_43,plain,
( less_than(X1,X3)
| ~ less_than(X1,X2)
| ~ less_than(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_44,negated_conjecture,
( esk5_0 = create_slb
| contains_slb(esk5_0,findmin_pqp_res(esk4_0))
| less_than(esk3_4(esk4_0,esk5_0,esk6_0,esk7_0),esk7_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_38]),c_0_39]) ).
cnf(c_0_45,negated_conjecture,
( pair_in_list(update_slb(esk5_0,findmin_pqp_res(esk4_0)),esk7_0,findmin_pqp_res(esk4_0))
| less_than(findmin_pqp_res(esk4_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_40,c_0_29]),c_0_30])]) ).
fof(c_0_46,plain,
! [X106,X107,X108] :
( X107 = create_slb
| ~ contains_slb(X107,findmin_pqp_res(X106))
| ~ strictly_less_than(findmin_pqp_res(X106),lookup_slb(X107,findmin_pqp_res(X106)))
| findmin_cpq_eff(triple(X106,X107,X108)) = triple(X106,update_slb(X107,findmin_pqp_res(X106)),bad) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_41])])])]) ).
fof(c_0_47,plain,
! [X9,X10] :
( less_than(X9,X10)
| less_than(X10,X9) ),
inference(variable_rename,[status(thm)],[totality]) ).
fof(c_0_48,plain,
! [X109,X110,X111] :
( X110 = create_slb
| ~ contains_slb(X110,findmin_pqp_res(X109))
| ~ less_than(lookup_slb(X110,findmin_pqp_res(X109)),findmin_pqp_res(X109))
| findmin_cpq_eff(triple(X109,X110,X111)) = triple(X109,update_slb(X110,findmin_pqp_res(X109)),X111) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_42])])])]) ).
cnf(c_0_49,negated_conjecture,
( esk5_0 = create_slb
| contains_slb(esk5_0,findmin_pqp_res(esk4_0))
| less_than(X1,esk7_0)
| ~ less_than(X1,esk3_4(esk4_0,esk5_0,esk6_0,esk7_0)) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_50,negated_conjecture,
( esk5_0 = create_slb
| contains_slb(esk5_0,findmin_pqp_res(esk4_0))
| less_than(findmin_pqp_res(esk4_0),esk3_4(esk4_0,esk5_0,esk6_0,esk7_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_45]),c_0_39]) ).
cnf(c_0_51,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_46]) ).
cnf(c_0_52,plain,
( less_than(X2,X1)
| strictly_less_than(X1,X2)
| ~ less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_53,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_54,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_48]) ).
cnf(c_0_55,negated_conjecture,
( esk5_0 = create_slb
| contains_slb(esk5_0,findmin_pqp_res(esk4_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_39]) ).
cnf(c_0_56,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_51,c_0_20]) ).
cnf(c_0_57,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1) ),
inference(csr,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_58,negated_conjecture,
( triple(esk4_0,update_slb(esk5_0,findmin_pqp_res(esk4_0)),X1) = findmin_cpq_eff(triple(esk4_0,esk5_0,X1))
| esk5_0 = create_slb
| ~ less_than(lookup_slb(esk5_0,findmin_pqp_res(esk4_0)),findmin_pqp_res(esk4_0)) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_59,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_56,c_0_57]) ).
cnf(c_0_60,negated_conjecture,
( findmin_cpq_eff(triple(esk4_0,esk5_0,X1)) = triple(esk4_0,update_slb(esk5_0,findmin_pqp_res(esk4_0)),bad)
| triple(esk4_0,update_slb(esk5_0,findmin_pqp_res(esk4_0)),X2) = findmin_cpq_eff(triple(esk4_0,esk5_0,X2))
| esk5_0 = create_slb ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_61,negated_conjecture,
( triple(esk4_0,update_slb(esk5_0,findmin_pqp_res(esk4_0)),bad) = findmin_cpq_eff(triple(esk4_0,esk5_0,bad))
| esk5_0 = create_slb
| findmin_cpq_eff(triple(esk4_0,esk5_0,X1)) != findmin_cpq_eff(triple(esk4_0,esk5_0,bad)) ),
inference(ef,[status(thm)],[c_0_60]) ).
cnf(c_0_62,negated_conjecture,
( triple(esk4_0,update_slb(esk5_0,findmin_pqp_res(esk4_0)),bad) = findmin_cpq_eff(triple(esk4_0,esk5_0,bad))
| esk5_0 = create_slb ),
inference(er,[status(thm)],[c_0_61]) ).
cnf(c_0_63,negated_conjecture,
( findmin_cpq_eff(triple(esk4_0,esk5_0,X1)) = findmin_cpq_eff(triple(esk4_0,esk5_0,bad))
| esk5_0 = create_slb
| less_than(lookup_slb(esk5_0,findmin_pqp_res(esk4_0)),findmin_pqp_res(esk4_0)) ),
inference(spm,[status(thm)],[c_0_59,c_0_62]) ).
cnf(c_0_64,negated_conjecture,
( findmin_cpq_eff(triple(esk4_0,esk5_0,X1)) = findmin_cpq_eff(triple(esk4_0,esk5_0,X2))
| esk5_0 = create_slb
| less_than(lookup_slb(esk5_0,findmin_pqp_res(esk4_0)),findmin_pqp_res(esk4_0)) ),
inference(spm,[status(thm)],[c_0_63,c_0_63]) ).
cnf(c_0_65,negated_conjecture,
( esk5_0 = create_slb
| check_cpq(findmin_cpq_eff(triple(esk4_0,esk5_0,X1)))
| less_than(lookup_slb(esk5_0,findmin_pqp_res(esk4_0)),findmin_pqp_res(esk4_0)) ),
inference(spm,[status(thm)],[c_0_27,c_0_64]) ).
cnf(c_0_66,negated_conjecture,
( triple(esk4_0,update_slb(esk5_0,findmin_pqp_res(esk4_0)),X1) = findmin_cpq_eff(triple(esk4_0,esk5_0,X1))
| esk5_0 = create_slb
| check_cpq(findmin_cpq_eff(triple(esk4_0,esk5_0,X2))) ),
inference(spm,[status(thm)],[c_0_58,c_0_65]) ).
cnf(c_0_67,lemma,
( esk5_0 = create_slb
| check_cpq(findmin_cpq_eff(triple(esk4_0,esk5_0,X1)))
| less_than(X2,X3)
| ~ check_cpq(findmin_cpq_eff(triple(esk4_0,esk5_0,X4)))
| ~ pair_in_list(update_slb(esk5_0,findmin_pqp_res(esk4_0)),X3,X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_66]) ).
cnf(c_0_68,negated_conjecture,
( esk5_0 = create_slb
| check_cpq(findmin_cpq_eff(triple(esk4_0,esk5_0,X1)))
| less_than(X2,X3)
| ~ pair_in_list(update_slb(esk5_0,findmin_pqp_res(esk4_0)),X3,X2) ),
inference(spm,[status(thm)],[c_0_67,c_0_27]) ).
cnf(c_0_69,negated_conjecture,
( esk5_0 = create_slb
| check_cpq(findmin_cpq_eff(triple(esk4_0,esk5_0,X1)))
| pair_in_list(update_slb(esk5_0,findmin_pqp_res(esk4_0)),esk7_0,findmin_pqp_res(esk4_0))
| less_than(esk3_4(esk4_0,esk5_0,esk6_0,esk7_0),esk7_0) ),
inference(spm,[status(thm)],[c_0_68,c_0_34]) ).
cnf(c_0_70,negated_conjecture,
( esk5_0 = create_slb
| check_cpq(findmin_cpq_eff(triple(esk4_0,esk5_0,X1)))
| check_cpq(findmin_cpq_eff(triple(esk4_0,esk5_0,X2)))
| less_than(esk3_4(esk4_0,esk5_0,esk6_0,esk7_0),esk7_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_39]) ).
cnf(c_0_71,lemma,
( esk5_0 = create_slb
| less_than(X1,X2)
| ~ check_cpq(findmin_cpq_eff(triple(esk4_0,esk5_0,bad)))
| ~ pair_in_list(update_slb(esk5_0,findmin_pqp_res(esk4_0)),X2,X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_62]) ).
cnf(c_0_72,negated_conjecture,
( esk5_0 = create_slb
| check_cpq(findmin_cpq_eff(triple(esk4_0,esk5_0,X1)))
| less_than(esk3_4(esk4_0,esk5_0,esk6_0,esk7_0),esk7_0) ),
inference(ef,[status(thm)],[c_0_70]) ).
cnf(c_0_73,lemma,
( esk5_0 = create_slb
| less_than(esk3_4(esk4_0,esk5_0,esk6_0,esk7_0),esk7_0)
| less_than(X1,X2)
| ~ pair_in_list(update_slb(esk5_0,findmin_pqp_res(esk4_0)),X2,X1) ),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_74,negated_conjecture,
( esk5_0 = create_slb
| pair_in_list(update_slb(esk5_0,findmin_pqp_res(esk4_0)),esk7_0,findmin_pqp_res(esk4_0))
| less_than(esk3_4(esk4_0,esk5_0,esk6_0,esk7_0),esk7_0) ),
inference(spm,[status(thm)],[c_0_73,c_0_34]) ).
cnf(c_0_75,lemma,
( esk5_0 = create_slb
| less_than(esk3_4(esk4_0,esk5_0,esk6_0,esk7_0),esk7_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_39]) ).
cnf(c_0_76,lemma,
( esk5_0 = create_slb
| less_than(X1,esk7_0)
| ~ less_than(X1,esk3_4(esk4_0,esk5_0,esk6_0,esk7_0)) ),
inference(spm,[status(thm)],[c_0_43,c_0_75]) ).
cnf(c_0_77,negated_conjecture,
( esk5_0 = create_slb
| check_cpq(findmin_cpq_eff(triple(esk4_0,esk5_0,X1)))
| less_than(findmin_pqp_res(esk4_0),esk3_4(esk4_0,esk5_0,esk6_0,esk7_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_45]),c_0_39]) ).
cnf(c_0_78,negated_conjecture,
( esk5_0 = create_slb
| check_cpq(findmin_cpq_eff(triple(esk4_0,esk5_0,X1))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_39]) ).
cnf(c_0_79,lemma,
( esk5_0 = create_slb
| less_than(X1,X2)
| ~ pair_in_list(update_slb(esk5_0,findmin_pqp_res(esk4_0)),X2,X1) ),
inference(spm,[status(thm)],[c_0_71,c_0_78]) ).
fof(c_0_80,plain,
! [X1] : ~ contains_slb(create_slb,X1),
inference(fof_simplification,[status(thm)],[ax20]) ).
cnf(c_0_81,negated_conjecture,
( esk5_0 = create_slb
| less_than(findmin_pqp_res(esk4_0),esk3_4(esk4_0,esk5_0,esk6_0,esk7_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_45]),c_0_39]) ).
fof(c_0_82,plain,
! [X18] : ~ contains_slb(create_slb,X18),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_80])]) ).
cnf(c_0_83,lemma,
esk5_0 = create_slb,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_81]),c_0_39]) ).
cnf(c_0_84,plain,
~ contains_slb(create_slb,X1),
inference(split_conjunct,[status(thm)],[c_0_82]) ).
cnf(c_0_85,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_83]),c_0_84]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : SWV407+1 : TPTP v8.1.2. Released v3.3.0.
% 0.02/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n020.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Fri May 3 16:47:08 EDT 2024
% 0.16/0.31 % CPUTime :
% 0.16/0.42 Running first-order model finding
% 0.16/0.42 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.kPhcKTseOC/E---3.1_13877.p
% 75.17/9.89 # Version: 3.1.0
% 75.17/9.89 # Preprocessing class: FSLSSMSSSSSNFFN.
% 75.17/9.89 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 75.17/9.89 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 75.17/9.89 # Starting new_bool_3 with 300s (1) cores
% 75.17/9.89 # Starting new_bool_1 with 300s (1) cores
% 75.17/9.89 # Starting sh5l with 300s (1) cores
% 75.17/9.89 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 13954 completed with status 0
% 75.17/9.89 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 75.17/9.89 # Preprocessing class: FSLSSMSSSSSNFFN.
% 75.17/9.89 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 75.17/9.89 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 75.17/9.89 # No SInE strategy applied
% 75.17/9.89 # Search class: FGHSM-FFMS32-MFFFFFNN
% 75.17/9.89 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 75.17/9.89 # Starting SAT001_MinMin_p005000_rr_RG with 450s (1) cores
% 75.17/9.89 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 75.17/9.89 # Starting new_bool_3 with 226s (1) cores
% 75.17/9.89 # Starting new_bool_1 with 226s (1) cores
% 75.17/9.89 # Starting sh5l with 226s (1) cores
% 75.17/9.89 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 13961 completed with status 0
% 75.17/9.89 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 75.17/9.89 # Preprocessing class: FSLSSMSSSSSNFFN.
% 75.17/9.89 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 75.17/9.89 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 75.17/9.89 # No SInE strategy applied
% 75.17/9.89 # Search class: FGHSM-FFMS32-MFFFFFNN
% 75.17/9.89 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 75.17/9.89 # Starting SAT001_MinMin_p005000_rr_RG with 450s (1) cores
% 75.17/9.89 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 75.17/9.89 # Preprocessing time : 0.002 s
% 75.17/9.89 # Presaturation interreduction done
% 75.17/9.89
% 75.17/9.89 # Proof found!
% 75.17/9.89 # SZS status Theorem
% 75.17/9.89 # SZS output start CNFRefutation
% See solution above
% 75.17/9.89 # Parsed axioms : 44
% 75.17/9.89 # Removed by relevancy pruning/SinE : 0
% 75.17/9.89 # Initial clauses : 60
% 75.17/9.89 # Removed in clause preprocessing : 4
% 75.17/9.89 # Initial clauses in saturation : 56
% 75.17/9.89 # Processed clauses : 10916
% 75.17/9.89 # ...of these trivial : 329
% 75.17/9.89 # ...subsumed : 4093
% 75.17/9.89 # ...remaining for further processing : 6494
% 75.17/9.89 # Other redundant clauses eliminated : 3
% 75.17/9.89 # Clauses deleted for lack of memory : 0
% 75.17/9.89 # Backward-subsumed : 304
% 75.17/9.89 # Backward-rewritten : 1329
% 75.17/9.89 # Generated clauses : 385757
% 75.17/9.89 # ...of the previous two non-redundant : 377901
% 75.17/9.89 # ...aggressively subsumed : 0
% 75.17/9.89 # Contextual simplify-reflections : 110
% 75.17/9.89 # Paramodulations : 385507
% 75.17/9.89 # Factorizations : 245
% 75.17/9.89 # NegExts : 0
% 75.17/9.89 # Equation resolutions : 6
% 75.17/9.89 # Disequality decompositions : 0
% 75.17/9.89 # Total rewrite steps : 33917
% 75.17/9.89 # ...of those cached : 33148
% 75.17/9.89 # Propositional unsat checks : 1
% 75.17/9.89 # Propositional check models : 1
% 75.17/9.89 # Propositional check unsatisfiable : 0
% 75.17/9.89 # Propositional clauses : 0
% 75.17/9.89 # Propositional clauses after purity: 0
% 75.17/9.89 # Propositional unsat core size : 0
% 75.17/9.89 # Propositional preprocessing time : 0.000
% 75.17/9.89 # Propositional encoding time : 0.448
% 75.17/9.89 # Propositional solver time : 0.032
% 75.17/9.89 # Success case prop preproc time : 0.000
% 75.17/9.89 # Success case prop encoding time : 0.000
% 75.17/9.89 # Success case prop solver time : 0.000
% 75.17/9.89 # Current number of processed clauses : 4803
% 75.17/9.89 # Positive orientable unit clauses : 3912
% 75.17/9.89 # Positive unorientable unit clauses: 0
% 75.17/9.89 # Negative unit clauses : 25
% 75.17/9.89 # Non-unit-clauses : 866
% 75.17/9.89 # Current number of unprocessed clauses: 363697
% 75.17/9.89 # ...number of literals in the above : 1805908
% 75.17/9.89 # Current number of archived formulas : 0
% 75.17/9.89 # Current number of archived clauses : 1691
% 75.17/9.89 # Clause-clause subsumption calls (NU) : 640988
% 75.17/9.89 # Rec. Clause-clause subsumption calls : 167198
% 75.17/9.89 # Non-unit clause-clause subsumptions : 4352
% 75.17/9.89 # Unit Clause-clause subsumption calls : 70300
% 75.17/9.89 # Rewrite failures with RHS unbound : 0
% 75.17/9.89 # BW rewrite match attempts : 3362695
% 75.17/9.89 # BW rewrite match successes : 11
% 75.17/9.89 # Condensation attempts : 0
% 75.17/9.89 # Condensation successes : 0
% 75.17/9.89 # Termbank termtop insertions : 12693302
% 75.17/9.89 # Search garbage collected termcells : 729
% 75.17/9.89
% 75.17/9.89 # -------------------------------------------------
% 75.17/9.89 # User time : 9.109 s
% 75.17/9.89 # System time : 0.278 s
% 75.17/9.89 # Total time : 9.387 s
% 75.17/9.89 # Maximum resident set size: 1920 pages
% 75.17/9.89
% 75.17/9.89 # -------------------------------------------------
% 75.17/9.89 # User time : 46.079 s
% 75.17/9.89 # System time : 0.521 s
% 75.17/9.89 # Total time : 46.600 s
% 75.17/9.89 # Maximum resident set size: 1736 pages
% 75.17/9.89 % E---3.1 exiting
%------------------------------------------------------------------------------