TSTP Solution File: SWV398+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SWV398+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 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 : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 21:38:24 EDT 2023
% Result : Theorem 20.20s 20.29s
% Output : CNFRefutation 20.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 46
% Syntax : Number of formulae : 109 ( 13 unt; 34 typ; 0 def)
% Number of atoms : 206 ( 47 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 199 ( 68 ~; 101 |; 17 &)
% ( 4 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 50 ( 28 >; 22 *; 0 +; 0 <<)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 25 ( 25 usr; 6 con; 0-3 aty)
% Number of variables : 230 ( 60 sgn; 84 !; 4 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
less_than: ( $i * $i ) > $o ).
tff(decl_23,type,
strictly_less_than: ( $i * $i ) > $o ).
tff(decl_24,type,
bottom: $i ).
tff(decl_25,type,
create_slb: $i ).
tff(decl_26,type,
isnonempty_slb: $i > $o ).
tff(decl_27,type,
pair: ( $i * $i ) > $i ).
tff(decl_28,type,
insert_slb: ( $i * $i ) > $i ).
tff(decl_29,type,
contains_slb: ( $i * $i ) > $o ).
tff(decl_30,type,
pair_in_list: ( $i * $i * $i ) > $o ).
tff(decl_31,type,
remove_slb: ( $i * $i ) > $i ).
tff(decl_32,type,
lookup_slb: ( $i * $i ) > $i ).
tff(decl_33,type,
update_slb: ( $i * $i ) > $i ).
tff(decl_34,type,
succ_cpq: ( $i * $i ) > $o ).
tff(decl_35,type,
insert_cpq: ( $i * $i ) > $i ).
tff(decl_36,type,
remove_cpq: ( $i * $i ) > $i ).
tff(decl_37,type,
findmin_cpq_eff: $i > $i ).
tff(decl_38,type,
removemin_cpq_eff: $i > $i ).
tff(decl_39,type,
triple: ( $i * $i * $i ) > $i ).
tff(decl_40,type,
check_cpq: $i > $o ).
tff(decl_41,type,
contains_cpq: ( $i * $i ) > $o ).
tff(decl_42,type,
bad: $i ).
tff(decl_43,type,
ok: $i > $o ).
tff(decl_44,type,
insert_pqp: ( $i * $i ) > $i ).
tff(decl_45,type,
remove_pqp: ( $i * $i ) > $i ).
tff(decl_46,type,
findmin_pqp_res: $i > $i ).
tff(decl_47,type,
findmin_cpq_res: $i > $i ).
tff(decl_48,type,
removemin_cpq_res: $i > $i ).
tff(decl_49,type,
esk1_2: ( $i * $i ) > $i ).
tff(decl_50,type,
esk2_2: ( $i * $i ) > $i ).
tff(decl_51,type,
esk3_2: ( $i * $i ) > $i ).
tff(decl_52,type,
esk4_2: ( $i * $i ) > $i ).
tff(decl_53,type,
esk5_0: $i ).
tff(decl_54,type,
esk6_0: $i ).
tff(decl_55,type,
esk7_0: $i ).
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/benchmark/Axioms/SWV007+3.ax',ax47) ).
fof(stricly_smaller_definition,axiom,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( less_than(X1,X2)
& ~ less_than(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax',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/sandbox2/benchmark/Axioms/SWV007+3.ax',ax48) ).
fof(totality,axiom,
! [X1,X2] :
( less_than(X1,X2)
| less_than(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax',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/sandbox2/benchmark/theBenchmark.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/sandbox2/benchmark/theBenchmark.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/sandbox2/benchmark/Axioms/SWV007+3.ax',ax37) ).
fof(ax42,axiom,
! [X1,X2,X3,X4] : insert_cpq(triple(X1,X2,X3),X4) = triple(insert_pqp(X1,X4),insert_slb(X2,pair(X4,bottom)),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax42) ).
fof(bottom_smallest,axiom,
! [X1] : less_than(bottom,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax',bottom_smallest) ).
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/benchmark/Axioms/SWV007+3.ax',ax49) ).
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/sandbox2/benchmark/theBenchmark.p',l34_l35) ).
fof(ax36,axiom,
! [X1,X2] : check_cpq(triple(X1,create_slb,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax36) ).
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,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_14,plain,
! [X107,X108,X109] :
( X108 = create_slb
| ~ contains_slb(X108,findmin_pqp_res(X107))
| ~ strictly_less_than(findmin_pqp_res(X107),lookup_slb(X108,findmin_pqp_res(X107)))
| findmin_cpq_eff(triple(X107,X108,X109)) = triple(X107,update_slb(X108,findmin_pqp_res(X107)),bad) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax48])])]) ).
fof(c_0_15,plain,
! [X104,X105,X106] :
( X105 = create_slb
| contains_slb(X105,findmin_pqp_res(X104))
| findmin_cpq_eff(triple(X104,X105,X106)) = triple(X104,update_slb(X105,findmin_pqp_res(X104)),bad) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_12])])]) ).
fof(c_0_16,plain,
! [X13,X14] :
( ( less_than(X13,X14)
| ~ strictly_less_than(X13,X14) )
& ( ~ less_than(X14,X13)
| ~ strictly_less_than(X13,X14) )
& ( ~ less_than(X13,X14)
| less_than(X14,X13)
| strictly_less_than(X13,X14) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).
fof(c_0_17,plain,
! [X10,X11] :
( less_than(X10,X11)
| less_than(X11,X10) ),
inference(variable_rename,[status(thm)],[totality]) ).
fof(c_0_18,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_19,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_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]) ).
cnf(c_0_21,plain,
( less_than(X2,X1)
| strictly_less_than(X1,X2)
| ~ less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_23,negated_conjecture,
( ~ check_cpq(triple(esk5_0,esk6_0,esk7_0))
& check_cpq(findmin_cpq_eff(triple(esk5_0,esk6_0,esk7_0))) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])]) ).
fof(c_0_24,lemma,
! [X120,X121,X122,X123,X124,X125,X126,X129] :
( ( ~ check_cpq(triple(X120,X121,X122))
| ~ pair_in_list(X121,X123,X124)
| less_than(X124,X123) )
& ( pair_in_list(X126,esk1_2(X125,X126),esk2_2(X125,X126))
| check_cpq(triple(X125,X126,X129)) )
& ( ~ less_than(esk2_2(X125,X126),esk1_2(X125,X126))
| check_cpq(triple(X125,X126,X129)) ) ),
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,
! [X67,X68,X69,X70,X71] :
( ( ~ check_cpq(triple(X67,insert_slb(X68,pair(X70,X71)),X69))
| check_cpq(triple(X67,X68,X69))
| ~ less_than(X71,X70) )
& ( ~ check_cpq(triple(X67,X68,X69))
| check_cpq(triple(X67,insert_slb(X68,pair(X70,X71)),X69))
| ~ less_than(X71,X70) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax37])])]) ).
cnf(c_0_26,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_19,c_0_20]) ).
cnf(c_0_27,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1) ),
inference(csr,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,negated_conjecture,
check_cpq(findmin_cpq_eff(triple(esk5_0,esk6_0,esk7_0))),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,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_20,c_0_20]) ).
cnf(c_0_30,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_31,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]) ).
cnf(c_0_32,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_26,c_0_27]) ).
cnf(c_0_33,negated_conjecture,
( esk6_0 = create_slb
| check_cpq(findmin_cpq_eff(triple(esk5_0,esk6_0,X1)))
| contains_slb(esk6_0,findmin_pqp_res(esk5_0)) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
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_30,c_0_31]) ).
cnf(c_0_35,lemma,
( pair_in_list(X1,esk1_2(X2,X1),esk2_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(esk2_2(X1,X2),esk1_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_37,plain,
! [X86,X87,X88,X89] : insert_cpq(triple(X86,X87,X88),X89) = triple(insert_pqp(X86,X89),insert_slb(X87,pair(X89,bottom)),X88),
inference(variable_rename,[status(thm)],[ax42]) ).
fof(c_0_38,plain,
! [X15] : less_than(bottom,X15),
inference(variable_rename,[status(thm)],[bottom_smallest]) ).
fof(c_0_39,plain,
! [X110,X111,X112] :
( X111 = create_slb
| ~ contains_slb(X111,findmin_pqp_res(X110))
| ~ less_than(lookup_slb(X111,findmin_pqp_res(X110)),findmin_pqp_res(X110))
| findmin_cpq_eff(triple(X110,X111,X112)) = triple(X110,update_slb(X111,findmin_pqp_res(X110)),X112) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax49])])]) ).
cnf(c_0_40,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_32,c_0_32]) ).
cnf(c_0_41,negated_conjecture,
( esk6_0 = create_slb
| check_cpq(triple(esk5_0,update_slb(esk6_0,findmin_pqp_res(esk5_0)),bad))
| contains_slb(esk6_0,findmin_pqp_res(esk5_0)) ),
inference(spm,[status(thm)],[c_0_33,c_0_20]) ).
cnf(c_0_42,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_43,plain,
insert_cpq(triple(X1,X2,X3),X4) = triple(insert_pqp(X1,X4),insert_slb(X2,pair(X4,bottom)),X3),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_44,plain,
less_than(bottom,X1),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_45,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_39]) ).
cnf(c_0_46,negated_conjecture,
( esk6_0 = create_slb
| check_cpq(findmin_cpq_eff(triple(esk5_0,esk6_0,X1)))
| less_than(lookup_slb(esk6_0,findmin_pqp_res(esk5_0)),findmin_pqp_res(esk5_0)) ),
inference(spm,[status(thm)],[c_0_28,c_0_40]) ).
cnf(c_0_47,lemma,
( esk6_0 = create_slb
| contains_slb(esk6_0,findmin_pqp_res(esk5_0))
| less_than(X1,X2)
| ~ pair_in_list(update_slb(esk6_0,findmin_pqp_res(esk5_0)),X2,X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_41]) ).
cnf(c_0_48,lemma,
( check_cpq(insert_cpq(triple(X1,X2,X3),X4))
| ~ check_cpq(triple(X5,X2,X6)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44])]) ).
cnf(c_0_49,negated_conjecture,
( triple(esk5_0,update_slb(esk6_0,findmin_pqp_res(esk5_0)),X1) = findmin_cpq_eff(triple(esk5_0,esk6_0,X1))
| esk6_0 = create_slb
| check_cpq(findmin_cpq_eff(triple(esk5_0,esk6_0,X2))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_33]) ).
fof(c_0_50,lemma,
! [X130,X131,X132,X133] :
( ( pair_in_list(update_slb(X130,X133),esk3_2(X130,X133),esk4_2(X130,X133))
| ~ pair_in_list(X130,X131,X132)
| ~ strictly_less_than(X131,X132) )
& ( strictly_less_than(esk3_2(X130,X133),esk4_2(X130,X133))
| ~ pair_in_list(X130,X131,X132)
| ~ strictly_less_than(X131,X132) ) ),
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_51,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_52,negated_conjecture,
( esk6_0 = create_slb
| check_cpq(triple(esk5_0,update_slb(esk6_0,findmin_pqp_res(esk5_0)),bad))
| less_than(lookup_slb(esk6_0,findmin_pqp_res(esk5_0)),findmin_pqp_res(esk5_0)) ),
inference(spm,[status(thm)],[c_0_46,c_0_32]) ).
cnf(c_0_53,lemma,
( esk6_0 = create_slb
| check_cpq(triple(X1,update_slb(esk6_0,findmin_pqp_res(esk5_0)),X2))
| contains_slb(esk6_0,findmin_pqp_res(esk5_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_35]),c_0_36]) ).
cnf(c_0_54,lemma,
( esk6_0 = create_slb
| check_cpq(insert_cpq(triple(X1,update_slb(esk6_0,findmin_pqp_res(esk5_0)),X2),X3))
| check_cpq(findmin_cpq_eff(triple(esk5_0,esk6_0,X4)))
| ~ check_cpq(findmin_cpq_eff(triple(esk5_0,esk6_0,X5))) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_55,lemma,
( strictly_less_than(esk3_2(X1,X2),esk4_2(X1,X2))
| ~ pair_in_list(X1,X3,X4)
| ~ strictly_less_than(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_56,plain,
( check_cpq(triple(insert_pqp(X1,X2),X3,X4))
| ~ check_cpq(insert_cpq(triple(X1,X3,X4),X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_43]),c_0_44])]) ).
cnf(c_0_57,negated_conjecture,
( triple(esk5_0,update_slb(esk6_0,findmin_pqp_res(esk5_0)),X1) = findmin_cpq_eff(triple(esk5_0,esk6_0,X1))
| esk6_0 = create_slb
| check_cpq(triple(esk5_0,update_slb(esk6_0,findmin_pqp_res(esk5_0)),bad)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_52]),c_0_53]) ).
cnf(c_0_58,negated_conjecture,
( esk6_0 = create_slb
| check_cpq(insert_cpq(triple(X1,update_slb(esk6_0,findmin_pqp_res(esk5_0)),X2),X3))
| check_cpq(findmin_cpq_eff(triple(esk5_0,esk6_0,X4))) ),
inference(spm,[status(thm)],[c_0_54,c_0_28]) ).
cnf(c_0_59,lemma,
( pair_in_list(update_slb(X1,X2),esk3_2(X1,X2),esk4_2(X1,X2))
| ~ pair_in_list(X1,X3,X4)
| ~ strictly_less_than(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_60,lemma,
( check_cpq(triple(X1,X2,X3))
| strictly_less_than(esk3_2(X2,X4),esk4_2(X2,X4))
| ~ strictly_less_than(esk1_2(X1,X2),esk2_2(X1,X2)) ),
inference(spm,[status(thm)],[c_0_55,c_0_35]) ).
cnf(c_0_61,lemma,
( less_than(X1,X2)
| ~ check_cpq(insert_cpq(triple(X3,X4,X5),X6))
| ~ pair_in_list(X4,X2,X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_56]) ).
cnf(c_0_62,lemma,
( esk6_0 = create_slb
| check_cpq(insert_cpq(triple(X1,update_slb(esk6_0,findmin_pqp_res(esk5_0)),X2),X3)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_57]),c_0_58]),c_0_48]) ).
cnf(c_0_63,lemma,
( check_cpq(triple(X1,X2,X3))
| pair_in_list(update_slb(X2,X4),esk3_2(X2,X4),esk4_2(X2,X4))
| ~ strictly_less_than(esk1_2(X1,X2),esk2_2(X1,X2)) ),
inference(spm,[status(thm)],[c_0_59,c_0_35]) ).
cnf(c_0_64,plain,
( ~ less_than(X1,X2)
| ~ strictly_less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_65,lemma,
( check_cpq(triple(X1,X2,X3))
| strictly_less_than(esk3_2(X2,X4),esk4_2(X2,X4)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_27]),c_0_36]) ).
cnf(c_0_66,lemma,
( esk6_0 = create_slb
| less_than(X1,X2)
| ~ pair_in_list(update_slb(esk6_0,findmin_pqp_res(esk5_0)),X2,X1) ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_67,lemma,
( check_cpq(triple(X1,X2,X3))
| pair_in_list(update_slb(X2,X4),esk3_2(X2,X4),esk4_2(X2,X4)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_27]),c_0_36]) ).
cnf(c_0_68,lemma,
( check_cpq(triple(X1,X2,X3))
| ~ less_than(esk4_2(X2,X4),esk3_2(X2,X4)) ),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_69,negated_conjecture,
~ check_cpq(triple(esk5_0,esk6_0,esk7_0)),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_70,lemma,
( esk6_0 = create_slb
| check_cpq(triple(X1,esk6_0,X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_68]) ).
fof(c_0_71,plain,
! [X65,X66] : check_cpq(triple(X65,create_slb,X66)),
inference(variable_rename,[status(thm)],[ax36]) ).
cnf(c_0_72,negated_conjecture,
esk6_0 = create_slb,
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_73,plain,
check_cpq(triple(X1,create_slb,X2)),
inference(split_conjunct,[status(thm)],[c_0_71]) ).
cnf(c_0_74,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_72]),c_0_73])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWV398+1 : TPTP v8.1.2. Released v3.3.0.
% 0.13/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n022.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 29 08:04:09 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.57 start to proof: theBenchmark
% 20.20/20.29 % Version : CSE_E---1.5
% 20.20/20.29 % Problem : theBenchmark.p
% 20.20/20.29 % Proof found
% 20.20/20.29 % SZS status Theorem for theBenchmark.p
% 20.20/20.29 % SZS output start Proof
% See solution above
% 20.20/20.30 % Total time : 19.708000 s
% 20.20/20.30 % SZS output end Proof
% 20.20/20.30 % Total time : 19.712000 s
%------------------------------------------------------------------------------