0.02/0.13	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.02/0.13	% Command  : tptp2X_and_run_prover9 %d %s
0.10/0.34	% Computer : n019.cluster.edu
0.10/0.34	% Model    : x86_64 x86_64
0.10/0.34	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.10/0.34	% Memory   : 8042.1875MB
0.10/0.34	% OS       : Linux 3.10.0-693.el7.x86_64
0.10/0.34	% CPULimit : 960
0.10/0.34	% WCLimit  : 120
0.10/0.34	% DateTime : Tue Aug  9 02:10:51 EDT 2022
0.10/0.34	% CPUTime  : 
0.78/1.10	============================== Prover9 ===============================
0.78/1.10	Prover9 (32) version 2009-11A, November 2009.
0.78/1.10	Process 19350 was started by sandbox2 on n019.cluster.edu,
0.78/1.10	Tue Aug  9 02:10:51 2022
0.78/1.10	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_19197_n019.cluster.edu".
0.78/1.10	============================== end of head ===========================
0.78/1.10	
0.78/1.10	============================== INPUT =================================
0.78/1.10	
0.78/1.10	% Reading from file /tmp/Prover9_19197_n019.cluster.edu
0.78/1.10	
0.78/1.10	set(prolog_style_variables).
0.78/1.10	set(auto2).
0.78/1.10	    % set(auto2) -> set(auto).
0.78/1.10	    % set(auto) -> set(auto_inference).
0.78/1.10	    % set(auto) -> set(auto_setup).
0.78/1.10	    % set(auto_setup) -> set(predicate_elim).
0.78/1.10	    % set(auto_setup) -> assign(eq_defs, unfold).
0.78/1.10	    % set(auto) -> set(auto_limits).
0.78/1.10	    % set(auto_limits) -> assign(max_weight, "100.000").
0.78/1.10	    % set(auto_limits) -> assign(sos_limit, 20000).
0.78/1.10	    % set(auto) -> set(auto_denials).
0.78/1.10	    % set(auto) -> set(auto_process).
0.78/1.10	    % set(auto2) -> assign(new_constants, 1).
0.78/1.10	    % set(auto2) -> assign(fold_denial_max, 3).
0.78/1.10	    % set(auto2) -> assign(max_weight, "200.000").
0.78/1.10	    % set(auto2) -> assign(max_hours, 1).
0.78/1.10	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.78/1.10	    % set(auto2) -> assign(max_seconds, 0).
0.78/1.10	    % set(auto2) -> assign(max_minutes, 5).
0.78/1.10	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.78/1.10	    % set(auto2) -> set(sort_initial_sos).
0.78/1.10	    % set(auto2) -> assign(sos_limit, -1).
0.78/1.10	    % set(auto2) -> assign(lrs_ticks, 3000).
0.78/1.10	    % set(auto2) -> assign(max_megs, 400).
0.78/1.10	    % set(auto2) -> assign(stats, some).
0.78/1.10	    % set(auto2) -> clear(echo_input).
0.78/1.10	    % set(auto2) -> set(quiet).
0.78/1.10	    % set(auto2) -> clear(print_initial_clauses).
0.78/1.10	    % set(auto2) -> clear(print_given).
0.78/1.10	assign(lrs_ticks,-1).
0.78/1.10	assign(sos_limit,10000).
0.78/1.10	assign(order,kbo).
0.78/1.10	set(lex_order_vars).
0.78/1.10	clear(print_given).
0.78/1.10	
0.78/1.10	% formulas(sos).  % not echoed (91 formulas)
0.78/1.10	
0.78/1.10	============================== end of input ==========================
0.78/1.10	
0.78/1.10	% From the command line: assign(max_seconds, 960).
0.78/1.10	
0.78/1.10	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.78/1.10	
0.78/1.10	% Formulas that are not ordinary clauses:
0.78/1.10	1 (all W0 (W0 = slcrc0 <-> aSet0(W0) & -(exists W1 aElementOf0(W1,W0)))) # label(mDefEmp) # label(definition) # label(non_clause).  [assumption].
0.78/1.10	2 (all W0 (aSet0(W0) -> (all W1 (aSubsetOf0(W1,W0) <-> aSet0(W1) & (all W2 (aElementOf0(W2,W1) -> aElementOf0(W2,W0))))))) # label(mDefSub) # label(definition) # label(non_clause).  [assumption].
0.78/1.10	3 (all W0 all W1 (aSet0(W0) & aElement0(W1) -> (all W2 (W2 = sdtpldt0(W0,W1) <-> aSet0(W2) & (all W3 (aElementOf0(W3,W2) <-> aElement0(W3) & (aElementOf0(W3,W0) | W3 = W1))))))) # label(mDefCons) # label(definition) # label(non_clause).  [assumption].
0.78/1.10	4 (all W0 all W1 (aSet0(W0) & aElement0(W1) -> (all W2 (W2 = sdtmndt0(W0,W1) <-> aSet0(W2) & (all W3 (aElementOf0(W3,W2) <-> aElement0(W3) & aElementOf0(W3,W0) & W3 != W1)))))) # label(mDefDiff) # label(definition) # label(non_clause).  [assumption].
0.78/1.10	5 (all W0 (aSubsetOf0(W0,szNzAzT0) & W0 != slcrc0 -> (all W1 (W1 = szmzizndt0(W0) <-> aElementOf0(W1,W0) & (all W2 (aElementOf0(W2,W0) -> sdtlseqdt0(W1,W2))))))) # label(mDefMin) # label(definition) # label(non_clause).  [assumption].
0.78/1.10	6 (all W0 (aSubsetOf0(W0,szNzAzT0) & isFinite0(W0) & W0 != slcrc0 -> (all W1 (W1 = szmzazxdt0(W0) <-> aElementOf0(W1,W0) & (all W2 (aElementOf0(W2,W0) -> sdtlseqdt0(W2,W1))))))) # label(mDefMax) # label(definition) # label(non_clause).  [assumption].
0.78/1.10	7 (all W0 (aElementOf0(W0,szNzAzT0) -> (all W1 (W1 = slbdtrb0(W0) <-> aSet0(W1) & (all W2 (aElementOf0(W2,W1) <-> aElementOf0(W2,szNzAzT0) & sdtlseqdt0(szszuzczcdt0(W2),W0))))))) # label(mDefSeg) # label(definition) # label(non_clause).  [assumption].
0.78/1.10	8 (all W0 all W1 (aSet0(W0) & aElementOf0(W1,szNzAzT0) -> (all W2 (W2 = slbdtsldtrb0(W0,W1) <-> aSet0(W2) & (all W3 (aElementOf0(W3,W2) <-> aSubsetOf0(W3,W0) & sbrdtbr0(W3) = W1)))))) # label(mDefSel) # label(definition) # label(non_clause).  [assumption].
0.78/1.10	9 (all W0 all W1 (aFunction0(W0) & aElement0(W1) -> (all W2 (W2 = sdtlbdtrb0(W0,W1) <-> aSet0(W2) & (all W3 (aElementOf0(W3,W2) <-> aElementOf0(W3,szDzozmdt0(W0)) & sdtlpdtrp0(W0,W3) = W1)))))) # label(mDefPtt) # label(definition) # label(non_clause).  [assumption].
0.78/1.10	10 (all W0 (aFunction0(W0) -> (all W1 (aSubsetOf0(W1,szDzozmdt0(W0)) -> (all W2 (W2 = sdtlcdtrc0(W0,W1) <-> aSet0(W2) & (all W3 (aElementOf0(W3,W2) <-> (exists W4 (aElementOf0(W4,W1) & sdtlpdtrp0(W0,W4) = W3)))))))))) # label(mDefSImg) # label(definition) # label(non_clause).  [assumption].
0.78/1.10	11 (all W0 (aFunction0(W0) -> (all W1 (aSubsetOf0(W1,szDzozmdt0(W0)) -> (all W2 (W2 = sdtexdt0(W0,W1) <-> aFunction0(W2) & szDzozmdt0(W2) = W1 & (all W3 (aElementOf0(W3,W1) -> sdtlpdtrp0(W2,W3) = sdtlpdtrp0(W0,W3))))))))) # label(mDefRst) # label(definition) # label(non_clause).  [assumption].
0.78/1.10	12 (all W0 (isFinite0(W0) & aSet0(W0) -> (all W1 (aElement0(W1) -> (-aElementOf0(W1,W0) -> szszuzczcdt0(sbrdtbr0(W0)) = sbrdtbr0(sdtpldt0(W0,W1))))))) # label(mCardCons) # label(axiom) # label(non_clause).  [assumption].
0.78/1.10	13 (all W0 (aElementOf0(W0,xS) -> aElementOf0(W0,szNzAzT0))) # label(m__3435_AndRHS_AndRHS_AndRHS) # label(hypothesis) # label(non_clause).  [assumption].
0.78/1.10	14 (all W0 (aElement0(W0) -> (all W1 (isFinite0(W1) & aSet0(W1) -> isFinite0(sdtpldt0(W1,W0)))))) # label(mFConsSet) # label(axiom) # label(non_clause).  [assumption].
0.78/1.10	15 (all W0 (aSet0(W0) -> (isFinite0(W0) -> $T))) # label(mFinRel) # label(axiom) # label(non_clause).  [assumption].
0.78/1.10	16 (all W0 all W1 (aElementOf0(W0,szNzAzT0) & aElementOf0(W1,szNzAzT0) -> (iLess0(W0,W1) -> $T))) # label(mIHSort) # label(axiom) # label(non_clause).  [assumption].
0.78/1.10	17 (all W0 (aSet0(W0) -> (all W1 (isFinite0(W0) & aElementOf0(W1,W0) -> szszuzczcdt0(sbrdtbr0(sdtmndt0(W0,W1))) = sbrdtbr0(W0))))) # label(mCardDiff) # label(axiom) # label(non_clause).  [assumption].
0.78/1.10	18 (all W0 (aFunction0(W0) -> (all W1 (aElementOf0(W1,szDzozmdt0(W0)) -> aElementOf0(sdtlpdtrp0(W0,W1),sdtlcdtrc0(W0,szDzozmdt0(W0))))))) # label(mImgRng) # label(axiom) # label(non_clause).  [assumption].
0.78/1.10	19 (all W0 all W1 all W2 (aSet0(W2) & aSet0(W1) & aSet0(W0) -> (aSubsetOf0(W1,W2) & aSubsetOf0(W0,W1) -> aSubsetOf0(W0,W2)))) # label(mSubTrans) # label(axiom) # label(non_clause).  [assumption].
0.78/1.10	20 (all W0 all W1 (aElementOf0(W0,szNzAzT0) & aElementOf0(W1,szNzAzT0) -> (sdtlseqdt0(W0,W1) <-> aSubsetOf0(slbdtrb0(W0),slbdtrb0(W1))))) # label(mSegLess) # label(axiom) # label(non_clause).  [assumption].
0.78/1.10	21 (all W0 (aElementOf0(W0,szNzAzT0) -> sdtlseqdt0(W0,W0))) # label(mLessRefl) # label(axiom) # label(non_clause).  [assumption].
0.78/1.10	22 (all W0 all W1 (aElement0(W1) & aFunction0(W0) -> aSubsetOf0(sdtlbdtrb0(W0,W1),szDzozmdt0(W0)))) # label(mPttSet) # label(axiom) # label(non_clause).  [assumption].
0.78/1.10	23 (all W0 (aSet0(W0) -> (W0 = slcrc0 <-> sz00 = sbrdtbr0(W0)))) # label(mCardEmpty) # label(axiom) # label(non_clause).  [assumption].
0.78/1.10	24 (all W0 (aSet0(W0) -> $T)) # label(mSetSort) # label(axiom) # label(non_clause).  [assumption].
0.78/1.10	25 (all W0 (aSubsetOf0(W0,szNzAzT0) & isFinite0(W0) -> (exists W1 (aElementOf0(W1,szNzAzT0) & aSubsetOf0(W0,slbdtrb0(W1)))))) # label(mFinSubSeg) # label(axiom) # label(non_clause).  [assumption].
0.78/1.10	26 (all W0 all W1 (aSet0(W1) & aElement0(W0) -> (-aElementOf0(W0,W1) -> sdtmndt0(sdtpldt0(W1,W0),W0) = W1))) # label(mDiffCons) # label(axiom) # label(non_clause).  [assumption].
0.78/1.10	27 (all W0 (aElement0(W0) -> (all W1 (isCountable0(W1) & aSet0(W1) -> isCountable0(sdtpldt0(W1,W0)))))) # label(mCConsSet) # label(axiom) # label(non_clause).  [assumption].
0.78/1.10	28 (all W0 (aSet0(W0) & isCountable0(W0) -> (all W1 (W1 != sz00 & aElementOf0(W1,szNzAzT0) -> isCountable0(slbdtsldtrb0(W0,W1)))))) # label(mSelCSet) # label(axiom) # label(non_clause).  [assumption].
0.78/1.10	29 (all W0 (aElementOf0(W0,szNzAzT0) -> sdtlseqdt0(W0,szszuzczcdt0(W0)))) # label(mLessSucc) # label(axiom) # label(non_clause).  [assumption].
0.78/1.10	30 (all W0 (aElementOf0(W0,szNzAzT0) -> sdtlseqdt0(sz00,W0))) # label(mZeroLess) # label(axiom) # label(non_clause).  [assumption].
0.78/1.10	31 (all W0 all W1 (aSet0(W0) & aSet0(W1) -> (aSubsetOf0(W0,W1) & aSubsetOf0(W1,W0) -> W1 = W0))) # label(mSubASymm) # label(axiom) # label(non_clause).  [assumption].
0.78/1.10	32 (all W0 (aSet0(W0) -> (all W1 (aElementOf0(W1,W0) -> aElement0(W1))))) # label(mEOfElem) # label(axiom) # label(non_clause).  [assumption].
0.78/1.10	33 (all W0 (aSet0(W0) -> (isCountable0(W0) -> $T))) # label(mCntRel) # label(axiom) # label(non_clause).  [assumption].
0.78/1.10	34 (all W0 all W1 (aElementOf0(W1,szNzAzT0) & aElementOf0(W0,szNzAzT0) -> (sdtlseqdt0(W0,W1) <-> sdtlseqdt0(szszuzczcdt0(W0),szszuzczcdt0(W1))))) # label(mSuccLess) # label(axiom) # label(non_clause).  [assumption].
0.78/1.10	35 (all W0 (aSet0(W0) & isFinite0(W0) -> (all W1 (aElementOf0(W1,szNzAzT0) -> isFinite0(slbdtsldtrb0(W0,W1)))))) # label(mSelFSet) # label(axiom) # label(non_clause).  [assumption].
0.78/1.10	36 (all W0 all W1 (aElementOf0(W0,szNzAzT0) & aElementOf0(W1,szNzAzT0) -> (sdtlseqdt0(W1,W0) & sdtlseqdt0(W0,W1) -> W1 = W0))) # label(mLessASymm) # label(axiom) # label(non_clause).  [assumption].
0.78/1.10	37 (all W0 all W1 (aElementOf0(W0,szNzAzT0) & aElementOf0(W1,szNzAzT0) -> (szszuzczcdt0(W1) = szszuzczcdt0(W0) -> W1 = W0))) # label(mSuccEquSucc) # label(axiom) # label(non_clause).  [assumption].
0.78/1.10	38 (all W0 (isCountable0(W0) & aSet0(W0) -> slcrc0 != W0)) # label(mCountNFin_01) # label(axiom) # label(non_clause).  [assumption].
0.78/1.10	39 (all W0 all W1 all W2 (aElementOf0(W1,szNzAzT0) & aElementOf0(W2,szNzAzT0) & aElementOf0(W0,szNzAzT0) -> (sdtlseqdt0(W1,W2) & sdtlseqdt0(W0,W1) -> sdtlseqdt0(W0,W2)))) # label(mLessTrans) # label(axiom) # label(non_clause).  [assumption].
0.78/1.10	40 (all W0 all W1 (aElementOf0(W1,szNzAzT0) & aSet0(W0) -> (all W2 (aSubsetOf0(W2,slbdtsldtrb0(W0,W1)) & isFinite0(W2) -> (exists W3 (aSubsetOf0(W3,W0) & aSubsetOf0(W2,slbdtsldtrb0(W3,W1)) & isFinite0(W3))))))) # label(mSelExtra) # label(axiom) # label(non_clause).  [assumption].
0.78/1.10	41 (all W0 (aElement0(W0) -> $T)) # label(mElmSort) # label(axiom) # label(non_clause).  [assumption].
0.78/1.10	42 (all W0 (aFunction0(W0) -> (all W1 (isCountable0(W1) & aSubsetOf0(W1,szDzozmdt0(W0)) -> ((all W2 all W3 (W3 != W2 & aElementOf0(W3,szDzozmdt0(W0)) & aElementOf0(W2,szDzozmdt0(W0)) -> sdtlpdtrp0(W0,W3) != sdtlpdtrp0(W0,W2))) -> isCountable0(sdtlcdtrc0(W0,W1))))))) # label(mImgCount) # label(axiom) # label(non_clause).  [assumption].
0.78/1.10	43 (all W0 (aElementOf0(W0,szNzAzT0) -> iLess0(W0,szszuzczcdt0(W0)))) # label(mIH) # label(axiom) # label(non_clause).  [assumption].
0.78/1.10	44 (all W0 all W1 (aSet0(W0) & aElementOf0(W1,szNzAzT0) -> (sdtlseqdt0(W1,sbrdtbr0(W0)) & isFinite0(W0) -> (exists W2 (aSubsetOf0(W2,W0) & sbrdtbr0(W2) = W1))))) # label(mCardSubEx) # label(axiom) # label(non_clause).  [assumption].
0.78/1.10	45 (all W0 all W1 (aElementOf0(W0,szNzAzT0) & aElementOf0(W1,szNzAzT0) -> (sdtlseqdt0(W0,W1) -> $T))) # label(mLessRel) # label(axiom) # label(non_clause).  [assumption].
0.78/1.10	46 (all W0 (aSet0(W0) -> (aElementOf0(sbrdtbr0(W0),szNzAzT0) <-> isFinite0(W0)))) # label(mCardNum) # label(axiom) # label(non_clause).  [assumption].
0.78/1.10	47 (all W0 all W1 (aElementOf0(W0,szNzAzT0) & aElementOf0(W1,szNzAzT0) -> sdtlseqdt0(szszuzczcdt0(W1),W0) | sdtlseqdt0(W0,W1))) # label(mLessTotal) # label(axiom) # label(non_clause).  [assumption].
0.78/1.10	48 (all W0 (aElementOf0(W0,szNzAzT0) -> -sdtlseqdt0(szszuzczcdt0(W0),sz00))) # label(mNoScLessZr) # label(axiom) # label(non_clause).  [assumption].
0.78/1.10	49 (all W0 (aSet0(W0) -> aSubsetOf0(W0,W0))) # label(mSubRefl) # label(axiom) # label(non_clause).  [assumption].
0.78/1.10	50 (all W0 (aElementOf0(W0,szNzAzT0) -> (all W1 all W2 (aSet0(W1) & sz00 != W0 & aSet0(W2) -> (aSubsetOf0(slbdtsldtrb0(W1,W0),slbdtsldtrb0(W2,W0)) & slcrc0 != slbdtsldtrb0(W1,W0) -> aSubsetOf0(W1,W2)))))) # label(mSelSub) # label(axiom) # label(non_clause).  [assumption].
0.78/1.10	51 (all W0 (aFunction0(W0) -> (isCountable0(szDzozmdt0(W0)) & isFinite0(sdtlcdtrc0(W0,szDzozmdt0(W0))) -> aElement0(szDzizrdt0(W0)) & isCountable0(sdtlbdtrb0(W0,szDzizrdt0(W0)))))) # label(mDirichlet) # label(axiom) # label(non_clause).  [assumption].
0.78/1.10	52 (all W0 (aElementOf0(W0,szNzAzT0) -> isFinite0(slbdtrb0(W0)))) # label(mSegFin) # label(axiom) # label(non_clause).  [assumption].
0.78/1.10	53 (all W0 (isCountable0(W0) & aSet0(W0) -> -isFinite0(W0))) # label(mCountNFin) # label(axiom) # label(non_clause).  [assumption].
3.06/3.45	54 (all W0 (aElementOf0(W0,szNzAzT0) -> aElementOf0(szszuzczcdt0(W0),szNzAzT0) & szszuzczcdt0(W0) != sz00)) # label(mSuccNum) # label(axiom) # label(non_clause).  [assumption].
3.06/3.45	55 (all W0 (aSet0(W0) & isFinite0(W0) -> (all W1 (aSubsetOf0(W1,W0) -> isFinite0(W1))))) # label(mSubFSet) # label(axiom) # label(non_clause).  [assumption].
3.06/3.45	56 (all W0 (aElementOf0(W0,szNzAzT0) -> szszuzczcdt0(W0) != W0)) # label(mNatNSucc) # label(axiom) # label(non_clause).  [assumption].
3.06/3.45	57 (all W0 (aElementOf0(W0,szNzAzT0) -> W0 = sbrdtbr0(slbdtrb0(W0)))) # label(mCardSeg) # label(axiom) # label(non_clause).  [assumption].
3.06/3.45	58 (all W0 (aElement0(W0) -> (all W1 (aSet0(W1) & isCountable0(W1) -> isCountable0(sdtmndt0(W1,W0)))))) # label(mCDiffSet) # label(axiom) # label(non_clause).  [assumption].
3.06/3.45	59 (all W0 (aSet0(W0) -> (all W1 (isFinite0(W0) & aSubsetOf0(W1,W0) -> sdtlseqdt0(sbrdtbr0(W1),sbrdtbr0(W0)))))) # label(mCardSub) # label(axiom) # label(non_clause).  [assumption].
3.06/3.45	60 (all W0 (aElement0(W0) -> (all W1 (isFinite0(W1) & aSet0(W1) -> isFinite0(sdtmndt0(W1,W0)))))) # label(mFDiffSet) # label(axiom) # label(non_clause).  [assumption].
3.06/3.45	61 (all W0 all W1 (aSubsetOf0(W0,szNzAzT0) & aSubsetOf0(W1,szNzAzT0) & W0 != slcrc0 & slcrc0 != W1 -> (aElementOf0(szmzizndt0(W0),W1) & aElementOf0(szmzizndt0(W1),W0) -> szmzizndt0(W1) = szmzizndt0(W0)))) # label(mMinMin) # label(axiom) # label(non_clause).  [assumption].
3.06/3.45	62 (all W0 (aSet0(W0) -> (all W1 (aElementOf0(W1,W0) -> W0 = sdtpldt0(sdtmndt0(W0,W1),W1))))) # label(mConsDiff) # label(axiom) # label(non_clause).  [assumption].
3.06/3.45	63 (all W0 (-isFinite0(W0) & aSet0(W0) -> (all W1 (aElementOf0(W1,szNzAzT0) -> slbdtsldtrb0(W0,W1) != slcrc0)))) # label(mSelNSet) # label(axiom) # label(non_clause).  [assumption].
3.06/3.45	64 (all W0 (aFunction0(W0) -> $T)) # label(mFunSort) # label(axiom) # label(non_clause).  [assumption].
3.06/3.45	65 (all W0 (aFunction0(W0) -> aSet0(szDzozmdt0(W0)))) # label(mDomSet) # label(axiom) # label(non_clause).  [assumption].
3.06/3.45	66 (all W0 all W1 (aElementOf0(W1,szNzAzT0) & aElementOf0(W0,szNzAzT0) -> (W0 = W1 | aElementOf0(W0,slbdtrb0(W1)) <-> aElementOf0(W0,slbdtrb0(szszuzczcdt0(W1)))))) # label(mSegSucc) # label(axiom) # label(non_clause).  [assumption].
3.06/3.45	67 (all W0 (aElementOf0(W0,szNzAzT0) -> (all W1 (isCountable0(W1) & ((all W2 (aElementOf0(W2,W1) -> aElementOf0(W2,szNzAzT0))) & aSet0(W1) | aSubsetOf0(W1,szNzAzT0)) -> (all W2 (aFunction0(W2) & ((all W3 (aElementOf0(W3,sdtlcdtrc0(W2,szDzozmdt0(W2))) <-> (exists W4 (W3 = sdtlpdtrp0(W2,W4) & aElementOf0(W4,szDzozmdt0(W2)))))) & aSet0(sdtlcdtrc0(W2,szDzozmdt0(W2))) -> aSubsetOf0(sdtlcdtrc0(W2,szDzozmdt0(W2)),xT) | (all W3 (aElementOf0(W3,sdtlcdtrc0(W2,szDzozmdt0(W2))) -> aElementOf0(W3,xT)))) & ((all W3 ((aElementOf0(W3,szDzozmdt0(W2)) -> W0 = sbrdtbr0(W3) & ((all W4 (aElementOf0(W4,W3) -> aElementOf0(W4,W1))) & aSet0(W3) | aSubsetOf0(W3,W1))) & (W0 = sbrdtbr0(W3) & aSubsetOf0(W3,W1) & (all W4 (aElementOf0(W4,W3) -> aElementOf0(W4,W1))) & aSet0(W3) -> aElementOf0(W3,szDzozmdt0(W2))))) | szDzozmdt0(W2) = slbdtsldtrb0(W1,W0)) -> (iLess0(W0,xK) -> (exists W3 ((exists W4 (aSet0(W4) & (all W5 (aElementOf0(W5,W4) -> aElementOf0(W5,W1))) & (all W5 (sbrdtbr0(W5) = W0 & (aSubsetOf0(W5,W4) | (all W6 (aElementOf0(W6,W5) -> aElementOf0(W6,W4))) & aSet0(W5)) | aElementOf0(W5,slbdtsldtrb0(W4,W0)) -> W3 = sdtlpdtrp0(W2,W5))) & isCountable0(W4) & aSubsetOf0(W4,W1))) & aElementOf0(W3,xT)))))))))) # label(m__3398) # label(hypothesis) # label(non_clause).  [assumption].
3.06/3.45	68 (all W0 (aSet0(W0) -> aElement0(sbrdtbr0(W0)))) # label(mCardS) # label(axiom) # label(non_clause).  [assumption].
3.06/3.45	69 (all W0 (aElementOf0(W0,szNzAzT0) -> (exists W1 (W0 = szszuzczcdt0(W1) & aElementOf0(W1,szNzAzT0))) | W0 = sz00)) # label(mNatExtra) # label(axiom) # label(non_clause).  [assumption].
3.06/3.45	70 (all W0 (aFunction0(W0) -> (all W1 (aElementOf0(W1,szDzozmdt0(W0)) -> aElement0(sdtlpdtrp0(W0,W1)))))) # label(mImgElm) # label(axiom) # label(non_clause).  [assumption].
3.06/3.45	71 (all W0 ((aElementOf0(W0,szDzozmdt0(xc)) -> aSet0(W0) & aSubsetOf0(W0,xS) & sbrdtbr0(W0) = xK & (all W1 (aElementOf0(W1,W0) -> aElementOf0(W1,xS)))) & (sbrdtbr0(W0) = xK & (aSubsetOf0(W0,xS) | aSet0(W0) & (all W1 (aElementOf0(W1,W0) -> aElementOf0(W1,xS)))) -> aElementOf0(W0,szDzozmdt0(xc))))) # label(m__3453_AndLHS) # label(hypothesis) # label(non_clause).  [assumption].
20.19/21.21	72 (all W0 (aElementOf0(W0,sdtlcdtrc0(xc,szDzozmdt0(xc))) <-> (exists W1 (W0 = sdtlpdtrp0(xc,W1) & aElementOf0(W1,szDzozmdt0(xc)))))) # label(m__3453_AndRHS_AndRHS_AndRHS_AndLHS) # label(hypothesis) # label(non_clause).  [assumption].
20.19/21.21	73 (all W0 (aElementOf0(W0,sdtlcdtrc0(xc,szDzozmdt0(xc))) -> aElementOf0(W0,xT))) # label(m__3453_AndRHS_AndRHS_AndRHS_AndRHS_AndLHS) # label(hypothesis) # label(non_clause).  [assumption].
20.19/21.21	74 -(exists W0 (szszuzczcdt0(W0) = xK & aElementOf0(W0,szNzAzT0))) # label(m__) # label(negated_conjecture) # label(non_clause).  [assumption].
20.19/21.21	
20.19/21.21	============================== end of process non-clausal formulas ===
20.19/21.21	
20.19/21.21	============================== PROCESS INITIAL CLAUSES ===============
20.19/21.21	
20.19/21.21	============================== PREDICATE ELIMINATION =================
20.19/21.21	
20.19/21.21	============================== end predicate elimination =============
20.19/21.21	
20.19/21.21	Auto_denials:  (non-Horn, no changes).
20.19/21.21	
20.19/21.21	Term ordering decisions:
20.19/21.21	Function symbol KB weights:  szNzAzT0=1. xK=1. xT=1. xc=1. slcrc0=1. sz00=1. xS=1. sdtlcdtrc0=1. sdtlpdtrp0=1. slbdtsldtrb0=1. sdtpldt0=1. sdtmndt0=1. sdtlbdtrb0=1. sdtexdt0=1. f2=1. f5=1. f6=1. f7=1. f16=1. f17=1. f18=1. f19=1. szDzozmdt0=1. sbrdtbr0=1. slbdtrb0=1. szszuzczcdt0=1. szmzizndt0=1. szmzazxdt0=1. szDzizrdt0=1. f1=1. f14=1. f27=1. f28=1. f29=1. f3=1. f4=1. f8=1. f9=1. f11=1. f12=1. f13=1. f15=1. f21=1. f22=1. f23=1. f24=1. f25=1. f10=1. f20=1. f26=1.
20.19/21.21	
20.19/21.21	============================== end of process initial clauses ========
20.19/21.21	
20.19/21.21	============================== CLAUSES FOR SEARCH ====================
20.19/21.21	
20.19/21.21	============================== end of clauses for search =============
20.19/21.21	
20.19/21.21	============================== SEARCH ================================
20.19/21.21	
20.19/21.21	% Starting search at 4.47 seconds.
20.19/21.21	
20.19/21.21	Low Water (keep): wt=10.000, iters=2147483647
20.19/21.21	
20.19/21.21	Low Water (keep): wt=6.000, iters=2147483647
20.19/21.21	
20.19/21.21	Low Water (keep): wt=2.000, iters=2147483647
20.19/21.21	
20.19/21.21	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 1928 (0.00 of 4.54 sec).
20.19/21.21	
20.19/21.21	============================== PROOF =================================
20.19/21.21	% SZS status Theorem
20.19/21.21	% SZS output start Refutation
20.19/21.21	
20.19/21.21	% Proof 1 at 19.39 (+ 0.03) seconds.
20.19/21.21	% Length of proof is 10.
20.19/21.21	% Level of proof is 3.
20.19/21.21	% Maximum clause weight is 11.000.
20.19/21.21	% Given clauses 5782.
20.19/21.21	
20.19/21.21	69 (all W0 (aElementOf0(W0,szNzAzT0) -> (exists W1 (W0 = szszuzczcdt0(W1) & aElementOf0(W1,szNzAzT0))) | W0 = sz00)) # label(mNatExtra) # label(axiom) # label(non_clause).  [assumption].
20.19/21.21	74 -(exists W0 (szszuzczcdt0(W0) = xK & aElementOf0(W0,szNzAzT0))) # label(m__) # label(negated_conjecture) # label(non_clause).  [assumption].
20.19/21.21	164 sz00 != xK # label(m__3520) # label(hypothesis).  [assumption].
20.19/21.21	207 aElementOf0(xK,szNzAzT0) # label(m__3418) # label(hypothesis).  [assumption].
20.19/21.21	3791 -aElementOf0(A,szNzAzT0) | szszuzczcdt0(f27(A)) = A | sz00 = A # label(mNatExtra) # label(axiom).  [clausify(69)].
20.19/21.21	3792 -aElementOf0(A,szNzAzT0) | aElementOf0(f27(A),szNzAzT0) | sz00 = A # label(mNatExtra) # label(axiom).  [clausify(69)].
20.19/21.21	3810 szszuzczcdt0(A) != xK | -aElementOf0(A,szNzAzT0) # label(m__) # label(negated_conjecture).  [clausify(74)].
20.19/21.21	7045 szszuzczcdt0(f27(xK)) = xK.  [resolve(3791,a,207,a),unit_del(b,164)].
20.19/21.21	7046 aElementOf0(f27(xK),szNzAzT0).  [resolve(3792,a,207,a),unit_del(b,164)].
20.19/21.21	7228 $F.  [resolve(7046,a,3810,b),rewrite([7045(3)]),xx(a)].
20.19/21.21	
20.19/21.21	% SZS output end Refutation
20.19/21.21	============================== end of proof ==========================
20.19/21.21	
20.19/21.21	============================== STATISTICS ============================
20.19/21.21	
20.19/21.21	Given=5782. Generated=7912. Kept=5972. proofs=1.
20.19/21.21	Usable=5782. Sos=154. Demods=4. Limbo=7, Disabled=2837. Hints=0.
20.19/21.21	Megabytes=23.04.
20.19/21.21	User_CPU=19.39, System_CPU=0.03, Wall_clock=21.
20.19/21.21	
20.19/21.21	============================== end of statistics =====================
20.19/21.21	
20.19/21.21	============================== end of search =========================
20.19/21.21	
20.19/21.21	THEOREM PROVED
20.19/21.21	% SZS status Theorem
20.19/21.21	
20.19/21.21	Exiting with 1 proof.
20.19/21.21	
20.19/21.21	Process 19350 exit (max_proofs) Tue Aug  9 02:11:12 2022
20.19/21.21	Prover9 interrupted
20.19/21.21	EOF