TSTP Solution File: ITP004+2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP004+2 : TPTP v8.2.0. Bugfixed v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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 : Mon May 20 22:15:11 EDT 2024
% Result : Theorem 2.33s 0.78s
% Output : CNFRefutation 2.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 10
% Syntax : Number of formulae : 58 ( 5 unt; 0 def)
% Number of atoms : 237 ( 21 equ)
% Maximal formula atoms : 22 ( 4 avg)
% Number of connectives : 300 ( 121 ~; 137 |; 10 &)
% ( 4 <=>; 28 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 3 con; 0-3 aty)
% Number of variables : 113 ( 0 sgn 48 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ap_tp,axiom,
! [X1,X2,X3] :
( mem(X3,arr(X1,X2))
=> ! [X4] :
( mem(X4,X1)
=> mem(ap(X3,X4),X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/ITP001/ITP001+2.ax',ap_tp) ).
fof(mem_c_2Epred__set_2ESUBSET,axiom,
! [X9] :
( ne(X9)
=> mem(c_2Epred__set_2ESUBSET(X9),arr(arr(X9,bool),arr(arr(X9,bool),bool))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mem_c_2Epred__set_2ESUBSET) ).
fof(boolext,axiom,
! [X5] :
( mem(X5,bool)
=> ! [X6] :
( mem(X6,bool)
=> ( ( p(X5)
<=> p(X6) )
=> X5 = X6 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/ITP001/ITP001+2.ax',boolext) ).
fof(conj_thm_2Epred__set_2EREST__SUBSET,conjecture,
! [X9] :
( ne(X9)
=> ! [X10] :
( mem(X10,arr(X9,bool))
=> p(ap(ap(c_2Epred__set_2ESUBSET(X9),ap(c_2Epred__set_2EREST(X9),X10)),X10)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_thm_2Epred__set_2EREST__SUBSET) ).
fof(mem_c_2Epred__set_2EREST,axiom,
! [X9] :
( ne(X9)
=> mem(c_2Epred__set_2EREST(X9),arr(arr(X9,bool),arr(X9,bool))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mem_c_2Epred__set_2EREST) ).
fof(mem_c_2Ebool_2EIN,axiom,
! [X9] :
( ne(X9)
=> mem(c_2Ebool_2EIN(X9),arr(X9,arr(arr(X9,bool),bool))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mem_c_2Ebool_2EIN) ).
fof(conj_thm_2Epred__set_2EIN__DELETE,axiom,
! [X9] :
( ne(X9)
=> ! [X10] :
( mem(X10,arr(X9,bool))
=> ! [X13] :
( mem(X13,X9)
=> ! [X14] :
( mem(X14,X9)
=> ( p(ap(ap(c_2Ebool_2EIN(X9),X13),ap(ap(c_2Epred__set_2EDELETE(X9),X10),X14)))
<=> ( p(ap(ap(c_2Ebool_2EIN(X9),X13),X10))
& X13 != X14 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_thm_2Epred__set_2EIN__DELETE) ).
fof(mem_c_2Epred__set_2ECHOICE,axiom,
! [X9] :
( ne(X9)
=> mem(c_2Epred__set_2ECHOICE(X9),arr(arr(X9,bool),X9)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mem_c_2Epred__set_2ECHOICE) ).
fof(ax_thm_2Epred__set_2ESUBSET__DEF,axiom,
! [X9] :
( ne(X9)
=> ! [X10] :
( mem(X10,arr(X9,bool))
=> ! [X11] :
( mem(X11,arr(X9,bool))
=> ( p(ap(ap(c_2Epred__set_2ESUBSET(X9),X10),X11))
<=> ! [X12] :
( mem(X12,X9)
=> ( p(ap(ap(c_2Ebool_2EIN(X9),X12),X10))
=> p(ap(ap(c_2Ebool_2EIN(X9),X12),X11)) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_thm_2Epred__set_2ESUBSET__DEF) ).
fof(ax_thm_2Epred__set_2EREST__DEF,axiom,
! [X9] :
( ne(X9)
=> ! [X10] :
( mem(X10,arr(X9,bool))
=> ap(c_2Epred__set_2EREST(X9),X10) = ap(ap(c_2Epred__set_2EDELETE(X9),X10),ap(c_2Epred__set_2ECHOICE(X9),X10)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_thm_2Epred__set_2EREST__DEF) ).
fof(c_0_10,plain,
! [X19,X20,X21,X22] :
( ~ mem(X21,arr(X19,X20))
| ~ mem(X22,X19)
| mem(ap(X21,X22),X20) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ap_tp])])])]) ).
fof(c_0_11,plain,
! [X31] :
( ~ ne(X31)
| mem(c_2Epred__set_2ESUBSET(X31),arr(arr(X31,bool),arr(arr(X31,bool),bool))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mem_c_2Epred__set_2ESUBSET])])]) ).
cnf(c_0_12,plain,
( mem(ap(X1,X4),X3)
| ~ mem(X1,arr(X2,X3))
| ~ mem(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,plain,
( mem(c_2Epred__set_2ESUBSET(X1),arr(arr(X1,bool),arr(arr(X1,bool),bool)))
| ~ ne(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_14,plain,
! [X17,X18] :
( ( ~ p(X17)
| ~ p(X18)
| X17 = X18
| ~ mem(X18,bool)
| ~ mem(X17,bool) )
& ( p(X17)
| p(X18)
| X17 = X18
| ~ mem(X18,bool)
| ~ mem(X17,bool) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[boolext])])])])]) ).
cnf(c_0_15,plain,
( mem(ap(c_2Epred__set_2ESUBSET(X1),X2),arr(arr(X1,bool),bool))
| ~ mem(X2,arr(X1,bool))
| ~ ne(X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_16,negated_conjecture,
~ ! [X9] :
( ne(X9)
=> ! [X10] :
( mem(X10,arr(X9,bool))
=> p(ap(ap(c_2Epred__set_2ESUBSET(X9),ap(c_2Epred__set_2EREST(X9),X10)),X10)) ) ),
inference(assume_negation,[status(cth)],[conj_thm_2Epred__set_2EREST__SUBSET]) ).
cnf(c_0_17,plain,
( p(X1)
| p(X2)
| X1 = X2
| ~ mem(X2,bool)
| ~ mem(X1,bool) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,plain,
( mem(ap(ap(c_2Epred__set_2ESUBSET(X1),X2),X3),bool)
| ~ mem(X3,arr(X1,bool))
| ~ mem(X2,arr(X1,bool))
| ~ ne(X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_15]) ).
fof(c_0_19,negated_conjecture,
( ne(esk1_0)
& mem(esk2_0,arr(esk1_0,bool))
& ~ p(ap(ap(c_2Epred__set_2ESUBSET(esk1_0),ap(c_2Epred__set_2EREST(esk1_0),esk2_0)),esk2_0)) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])]) ).
fof(c_0_20,plain,
! [X28] :
( ~ ne(X28)
| mem(c_2Epred__set_2EREST(X28),arr(arr(X28,bool),arr(X28,bool))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mem_c_2Epred__set_2EREST])])]) ).
cnf(c_0_21,plain,
( X1 = ap(ap(c_2Epred__set_2ESUBSET(X2),X3),X4)
| p(ap(ap(c_2Epred__set_2ESUBSET(X2),X3),X4))
| p(X1)
| ~ mem(X4,arr(X2,bool))
| ~ mem(X3,arr(X2,bool))
| ~ mem(X1,bool)
| ~ ne(X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,negated_conjecture,
mem(esk2_0,arr(esk1_0,bool)),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,negated_conjecture,
ne(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,plain,
( mem(c_2Epred__set_2EREST(X1),arr(arr(X1,bool),arr(X1,bool)))
| ~ ne(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_25,plain,
! [X45] :
( ~ ne(X45)
| mem(c_2Ebool_2EIN(X45),arr(X45,arr(arr(X45,bool),bool))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mem_c_2Ebool_2EIN])])]) ).
cnf(c_0_26,negated_conjecture,
( X1 = ap(ap(c_2Epred__set_2ESUBSET(esk1_0),X2),esk2_0)
| p(ap(ap(c_2Epred__set_2ESUBSET(esk1_0),X2),esk2_0))
| p(X1)
| ~ mem(X2,arr(esk1_0,bool))
| ~ mem(X1,bool) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]) ).
cnf(c_0_27,plain,
( mem(ap(c_2Epred__set_2EREST(X1),X2),arr(X1,bool))
| ~ mem(X2,arr(X1,bool))
| ~ ne(X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_24]) ).
cnf(c_0_28,plain,
( mem(c_2Ebool_2EIN(X1),arr(X1,arr(arr(X1,bool),bool)))
| ~ ne(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_29,plain,
! [X9] :
( ne(X9)
=> ! [X10] :
( mem(X10,arr(X9,bool))
=> ! [X13] :
( mem(X13,X9)
=> ! [X14] :
( mem(X14,X9)
=> ( p(ap(ap(c_2Ebool_2EIN(X9),X13),ap(ap(c_2Epred__set_2EDELETE(X9),X10),X14)))
<=> ( p(ap(ap(c_2Ebool_2EIN(X9),X13),X10))
& X13 != X14 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[conj_thm_2Epred__set_2EIN__DELETE]) ).
fof(c_0_30,plain,
! [X39] :
( ~ ne(X39)
| mem(c_2Epred__set_2ECHOICE(X39),arr(arr(X39,bool),X39)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mem_c_2Epred__set_2ECHOICE])])]) ).
cnf(c_0_31,negated_conjecture,
( X1 = ap(ap(c_2Epred__set_2ESUBSET(esk1_0),ap(c_2Epred__set_2EREST(esk1_0),X2)),esk2_0)
| p(ap(ap(c_2Epred__set_2ESUBSET(esk1_0),ap(c_2Epred__set_2EREST(esk1_0),X2)),esk2_0))
| p(X1)
| ~ mem(X2,arr(esk1_0,bool))
| ~ mem(X1,bool) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_23])]) ).
cnf(c_0_32,negated_conjecture,
~ p(ap(ap(c_2Epred__set_2ESUBSET(esk1_0),ap(c_2Epred__set_2EREST(esk1_0),esk2_0)),esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_33,plain,
( mem(ap(c_2Ebool_2EIN(X1),X2),arr(arr(X1,bool),bool))
| ~ mem(X2,X1)
| ~ ne(X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_28]) ).
fof(c_0_34,plain,
! [X32,X33,X34,X35] :
( ( ~ p(ap(ap(c_2Epred__set_2ESUBSET(X32),X33),X34))
| ~ mem(X35,X32)
| ~ p(ap(ap(c_2Ebool_2EIN(X32),X35),X33))
| p(ap(ap(c_2Ebool_2EIN(X32),X35),X34))
| ~ mem(X34,arr(X32,bool))
| ~ mem(X33,arr(X32,bool))
| ~ ne(X32) )
& ( mem(esk4_3(X32,X33,X34),X32)
| p(ap(ap(c_2Epred__set_2ESUBSET(X32),X33),X34))
| ~ mem(X34,arr(X32,bool))
| ~ mem(X33,arr(X32,bool))
| ~ ne(X32) )
& ( p(ap(ap(c_2Ebool_2EIN(X32),esk4_3(X32,X33,X34)),X33))
| p(ap(ap(c_2Epred__set_2ESUBSET(X32),X33),X34))
| ~ mem(X34,arr(X32,bool))
| ~ mem(X33,arr(X32,bool))
| ~ ne(X32) )
& ( ~ p(ap(ap(c_2Ebool_2EIN(X32),esk4_3(X32,X33,X34)),X34))
| p(ap(ap(c_2Epred__set_2ESUBSET(X32),X33),X34))
| ~ mem(X34,arr(X32,bool))
| ~ mem(X33,arr(X32,bool))
| ~ ne(X32) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax_thm_2Epred__set_2ESUBSET__DEF])])])])])]) ).
fof(c_0_35,plain,
! [X41,X42,X43,X44] :
( ( p(ap(ap(c_2Ebool_2EIN(X41),X43),X42))
| ~ p(ap(ap(c_2Ebool_2EIN(X41),X43),ap(ap(c_2Epred__set_2EDELETE(X41),X42),X44)))
| ~ mem(X44,X41)
| ~ mem(X43,X41)
| ~ mem(X42,arr(X41,bool))
| ~ ne(X41) )
& ( X43 != X44
| ~ p(ap(ap(c_2Ebool_2EIN(X41),X43),ap(ap(c_2Epred__set_2EDELETE(X41),X42),X44)))
| ~ mem(X44,X41)
| ~ mem(X43,X41)
| ~ mem(X42,arr(X41,bool))
| ~ ne(X41) )
& ( ~ p(ap(ap(c_2Ebool_2EIN(X41),X43),X42))
| X43 = X44
| p(ap(ap(c_2Ebool_2EIN(X41),X43),ap(ap(c_2Epred__set_2EDELETE(X41),X42),X44)))
| ~ mem(X44,X41)
| ~ mem(X43,X41)
| ~ mem(X42,arr(X41,bool))
| ~ ne(X41) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_29])])])])]) ).
fof(c_0_36,plain,
! [X29,X30] :
( ~ ne(X29)
| ~ mem(X30,arr(X29,bool))
| ap(c_2Epred__set_2EREST(X29),X30) = ap(ap(c_2Epred__set_2EDELETE(X29),X30),ap(c_2Epred__set_2ECHOICE(X29),X30)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax_thm_2Epred__set_2EREST__DEF])])])]) ).
cnf(c_0_37,plain,
( mem(c_2Epred__set_2ECHOICE(X1),arr(arr(X1,bool),X1))
| ~ ne(X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_38,negated_conjecture,
( X1 = ap(ap(c_2Epred__set_2ESUBSET(esk1_0),ap(c_2Epred__set_2EREST(esk1_0),esk2_0)),esk2_0)
| p(X1)
| ~ mem(X1,bool) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_22]),c_0_32]) ).
cnf(c_0_39,plain,
( mem(ap(ap(c_2Ebool_2EIN(X1),X2),X3),bool)
| ~ mem(X3,arr(X1,bool))
| ~ mem(X2,X1)
| ~ ne(X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_33]) ).
cnf(c_0_40,plain,
( mem(esk4_3(X1,X2,X3),X1)
| p(ap(ap(c_2Epred__set_2ESUBSET(X1),X2),X3))
| ~ mem(X3,arr(X1,bool))
| ~ mem(X2,arr(X1,bool))
| ~ ne(X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_41,plain,
( p(ap(ap(c_2Ebool_2EIN(X1),X2),X3))
| ~ p(ap(ap(c_2Ebool_2EIN(X1),X2),ap(ap(c_2Epred__set_2EDELETE(X1),X3),X4)))
| ~ mem(X4,X1)
| ~ mem(X2,X1)
| ~ mem(X3,arr(X1,bool))
| ~ ne(X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_42,plain,
( ap(c_2Epred__set_2EREST(X1),X2) = ap(ap(c_2Epred__set_2EDELETE(X1),X2),ap(c_2Epred__set_2ECHOICE(X1),X2))
| ~ ne(X1)
| ~ mem(X2,arr(X1,bool)) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_43,plain,
( mem(ap(c_2Epred__set_2ECHOICE(X1),X2),X1)
| ~ mem(X2,arr(X1,bool))
| ~ ne(X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_37]) ).
cnf(c_0_44,negated_conjecture,
( ap(ap(c_2Ebool_2EIN(X1),X2),X3) = ap(ap(c_2Epred__set_2ESUBSET(esk1_0),ap(c_2Epred__set_2EREST(esk1_0),esk2_0)),esk2_0)
| p(ap(ap(c_2Ebool_2EIN(X1),X2),X3))
| ~ mem(X3,arr(X1,bool))
| ~ mem(X2,X1)
| ~ ne(X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_45,negated_conjecture,
( p(ap(ap(c_2Epred__set_2ESUBSET(esk1_0),X1),esk2_0))
| mem(esk4_3(esk1_0,X1,esk2_0),esk1_0)
| ~ mem(X1,arr(esk1_0,bool)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_22]),c_0_23])]) ).
cnf(c_0_46,plain,
( p(ap(ap(c_2Ebool_2EIN(X1),X2),X3))
| ~ p(ap(ap(c_2Ebool_2EIN(X1),X2),ap(c_2Epred__set_2EREST(X1),X3)))
| ~ mem(X3,arr(X1,bool))
| ~ mem(X2,X1)
| ~ ne(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]) ).
cnf(c_0_47,negated_conjecture,
( ap(ap(c_2Ebool_2EIN(X1),X2),ap(c_2Epred__set_2EREST(X1),X3)) = ap(ap(c_2Epred__set_2ESUBSET(esk1_0),ap(c_2Epred__set_2EREST(esk1_0),esk2_0)),esk2_0)
| p(ap(ap(c_2Ebool_2EIN(X1),X2),ap(c_2Epred__set_2EREST(X1),X3)))
| ~ mem(X3,arr(X1,bool))
| ~ mem(X2,X1)
| ~ ne(X1) ),
inference(spm,[status(thm)],[c_0_44,c_0_27]) ).
cnf(c_0_48,negated_conjecture,
( ap(ap(c_2Ebool_2EIN(esk1_0),X1),esk2_0) = ap(ap(c_2Epred__set_2ESUBSET(esk1_0),ap(c_2Epred__set_2EREST(esk1_0),esk2_0)),esk2_0)
| p(ap(ap(c_2Ebool_2EIN(esk1_0),X1),esk2_0))
| ~ mem(X1,esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_22]),c_0_23])]) ).
cnf(c_0_49,negated_conjecture,
( mem(esk4_3(esk1_0,ap(c_2Epred__set_2EREST(esk1_0),esk2_0),esk2_0),esk1_0)
| ~ mem(ap(c_2Epred__set_2EREST(esk1_0),esk2_0),arr(esk1_0,bool)) ),
inference(spm,[status(thm)],[c_0_32,c_0_45]) ).
cnf(c_0_50,plain,
( p(ap(ap(c_2Ebool_2EIN(X1),esk4_3(X1,X2,X3)),X2))
| p(ap(ap(c_2Epred__set_2ESUBSET(X1),X2),X3))
| ~ mem(X3,arr(X1,bool))
| ~ mem(X2,arr(X1,bool))
| ~ ne(X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_51,negated_conjecture,
( ap(ap(c_2Ebool_2EIN(X1),X2),ap(c_2Epred__set_2EREST(X1),X3)) = ap(ap(c_2Epred__set_2ESUBSET(esk1_0),ap(c_2Epred__set_2EREST(esk1_0),esk2_0)),esk2_0)
| p(ap(ap(c_2Ebool_2EIN(X1),X2),X3))
| ~ mem(X3,arr(X1,bool))
| ~ mem(X2,X1)
| ~ ne(X1) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_52,plain,
( p(ap(ap(c_2Epred__set_2ESUBSET(X1),X2),X3))
| ~ p(ap(ap(c_2Ebool_2EIN(X1),esk4_3(X1,X2,X3)),X3))
| ~ mem(X3,arr(X1,bool))
| ~ mem(X2,arr(X1,bool))
| ~ ne(X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_53,negated_conjecture,
( ap(ap(c_2Ebool_2EIN(esk1_0),esk4_3(esk1_0,ap(c_2Epred__set_2EREST(esk1_0),esk2_0),esk2_0)),esk2_0) = ap(ap(c_2Epred__set_2ESUBSET(esk1_0),ap(c_2Epred__set_2EREST(esk1_0),esk2_0)),esk2_0)
| p(ap(ap(c_2Ebool_2EIN(esk1_0),esk4_3(esk1_0,ap(c_2Epred__set_2EREST(esk1_0),esk2_0),esk2_0)),esk2_0))
| ~ mem(ap(c_2Epred__set_2EREST(esk1_0),esk2_0),arr(esk1_0,bool)) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_54,negated_conjecture,
( p(ap(ap(c_2Ebool_2EIN(X1),esk4_3(X1,ap(c_2Epred__set_2EREST(X1),X2),X3)),X2))
| p(ap(ap(c_2Epred__set_2ESUBSET(X1),ap(c_2Epred__set_2EREST(X1),X2)),X3))
| ~ mem(X3,arr(X1,bool))
| ~ mem(X2,arr(X1,bool))
| ~ ne(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_32]),c_0_40]),c_0_27]) ).
cnf(c_0_55,negated_conjecture,
( ap(ap(c_2Ebool_2EIN(esk1_0),esk4_3(esk1_0,ap(c_2Epred__set_2EREST(esk1_0),esk2_0),esk2_0)),esk2_0) = ap(ap(c_2Epred__set_2ESUBSET(esk1_0),ap(c_2Epred__set_2EREST(esk1_0),esk2_0)),esk2_0)
| ~ mem(ap(c_2Epred__set_2EREST(esk1_0),esk2_0),arr(esk1_0,bool)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_22]),c_0_23])]),c_0_32]) ).
cnf(c_0_56,negated_conjecture,
~ mem(ap(c_2Epred__set_2EREST(esk1_0),esk2_0),arr(esk1_0,bool)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_22]),c_0_23])]),c_0_32]) ).
cnf(c_0_57,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_27]),c_0_22]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : ITP004+2 : TPTP v8.2.0. Bugfixed v7.5.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n006.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sat May 18 16:45:38 EDT 2024
% 0.14/0.35 % 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/benchmark/theBenchmark.p
% 2.33/0.78 # Version: 3.1.0
% 2.33/0.78 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.33/0.78 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.33/0.78 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.33/0.78 # Starting new_bool_3 with 300s (1) cores
% 2.33/0.78 # Starting new_bool_1 with 300s (1) cores
% 2.33/0.78 # Starting sh5l with 300s (1) cores
% 2.33/0.78 # new_bool_3 with pid 13905 completed with status 0
% 2.33/0.78 # Result found by new_bool_3
% 2.33/0.78 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.33/0.78 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.33/0.78 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.33/0.78 # Starting new_bool_3 with 300s (1) cores
% 2.33/0.78 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.33/0.78 # Search class: FGHSF-FFMS31-MFFFFFNN
% 2.33/0.78 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.33/0.78 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 2.33/0.78 # SAT001_MinMin_p005000_rr_RG with pid 13908 completed with status 0
% 2.33/0.78 # Result found by SAT001_MinMin_p005000_rr_RG
% 2.33/0.78 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.33/0.78 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.33/0.78 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.33/0.78 # Starting new_bool_3 with 300s (1) cores
% 2.33/0.78 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.33/0.78 # Search class: FGHSF-FFMS31-MFFFFFNN
% 2.33/0.78 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.33/0.78 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 2.33/0.78 # Preprocessing time : 0.002 s
% 2.33/0.78 # Presaturation interreduction done
% 2.33/0.78
% 2.33/0.78 # Proof found!
% 2.33/0.78 # SZS status Theorem
% 2.33/0.78 # SZS output start CNFRefutation
% See solution above
% 2.33/0.78 # Parsed axioms : 27
% 2.33/0.78 # Removed by relevancy pruning/SinE : 13
% 2.33/0.78 # Initial clauses : 23
% 2.33/0.78 # Removed in clause preprocessing : 0
% 2.33/0.78 # Initial clauses in saturation : 23
% 2.33/0.78 # Processed clauses : 947
% 2.33/0.78 # ...of these trivial : 10
% 2.33/0.78 # ...subsumed : 293
% 2.33/0.78 # ...remaining for further processing : 644
% 2.33/0.78 # Other redundant clauses eliminated : 1
% 2.33/0.78 # Clauses deleted for lack of memory : 0
% 2.33/0.78 # Backward-subsumed : 158
% 2.33/0.78 # Backward-rewritten : 19
% 2.33/0.78 # Generated clauses : 7792
% 2.33/0.78 # ...of the previous two non-redundant : 7325
% 2.33/0.78 # ...aggressively subsumed : 0
% 2.33/0.78 # Contextual simplify-reflections : 36
% 2.33/0.78 # Paramodulations : 7778
% 2.33/0.78 # Factorizations : 12
% 2.33/0.78 # NegExts : 0
% 2.33/0.78 # Equation resolutions : 2
% 2.33/0.78 # Disequality decompositions : 0
% 2.33/0.78 # Total rewrite steps : 1216
% 2.33/0.78 # ...of those cached : 1211
% 2.33/0.78 # Propositional unsat checks : 0
% 2.33/0.78 # Propositional check models : 0
% 2.33/0.78 # Propositional check unsatisfiable : 0
% 2.33/0.78 # Propositional clauses : 0
% 2.33/0.78 # Propositional clauses after purity: 0
% 2.33/0.78 # Propositional unsat core size : 0
% 2.33/0.78 # Propositional preprocessing time : 0.000
% 2.33/0.78 # Propositional encoding time : 0.000
% 2.33/0.78 # Propositional solver time : 0.000
% 2.33/0.78 # Success case prop preproc time : 0.000
% 2.33/0.78 # Success case prop encoding time : 0.000
% 2.33/0.78 # Success case prop solver time : 0.000
% 2.33/0.78 # Current number of processed clauses : 443
% 2.33/0.78 # Positive orientable unit clauses : 5
% 2.33/0.78 # Positive unorientable unit clauses: 0
% 2.33/0.78 # Negative unit clauses : 2
% 2.33/0.78 # Non-unit-clauses : 436
% 2.33/0.78 # Current number of unprocessed clauses: 6302
% 2.33/0.78 # ...number of literals in the above : 50004
% 2.33/0.78 # Current number of archived formulas : 0
% 2.33/0.78 # Current number of archived clauses : 200
% 2.33/0.78 # Clause-clause subsumption calls (NU) : 25993
% 2.33/0.78 # Rec. Clause-clause subsumption calls : 2164
% 2.33/0.78 # Non-unit clause-clause subsumptions : 442
% 2.33/0.78 # Unit Clause-clause subsumption calls : 135
% 2.33/0.78 # Rewrite failures with RHS unbound : 0
% 2.33/0.78 # BW rewrite match attempts : 16
% 2.33/0.78 # BW rewrite match successes : 2
% 2.33/0.78 # Condensation attempts : 0
% 2.33/0.78 # Condensation successes : 0
% 2.33/0.78 # Termbank termtop insertions : 491009
% 2.33/0.78 # Search garbage collected termcells : 621
% 2.33/0.78
% 2.33/0.78 # -------------------------------------------------
% 2.33/0.78 # User time : 0.271 s
% 2.33/0.78 # System time : 0.011 s
% 2.33/0.78 # Total time : 0.283 s
% 2.33/0.78 # Maximum resident set size: 1896 pages
% 2.33/0.78
% 2.33/0.78 # -------------------------------------------------
% 2.33/0.78 # User time : 0.274 s
% 2.33/0.78 # System time : 0.012 s
% 2.33/0.78 # Total time : 0.286 s
% 2.33/0.78 # Maximum resident set size: 1760 pages
% 2.33/0.78 % E---3.1 exiting
% 2.33/0.78 % E exiting
%------------------------------------------------------------------------------