0.10/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.10/0.12	% Command    : tptp2X_and_run_prover9 %d %s
0.13/0.33	% Computer   : n008.cluster.edu
0.13/0.33	% Model      : x86_64 x86_64
0.13/0.33	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.33	% Memory     : 8042.1875MB
0.13/0.33	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.33	% CPULimit   : 1200
0.13/0.33	% DateTime   : Tue Jul 13 16:27:29 EDT 2021
0.13/0.33	% CPUTime    : 
0.82/1.11	============================== Prover9 ===============================
0.82/1.11	Prover9 (32) version 2009-11A, November 2009.
0.82/1.11	Process 504 was started by sandbox2 on n008.cluster.edu,
0.82/1.11	Tue Jul 13 16:27:30 2021
0.82/1.11	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1200 -f /tmp/Prover9_32574_n008.cluster.edu".
0.82/1.11	============================== end of head ===========================
0.82/1.11	
0.82/1.11	============================== INPUT =================================
0.82/1.11	
0.82/1.11	% Reading from file /tmp/Prover9_32574_n008.cluster.edu
0.82/1.11	
0.82/1.11	set(prolog_style_variables).
0.82/1.11	set(auto2).
0.82/1.11	    % set(auto2) -> set(auto).
0.82/1.11	    % set(auto) -> set(auto_inference).
0.82/1.11	    % set(auto) -> set(auto_setup).
0.82/1.11	    % set(auto_setup) -> set(predicate_elim).
0.82/1.11	    % set(auto_setup) -> assign(eq_defs, unfold).
0.82/1.11	    % set(auto) -> set(auto_limits).
0.82/1.11	    % set(auto_limits) -> assign(max_weight, "100.000").
0.82/1.11	    % set(auto_limits) -> assign(sos_limit, 20000).
0.82/1.11	    % set(auto) -> set(auto_denials).
0.82/1.11	    % set(auto) -> set(auto_process).
0.82/1.11	    % set(auto2) -> assign(new_constants, 1).
0.82/1.11	    % set(auto2) -> assign(fold_denial_max, 3).
0.82/1.11	    % set(auto2) -> assign(max_weight, "200.000").
0.82/1.11	    % set(auto2) -> assign(max_hours, 1).
0.82/1.11	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.82/1.11	    % set(auto2) -> assign(max_seconds, 0).
0.82/1.11	    % set(auto2) -> assign(max_minutes, 5).
0.82/1.11	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.82/1.11	    % set(auto2) -> set(sort_initial_sos).
0.82/1.11	    % set(auto2) -> assign(sos_limit, -1).
0.82/1.11	    % set(auto2) -> assign(lrs_ticks, 3000).
0.82/1.11	    % set(auto2) -> assign(max_megs, 400).
0.82/1.11	    % set(auto2) -> assign(stats, some).
0.82/1.11	    % set(auto2) -> clear(echo_input).
0.82/1.11	    % set(auto2) -> set(quiet).
0.82/1.11	    % set(auto2) -> clear(print_initial_clauses).
0.82/1.11	    % set(auto2) -> clear(print_given).
0.82/1.11	assign(lrs_ticks,-1).
0.82/1.11	assign(sos_limit,10000).
0.82/1.11	assign(order,kbo).
0.82/1.11	set(lex_order_vars).
0.82/1.11	clear(print_given).
0.82/1.11	
0.82/1.11	% formulas(sos).  % not echoed (115 formulas)
0.82/1.11	
0.82/1.11	============================== end of input ==========================
0.82/1.11	
0.82/1.11	% From the command line: assign(max_seconds, 1200).
0.82/1.11	
0.82/1.11	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.82/1.11	
0.82/1.11	% Formulas that are not ordinary clauses:
0.82/1.11	1 (all W0 (W0 = slcrc0 <-> aSet0(W0) & -(exists W1 aElementOf0(W1,W0)))) # label(mDefEmp) # label(definition) # label(non_clause).  [assumption].
0.82/1.11	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.82/1.11	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.82/1.11	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.82/1.11	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.82/1.11	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.82/1.11	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.82/1.11	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.82/1.11	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.82/1.11	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.82/1.11	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.82/1.11	12 (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.82/1.11	13 (all W0 all W1 (aElementOf0(W0,szNzAzT0) & aElementOf0(W1,szNzAzT0) -> sdtlseqdt0(W0,W1) | sdtlseqdt0(szszuzczcdt0(W1),W0))) # label(mLessTotal) # label(axiom) # label(non_clause).  [assumption].
0.82/1.11	14 (all W0 (aElementOf0(W0,sdtlpdtrp0(xN,xi)) -> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),W0))) # label(m__4007_AndLHS) # label(hypothesis) # label(non_clause).  [assumption].
0.82/1.11	15 (all W0 (aElement0(W0) & (aElementOf0(W0,xQ) | szmzizndt0(sdtlpdtrp0(xN,xi)) = W0) <-> aElementOf0(W0,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))))) # label(m__4007_AndRHS_AndRHS_AndLHS) # label(hypothesis) # label(non_clause).  [assumption].
0.82/1.11	16 (all W0 all W1 (aElementOf0(W0,szNzAzT0) & aElementOf0(W1,szNzAzT0) -> (sdtlseqdt0(W1,W0) -> aSubsetOf0(sdtlpdtrp0(xN,W0),sdtlpdtrp0(xN,W1)) & (all W2 (aElementOf0(W2,sdtlpdtrp0(xN,W0)) -> aElementOf0(W2,sdtlpdtrp0(xN,W1))))))) # label(m__3754) # label(hypothesis) # label(non_clause).  [assumption].
0.82/1.11	17 (all W0 all W1 (aSubsetOf0(W0,szNzAzT0) & slcrc0 != W1 & W0 != slcrc0 & aSubsetOf0(W1,szNzAzT0) -> (aElementOf0(szmzizndt0(W0),W1) & aElementOf0(szmzizndt0(W1),W0) -> szmzizndt0(W1) = szmzizndt0(W0)))) # label(mMinMin) # label(axiom) # label(non_clause).  [assumption].
0.82/1.11	18 (all W0 all W1 all W2 (aSet0(W0) & aSet0(W2) & aSet0(W1) -> (aSubsetOf0(W0,W1) & aSubsetOf0(W1,W2) -> aSubsetOf0(W0,W2)))) # label(mSubTrans) # label(axiom) # label(non_clause).  [assumption].
0.82/1.11	19 (all W0 all W1 (aElementOf0(W1,szNzAzT0) & aElementOf0(W0,szNzAzT0) -> (iLess0(W0,W1) -> $T))) # label(mIHSort) # label(axiom) # label(non_clause).  [assumption].
0.82/1.11	20 (all W0 all W1 (aElementOf0(W1,szNzAzT0) & aElementOf0(W0,szNzAzT0) -> (aElementOf0(W0,slbdtrb0(szszuzczcdt0(W1))) <-> aElementOf0(W0,slbdtrb0(W1)) | W1 = W0))) # label(mSegSucc) # label(axiom) # label(non_clause).  [assumption].
0.82/1.11	21 (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.82/1.11	22 (all W0 (aElementOf0(W0,szNzAzT0) -> -sdtlseqdt0(szszuzczcdt0(W0),sz00))) # label(mNoScLessZr) # label(axiom) # label(non_clause).  [assumption].
0.82/1.11	23 (all W0 (aElementOf0(W0,szNzAzT0) -> iLess0(W0,szszuzczcdt0(W0)))) # label(mIH) # label(axiom) # label(non_clause).  [assumption].
0.82/1.11	24 (all W0 (aSet0(W0) & isCountable0(W0) -> -isFinite0(W0))) # label(mCountNFin) # label(axiom) # label(non_clause).  [assumption].
0.82/1.11	25 (all W0 (aElementOf0(W0,sdtlcdtrc0(xc,szDzozmdt0(xc))) -> aElementOf0(W0,xT))) # label(m__3453_AndRHS_AndLHS) # label(hypothesis) # label(non_clause).  [assumption].
0.82/1.11	26 (all W0 (aElementOf0(W0,sdtlcdtrc0(xc,szDzozmdt0(xc))) <-> (exists W1 (aElementOf0(W1,szDzozmdt0(xc)) & W0 = sdtlpdtrp0(xc,W1))))) # label(m__3453_AndRHS_AndRHS_AndRHS_AndLHS) # label(hypothesis) # label(non_clause).  [assumption].
0.82/1.11	27 (all W0 ((aElementOf0(W0,szDzozmdt0(xc)) -> (all W1 (aElementOf0(W1,W0) -> aElementOf0(W1,xS))) & aSubsetOf0(W0,xS) & sbrdtbr0(W0) = xK & aSet0(W0)) & ((aSubsetOf0(W0,xS) | (all W1 (aElementOf0(W1,W0) -> aElementOf0(W1,xS))) & aSet0(W0)) & sbrdtbr0(W0) = xK -> aElementOf0(W0,szDzozmdt0(xc))))) # label(m__3453_AndRHS_AndRHS_AndRHS_AndRHS_AndRHS_AndLHS) # label(hypothesis) # label(non_clause).  [assumption].
0.82/1.11	28 (all W0 all W1 (aSet0(W0) & aElementOf0(W1,szNzAzT0) -> (all W2 (aSubsetOf0(W2,slbdtsldtrb0(W0,W1)) & isFinite0(W2) -> (exists W3 (aSubsetOf0(W2,slbdtsldtrb0(W3,W1)) & isFinite0(W3) & aSubsetOf0(W3,W0))))))) # label(mSelExtra) # label(axiom) # label(non_clause).  [assumption].
0.82/1.11	29 (all W0 (aSet0(W0) -> aElement0(sbrdtbr0(W0)))) # label(mCardS) # label(axiom) # label(non_clause).  [assumption].
0.82/1.11	30 (all W0 (aElementOf0(W0,szNzAzT0) -> aSet0(sdtlpdtrp0(xN,W0)) & isCountable0(sdtlpdtrp0(xN,W0)) & aSubsetOf0(sdtlpdtrp0(xN,W0),szNzAzT0) & (all W1 (aElementOf0(W1,sdtlpdtrp0(xN,W0)) -> aElementOf0(W1,szNzAzT0))))) # label(m__3671) # label(hypothesis) # label(non_clause).  [assumption].
0.82/1.11	31 (all W0 (aFunction0(W0) -> $T)) # label(mFunSort) # label(axiom) # label(non_clause).  [assumption].
0.82/1.11	32 (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.82/1.11	33 (all W0 (aElement0(W0) & aElementOf0(W0,sdtlpdtrp0(xN,xi)) & W0 != szmzizndt0(sdtlpdtrp0(xN,xi)) <-> aElementOf0(W0,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))))) # label(m__3989_02_AndRHS_AndLHS) # label(hypothesis) # label(non_clause).  [assumption].
0.82/1.11	34 (all W0 (aElementOf0(W0,xQ) -> aElementOf0(W0,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))))) # label(m__3989_02_AndRHS_AndRHS_AndRHS_AndRHS_AndRHS_AndRHS_AndLHS) # label(hypothesis) # label(non_clause).  [assumption].
0.82/1.11	35 (all W0 (aElementOf0(W0,sdtlpdtrp0(xN,xi)) -> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),W0))) # label(m__3989_02_AndRHS_AndRHS_AndRHS_AndRHS_AndRHS_AndRHS_AndRHS_AndRHS) # label(hypothesis) # label(non_clause).  [assumption].
0.82/1.11	36 (all W0 all W1 (aSet0(W1) & aSet0(W0) -> (aSubsetOf0(W0,W1) & aSubsetOf0(W1,W0) -> W1 = W0))) # label(mSubASymm) # label(axiom) # label(non_clause).  [assumption].
0.82/1.11	37 (all W0 (aSet0(W0) & isCountable0(W0) -> W0 != slcrc0)) # label(mCountNFin_01) # label(axiom) # label(non_clause).  [assumption].
0.82/1.11	38 (all W0 (aElementOf0(W0,xS) -> aElementOf0(W0,szNzAzT0))) # label(m__3435_AndRHS_AndLHS) # label(hypothesis) # label(non_clause).  [assumption].
0.82/1.11	39 (all W0 all W1 (aElementOf0(W0,szNzAzT0) & aElementOf0(W1,szNzAzT0) -> (szszuzczcdt0(W1) = szszuzczcdt0(W0) -> W0 = W1))) # label(mSuccEquSucc) # label(axiom) # label(non_clause).  [assumption].
0.82/1.11	40 (all W0 (aElementOf0(W0,szNzAzT0) -> sbrdtbr0(slbdtrb0(W0)) = W0)) # label(mCardSeg) # label(axiom) # label(non_clause).  [assumption].
0.82/1.11	41 (all W0 (aElementOf0(W0,szNzAzT0) -> isFinite0(slbdtrb0(W0)))) # label(mSegFin) # label(axiom) # label(non_clause).  [assumption].
0.82/1.11	42 (all W0 (aElement0(W0) -> (all W1 (aSet0(W1) & isFinite0(W1) -> isFinite0(sdtpldt0(W1,W0)))))) # label(mFConsSet) # label(axiom) # label(non_clause).  [assumption].
0.82/1.11	43 (all W0 (aElementOf0(W0,szNzAzT0) -> sdtlseqdt0(W0,W0))) # label(mLessRefl) # label(axiom) # label(non_clause).  [assumption].
0.82/1.11	44 (all W0 (aElement0(W0) -> (all W1 (aSet0(W1) & isCountable0(W1) -> isCountable0(sdtmndt0(W1,W0)))))) # label(mCDiffSet) # label(axiom) # label(non_clause).  [assumption].
0.82/1.11	45 (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.82/1.11	46 (all W0 (aElement0(W0) -> (all W1 (isFinite0(W1) & aSet0(W1) -> isFinite0(sdtmndt0(W1,W0)))))) # label(mFDiffSet) # label(axiom) # label(non_clause).  [assumption].
0.82/1.11	47 (all W0 (aSet0(W0) -> aSubsetOf0(W0,W0))) # label(mSubRefl) # label(axiom) # label(non_clause).  [assumption].
0.82/1.11	48 (all W0 all W1 (aElementOf0(W0,szNzAzT0) & W0 != W1 & aElementOf0(W1,szNzAzT0) -> -((all W2 (aElementOf0(W2,sdtlpdtrp0(xN,W0)) -> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,W0)),W2))) & aElementOf0(szmzizndt0(sdtlpdtrp0(xN,W0)),sdtlpdtrp0(xN,W0)) -> aElementOf0(szmzizndt0(sdtlpdtrp0(xN,W0)),sdtlpdtrp0(xN,W1)) & (all W2 (aElementOf0(W2,sdtlpdtrp0(xN,W1)) -> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,W0)),W2))) | szmzizndt0(sdtlpdtrp0(xN,W0)) = szmzizndt0(sdtlpdtrp0(xN,W1))))) # label(m__3821) # label(hypothesis) # label(non_clause).  [assumption].
1.73/2.00	49 (all W0 (aSet0(W0) -> (all W1 (aElementOf0(W1,W0) -> sdtpldt0(sdtmndt0(W0,W1),W1) = W0)))) # label(mConsDiff) # label(axiom) # label(non_clause).  [assumption].
1.73/2.00	50 (all W0 (aSubsetOf0(W0,szNzAzT0) & isFinite0(W0) -> (exists W1 (aElementOf0(W1,szNzAzT0) & aSubsetOf0(W0,slbdtrb0(W1)))))) # label(mFinSubSeg) # label(axiom) # label(non_clause).  [assumption].
1.73/2.00	51 (all W0 (aFunction0(W0) -> (all W1 (isCountable0(W1) & aSubsetOf0(W1,szDzozmdt0(W0)) -> ((all W2 all W3 (aElementOf0(W2,szDzozmdt0(W0)) & aElementOf0(W3,szDzozmdt0(W0)) & W3 != W2 -> sdtlpdtrp0(W0,W3) != sdtlpdtrp0(W0,W2))) -> isCountable0(sdtlcdtrc0(W0,W1))))))) # label(mImgCount) # label(axiom) # label(non_clause).  [assumption].
1.73/2.00	52 (all W0 (isFinite0(W0) & aSet0(W0) -> (all W1 (aSubsetOf0(W1,W0) -> isFinite0(W1))))) # label(mSubFSet) # label(axiom) # label(non_clause).  [assumption].
1.73/2.00	53 (all W0 (-isFinite0(W0) & aSet0(W0) -> (all W1 (aElementOf0(W1,szNzAzT0) -> slcrc0 != slbdtsldtrb0(W0,W1))))) # label(mSelNSet) # label(axiom) # label(non_clause).  [assumption].
1.73/2.00	54 (all W0 (isFinite0(W0) & aSet0(W0) -> (all W1 (aElement0(W1) -> (-aElementOf0(W1,W0) -> sbrdtbr0(sdtpldt0(W0,W1)) = szszuzczcdt0(sbrdtbr0(W0))))))) # label(mCardCons) # label(axiom) # label(non_clause).  [assumption].
1.73/2.00	55 (all W0 (aSet0(W0) & isFinite0(W0) -> (all W1 (aElementOf0(W1,szNzAzT0) -> isFinite0(slbdtsldtrb0(W0,W1)))))) # label(mSelFSet) # label(axiom) # label(non_clause).  [assumption].
1.73/2.00	56 (all W0 (aSet0(W0) -> (isFinite0(W0) <-> aElementOf0(sbrdtbr0(W0),szNzAzT0)))) # label(mCardNum) # label(axiom) # label(non_clause).  [assumption].
1.73/2.00	57 (all W0 (aElementOf0(W0,szNzAzT0) -> szszuzczcdt0(W0) != W0)) # label(mNatNSucc) # label(axiom) # label(non_clause).  [assumption].
1.73/2.00	58 (all W0 (aSet0(W0) -> (all W1 (aElementOf0(W1,W0) -> aElement0(W1))))) # label(mEOfElem) # label(axiom) # label(non_clause).  [assumption].
1.73/2.00	59 (all W0 (aSet0(W0) -> (W0 = slcrc0 <-> sbrdtbr0(W0) = sz00))) # label(mCardEmpty) # label(axiom) # label(non_clause).  [assumption].
1.73/2.00	60 (all W0 all W1 (aSet0(W0) & aElementOf0(W1,szNzAzT0) -> (isFinite0(W0) & sdtlseqdt0(W1,sbrdtbr0(W0)) -> (exists W2 (aSubsetOf0(W2,W0) & W1 = sbrdtbr0(W2)))))) # label(mCardSubEx) # label(axiom) # label(non_clause).  [assumption].
1.73/2.00	61 (all W0 (aElementOf0(W0,szNzAzT0) -> (all W1 all W2 (aSet0(W2) & W0 != sz00 & aSet0(W1) -> (slcrc0 != slbdtsldtrb0(W1,W0) & aSubsetOf0(slbdtsldtrb0(W1,W0),slbdtsldtrb0(W2,W0)) -> aSubsetOf0(W1,W2)))))) # label(mSelSub) # label(axiom) # label(non_clause).  [assumption].
1.73/2.00	62 (all W0 (aFunction0(W0) -> aSet0(szDzozmdt0(W0)))) # label(mDomSet) # label(axiom) # label(non_clause).  [assumption].
1.73/2.00	63 (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].
1.73/2.00	64 (all W0 all W1 (aElement0(W1) & aFunction0(W0) -> aSubsetOf0(sdtlbdtrb0(W0,W1),szDzozmdt0(W0)))) # label(mPttSet) # label(axiom) # label(non_clause).  [assumption].
1.73/2.00	65 (all W0 (aElementOf0(W0,szNzAzT0) -> (all W1 ((aSubsetOf0(W1,szNzAzT0) | aSet0(W1) & (all W2 (aElementOf0(W2,W1) -> aElementOf0(W2,szNzAzT0)))) & isCountable0(W1) -> (all W2 ((szDzozmdt0(W2) = slbdtsldtrb0(W1,W0) | (all W3 ((aElementOf0(W3,szDzozmdt0(W2)) -> ((all W4 (aElementOf0(W4,W3) -> aElementOf0(W4,W1))) & aSet0(W3) | aSubsetOf0(W3,W1)) & W0 = sbrdtbr0(W3)) & ((all W4 (aElementOf0(W4,W3) -> aElementOf0(W4,W1))) & aSubsetOf0(W3,W1) & W0 = sbrdtbr0(W3) & aSet0(W3) -> aElementOf0(W3,szDzozmdt0(W2)))))) & ((all W3 ((exists W4 (W3 = sdtlpdtrp0(W2,W4) & aElementOf0(W4,szDzozmdt0(W2)))) <-> aElementOf0(W3,sdtlcdtrc0(W2,szDzozmdt0(W2))))) & aSet0(sdtlcdtrc0(W2,szDzozmdt0(W2))) -> (all W3 (aElementOf0(W3,sdtlcdtrc0(W2,szDzozmdt0(W2))) -> aElementOf0(W3,xT))) | aSubsetOf0(sdtlcdtrc0(W2,szDzozmdt0(W2)),xT)) & aFunction0(W2) -> (iLess0(W0,xK) -> (exists W3 (aElementOf0(W3,xT) & (exists W4 (aSubsetOf0(W4,W1) & (all W5 (aElementOf0(W5,slbdtsldtrb0(W4,W0)) | (aSubsetOf0(W5,W4) | (all W6 (aElementOf0(W6,W5) -> aElementOf0(W6,W4))) & aSet0(W5)) & sbrdtbr0(W5) = W0 -> W3 = sdtlpdtrp0(W2,W5))) & isCountable0(W4) & (all W5 (aElementOf0(W5,W4) -> aElementOf0(W5,W1))) & aSet0(W4)))))))))))) # label(m__3398) # label(hypothesis) # label(non_clause).  [assumption].
1.73/2.00	66 (all W0 (aSet0(W0) & isCountable0(W0) -> (all W1 (sz00 != W1 & aElementOf0(W1,szNzAzT0) -> isCountable0(slbdtsldtrb0(W0,W1)))))) # label(mSelCSet) # label(axiom) # label(non_clause).  [assumption].
1.73/2.00	67 (all W0 (aElementOf0(W0,szNzAzT0) -> sdtlseqdt0(W0,szszuzczcdt0(W0)))) # label(mLessSucc) # label(axiom) # label(non_clause).  [assumption].
1.73/2.00	68 (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].
1.73/2.00	69 (all W0 (aElementOf0(W0,szNzAzT0) -> szszuzczcdt0(W0) != sz00 & aElementOf0(szszuzczcdt0(W0),szNzAzT0))) # label(mSuccNum) # label(axiom) # label(non_clause).  [assumption].
1.73/2.00	70 (all W0 (aElementOf0(W0,szNzAzT0) -> (((all W1 (aElementOf0(W1,sdtlpdtrp0(xN,W0)) -> aElementOf0(W1,szNzAzT0))) & aSet0(sdtlpdtrp0(xN,W0)) | aSubsetOf0(sdtlpdtrp0(xN,W0),szNzAzT0)) & isCountable0(sdtlpdtrp0(xN,W0)) -> aElementOf0(szmzizndt0(sdtlpdtrp0(xN,W0)),sdtlpdtrp0(xN,W0)) & (all W1 (aElementOf0(W1,sdtlpdtrp0(xN,W0)) -> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,W0)),W1))) & (all W1 (aElement0(W1) & aElementOf0(W1,sdtlpdtrp0(xN,W0)) & szmzizndt0(sdtlpdtrp0(xN,W0)) != W1 <-> aElementOf0(W1,sdtmndt0(sdtlpdtrp0(xN,W0),szmzizndt0(sdtlpdtrp0(xN,W0)))))) & isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(W0))) & aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(W0)),sdtmndt0(sdtlpdtrp0(xN,W0),szmzizndt0(sdtlpdtrp0(xN,W0)))) & (all W1 (aElementOf0(W1,sdtlpdtrp0(xN,szszuzczcdt0(W0))) -> aElementOf0(W1,sdtmndt0(sdtlpdtrp0(xN,W0),szmzizndt0(sdtlpdtrp0(xN,W0)))))) & aSet0(sdtlpdtrp0(xN,szszuzczcdt0(W0))) & aSet0(sdtmndt0(sdtlpdtrp0(xN,W0),szmzizndt0(sdtlpdtrp0(xN,W0))))))) # label(m__3623_AndRHS_AndLHS) # label(hypothesis) # label(non_clause).  [assumption].
1.73/2.00	71 (all W0 all W1 (aElementOf0(W1,szNzAzT0) & aElementOf0(W0,szNzAzT0) -> (sdtlseqdt0(W0,W1) -> $T))) # label(mLessRel) # label(axiom) # label(non_clause).  [assumption].
1.73/2.00	72 (all W0 (aElement0(W0) -> (all W1 (isCountable0(W1) & aSet0(W1) -> isCountable0(sdtpldt0(W1,W0)))))) # label(mCConsSet) # label(axiom) # label(non_clause).  [assumption].
1.73/2.00	73 (all W0 (aSet0(W0) -> (isFinite0(W0) -> $T))) # label(mFinRel) # label(axiom) # label(non_clause).  [assumption].
1.73/2.00	74 (all W0 (aElement0(W0) -> $T)) # label(mElmSort) # label(axiom) # label(non_clause).  [assumption].
1.73/2.00	75 (all W0 (aSet0(W0) -> $T)) # label(mSetSort) # label(axiom) # label(non_clause).  [assumption].
1.73/2.00	76 (all W0 (aFunction0(W0) -> (all W1 (aElementOf0(W1,szDzozmdt0(W0)) -> aElement0(sdtlpdtrp0(W0,W1)))))) # label(mImgElm) # label(axiom) # label(non_clause).  [assumption].
1.73/2.00	77 (all W0 (aSet0(W0) -> (isCountable0(W0) -> $T))) # label(mCntRel) # label(axiom) # label(non_clause).  [assumption].
1.73/2.00	78 (all W0 (aElementOf0(W0,szNzAzT0) -> (exists W1 (szszuzczcdt0(W1) = W0 & aElementOf0(W1,szNzAzT0))) | W0 = sz00)) # label(mNatExtra) # label(axiom) # label(non_clause).  [assumption].
1.73/2.00	79 (all W0 (aElementOf0(W0,szNzAzT0) -> sdtlseqdt0(sz00,W0))) # label(mZeroLess) # label(axiom) # label(non_clause).  [assumption].
1.73/2.00	80 (all W0 all W1 (aSet0(W1) & aElement0(W0) -> (-aElementOf0(W0,W1) -> W1 = sdtmndt0(sdtpldt0(W1,W0),W0)))) # label(mDiffCons) # label(axiom) # label(non_clause).  [assumption].
1.73/2.00	81 (all W0 (aSet0(W0) -> (all W1 (aSubsetOf0(W1,W0) & isFinite0(W0) -> sdtlseqdt0(sbrdtbr0(W1),sbrdtbr0(W0)))))) # label(mCardSub) # label(axiom) # label(non_clause).  [assumption].
1.73/2.00	82 (all W0 all W1 all W2 (aElementOf0(W0,szNzAzT0) & aElementOf0(W1,szNzAzT0) & aElementOf0(W2,szNzAzT0) -> (sdtlseqdt0(W0,W1) & sdtlseqdt0(W1,W2) -> sdtlseqdt0(W0,W2)))) # label(mLessTrans) # label(axiom) # label(non_clause).  [assumption].
1.73/2.00	83 -(aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi)) & (all W0 (aElementOf0(W0,sdtlpdtrp0(xN,xi)) -> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),W0))) -> (aSet0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) & (all W0 (aElementOf0(W0,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) <-> aElement0(W0) & (aElementOf0(W0,xQ) | W0 = szmzizndt0(sdtlpdtrp0(xN,xi))))) -> aSubsetOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),xS) | (all W0 (aElementOf0(W0,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) -> aElementOf0(W0,xS))))) # label(m__) # label(negated_conjecture) # label(non_clause).  [assumption].
11.11/11.37	
11.11/11.37	============================== end of process non-clausal formulas ===
11.11/11.37	
11.11/11.37	============================== PROCESS INITIAL CLAUSES ===============
11.11/11.37	
11.11/11.37	============================== PREDICATE ELIMINATION =================
11.11/11.37	
11.11/11.37	============================== end predicate elimination =============
11.11/11.37	
11.11/11.37	Auto_denials:  (non-Horn, no changes).
11.11/11.37	
11.11/11.37	Term ordering decisions:
11.11/11.37	Function symbol KB weights:  szNzAzT0=1. xK=1. xT=1. xN=1. xi=1. xc=1. xQ=1. slcrc0=1. sz00=1. xS=1. xk=1. c1=1. sdtlcdtrc0=1. sdtlpdtrp0=1. slbdtsldtrb0=1. sdtmndt0=1. sdtpldt0=1. sdtlbdtrb0=1. sdtexdt0=1. f2=1. f5=1. f6=1. f7=1. f17=1. f19=1. f20=1. f21=1. f22=1. szDzozmdt0=1. sbrdtbr0=1. szmzizndt0=1. szszuzczcdt0=1. slbdtrb0=1. szmzazxdt0=1. szDzizrdt0=1. f1=1. f14=1. f15=1. f18=1. f30=1. f31=1. f3=1. f4=1. f8=1. f9=1. f11=1. f12=1. f13=1. f16=1. f23=1. f24=1. f26=1. f27=1. f28=1. f10=1. f25=1. f29=1.
11.11/11.37	
11.11/11.37	============================== end of process initial clauses ========
11.11/11.37	
11.11/11.37	============================== CLAUSES FOR SEARCH ====================
11.11/11.37	
11.11/11.37	============================== end of clauses for search =============
11.11/11.37	
11.11/11.37	============================== SEARCH ================================
11.11/11.37	
11.11/11.37	% Starting search at 2.06 seconds.
11.11/11.37	
11.11/11.37	Low Water (keep): wt=2.000, iters=2147483647
11.11/11.37	
11.11/11.37	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 1460 (0.00 of 2.09 sec).
11.11/11.37	
11.11/11.37	Low Water (displace): id=8591, wt=146.000
11.11/11.37	
11.11/11.37	Low Water (displace): id=8592, wt=145.000
11.11/11.37	
11.11/11.37	Low Water (displace): id=8754, wt=143.000
11.11/11.37	
11.11/11.37	Low Water (displace): id=8500, wt=142.000
11.11/11.37	
11.11/11.37	Low Water (displace): id=8595, wt=141.000
11.11/11.38	
11.11/11.38	Low Water (displace): id=8936, wt=140.000
11.11/11.38	
11.11/11.38	Low Water (displace): id=8627, wt=139.000
11.11/11.38	
11.11/11.38	Low Water (displace): id=10027, wt=138.000
11.11/11.38	
11.11/11.38	Low Water (displace): id=8965, wt=137.000
11.11/11.38	
11.11/11.38	Low Water (displace): id=8706, wt=136.000
11.11/11.38	
11.11/11.38	Low Water (displace): id=9868, wt=135.000
11.11/11.38	
11.11/11.38	Low Water (displace): id=8937, wt=134.000
11.11/11.38	
11.11/11.38	Low Water (displace): id=9777, wt=133.000
11.11/11.38	
11.11/11.38	Low Water (displace): id=9145, wt=132.000
11.11/11.38	
11.11/11.38	Low Water (displace): id=10032, wt=131.000
11.11/11.38	
11.11/11.38	Low Water (displace): id=10345, wt=130.000
11.11/11.38	
11.11/11.38	Low Water (displace): id=10252, wt=129.000
11.11/11.38	
11.11/11.38	Low Water (displace): id=10036, wt=128.000
11.11/11.38	
11.11/11.38	Low Water (displace): id=11009, wt=127.000
11.11/11.38	
11.11/11.38	Low Water (displace): id=10062, wt=126.000
11.11/11.38	
11.11/11.38	Low Water (displace): id=10138, wt=125.000
11.11/11.38	
11.11/11.38	Low Water (displace): id=10928, wt=124.000
11.11/11.38	
11.11/11.38	Low Water (displace): id=10352, wt=123.000
11.11/11.38	
11.11/11.38	Low Water (displace): id=10867, wt=122.000
11.11/11.38	
11.11/11.38	Low Water (displace): id=9801, wt=121.000
11.11/11.38	
11.11/11.38	Low Water (displace): id=11012, wt=120.000
11.11/11.38	
11.11/11.38	Low Water (displace): id=10990, wt=119.000
11.11/11.38	
11.11/11.38	Low Water (displace): id=11117, wt=118.000
11.11/11.38	
11.11/11.38	Low Water (displace): id=11014, wt=117.000
11.11/11.38	
11.11/11.38	Low Water (displace): id=10916, wt=116.000
11.11/11.38	
11.11/11.38	Low Water (displace): id=11015, wt=115.000
11.11/11.38	
11.11/11.38	Low Water (displace): id=10965, wt=114.000
11.11/11.38	
11.11/11.38	Low Water (displace): id=11157, wt=113.000
11.11/11.38	
11.11/11.38	Low Water (displace): id=10994, wt=112.000
11.11/11.38	
11.11/11.38	Low Water (displace): id=11120, wt=111.000
11.11/11.38	
11.11/11.38	Low Water (displace): id=10872, wt=110.000
11.11/11.38	
11.11/11.38	Low Water (displace): id=11026, wt=109.000
11.11/11.38	
11.11/11.38	Low Water (displace): id=11122, wt=108.000
11.11/11.38	
11.11/11.38	Low Water (displace): id=10999, wt=107.000
11.11/11.38	
11.11/11.38	Low Water (displace): id=11161, wt=106.000
11.11/11.38	
11.11/11.38	Low Water (displace): id=10791, wt=105.000
11.11/11.38	
11.11/11.38	Low Water (displace): id=10970, wt=104.000
11.11/11.38	
11.11/11.38	Low Water (displace): id=11163, wt=103.000
11.11/11.38	
11.11/11.38	Low Water (displace): id=11031, wt=102.000
11.11/11.38	
11.11/11.38	Low Water (displace): id=11165, wt=101.000
11.11/11.38	
11.11/11.38	Low Water (displace): id=11137, wt=100.000
11.11/11.38	
11.11/11.38	Low Water (displace): id=11159, wt=99.000
11.11/11.38	
11.11/11.38	Low Water (displace): id=10985, wt=98.000
11.11/11.38	
11.11/11.38	Low Water (displace): id=11115, wt=97.000
11.11/11.38	
11.11/11.38	Low Water (displace): id=11099, wt=96.000
11.11/11.38	
11.11/11.38	Low Water (displace): id=11140, wt=95.000
11.11/11.38	
11.11/11.38	Low Water (displace): id=1112Alarm clock 
119.63/120.07	Prover9 interrupted
119.63/120.07	EOF