TSTP Solution File: SWV404+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SWV404+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n021.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:26 EDT 2023
% Result : Theorem 4.36s 4.47s
% Output : CNFRefutation 4.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 45
% Syntax : Number of formulae : 116 ( 16 unt; 30 typ; 0 def)
% Number of atoms : 216 ( 71 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 194 ( 64 ~; 96 |; 17 &)
% ( 3 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 42 ( 24 >; 18 *; 0 +; 0 <<)
% Number of predicates : 12 ( 9 usr; 2 prp; 0-3 aty)
% Number of functors : 21 ( 21 usr; 6 con; 0-3 aty)
% Number of variables : 174 ( 26 sgn; 105 !; 0 ?; 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_0: $i ).
tff(decl_50,type,
esk2_0: $i ).
tff(decl_51,type,
esk3_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/sandbox/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/sandbox/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/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(l40_co,conjecture,
! [X1,X2,X3] :
( ( check_cpq(removemin_cpq_eff(triple(X1,X2,X3)))
& ok(removemin_cpq_eff(triple(X1,X2,X3))) )
=> check_cpq(triple(X1,X2,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l40_co) ).
fof(ax52,axiom,
! [X1] : removemin_cpq_eff(X1) = remove_cpq(findmin_cpq_eff(X1),findmin_cpq_res(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax52) ).
fof(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(ax43,axiom,
! [X1,X2,X3,X4] :
( ~ contains_slb(X2,X4)
=> remove_cpq(triple(X1,X2,X3),X4) = triple(X1,X2,bad) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax43) ).
fof(ax40,axiom,
! [X1,X2] :
( ok(triple(X1,X2,bad))
<=> ~ $true ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax40) ).
fof(ax45,axiom,
! [X1,X2,X3,X4] :
( ( contains_slb(X2,X4)
& strictly_less_than(X4,lookup_slb(X2,X4)) )
=> remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),bad) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax45) ).
fof(ax44,axiom,
! [X1,X2,X3,X4] :
( ( contains_slb(X2,X4)
& less_than(lookup_slb(X2,X4),X4) )
=> remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax44) ).
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(l40_l27,lemma,
! [X1,X2,X3,X4] :
( ( check_cpq(remove_cpq(triple(X1,X2,X3),X4))
& ok(remove_cpq(triple(X1,X2,X3),X4)) )
=> check_cpq(triple(X1,X2,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l40_l27) ).
fof(l40_l34,lemma,
! [X1,X2,X3] :
( ~ check_cpq(triple(X1,X2,X3))
=> ~ check_cpq(findmin_cpq_eff(triple(X1,X2,X3))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l40_l34) ).
fof(ax36,axiom,
! [X1,X2] : check_cpq(triple(X1,create_slb,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax36) ).
fof(c_0_15,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_16,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_17,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_18,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_15])])]) ).
fof(c_0_19,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)],[c_0_16])])]) ).
fof(c_0_20,plain,
! [X9,X10] :
( less_than(X9,X10)
| less_than(X10,X9) ),
inference(variable_rename,[status(thm)],[totality]) ).
fof(c_0_21,negated_conjecture,
~ ! [X1,X2,X3] :
( ( check_cpq(removemin_cpq_eff(triple(X1,X2,X3)))
& ok(removemin_cpq_eff(triple(X1,X2,X3))) )
=> check_cpq(triple(X1,X2,X3)) ),
inference(assume_negation,[status(cth)],[l40_co]) ).
cnf(c_0_22,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_17]) ).
cnf(c_0_23,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_18]) ).
cnf(c_0_24,plain,
( less_than(X2,X1)
| strictly_less_than(X1,X2)
| ~ less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_26,negated_conjecture,
( check_cpq(removemin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)))
& ok(removemin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)))
& ~ check_cpq(triple(esk1_0,esk2_0,esk3_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])]) ).
fof(c_0_27,plain,
! [X117] : removemin_cpq_eff(X117) = remove_cpq(findmin_cpq_eff(X117),findmin_cpq_res(X117)),
inference(variable_rename,[status(thm)],[ax52]) ).
cnf(c_0_28,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_22,c_0_23]) ).
cnf(c_0_29,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1) ),
inference(csr,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,negated_conjecture,
ok(removemin_cpq_eff(triple(esk1_0,esk2_0,esk3_0))),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_31,plain,
removemin_cpq_eff(X1) = remove_cpq(findmin_cpq_eff(X1),findmin_cpq_res(X1)),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
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_28,c_0_29]) ).
fof(c_0_33,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_34,negated_conjecture,
ok(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)),findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0)))),
inference(rw,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,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_23,c_0_23]) ).
fof(c_0_36,plain,
! [X1,X2,X3,X4] :
( ~ contains_slb(X2,X4)
=> remove_cpq(triple(X1,X2,X3),X4) = triple(X1,X2,bad) ),
inference(fof_simplification,[status(thm)],[ax43]) ).
fof(c_0_37,plain,
! [X1,X2] : ~ ok(triple(X1,X2,bad)),
inference(fof_simplification,[status(thm)],[ax40]) ).
cnf(c_0_38,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_39,plain,
( X1 = create_slb
| findmin_cpq_res(triple(X2,X1,X3)) = findmin_pqp_res(X2) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_40,negated_conjecture,
( esk2_0 = create_slb
| ok(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,X1)),findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0))))
| contains_slb(esk2_0,findmin_pqp_res(esk1_0)) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
fof(c_0_41,plain,
! [X89,X90,X91,X92] :
( contains_slb(X90,X92)
| remove_cpq(triple(X89,X90,X91),X92) = triple(X89,X90,bad) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_36])]) ).
fof(c_0_42,plain,
! [X80,X81] : ~ ok(triple(X80,X81,bad)),
inference(variable_rename,[status(thm)],[c_0_37]) ).
fof(c_0_43,plain,
! [X97,X98,X99,X100] :
( ~ contains_slb(X98,X100)
| ~ strictly_less_than(X100,lookup_slb(X98,X100))
| remove_cpq(triple(X97,X98,X99),X100) = triple(remove_pqp(X97,X100),remove_slb(X98,X100),bad) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax45])]) ).
cnf(c_0_44,negated_conjecture,
( esk2_0 = create_slb
| ok(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,X1)),findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0))))
| less_than(lookup_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0)) ),
inference(spm,[status(thm)],[c_0_34,c_0_38]) ).
fof(c_0_45,plain,
! [X93,X94,X95,X96] :
( ~ contains_slb(X94,X96)
| ~ less_than(lookup_slb(X94,X96),X96)
| remove_cpq(triple(X93,X94,X95),X96) = triple(remove_pqp(X93,X96),remove_slb(X94,X96),X95) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax44])]) ).
cnf(c_0_46,negated_conjecture,
( esk2_0 = create_slb
| ok(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)),findmin_pqp_res(esk1_0))) ),
inference(spm,[status(thm)],[c_0_34,c_0_39]) ).
cnf(c_0_47,negated_conjecture,
( esk2_0 = create_slb
| ok(remove_cpq(triple(esk1_0,update_slb(esk2_0,findmin_pqp_res(esk1_0)),bad),findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0))))
| contains_slb(esk2_0,findmin_pqp_res(esk1_0)) ),
inference(spm,[status(thm)],[c_0_40,c_0_23]) ).
cnf(c_0_48,plain,
( contains_slb(X1,X2)
| remove_cpq(triple(X3,X1,X4),X2) = triple(X3,X1,bad) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_49,plain,
~ ok(triple(X1,X2,bad)),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_50,plain,
( remove_cpq(triple(X3,X1,X4),X2) = triple(remove_pqp(X3,X2),remove_slb(X1,X2),bad)
| ~ contains_slb(X1,X2)
| ~ strictly_less_than(X2,lookup_slb(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_51,negated_conjecture,
( esk2_0 = create_slb
| ok(remove_cpq(triple(esk1_0,update_slb(esk2_0,findmin_pqp_res(esk1_0)),bad),findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0))))
| less_than(lookup_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0)) ),
inference(spm,[status(thm)],[c_0_44,c_0_32]) ).
cnf(c_0_52,plain,
( remove_cpq(triple(X3,X1,X4),X2) = triple(remove_pqp(X3,X2),remove_slb(X1,X2),X4)
| ~ contains_slb(X1,X2)
| ~ less_than(lookup_slb(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_53,negated_conjecture,
( esk2_0 = create_slb
| ok(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,X1)),findmin_pqp_res(esk1_0)))
| contains_slb(esk2_0,findmin_pqp_res(esk1_0)) ),
inference(spm,[status(thm)],[c_0_46,c_0_35]) ).
cnf(c_0_54,negated_conjecture,
( esk2_0 = create_slb
| contains_slb(update_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0)))
| contains_slb(esk2_0,findmin_pqp_res(esk1_0)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]) ).
cnf(c_0_55,plain,
( ~ ok(remove_cpq(triple(X1,X2,X3),X4))
| ~ contains_slb(X2,X4)
| ~ strictly_less_than(X4,lookup_slb(X2,X4)) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_56,negated_conjecture,
( esk2_0 = create_slb
| contains_slb(update_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0)))
| less_than(lookup_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_48]),c_0_49]) ).
cnf(c_0_57,plain,
( ~ ok(remove_cpq(triple(X1,X2,bad),X3))
| ~ contains_slb(X2,X3)
| ~ less_than(lookup_slb(X2,X3),X3) ),
inference(spm,[status(thm)],[c_0_49,c_0_52]) ).
cnf(c_0_58,negated_conjecture,
( esk2_0 = create_slb
| ok(remove_cpq(triple(esk1_0,update_slb(esk2_0,findmin_pqp_res(esk1_0)),bad),findmin_pqp_res(esk1_0)))
| contains_slb(esk2_0,findmin_pqp_res(esk1_0)) ),
inference(spm,[status(thm)],[c_0_53,c_0_23]) ).
cnf(c_0_59,negated_conjecture,
( esk2_0 = create_slb
| contains_slb(update_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0))
| contains_slb(esk2_0,findmin_pqp_res(esk1_0)) ),
inference(spm,[status(thm)],[c_0_54,c_0_39]) ).
cnf(c_0_60,negated_conjecture,
( esk2_0 = create_slb
| less_than(lookup_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0))
| ~ strictly_less_than(findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0)),lookup_slb(update_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0)))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_51]),c_0_56]) ).
cnf(c_0_61,negated_conjecture,
( esk2_0 = create_slb
| less_than(lookup_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0))
| ~ less_than(lookup_slb(update_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0))),findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_51]),c_0_56]) ).
cnf(c_0_62,negated_conjecture,
( esk2_0 = create_slb
| contains_slb(esk2_0,findmin_pqp_res(esk1_0))
| ~ strictly_less_than(findmin_pqp_res(esk1_0),lookup_slb(update_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_58]),c_0_59]) ).
fof(c_0_63,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_64,negated_conjecture,
( esk2_0 = create_slb
| less_than(lookup_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0))
| ~ strictly_less_than(findmin_pqp_res(esk1_0),lookup_slb(update_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0))) ),
inference(spm,[status(thm)],[c_0_60,c_0_39]) ).
cnf(c_0_65,negated_conjecture,
( esk2_0 = create_slb
| less_than(lookup_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0))
| ~ less_than(lookup_slb(update_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0)) ),
inference(spm,[status(thm)],[c_0_61,c_0_39]) ).
cnf(c_0_66,negated_conjecture,
( esk2_0 = create_slb
| contains_slb(esk2_0,findmin_pqp_res(esk1_0))
| ~ less_than(lookup_slb(update_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0))),findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_47]),c_0_54]) ).
cnf(c_0_67,negated_conjecture,
( esk2_0 = create_slb
| contains_slb(esk2_0,findmin_pqp_res(esk1_0))
| less_than(lookup_slb(update_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0)) ),
inference(spm,[status(thm)],[c_0_62,c_0_29]) ).
fof(c_0_68,lemma,
! [X119,X120,X121,X122] :
( ~ check_cpq(remove_cpq(triple(X119,X120,X121),X122))
| ~ ok(remove_cpq(triple(X119,X120,X121),X122))
| check_cpq(triple(X119,X120,X121)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l40_l27])]) ).
cnf(c_0_69,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_63]) ).
cnf(c_0_70,negated_conjecture,
( esk2_0 = create_slb
| less_than(lookup_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_29]),c_0_65]) ).
cnf(c_0_71,negated_conjecture,
( esk2_0 = create_slb
| contains_slb(esk2_0,findmin_pqp_res(esk1_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_39]),c_0_67]) ).
fof(c_0_72,lemma,
! [X1,X2,X3] :
( ~ check_cpq(triple(X1,X2,X3))
=> ~ check_cpq(findmin_cpq_eff(triple(X1,X2,X3))) ),
inference(fof_simplification,[status(thm)],[l40_l34]) ).
cnf(c_0_73,lemma,
( check_cpq(triple(X1,X2,X3))
| ~ check_cpq(remove_cpq(triple(X1,X2,X3),X4))
| ~ ok(remove_cpq(triple(X1,X2,X3),X4)) ),
inference(split_conjunct,[status(thm)],[c_0_68]) ).
cnf(c_0_74,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 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_71]) ).
cnf(c_0_75,negated_conjecture,
check_cpq(removemin_cpq_eff(triple(esk1_0,esk2_0,esk3_0))),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_76,lemma,
! [X123,X124,X125] :
( check_cpq(triple(X123,X124,X125))
| ~ check_cpq(findmin_cpq_eff(triple(X123,X124,X125))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_72])]) ).
cnf(c_0_77,lemma,
( esk2_0 = create_slb
| check_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,X1)))
| ~ ok(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,X1)),X2))
| ~ check_cpq(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,X1)),X2)) ),
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_78,negated_conjecture,
check_cpq(remove_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0)),findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0)))),
inference(rw,[status(thm)],[c_0_75,c_0_31]) ).
cnf(c_0_79,lemma,
( check_cpq(triple(X1,X2,X3))
| ~ check_cpq(findmin_cpq_eff(triple(X1,X2,X3))) ),
inference(split_conjunct,[status(thm)],[c_0_76]) ).
cnf(c_0_80,negated_conjecture,
( esk2_0 = create_slb
| check_cpq(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_34]),c_0_78])]) ).
cnf(c_0_81,negated_conjecture,
~ check_cpq(triple(esk1_0,esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_82,plain,
! [X64,X65] : check_cpq(triple(X64,create_slb,X65)),
inference(variable_rename,[status(thm)],[ax36]) ).
cnf(c_0_83,lemma,
esk2_0 = create_slb,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_81]) ).
cnf(c_0_84,plain,
check_cpq(triple(X1,create_slb,X2)),
inference(split_conjunct,[status(thm)],[c_0_82]) ).
cnf(c_0_85,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_83]),c_0_84])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : SWV404+1 : TPTP v8.1.2. Released v3.3.0.
% 0.05/0.09 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.09/0.29 % Computer : n021.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Tue Aug 29 07:34:29 EDT 2023
% 0.09/0.29 % CPUTime :
% 0.13/0.50 start to proof: theBenchmark
% 4.36/4.47 % Version : CSE_E---1.5
% 4.36/4.47 % Problem : theBenchmark.p
% 4.36/4.47 % Proof found
% 4.36/4.47 % SZS status Theorem for theBenchmark.p
% 4.36/4.47 % SZS output start Proof
% See solution above
% 4.36/4.47 % Total time : 3.947000 s
% 4.36/4.47 % SZS output end Proof
% 4.36/4.47 % Total time : 3.950000 s
%------------------------------------------------------------------------------