TSTP Solution File: SWV407+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV407+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n009.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 : 600s
% DateTime : Wed Jul 20 17:47:08 EDT 2022
% Result : Theorem 9.57s 2.66s
% Output : CNFRefutation 9.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 32
% Number of leaves : 13
% Syntax : Number of formulae : 85 ( 13 unt; 0 def)
% Number of atoms : 245 ( 74 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 222 ( 62 ~; 129 |; 19 &)
% ( 3 <=>; 9 =>; 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 : 173 ( 35 sgn 83 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
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/sandbox/benchmark/theBenchmark.p',l43_co) ).
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/benchmark/Axioms/SWV007+3.ax',ax47) ).
fof(ax39,axiom,
! [X1,X2,X3,X4] :
( contains_cpq(triple(X1,X2,X3),X4)
<=> contains_slb(X2,X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax39) ).
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/sandbox/benchmark/theBenchmark.p',l43_li4142) ).
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/sandbox/benchmark/theBenchmark.p',l43_l44) ).
fof(stricly_smaller_definition,axiom,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( less_than(X1,X2)
& ~ less_than(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+0.ax',stricly_smaller_definition) ).
fof(ax51,axiom,
! [X1,X2,X3,X4] :
( X2 != create_slb
=> findmin_cpq_res(triple(X1,X2,X3)) = findmin_pqp_res(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax51) ).
fof(transitivity,axiom,
! [X1,X2,X3] :
( ( less_than(X1,X2)
& less_than(X2,X3) )
=> less_than(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+0.ax',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/sandbox/benchmark/Axioms/SWV007+3.ax',ax48) ).
fof(totality,axiom,
! [X1,X2] :
( less_than(X1,X2)
| less_than(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+0.ax',totality) ).
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/benchmark/Axioms/SWV007+3.ax',ax49) ).
fof(ax28,axiom,
! [X1] : update_slb(create_slb,X1) = create_slb,
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+2.ax',ax28) ).
fof(ax22,axiom,
! [X1,X2] : ~ pair_in_list(create_slb,X1,X2),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+2.ax',ax22) ).
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(assume_negation,[status(cth)],[l43_co]) ).
fof(c_0_14,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)],[ax47])])]) ).
fof(c_0_15,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)],[inference(fof_simplification,[status(thm)],[c_0_13])])])]) ).
cnf(c_0_16,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_17,negated_conjecture,
check_cpq(findmin_cpq_eff(triple(esk4_0,esk5_0,esk6_0))),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_18,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_16,c_0_16]) ).
fof(c_0_19,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(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax39])]) ).
fof(c_0_20,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(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])])])])])]) ).
cnf(c_0_21,negated_conjecture,
( esk5_0 = create_slb
| check_cpq(findmin_cpq_eff(triple(esk4_0,esk5_0,X1)))
| contains_slb(esk5_0,findmin_pqp_res(esk4_0)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
fof(c_0_22,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(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l43_l44])])])]) ).
cnf(c_0_23,plain,
( contains_slb(X2,X4)
| ~ contains_cpq(triple(X1,X2,X3),X4) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,negated_conjecture,
contains_cpq(triple(esk4_0,esk5_0,esk6_0),esk7_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_25,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(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[stricly_smaller_definition])])])]) ).
cnf(c_0_26,lemma,
( less_than(X5,X4)
| ~ check_cpq(triple(X1,X2,X3))
| ~ pair_in_list(X2,X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,negated_conjecture,
( esk5_0 = create_slb
| check_cpq(triple(esk4_0,update_slb(esk5_0,findmin_pqp_res(esk4_0)),bad))
| contains_slb(esk5_0,findmin_pqp_res(esk4_0)) ),
inference(spm,[status(thm)],[c_0_21,c_0_16]) ).
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_22]) ).
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_15]) ).
cnf(c_0_30,negated_conjecture,
contains_slb(esk5_0,esk7_0),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_31,plain,
( ~ less_than(X1,X2)
| ~ strictly_less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
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)],[ax51])])]) ).
cnf(c_0_33,lemma,
( 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(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_22]) ).
cnf(c_0_41,plain,
( less_than(X1,X3)
| ~ less_than(X1,X2)
| ~ less_than(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_42,lemma,
( 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_43,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_44,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(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax48])])]) ).
fof(c_0_45,plain,
! [X9,X10] :
( less_than(X9,X10)
| less_than(X10,X9) ),
inference(variable_rename,[status(thm)],[totality]) ).
fof(c_0_46,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(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax49])])]) ).
cnf(c_0_47,lemma,
( 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_41,c_0_42]) ).
cnf(c_0_48,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_43]),c_0_39]) ).
cnf(c_0_49,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_44]) ).
cnf(c_0_50,plain,
( less_than(X2,X1)
| strictly_less_than(X1,X2)
| ~ less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_51,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_52,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_46]) ).
cnf(c_0_53,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_47,c_0_48]),c_0_39]) ).
cnf(c_0_54,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_49,c_0_16]) ).
cnf(c_0_55,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1) ),
inference(csr,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_56,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_52,c_0_53]) ).
cnf(c_0_57,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_54,c_0_55]) ).
cnf(c_0_58,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_56,c_0_57]) ).
cnf(c_0_59,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_58]) ).
cnf(c_0_60,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_59]) ).
cnf(c_0_61,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_57,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,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_61,c_0_61]) ).
cnf(c_0_63,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_17,c_0_62]) ).
cnf(c_0_64,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_56,c_0_63]) ).
cnf(c_0_65,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_26,c_0_64]) ).
cnf(c_0_66,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_65,c_0_17]) ).
cnf(c_0_67,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_66,c_0_34]) ).
cnf(c_0_68,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_66,c_0_67]),c_0_39]) ).
cnf(c_0_69,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_26,c_0_60]) ).
cnf(c_0_70,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_68]) ).
cnf(c_0_71,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_69,c_0_70]) ).
cnf(c_0_72,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_71,c_0_34]) ).
cnf(c_0_73,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_71,c_0_72]),c_0_39]) ).
cnf(c_0_74,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_41,c_0_73]) ).
cnf(c_0_75,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_66,c_0_43]),c_0_39]) ).
cnf(c_0_76,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_74,c_0_75]),c_0_39]) ).
cnf(c_0_77,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_69,c_0_76]) ).
cnf(c_0_78,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_77,c_0_43]),c_0_39]) ).
fof(c_0_79,plain,
! [X44] : update_slb(create_slb,X44) = create_slb,
inference(variable_rename,[status(thm)],[ax28]) ).
fof(c_0_80,plain,
! [X23,X24] : ~ pair_in_list(create_slb,X23,X24),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[ax22])]) ).
cnf(c_0_81,lemma,
esk5_0 = create_slb,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_78]),c_0_39]) ).
cnf(c_0_82,plain,
update_slb(create_slb,X1) = create_slb,
inference(split_conjunct,[status(thm)],[c_0_79]) ).
cnf(c_0_83,plain,
~ pair_in_list(create_slb,X1,X2),
inference(split_conjunct,[status(thm)],[c_0_80]) ).
cnf(c_0_84,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_81]),c_0_82]),c_0_81]),c_0_81]),c_0_82]),c_0_83]),c_0_83]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWV407+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.35 % Computer : n009.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8042.1875MB
% 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 600
% 0.12/0.35 % DateTime : Wed Jun 15 06:21:54 EDT 2022
% 0.12/0.35 % CPUTime :
% 0.20/0.47 # ENIGMATIC: Selected SinE mode:
% 0.20/0.47 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 9.57/2.66 # ENIGMATIC: Solved by autoschedule:
% 9.57/2.66 # No SInE strategy applied
% 9.57/2.66 # Trying AutoSched0 for 150 seconds
% 9.57/2.66 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_AE_CS_SP_PI_PS_S3S
% 9.57/2.66 # and selection function SelectNewComplexAHPExceptUniqMaxHorn.
% 9.57/2.66 #
% 9.57/2.66 # Preprocessing time : 0.014 s
% 9.57/2.66 # Presaturation interreduction done
% 9.57/2.66
% 9.57/2.66 # Proof found!
% 9.57/2.66 # SZS status Theorem
% 9.57/2.66 # SZS output start CNFRefutation
% See solution above
% 9.57/2.66 # Training examples: 0 positive, 0 negative
% 9.57/2.66
% 9.57/2.66 # -------------------------------------------------
% 9.57/2.66 # User time : 0.365 s
% 9.57/2.66 # System time : 0.012 s
% 9.57/2.66 # Total time : 0.377 s
% 9.57/2.66 # Maximum resident set size: 7124 pages
% 9.57/2.66
%------------------------------------------------------------------------------