TSTP Solution File: NUM580+3 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : NUM580+3 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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 : Tue May 21 01:27:02 EDT 2024
% Result : Theorem 50.30s 6.94s
% Output : CNFRefutation 50.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 50 ( 16 unt; 0 def)
% Number of atoms : 277 ( 43 equ)
% Maximal formula atoms : 52 ( 5 avg)
% Number of connectives : 346 ( 119 ~; 118 |; 74 &)
% ( 10 <=>; 25 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 6 con; 0-3 aty)
% Number of variables : 77 ( 0 sgn 52 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
& ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xi))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X1) ) )
=> ( ( aSet0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
& ! [X1] :
( aElementOf0(X1,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
<=> ( aElement0(X1)
& ( aElementOf0(X1,xQ)
| X1 = szmzizndt0(sdtlpdtrp0(xN,xi)) ) ) ) )
=> sbrdtbr0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) = xK ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(mDefDiff,axiom,
! [X1,X2] :
( ( aSet0(X1)
& aElement0(X2) )
=> ! [X3] :
( X3 = sdtmndt0(X1,X2)
<=> ( aSet0(X3)
& ! [X4] :
( aElementOf0(X4,X3)
<=> ( aElement0(X4)
& aElementOf0(X4,X1)
& X4 != X2 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefDiff) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mEOfElem) ).
fof(m__3671,hypothesis,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( aSet0(sdtlpdtrp0(xN,X1))
& ! [X2] :
( aElementOf0(X2,sdtlpdtrp0(xN,X1))
=> aElementOf0(X2,szNzAzT0) )
& aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3671) ).
fof(m__3989,hypothesis,
aElementOf0(xi,szNzAzT0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3989) ).
fof(m__3989_02,hypothesis,
( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
& ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xi))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X1) )
& aSet0(sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
& ! [X1] :
( aElementOf0(X1,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
<=> ( aElement0(X1)
& aElementOf0(X1,sdtlpdtrp0(xN,xi))
& X1 != szmzizndt0(sdtlpdtrp0(xN,xi)) ) )
& aSet0(xQ)
& ! [X1] :
( aElementOf0(X1,xQ)
=> aElementOf0(X1,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& aSubsetOf0(xQ,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
& sbrdtbr0(xQ) = xk
& aElementOf0(xQ,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))),xk)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3989_02) ).
fof(mDefSub,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefSub) ).
fof(mCardCons,axiom,
! [X1] :
( ( aSet0(X1)
& isFinite0(X1) )
=> ! [X2] :
( aElement0(X2)
=> ( ~ aElementOf0(X2,X1)
=> sbrdtbr0(sdtpldt0(X1,X2)) = szszuzczcdt0(sbrdtbr0(X1)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mCardCons) ).
fof(mCardNum,axiom,
! [X1] :
( aSet0(X1)
=> ( aElementOf0(sbrdtbr0(X1),szNzAzT0)
<=> isFinite0(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mCardNum) ).
fof(m__3533,hypothesis,
( aElementOf0(xk,szNzAzT0)
& szszuzczcdt0(xk) = xK ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3533) ).
fof(c_0_10,negated_conjecture,
~ ( ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
& ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xi))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X1) ) )
=> ( ( aSet0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
& ! [X1] :
( aElementOf0(X1,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
<=> ( aElement0(X1)
& ( aElementOf0(X1,xQ)
| X1 = szmzizndt0(sdtlpdtrp0(xN,xi)) ) ) ) )
=> sbrdtbr0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) = xK ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_11,negated_conjecture,
! [X8,X9] :
( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
& ( ~ aElementOf0(X8,sdtlpdtrp0(xN,xi))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X8) )
& aSet0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
& ( aElement0(X9)
| ~ aElementOf0(X9,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& ( aElementOf0(X9,xQ)
| X9 = szmzizndt0(sdtlpdtrp0(xN,xi))
| ~ aElementOf0(X9,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& ( ~ aElementOf0(X9,xQ)
| ~ aElement0(X9)
| aElementOf0(X9,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& ( X9 != szmzizndt0(sdtlpdtrp0(xN,xi))
| ~ aElement0(X9)
| aElementOf0(X9,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& sbrdtbr0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) != xK ),
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_10])])])])]) ).
fof(c_0_12,plain,
! [X1,X2] :
( ( aSet0(X1)
& aElement0(X2) )
=> ! [X3] :
( X3 = sdtmndt0(X1,X2)
<=> ( aSet0(X3)
& ! [X4] :
( aElementOf0(X4,X3)
<=> ( aElement0(X4)
& aElementOf0(X4,X1)
& X4 != X2 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[mDefDiff]) ).
cnf(c_0_13,negated_conjecture,
( aElementOf0(X1,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
| X1 != szmzizndt0(sdtlpdtrp0(xN,xi))
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_14,plain,
! [X114,X115] :
( ~ aSet0(X114)
| ~ aElementOf0(X115,X114)
| aElement0(X115) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEOfElem])])])]) ).
fof(c_0_15,hypothesis,
! [X109,X110] :
( ( aSet0(sdtlpdtrp0(xN,X109))
| ~ aElementOf0(X109,szNzAzT0) )
& ( ~ aElementOf0(X110,sdtlpdtrp0(xN,X109))
| aElementOf0(X110,szNzAzT0)
| ~ aElementOf0(X109,szNzAzT0) )
& ( aSubsetOf0(sdtlpdtrp0(xN,X109),szNzAzT0)
| ~ aElementOf0(X109,szNzAzT0) )
& ( isCountable0(sdtlpdtrp0(xN,X109))
| ~ aElementOf0(X109,szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3671])])])])]) ).
fof(c_0_16,plain,
! [X143,X144,X145,X146,X147,X148] :
( ( aSet0(X145)
| X145 != sdtmndt0(X143,X144)
| ~ aSet0(X143)
| ~ aElement0(X144) )
& ( aElement0(X146)
| ~ aElementOf0(X146,X145)
| X145 != sdtmndt0(X143,X144)
| ~ aSet0(X143)
| ~ aElement0(X144) )
& ( aElementOf0(X146,X143)
| ~ aElementOf0(X146,X145)
| X145 != sdtmndt0(X143,X144)
| ~ aSet0(X143)
| ~ aElement0(X144) )
& ( X146 != X144
| ~ aElementOf0(X146,X145)
| X145 != sdtmndt0(X143,X144)
| ~ aSet0(X143)
| ~ aElement0(X144) )
& ( ~ aElement0(X147)
| ~ aElementOf0(X147,X143)
| X147 = X144
| aElementOf0(X147,X145)
| X145 != sdtmndt0(X143,X144)
| ~ aSet0(X143)
| ~ aElement0(X144) )
& ( ~ aElementOf0(esk24_3(X143,X144,X148),X148)
| ~ aElement0(esk24_3(X143,X144,X148))
| ~ aElementOf0(esk24_3(X143,X144,X148),X143)
| esk24_3(X143,X144,X148) = X144
| ~ aSet0(X148)
| X148 = sdtmndt0(X143,X144)
| ~ aSet0(X143)
| ~ aElement0(X144) )
& ( aElement0(esk24_3(X143,X144,X148))
| aElementOf0(esk24_3(X143,X144,X148),X148)
| ~ aSet0(X148)
| X148 = sdtmndt0(X143,X144)
| ~ aSet0(X143)
| ~ aElement0(X144) )
& ( aElementOf0(esk24_3(X143,X144,X148),X143)
| aElementOf0(esk24_3(X143,X144,X148),X148)
| ~ aSet0(X148)
| X148 = sdtmndt0(X143,X144)
| ~ aSet0(X143)
| ~ aElement0(X144) )
& ( esk24_3(X143,X144,X148) != X144
| aElementOf0(esk24_3(X143,X144,X148),X148)
| ~ aSet0(X148)
| X148 = sdtmndt0(X143,X144)
| ~ aSet0(X143)
| ~ aElement0(X144) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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)],[c_0_12])])])])])])]) ).
cnf(c_0_17,negated_conjecture,
( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ aElement0(szmzizndt0(sdtlpdtrp0(xN,xi))) ),
inference(er,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
( aElement0(X2)
| ~ aSet0(X1)
| ~ aElementOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,hypothesis,
( aSet0(sdtlpdtrp0(xN,X1))
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,hypothesis,
aElementOf0(xi,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3989]) ).
fof(c_0_21,hypothesis,
( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
& ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xi))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X1) )
& aSet0(sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
& ! [X1] :
( aElementOf0(X1,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
<=> ( aElement0(X1)
& aElementOf0(X1,sdtlpdtrp0(xN,xi))
& X1 != szmzizndt0(sdtlpdtrp0(xN,xi)) ) )
& aSet0(xQ)
& ! [X1] :
( aElementOf0(X1,xQ)
=> aElementOf0(X1,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& aSubsetOf0(xQ,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
& sbrdtbr0(xQ) = xk
& aElementOf0(xQ,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))),xk)) ),
inference(fof_simplification,[status(thm)],[m__3989_02]) ).
cnf(c_0_22,plain,
( X1 != X2
| ~ aElementOf0(X1,X3)
| X3 != sdtmndt0(X4,X2)
| ~ aSet0(X4)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_23,plain,
! [X116,X117,X118,X119] :
( ( aSet0(X117)
| ~ aSubsetOf0(X117,X116)
| ~ aSet0(X116) )
& ( ~ aElementOf0(X118,X117)
| aElementOf0(X118,X116)
| ~ aSubsetOf0(X117,X116)
| ~ aSet0(X116) )
& ( aElementOf0(esk22_2(X116,X119),X119)
| ~ aSet0(X119)
| aSubsetOf0(X119,X116)
| ~ aSet0(X116) )
& ( ~ aElementOf0(esk22_2(X116,X119),X116)
| ~ aSet0(X119)
| aSubsetOf0(X119,X116)
| ~ aSet0(X116) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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)],[mDefSub])])])])])])]) ).
cnf(c_0_24,plain,
( aSet0(X1)
| X1 != sdtmndt0(X2,X3)
| ~ aSet0(X2)
| ~ aElement0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_25,negated_conjecture,
( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),X1)
| ~ aSet0(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_26,negated_conjecture,
aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_27,hypothesis,
aSet0(sdtlpdtrp0(xN,xi)),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
fof(c_0_28,plain,
! [X1] :
( ( aSet0(X1)
& isFinite0(X1) )
=> ! [X2] :
( aElement0(X2)
=> ( ~ aElementOf0(X2,X1)
=> sbrdtbr0(sdtpldt0(X1,X2)) = szszuzczcdt0(sbrdtbr0(X1)) ) ) ),
inference(fof_simplification,[status(thm)],[mCardCons]) ).
fof(c_0_29,plain,
! [X29] :
( ( ~ aElementOf0(sbrdtbr0(X29),szNzAzT0)
| isFinite0(X29)
| ~ aSet0(X29) )
& ( ~ isFinite0(X29)
| aElementOf0(sbrdtbr0(X29),szNzAzT0)
| ~ aSet0(X29) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mCardNum])])])]) ).
fof(c_0_30,hypothesis,
! [X80,X81,X82] :
( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
& ( ~ aElementOf0(X80,sdtlpdtrp0(xN,xi))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X80) )
& aSet0(sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
& ( aElement0(X81)
| ~ aElementOf0(X81,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& ( aElementOf0(X81,sdtlpdtrp0(xN,xi))
| ~ aElementOf0(X81,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& ( X81 != szmzizndt0(sdtlpdtrp0(xN,xi))
| ~ aElementOf0(X81,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& ( ~ aElement0(X81)
| ~ aElementOf0(X81,sdtlpdtrp0(xN,xi))
| X81 = szmzizndt0(sdtlpdtrp0(xN,xi))
| aElementOf0(X81,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& aSet0(xQ)
& ( ~ aElementOf0(X82,xQ)
| aElementOf0(X82,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& aSubsetOf0(xQ,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
& sbrdtbr0(xQ) = xk
& aElementOf0(xQ,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))),xk)) ),
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_21])])])])]) ).
cnf(c_0_31,plain,
( ~ aElementOf0(X1,sdtmndt0(X2,X1))
| ~ aElement0(X1)
| ~ aSet0(X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_22])]) ).
cnf(c_0_32,plain,
( aElementOf0(X1,X3)
| ~ aElementOf0(X1,X2)
| ~ aSubsetOf0(X2,X3)
| ~ aSet0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_33,plain,
( aSet0(sdtmndt0(X1,X2))
| ~ aElement0(X2)
| ~ aSet0(X1) ),
inference(er,[status(thm)],[c_0_24]) ).
cnf(c_0_34,negated_conjecture,
aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
cnf(c_0_35,negated_conjecture,
aSet0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_36,plain,
! [X31,X32] :
( ~ aSet0(X31)
| ~ isFinite0(X31)
| ~ aElement0(X32)
| aElementOf0(X32,X31)
| sbrdtbr0(sdtpldt0(X31,X32)) = szszuzczcdt0(sbrdtbr0(X31)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_28])])])]) ).
cnf(c_0_37,plain,
( isFinite0(X1)
| ~ aElementOf0(sbrdtbr0(X1),szNzAzT0)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_38,hypothesis,
sbrdtbr0(xQ) = xk,
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_39,hypothesis,
aElementOf0(xk,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3533]) ).
cnf(c_0_40,hypothesis,
aSet0(xQ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_41,plain,
( ~ aSubsetOf0(X1,sdtmndt0(X2,X3))
| ~ aElementOf0(X3,X1)
| ~ aElement0(X3)
| ~ aSet0(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_42,hypothesis,
aSubsetOf0(xQ,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_43,negated_conjecture,
aElement0(szmzizndt0(sdtlpdtrp0(xN,xi))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_34]),c_0_35])]) ).
cnf(c_0_44,negated_conjecture,
sbrdtbr0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) != xK,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_45,plain,
( aElementOf0(X2,X1)
| sbrdtbr0(sdtpldt0(X1,X2)) = szszuzczcdt0(sbrdtbr0(X1))
| ~ aSet0(X1)
| ~ isFinite0(X1)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_46,hypothesis,
szszuzczcdt0(xk) = xK,
inference(split_conjunct,[status(thm)],[m__3533]) ).
cnf(c_0_47,hypothesis,
isFinite0(xQ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]),c_0_40])]) ).
cnf(c_0_48,hypothesis,
~ aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),xQ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]),c_0_27])]) ).
cnf(c_0_49,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_38]),c_0_46]),c_0_47]),c_0_43]),c_0_40])]),c_0_48]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : NUM580+3 : TPTP v8.2.0. Released v4.0.0.
% 0.04/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n029.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon May 20 05:40:23 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.18/0.48 Running first-order model finding
% 0.18/0.48 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 50.30/6.94 # Version: 3.1.0
% 50.30/6.94 # Preprocessing class: FSLSSMSMSSSNFFN.
% 50.30/6.94 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 50.30/6.94 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 50.30/6.94 # Starting new_bool_3 with 300s (1) cores
% 50.30/6.94 # Starting new_bool_1 with 300s (1) cores
% 50.30/6.94 # Starting sh5l with 300s (1) cores
% 50.30/6.94 # sh5l with pid 28291 completed with status 0
% 50.30/6.94 # Result found by sh5l
% 50.30/6.94 # Preprocessing class: FSLSSMSMSSSNFFN.
% 50.30/6.94 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 50.30/6.94 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 50.30/6.94 # Starting new_bool_3 with 300s (1) cores
% 50.30/6.94 # Starting new_bool_1 with 300s (1) cores
% 50.30/6.94 # Starting sh5l with 300s (1) cores
% 50.30/6.94 # SinE strategy is gf500_gu_R04_F100_L20000
% 50.30/6.94 # Search class: FGHSF-SMLM32-MFFFFFNN
% 50.30/6.94 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 50.30/6.94 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 163s (1) cores
% 50.30/6.94 # G-E--_208_C18_F1_SE_CS_SP_PS_S2o with pid 28299 completed with status 0
% 50.30/6.94 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2o
% 50.30/6.94 # Preprocessing class: FSLSSMSMSSSNFFN.
% 50.30/6.94 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 50.30/6.94 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 50.30/6.94 # Starting new_bool_3 with 300s (1) cores
% 50.30/6.94 # Starting new_bool_1 with 300s (1) cores
% 50.30/6.94 # Starting sh5l with 300s (1) cores
% 50.30/6.94 # SinE strategy is gf500_gu_R04_F100_L20000
% 50.30/6.94 # Search class: FGHSF-SMLM32-MFFFFFNN
% 50.30/6.94 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 50.30/6.94 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 163s (1) cores
% 50.30/6.94 # Preprocessing time : 0.163 s
% 50.30/6.94 # Presaturation interreduction done
% 50.30/6.94
% 50.30/6.94 # Proof found!
% 50.30/6.94 # SZS status Theorem
% 50.30/6.94 # SZS output start CNFRefutation
% See solution above
% 50.30/6.94 # Parsed axioms : 87
% 50.30/6.94 # Removed by relevancy pruning/SinE : 2
% 50.30/6.94 # Initial clauses : 4198
% 50.30/6.94 # Removed in clause preprocessing : 7
% 50.30/6.94 # Initial clauses in saturation : 4191
% 50.30/6.94 # Processed clauses : 6518
% 50.30/6.94 # ...of these trivial : 11
% 50.30/6.94 # ...subsumed : 688
% 50.30/6.94 # ...remaining for further processing : 5819
% 50.30/6.94 # Other redundant clauses eliminated : 1934
% 50.30/6.94 # Clauses deleted for lack of memory : 0
% 50.30/6.94 # Backward-subsumed : 14
% 50.30/6.94 # Backward-rewritten : 4
% 50.30/6.94 # Generated clauses : 3276
% 50.30/6.94 # ...of the previous two non-redundant : 3198
% 50.30/6.94 # ...aggressively subsumed : 0
% 50.30/6.94 # Contextual simplify-reflections : 46
% 50.30/6.94 # Paramodulations : 1534
% 50.30/6.94 # Factorizations : 0
% 50.30/6.94 # NegExts : 0
% 50.30/6.94 # Equation resolutions : 1936
% 50.30/6.94 # Disequality decompositions : 0
% 50.30/6.94 # Total rewrite steps : 685
% 50.30/6.94 # ...of those cached : 586
% 50.30/6.94 # Propositional unsat checks : 0
% 50.30/6.94 # Propositional check models : 0
% 50.30/6.94 # Propositional check unsatisfiable : 0
% 50.30/6.94 # Propositional clauses : 0
% 50.30/6.94 # Propositional clauses after purity: 0
% 50.30/6.94 # Propositional unsat core size : 0
% 50.30/6.94 # Propositional preprocessing time : 0.000
% 50.30/6.94 # Propositional encoding time : 0.000
% 50.30/6.94 # Propositional solver time : 0.000
% 50.30/6.94 # Success case prop preproc time : 0.000
% 50.30/6.94 # Success case prop encoding time : 0.000
% 50.30/6.94 # Success case prop solver time : 0.000
% 50.30/6.94 # Current number of processed clauses : 464
% 50.30/6.94 # Positive orientable unit clauses : 196
% 50.30/6.94 # Positive unorientable unit clauses: 0
% 50.30/6.94 # Negative unit clauses : 49
% 50.30/6.94 # Non-unit-clauses : 219
% 50.30/6.94 # Current number of unprocessed clauses: 4458
% 50.30/6.94 # ...number of literals in the above : 44352
% 50.30/6.94 # Current number of archived formulas : 0
% 50.30/6.94 # Current number of archived clauses : 3615
% 50.30/6.94 # Clause-clause subsumption calls (NU) : 7244210
% 50.30/6.94 # Rec. Clause-clause subsumption calls : 69884
% 50.30/6.94 # Non-unit clause-clause subsumptions : 680
% 50.30/6.94 # Unit Clause-clause subsumption calls : 2257
% 50.30/6.94 # Rewrite failures with RHS unbound : 0
% 50.30/6.94 # BW rewrite match attempts : 143
% 50.30/6.94 # BW rewrite match successes : 14
% 50.30/6.94 # Condensation attempts : 0
% 50.30/6.94 # Condensation successes : 0
% 50.30/6.94 # Termbank termtop insertions : 622912
% 50.30/6.94 # Search garbage collected termcells : 26813
% 50.30/6.94
% 50.30/6.94 # -------------------------------------------------
% 50.30/6.94 # User time : 6.385 s
% 50.30/6.94 # System time : 0.041 s
% 50.30/6.94 # Total time : 6.426 s
% 50.30/6.94 # Maximum resident set size: 13296 pages
% 50.30/6.94
% 50.30/6.94 # -------------------------------------------------
% 50.30/6.94 # User time : 6.388 s
% 50.30/6.94 # System time : 0.045 s
% 50.30/6.94 # Total time : 6.433 s
% 50.30/6.94 # Maximum resident set size: 1824 pages
% 50.30/6.94 % E---3.1 exiting
%------------------------------------------------------------------------------