TSTP Solution File: SWV404+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWV404+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:44:03 EDT 2024
% Result : Theorem 8.64s 1.62s
% Output : CNFRefutation 8.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 15
% Syntax : Number of formulae : 89 ( 14 unt; 0 def)
% Number of atoms : 230 ( 77 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 209 ( 68 ~; 99 |; 22 &)
% ( 3 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 8 ( 5 usr; 2 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 5 con; 0-3 aty)
% Number of variables : 186 ( 31 sgn 115 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax48,axiom,
! [X1,X2,X3,X4] :
( ( X2 != create_slb
& contains_slb(X2,findmin_pqp_res(X1))
& strictly_less_than(findmin_pqp_res(X1),lookup_slb(X2,findmin_pqp_res(X1))) )
=> findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad) ),
file('/export/starexec/sandbox/tmp/tmp.19xPKzX60E/E---3.1_32613.p',ax48) ).
fof(ax47,axiom,
! [X1,X2,X3,X4] :
( ( X2 != create_slb
& ~ contains_slb(X2,findmin_pqp_res(X1)) )
=> findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad) ),
file('/export/starexec/sandbox/tmp/tmp.19xPKzX60E/E---3.1_32613.p',ax47) ).
fof(stricly_smaller_definition,axiom,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( less_than(X1,X2)
& ~ less_than(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.19xPKzX60E/E---3.1_32613.p',stricly_smaller_definition) ).
fof(totality,axiom,
! [X1,X2] :
( less_than(X1,X2)
| less_than(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.19xPKzX60E/E---3.1_32613.p',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/tmp/tmp.19xPKzX60E/E---3.1_32613.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/tmp/tmp.19xPKzX60E/E---3.1_32613.p',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/tmp/tmp.19xPKzX60E/E---3.1_32613.p',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/tmp/tmp.19xPKzX60E/E---3.1_32613.p',ax43) ).
fof(ax40,axiom,
! [X1,X2] :
( ok(triple(X1,X2,bad))
<=> ~ $true ),
file('/export/starexec/sandbox/tmp/tmp.19xPKzX60E/E---3.1_32613.p',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/tmp/tmp.19xPKzX60E/E---3.1_32613.p',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/tmp/tmp.19xPKzX60E/E---3.1_32613.p',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/tmp/tmp.19xPKzX60E/E---3.1_32613.p',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/tmp/tmp.19xPKzX60E/E---3.1_32613.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/tmp/tmp.19xPKzX60E/E---3.1_32613.p',l40_l34) ).
fof(ax36,axiom,
! [X1,X2] : check_cpq(triple(X1,create_slb,X2)),
file('/export/starexec/sandbox/tmp/tmp.19xPKzX60E/E---3.1_32613.p',ax36) ).
fof(c_0_15,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_16,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_17,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_18,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_15])])])]) ).
fof(c_0_19,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_16])])]) ).
fof(c_0_20,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_17])])])]) ).
fof(c_0_21,plain,
! [X9,X10] :
( less_than(X9,X10)
| less_than(X10,X9) ),
inference(variable_rename,[status(thm)],[totality]) ).
fof(c_0_22,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_23,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_18]) ).
cnf(c_0_24,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_19]) ).
cnf(c_0_25,plain,
( less_than(X2,X1)
| strictly_less_than(X1,X2)
| ~ less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_27,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(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])])]) ).
fof(c_0_28,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_29,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_23,c_0_24]) ).
cnf(c_0_30,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1) ),
inference(csr,[status(thm)],[c_0_25,c_0_26]) ).
fof(c_0_31,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_32,negated_conjecture,
ok(removemin_cpq_eff(triple(esk1_0,esk2_0,esk3_0))),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_33,plain,
removemin_cpq_eff(X1) = remove_cpq(findmin_cpq_eff(X1),findmin_cpq_res(X1)),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_34,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_29,c_0_30]) ).
fof(c_0_35,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_31])])]) ).
cnf(c_0_36,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_32,c_0_33]) ).
cnf(c_0_37,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_24,c_0_24]) ).
fof(c_0_38,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_39,plain,
! [X80,X81] :
( ( ~ ok(triple(X80,X81,bad))
| ~ $true )
& ( $true
| ok(triple(X80,X81,bad)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax40])])]) ).
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_34,c_0_34]) ).
cnf(c_0_41,plain,
( X1 = create_slb
| findmin_cpq_res(triple(X2,X1,X3)) = findmin_pqp_res(X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_42,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_36,c_0_37]) ).
fof(c_0_43,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_38])]) ).
cnf(c_0_44,plain,
( ~ ok(triple(X1,X2,bad))
| $false ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
fof(c_0_45,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(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax45])])]) ).
cnf(c_0_46,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_36,c_0_40]) ).
fof(c_0_47,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(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax44])])]) ).
cnf(c_0_48,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_36,c_0_41]) ).
cnf(c_0_49,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_42,c_0_24]) ).
cnf(c_0_50,plain,
( contains_slb(X1,X2)
| remove_cpq(triple(X3,X1,X4),X2) = triple(X3,X1,bad) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_51,plain,
~ ok(triple(X1,X2,bad)),
inference(cn,[status(thm)],[c_0_44]) ).
cnf(c_0_52,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_45]) ).
cnf(c_0_53,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_46,c_0_34]) ).
cnf(c_0_54,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_47]) ).
cnf(c_0_55,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_48,c_0_37]) ).
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)))
| contains_slb(esk2_0,findmin_pqp_res(esk1_0)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]) ).
cnf(c_0_57,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_51,c_0_52]) ).
cnf(c_0_58,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_53,c_0_50]),c_0_51]) ).
cnf(c_0_59,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_51,c_0_54]) ).
cnf(c_0_60,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_55,c_0_24]) ).
cnf(c_0_61,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_56,c_0_41]) ).
fof(c_0_62,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_63,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_57,c_0_53]),c_0_58]) ).
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))
| ~ 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_59,c_0_53]),c_0_58]) ).
cnf(c_0_65,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_57,c_0_60]),c_0_61]) ).
fof(c_0_66,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_62])])])]) ).
cnf(c_0_67,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_63,c_0_41]) ).
cnf(c_0_68,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_64,c_0_41]) ).
cnf(c_0_69,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_59,c_0_49]),c_0_56]) ).
cnf(c_0_70,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_65,c_0_30]) ).
fof(c_0_71,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(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l40_l27])])]) ).
cnf(c_0_72,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_66]) ).
cnf(c_0_73,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_67,c_0_30]),c_0_68]) ).
cnf(c_0_74,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_69,c_0_41]),c_0_70]) ).
fof(c_0_75,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_76,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_71]) ).
cnf(c_0_77,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_72,c_0_73]),c_0_74]) ).
cnf(c_0_78,negated_conjecture,
check_cpq(removemin_cpq_eff(triple(esk1_0,esk2_0,esk3_0))),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
fof(c_0_79,lemma,
! [X123,X124,X125] :
( check_cpq(triple(X123,X124,X125))
| ~ check_cpq(findmin_cpq_eff(triple(X123,X124,X125))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_75])])]) ).
cnf(c_0_80,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_76,c_0_77]) ).
cnf(c_0_81,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_78,c_0_33]) ).
cnf(c_0_82,lemma,
( check_cpq(triple(X1,X2,X3))
| ~ check_cpq(findmin_cpq_eff(triple(X1,X2,X3))) ),
inference(split_conjunct,[status(thm)],[c_0_79]) ).
cnf(c_0_83,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_80,c_0_36]),c_0_81])]) ).
cnf(c_0_84,negated_conjecture,
~ check_cpq(triple(esk1_0,esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
fof(c_0_85,plain,
! [X64,X65] : check_cpq(triple(X64,create_slb,X65)),
inference(variable_rename,[status(thm)],[ax36]) ).
cnf(c_0_86,lemma,
esk2_0 = create_slb,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_84]) ).
cnf(c_0_87,plain,
check_cpq(triple(X1,create_slb,X2)),
inference(split_conjunct,[status(thm)],[c_0_85]) ).
cnf(c_0_88,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_86]),c_0_87])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWV404+1 : TPTP v8.1.2. Released v3.3.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n017.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 16:56:38 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.19xPKzX60E/E---3.1_32613.p
% 8.64/1.62 # Version: 3.1.0
% 8.64/1.62 # Preprocessing class: FSMSSMSSSSSNFFN.
% 8.64/1.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.64/1.62 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 8.64/1.62 # Starting new_bool_3 with 300s (1) cores
% 8.64/1.62 # Starting new_bool_1 with 300s (1) cores
% 8.64/1.62 # Starting sh5l with 300s (1) cores
% 8.64/1.62 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 32707 completed with status 0
% 8.64/1.62 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 8.64/1.62 # Preprocessing class: FSMSSMSSSSSNFFN.
% 8.64/1.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.64/1.62 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 8.64/1.62 # No SInE strategy applied
% 8.64/1.62 # Search class: FGHSM-FFMF31-MFFFFFNN
% 8.64/1.62 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 8.64/1.62 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 811s (1) cores
% 8.64/1.62 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 8.64/1.62 # Starting new_bool_3 with 136s (1) cores
% 8.64/1.62 # Starting new_bool_1 with 136s (1) cores
% 8.64/1.62 # Starting sh5l with 136s (1) cores
% 8.64/1.62 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with pid 32713 completed with status 0
% 8.64/1.62 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN
% 8.64/1.62 # Preprocessing class: FSMSSMSSSSSNFFN.
% 8.64/1.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.64/1.62 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 8.64/1.62 # No SInE strategy applied
% 8.64/1.62 # Search class: FGHSM-FFMF31-MFFFFFNN
% 8.64/1.62 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 8.64/1.62 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 811s (1) cores
% 8.64/1.62 # Preprocessing time : 0.002 s
% 8.64/1.62 # Presaturation interreduction done
% 8.64/1.62
% 8.64/1.62 # Proof found!
% 8.64/1.62 # SZS status Theorem
% 8.64/1.62 # SZS output start CNFRefutation
% See solution above
% 8.64/1.62 # Parsed axioms : 44
% 8.64/1.62 # Removed by relevancy pruning/SinE : 0
% 8.64/1.62 # Initial clauses : 57
% 8.64/1.62 # Removed in clause preprocessing : 4
% 8.64/1.62 # Initial clauses in saturation : 53
% 8.64/1.62 # Processed clauses : 3701
% 8.64/1.62 # ...of these trivial : 5
% 8.64/1.62 # ...subsumed : 2328
% 8.64/1.62 # ...remaining for further processing : 1368
% 8.64/1.62 # Other redundant clauses eliminated : 3
% 8.64/1.62 # Clauses deleted for lack of memory : 0
% 8.64/1.62 # Backward-subsumed : 117
% 8.64/1.62 # Backward-rewritten : 117
% 8.64/1.62 # Generated clauses : 52178
% 8.64/1.62 # ...of the previous two non-redundant : 50921
% 8.64/1.62 # ...aggressively subsumed : 0
% 8.64/1.62 # Contextual simplify-reflections : 26
% 8.64/1.62 # Paramodulations : 52040
% 8.64/1.62 # Factorizations : 136
% 8.64/1.62 # NegExts : 0
% 8.64/1.62 # Equation resolutions : 3
% 8.64/1.62 # Disequality decompositions : 0
% 8.64/1.62 # Total rewrite steps : 4394
% 8.64/1.62 # ...of those cached : 3927
% 8.64/1.62 # Propositional unsat checks : 0
% 8.64/1.62 # Propositional check models : 0
% 8.64/1.62 # Propositional check unsatisfiable : 0
% 8.64/1.62 # Propositional clauses : 0
% 8.64/1.62 # Propositional clauses after purity: 0
% 8.64/1.62 # Propositional unsat core size : 0
% 8.64/1.62 # Propositional preprocessing time : 0.000
% 8.64/1.62 # Propositional encoding time : 0.000
% 8.64/1.62 # Propositional solver time : 0.000
% 8.64/1.62 # Success case prop preproc time : 0.000
% 8.64/1.62 # Success case prop encoding time : 0.000
% 8.64/1.62 # Success case prop solver time : 0.000
% 8.64/1.62 # Current number of processed clauses : 1079
% 8.64/1.62 # Positive orientable unit clauses : 42
% 8.64/1.62 # Positive unorientable unit clauses: 0
% 8.64/1.62 # Negative unit clauses : 244
% 8.64/1.62 # Non-unit-clauses : 793
% 8.64/1.62 # Current number of unprocessed clauses: 46045
% 8.64/1.62 # ...number of literals in the above : 230284
% 8.64/1.62 # Current number of archived formulas : 0
% 8.64/1.62 # Current number of archived clauses : 289
% 8.64/1.62 # Clause-clause subsumption calls (NU) : 111291
% 8.64/1.62 # Rec. Clause-clause subsumption calls : 23224
% 8.64/1.62 # Non-unit clause-clause subsumptions : 2145
% 8.64/1.62 # Unit Clause-clause subsumption calls : 3975
% 8.64/1.62 # Rewrite failures with RHS unbound : 0
% 8.64/1.62 # BW rewrite match attempts : 107
% 8.64/1.62 # BW rewrite match successes : 3
% 8.64/1.62 # Condensation attempts : 0
% 8.64/1.62 # Condensation successes : 0
% 8.64/1.62 # Termbank termtop insertions : 1194413
% 8.64/1.62 # Search garbage collected termcells : 616
% 8.64/1.62
% 8.64/1.62 # -------------------------------------------------
% 8.64/1.62 # User time : 1.060 s
% 8.64/1.62 # System time : 0.038 s
% 8.64/1.62 # Total time : 1.098 s
% 8.64/1.62 # Maximum resident set size: 1928 pages
% 8.64/1.62
% 8.64/1.62 # -------------------------------------------------
% 8.64/1.62 # User time : 5.380 s
% 8.64/1.62 # System time : 0.087 s
% 8.64/1.62 # Total time : 5.467 s
% 8.64/1.62 # Maximum resident set size: 1740 pages
% 8.64/1.62 % E---3.1 exiting
% 8.64/1.62 % E exiting
%------------------------------------------------------------------------------