0.03/0.13	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.13	% Command    : tptp2X_and_run_prover9 %d %s
0.12/0.34	% Computer   : n005.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   : 960
0.12/0.34	% DateTime   : Thu Jul  2 12:53:06 EDT 2020
0.12/0.34	% CPUTime    : 
0.75/1.34	============================== Prover9 ===============================
0.75/1.34	Prover9 (32) version 2009-11A, November 2009.
0.75/1.34	Process 32299 was started by sandbox on n005.cluster.edu,
0.75/1.34	Thu Jul  2 12:53:07 2020
0.75/1.34	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 960 -f /tmp/Prover9_32146_n005.cluster.edu".
0.75/1.34	============================== end of head ===========================
0.75/1.34	
0.75/1.34	============================== INPUT =================================
0.75/1.34	
0.75/1.34	% Reading from file /tmp/Prover9_32146_n005.cluster.edu
0.75/1.34	
0.75/1.34	set(prolog_style_variables).
0.75/1.34	set(auto2).
0.75/1.34	    % set(auto2) -> set(auto).
0.75/1.34	    % set(auto) -> set(auto_inference).
0.75/1.34	    % set(auto) -> set(auto_setup).
0.75/1.34	    % set(auto_setup) -> set(predicate_elim).
0.75/1.34	    % set(auto_setup) -> assign(eq_defs, unfold).
0.75/1.34	    % set(auto) -> set(auto_limits).
0.75/1.34	    % set(auto_limits) -> assign(max_weight, "100.000").
0.75/1.34	    % set(auto_limits) -> assign(sos_limit, 20000).
0.75/1.34	    % set(auto) -> set(auto_denials).
0.75/1.34	    % set(auto) -> set(auto_process).
0.75/1.34	    % set(auto2) -> assign(new_constants, 1).
0.75/1.34	    % set(auto2) -> assign(fold_denial_max, 3).
0.75/1.34	    % set(auto2) -> assign(max_weight, "200.000").
0.75/1.34	    % set(auto2) -> assign(max_hours, 1).
0.75/1.34	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.75/1.34	    % set(auto2) -> assign(max_seconds, 0).
0.75/1.34	    % set(auto2) -> assign(max_minutes, 5).
0.75/1.34	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.75/1.34	    % set(auto2) -> set(sort_initial_sos).
0.75/1.34	    % set(auto2) -> assign(sos_limit, -1).
0.75/1.34	    % set(auto2) -> assign(lrs_ticks, 3000).
0.75/1.34	    % set(auto2) -> assign(max_megs, 400).
0.75/1.34	    % set(auto2) -> assign(stats, some).
0.75/1.34	    % set(auto2) -> clear(echo_input).
0.75/1.34	    % set(auto2) -> set(quiet).
0.75/1.34	    % set(auto2) -> clear(print_initial_clauses).
0.75/1.34	    % set(auto2) -> clear(print_given).
0.75/1.34	assign(lrs_ticks,-1).
0.75/1.34	assign(sos_limit,10000).
0.75/1.34	assign(order,kbo).
0.75/1.34	set(lex_order_vars).
0.75/1.34	clear(print_given).
0.75/1.34	
0.75/1.34	% formulas(sos).  % not echoed (83 formulas)
0.75/1.34	
0.75/1.34	============================== end of input ==========================
0.75/1.34	
0.75/1.34	% From the command line: assign(max_seconds, 960).
0.75/1.34	
0.75/1.34	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.75/1.34	
0.75/1.34	% Formulas that are not ordinary clauses:
0.75/1.34	1 (all W0 (W0 = slcrc0 <-> aSet0(W0) & -(exists W1 aElementOf0(W1,W0)))) # label(mDefEmp) # label(definition) # label(non_clause).  [assumption].
0.75/1.34	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.75/1.34	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.75/1.34	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.75/1.34	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.75/1.34	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.75/1.34	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.75/1.34	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.75/1.34	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.75/1.34	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.75/1.34	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.75/1.34	12 (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.75/1.34	13 (all W0 (aElement0(W0) -> $T)) # label(mElmSort) # label(axiom) # label(non_clause).  [assumption].
0.75/1.34	14 (all W0 (isFinite0(W0) & aSubsetOf0(W0,szNzAzT0) -> (exists W1 (aElementOf0(W1,szNzAzT0) & aSubsetOf0(W0,slbdtrb0(W1)))))) # label(mFinSubSeg) # label(axiom) # label(non_clause).  [assumption].
0.75/1.34	15 (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.75/1.34	16 (all W0 (isCountable0(W0) & aSet0(W0) -> -isFinite0(W0))) # label(mCountNFin) # label(axiom) # label(non_clause).  [assumption].
0.75/1.34	17 (all W0 all W1 (W0 != slcrc0 & W1 != slcrc0 & aSubsetOf0(W1,szNzAzT0) & aSubsetOf0(W0,szNzAzT0) -> (aElementOf0(szmzizndt0(W0),W1) & aElementOf0(szmzizndt0(W1),W0) -> szmzizndt0(W0) = szmzizndt0(W1)))) # label(mMinMin) # label(axiom) # label(non_clause).  [assumption].
0.75/1.34	18 (all W0 (aElement0(W0) -> (all W1 (isCountable0(W1) & aSet0(W1) -> isCountable0(sdtpldt0(W1,W0)))))) # label(mCConsSet) # label(axiom) # label(non_clause).  [assumption].
0.75/1.34	19 (all W0 (aSet0(W0) & isCountable0(W0) -> slcrc0 != W0)) # label(mCountNFin_01) # label(axiom) # label(non_clause).  [assumption].
0.75/1.34	20 (all W0 (aSet0(W0) -> (sz00 = sbrdtbr0(W0) <-> slcrc0 = W0))) # label(mCardEmpty) # label(axiom) # label(non_clause).  [assumption].
0.75/1.34	21 (all W0 (aSet0(W0) -> aSubsetOf0(W0,W0))) # label(mSubRefl) # label(axiom) # label(non_clause).  [assumption].
0.75/1.34	22 (all W0 (aSet0(W0) -> (isCountable0(W0) -> $T))) # label(mCntRel) # label(axiom) # label(non_clause).  [assumption].
0.75/1.34	23 (all W0 (aElement0(W0) -> (all W1 (isFinite0(W1) & aSet0(W1) -> isFinite0(sdtpldt0(W1,W0)))))) # label(mFConsSet) # label(axiom) # label(non_clause).  [assumption].
0.75/1.34	24 (all W0 (aElementOf0(W0,szNzAzT0) -> sdtlseqdt0(W0,szszuzczcdt0(W0)))) # label(mLessSucc) # label(axiom) # label(non_clause).  [assumption].
0.75/1.34	25 (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.75/1.34	26 (all W0 (aElementOf0(W0,szNzAzT0) -> sdtlseqdt0(sz00,W0))) # label(mZeroLess) # label(axiom) # label(non_clause).  [assumption].
0.75/1.34	27 (all W0 all W1 (aElementOf0(W1,szNzAzT0) & aElementOf0(W0,szNzAzT0) -> (szszuzczcdt0(W1) = szszuzczcdt0(W0) -> W0 = W1))) # label(mSuccEquSucc) # label(axiom) # label(non_clause).  [assumption].
0.75/1.34	28 (all W0 (aSet0(W0) & -isFinite0(W0) -> (all W1 (aElementOf0(W1,szNzAzT0) -> slbdtsldtrb0(W0,W1) != slcrc0)))) # label(mSelNSet) # label(axiom) # label(non_clause).  [assumption].
0.75/1.34	29 (all W0 (aSet0(W0) -> (all W1 (aElementOf0(W1,W0) -> aElement0(W1))))) # label(mEOfElem) # label(axiom) # label(non_clause).  [assumption].
0.75/1.34	30 (all W0 (aFunction0(W0) -> (all W1 (aElementOf0(W1,szDzozmdt0(W0)) -> aElement0(sdtlpdtrp0(W0,W1)))))) # label(mImgElm) # label(axiom) # label(non_clause).  [assumption].
0.75/1.34	31 (all W0 (aElementOf0(W0,szNzAzT0) -> -sdtlseqdt0(szszuzczcdt0(W0),sz00))) # label(mNoScLessZr) # label(axiom) # label(non_clause).  [assumption].
0.75/1.34	32 (all W0 all W1 (aElement0(W1) & aFunction0(W0) -> aSubsetOf0(sdtlbdtrb0(W0,W1),szDzozmdt0(W0)))) # label(mPttSet) # label(axiom) # label(non_clause).  [assumption].
0.75/1.34	33 (all W0 all W1 (aElementOf0(W0,szNzAzT0) & aElementOf0(W1,szNzAzT0) -> (iLess0(W0,W1) -> $T))) # label(mIHSort) # label(axiom) # label(non_clause).  [assumption].
0.75/1.34	34 (all W0 (aElementOf0(W0,szNzAzT0) -> isFinite0(slbdtrb0(W0)))) # label(mSegFin) # label(axiom) # label(non_clause).  [assumption].
0.75/1.34	35 (all W0 (aElementOf0(W0,szNzAzT0) -> szszuzczcdt0(W0) != W0)) # label(mNatNSucc) # label(axiom) # label(non_clause).  [assumption].
0.75/1.34	36 (all W0 all W1 (aSet0(W0) & aElementOf0(W1,szNzAzT0) -> (all W2 (aSubsetOf0(W2,slbdtsldtrb0(W0,W1)) & isFinite0(W2) -> (exists W3 (aSubsetOf0(W3,W0) & isFinite0(W3) & aSubsetOf0(W2,slbdtsldtrb0(W3,W1)))))))) # label(mSelExtra) # label(axiom) # label(non_clause).  [assumption].
0.75/1.34	37 (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].
0.75/1.34	38 (all W0 (aElementOf0(W0,szNzAzT0) -> (all W1 all W2 (aSet0(W1) & W0 != sz00 & aSet0(W2) -> (slbdtsldtrb0(W1,W0) != slcrc0 & aSubsetOf0(slbdtsldtrb0(W1,W0),slbdtsldtrb0(W2,W0)) -> aSubsetOf0(W1,W2)))))) # label(mSelSub) # label(axiom) # label(non_clause).  [assumption].
0.75/1.34	39 (all W0 (aSet0(W0) & isCountable0(W0) -> (all W1 (aElementOf0(W1,szNzAzT0) & sz00 != W1 -> isCountable0(slbdtsldtrb0(W0,W1)))))) # label(mSelCSet) # label(axiom) # label(non_clause).  [assumption].
0.75/1.34	40 (all W0 all W1 all W2 (aSet0(W1) & aSet0(W2) & aSet0(W0) -> (aSubsetOf0(W1,W2) & aSubsetOf0(W0,W1) -> aSubsetOf0(W0,W2)))) # label(mSubTrans) # label(axiom) # label(non_clause).  [assumption].
0.75/1.34	41 (all W0 (aSet0(W0) & isFinite0(W0) -> (all W1 (aElement0(W1) -> (-aElementOf0(W1,W0) -> szszuzczcdt0(sbrdtbr0(W0)) = sbrdtbr0(sdtpldt0(W0,W1))))))) # label(mCardCons) # label(axiom) # label(non_clause).  [assumption].
0.75/1.34	42 (all W0 all W1 all W2 (aElementOf0(W2,szNzAzT0) & aElementOf0(W1,szNzAzT0) & aElementOf0(W0,szNzAzT0) -> (sdtlseqdt0(W1,W2) & sdtlseqdt0(W0,W1) -> sdtlseqdt0(W0,W2)))) # label(mLessTrans) # label(axiom) # label(non_clause).  [assumption].
0.75/1.34	43 (all W0 (aSet0(W0) -> aElement0(sbrdtbr0(W0)))) # label(mCardS) # label(axiom) # label(non_clause).  [assumption].
0.75/1.34	44 (all W0 (aElementOf0(W0,szNzAzT0) -> sz00 = W0 | (exists W1 (W0 = szszuzczcdt0(W1) & aElementOf0(W1,szNzAzT0))))) # label(mNatExtra) # label(axiom) # label(non_clause).  [assumption].
0.75/1.34	45 (all W0 (aSet0(W0) -> (isFinite0(W0) -> $T))) # label(mFinRel) # label(axiom) # label(non_clause).  [assumption].
0.75/1.34	46 (all W0 (aFunction0(W0) -> (all W1 (aSubsetOf0(W1,szDzozmdt0(W0)) & isCountable0(W1) -> ((all W2 all W3 (W2 != W3 & 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.75/1.34	47 (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].
0.75/1.34	48 (all W0 (aElementOf0(W0,szNzAzT0) -> sbrdtbr0(slbdtrb0(W0)) = W0)) # label(mCardSeg) # label(axiom) # label(non_clause).  [assumption].
0.75/1.34	49 (all W0 (aElement0(W0) -> (all W1 (isCountable0(W1) & aSet0(W1) -> isCountable0(sdtmndt0(W1,W0)))))) # label(mCDiffSet) # label(axiom) # label(non_clause).  [assumption].
0.75/1.34	50 (all W0 all W1 (aElementOf0(W0,szNzAzT0) & aElementOf0(W1,szNzAzT0) -> (sdtlseqdt0(W0,W1) -> $T))) # label(mLessRel) # label(axiom) # label(non_clause).  [assumption].
0.75/1.34	51 (all W0 (aFunction0(W0) -> $T)) # label(mFunSort) # label(axiom) # label(non_clause).  [assumption].
0.75/1.34	52 (all W0 all W1 (aSet0(W1) & aSet0(W0) -> (aSubsetOf0(W1,W0) & aSubsetOf0(W0,W1) -> W0 = W1))) # label(mSubASymm) # label(axiom) # label(non_clause).  [assumption].
0.75/1.34	53 (all W0 all W1 (aElementOf0(W1,szNzAzT0) & aElementOf0(W0,szNzAzT0) -> (sdtlseqdt0(szszuzczcdt0(W0),szszuzczcdt0(W1)) <-> sdtlseqdt0(W0,W1)))) # label(mSuccLess) # label(axiom) # label(non_clause).  [assumption].
0.75/1.34	54 (all W0 all W1 (aElementOf0(W1,szNzAzT0) & aElementOf0(W0,szNzAzT0) -> (sdtlseqdt0(W0,W1) & sdtlseqdt0(W1,W0) -> W0 = W1))) # label(mLessASymm) # label(axiom) # label(non_clause).  [assumption].
0.75/1.36	55 (all W0 (isFinite0(W0) & aSet0(W0) -> (all W1 (aElementOf0(W1,szNzAzT0) -> isFinite0(slbdtsldtrb0(W0,W1)))))) # label(mSelFSet) # label(axiom) # label(non_clause).  [assumption].
0.75/1.36	56 (all W0 (aFunction0(W0) -> (isFinite0(sdtlcdtrc0(W0,szDzozmdt0(W0))) & isCountable0(szDzozmdt0(W0)) -> aElement0(szDzizrdt0(W0)) & isCountable0(sdtlbdtrb0(W0,szDzizrdt0(W0)))))) # label(mDirichlet) # label(axiom) # label(non_clause).  [assumption].
0.75/1.36	57 (all W0 all W1 (aElementOf0(W1,szNzAzT0) & aElementOf0(W0,szNzAzT0) -> sdtlseqdt0(szszuzczcdt0(W1),W0) | sdtlseqdt0(W0,W1))) # label(mLessTotal) # label(axiom) # label(non_clause).  [assumption].
0.75/1.36	58 (all W0 (aSet0(W0) -> (all W1 (isFinite0(W0) & aSubsetOf0(W1,W0) -> sdtlseqdt0(sbrdtbr0(W1),sbrdtbr0(W0)))))) # label(mCardSub) # label(axiom) # label(non_clause).  [assumption].
0.75/1.36	59 (all W0 (aElement0(W0) -> (all W1 (isFinite0(W1) & aSet0(W1) -> isFinite0(sdtmndt0(W1,W0)))))) # label(mFDiffSet) # label(axiom) # label(non_clause).  [assumption].
0.75/1.36	60 (all W0 (aSet0(W0) -> $T)) # label(mSetSort) # label(axiom) # label(non_clause).  [assumption].
0.75/1.36	61 (all W0 (aElementOf0(W0,szNzAzT0) -> (all W1 (isCountable0(W1) & aSubsetOf0(W1,szNzAzT0) -> (all W2 (aFunction0(W2) & szDzozmdt0(W2) = slbdtsldtrb0(W1,W0) & aSubsetOf0(sdtlcdtrc0(W2,szDzozmdt0(W2)),xT) -> (iLess0(W0,xK) -> (exists W3 (aElementOf0(W3,xT) & (exists W4 ((all W5 (aElementOf0(W5,slbdtsldtrb0(W4,W0)) -> sdtlpdtrp0(W2,W5) = W3)) & isCountable0(W4) & aSubsetOf0(W4,W1)))))))))))) # label(m__3398) # label(hypothesis) # label(non_clause).  [assumption].
0.75/1.36	62 (all W0 (aSet0(W0) -> (aElementOf0(sbrdtbr0(W0),szNzAzT0) <-> isFinite0(W0)))) # label(mCardNum) # label(axiom) # label(non_clause).  [assumption].
0.75/1.36	63 (all W0 (aSet0(W0) -> (all W1 (aElementOf0(W1,W0) -> W0 = sdtpldt0(sdtmndt0(W0,W1),W1))))) # label(mConsDiff) # label(axiom) # label(non_clause).  [assumption].
0.75/1.36	64 (all W0 (aFunction0(W0) -> aSet0(szDzozmdt0(W0)))) # label(mDomSet) # label(axiom) # label(non_clause).  [assumption].
0.75/1.36	65 (all W0 (aElementOf0(W0,szNzAzT0) -> iLess0(W0,szszuzczcdt0(W0)))) # label(mIH) # label(axiom) # label(non_clause).  [assumption].
0.75/1.36	66 (all W0 all W1 (aElementOf0(W1,szNzAzT0) & aSet0(W0) -> (sdtlseqdt0(W1,sbrdtbr0(W0)) & isFinite0(W0) -> (exists W2 (aSubsetOf0(W2,W0) & sbrdtbr0(W2) = W1))))) # label(mCardSubEx) # label(axiom) # label(non_clause).  [assumption].
0.75/1.36	67 (all W0 (isFinite0(W0) & aSet0(W0) -> (all W1 (aSubsetOf0(W1,W0) -> isFinite0(W1))))) # label(mSubFSet) # label(axiom) # label(non_clause).  [assumption].
0.75/1.36	68 (all W0 (aElementOf0(W0,szNzAzT0) -> sz00 != szszuzczcdt0(W0) & aElementOf0(szszuzczcdt0(W0),szNzAzT0))) # label(mSuccNum) # label(axiom) # label(non_clause).  [assumption].
0.75/1.36	69 (all W0 (aElementOf0(W0,szNzAzT0) -> sdtlseqdt0(W0,W0))) # label(mLessRefl) # label(axiom) # label(non_clause).  [assumption].
0.75/1.36	70 -(xK = sz00 -> (exists W0 (aElementOf0(W0,xT) & (exists W1 (aSubsetOf0(W1,xS) & (all W2 (aElementOf0(W2,slbdtsldtrb0(W1,xK)) -> sdtlpdtrp0(xc,W2) = W0)) & isCountable0(W1)))))) # label(m__) # label(negated_conjecture) # label(non_clause).  [assumption].
0.75/1.36	
0.75/1.36	============================== end of process non-clausal formulas ===
0.75/1.36	
0.75/1.36	============================== PROCESS INITIAL CLAUSES ===============
0.75/1.36	
0.75/1.36	============================== PREDICATE ELIMINATION =================
0.75/1.36	
0.75/1.36	============================== end predicate elimination =============
0.75/1.36	
0.75/1.36	Auto_denials:  (non-Horn, no changes).
0.75/1.36	
0.75/1.36	Term ordering decisions:
0.75/1.36	Function symbol KB weights:  szNzAzT0=1. slcrc0=1. sz00=1. xT=1. xK=1. xS=1. xc=1. slbdtsldtrb0=1. sdtlcdtrc0=1. sdtlpdtrp0=1. sdtpldt0=1. sdtmndt0=1. sdtlbdtrb0=1. sdtexdt0=1. f2=1. f5=1. f6=1. f7=1. f17=1. f18=1. f21=1. f22=1. szDzozmdt0=1. slbdtrb0=1. szszuzczcdt0=1. sbrdtbr0=1. szmzizndt0=1. szmzazxdt0=1. szDzizrdt0=1. f1=1. f14=1. f16=1. f3=1. f4=1. f8=1. f9=1. f11=1. f12=1. f13=1. f15=1. f19=1. f20=1. f10=1.
0.75/1.36	
0.75/1.36	============================== end of process initial clauses ===Alarm clock 
119.49/120.10	Prover9 interrupted
119.49/120.10	EOF