0.06/0.11 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.06/0.11 % Command : tptp2X_and_run_prover9 %d %s 0.11/0.31 % Computer : n014.cluster.edu 0.11/0.31 % Model : x86_64 x86_64 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.11/0.31 % Memory : 8042.1875MB 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64 0.11/0.31 % CPULimit : 960 0.11/0.31 % WCLimit : 120 0.11/0.31 % DateTime : Tue Aug 9 04:41:31 EDT 2022 0.11/0.32 % CPUTime : 0.57/0.89 ============================== Prover9 =============================== 0.57/0.89 Prover9 (32) version 2009-11A, November 2009. 0.57/0.89 Process 23615 was started by sandbox2 on n014.cluster.edu, 0.57/0.89 Tue Aug 9 04:41:31 2022 0.57/0.89 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_23462_n014.cluster.edu". 0.57/0.89 ============================== end of head =========================== 0.57/0.89 0.57/0.89 ============================== INPUT ================================= 0.57/0.89 0.57/0.89 % Reading from file /tmp/Prover9_23462_n014.cluster.edu 0.57/0.89 0.57/0.89 set(prolog_style_variables). 0.57/0.89 set(auto2). 0.57/0.89 % set(auto2) -> set(auto). 0.57/0.89 % set(auto) -> set(auto_inference). 0.57/0.89 % set(auto) -> set(auto_setup). 0.57/0.89 % set(auto_setup) -> set(predicate_elim). 0.57/0.89 % set(auto_setup) -> assign(eq_defs, unfold). 0.57/0.89 % set(auto) -> set(auto_limits). 0.57/0.89 % set(auto_limits) -> assign(max_weight, "100.000"). 0.57/0.89 % set(auto_limits) -> assign(sos_limit, 20000). 0.57/0.89 % set(auto) -> set(auto_denials). 0.57/0.89 % set(auto) -> set(auto_process). 0.57/0.89 % set(auto2) -> assign(new_constants, 1). 0.57/0.89 % set(auto2) -> assign(fold_denial_max, 3). 0.57/0.89 % set(auto2) -> assign(max_weight, "200.000"). 0.57/0.89 % set(auto2) -> assign(max_hours, 1). 0.57/0.89 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.57/0.89 % set(auto2) -> assign(max_seconds, 0). 0.57/0.89 % set(auto2) -> assign(max_minutes, 5). 0.57/0.89 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.57/0.89 % set(auto2) -> set(sort_initial_sos). 0.57/0.89 % set(auto2) -> assign(sos_limit, -1). 0.57/0.89 % set(auto2) -> assign(lrs_ticks, 3000). 0.57/0.89 % set(auto2) -> assign(max_megs, 400). 0.57/0.89 % set(auto2) -> assign(stats, some). 0.57/0.89 % set(auto2) -> clear(echo_input). 0.57/0.89 % set(auto2) -> set(quiet). 0.57/0.89 % set(auto2) -> clear(print_initial_clauses). 0.57/0.89 % set(auto2) -> clear(print_given). 0.57/0.89 assign(lrs_ticks,-1). 0.57/0.89 assign(sos_limit,10000). 0.57/0.89 assign(order,kbo). 0.57/0.89 set(lex_order_vars). 0.57/0.89 clear(print_given). 0.57/0.89 0.57/0.89 % formulas(sos). % not echoed (102 formulas) 0.57/0.89 0.57/0.89 ============================== end of input ========================== 0.57/0.89 0.57/0.89 % From the command line: assign(max_seconds, 960). 0.57/0.89 0.57/0.89 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.57/0.89 0.57/0.89 % Formulas that are not ordinary clauses: 0.57/0.89 1 (all W0 (W0 = slcrc0 <-> aSet0(W0) & -(exists W1 aElementOf0(W1,W0)))) # label(mDefEmp) # label(definition) # label(non_clause). [assumption]. 0.57/0.89 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.57/0.89 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.57/0.89 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.57/0.89 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.57/0.89 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.57/0.89 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.57/0.89 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.57/0.89 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.57/0.89 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.57/0.89 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.57/0.89 12 (all W0 (aSet0(W0) -> (all W1 (isFinite0(W0) & aElementOf0(W1,W0) -> sbrdtbr0(W0) = szszuzczcdt0(sbrdtbr0(sdtmndt0(W0,W1))))))) # label(mCardDiff) # label(axiom) # label(non_clause). [assumption]. 0.57/0.89 13 (all W0 all W1 (aElementOf0(W1,szNzAzT0) & aElementOf0(W0,szNzAzT0) -> (sdtlseqdt0(W0,W1) <-> aSubsetOf0(slbdtrb0(W0),slbdtrb0(W1))))) # label(mSegLess) # label(axiom) # label(non_clause). [assumption]. 0.57/0.89 14 (all W0 (aSet0(W0) -> (all W1 (aElementOf0(W1,W0) -> sdtpldt0(sdtmndt0(W0,W1),W1) = W0)))) # label(mConsDiff) # label(axiom) # label(non_clause). [assumption]. 0.57/0.89 15 (all W0 (aFunction0(W0) -> (all W1 (aElementOf0(W1,szDzozmdt0(W0)) -> aElement0(sdtlpdtrp0(W0,W1)))))) # label(mImgElm) # label(axiom) # label(non_clause). [assumption]. 0.57/0.89 16 (all W0 (aSet0(W0) & isFinite0(W0) -> (all W1 (aSubsetOf0(W1,W0) -> isFinite0(W1))))) # label(mSubFSet) # label(axiom) # label(non_clause). [assumption]. 0.57/0.89 17 (all W0 (aSet0(W0) -> $T)) # label(mSetSort) # label(axiom) # label(non_clause). [assumption]. 0.57/0.89 18 sdtlseqdt0(xj,xi) & (exists W0 (szszuzczcdt0(W0) = xi & aElementOf0(W0,szNzAzT0))) -> (sdtlseqdt0(xj,xi) -> (all W0 (aElementOf0(W0,sdtlpdtrp0(xN,xi)) -> aElementOf0(W0,sdtlpdtrp0(xN,xj)))) & aSubsetOf0(sdtlpdtrp0(xN,xi),sdtlpdtrp0(xN,xj))) # label(m__3786_02) # label(hypothesis) # label(non_clause). [assumption]. 0.57/0.89 19 (all W0 all W1 (aSet0(W0) & aSet0(W1) -> (aSubsetOf0(W0,W1) & aSubsetOf0(W1,W0) -> W0 = W1))) # label(mSubASymm) # label(axiom) # label(non_clause). [assumption]. 0.57/0.89 20 (all W0 (aFunction0(W0) -> aSet0(szDzozmdt0(W0)))) # label(mDomSet) # label(axiom) # label(non_clause). [assumption]. 0.57/0.89 21 (all W0 (aElementOf0(W0,szNzAzT0) -> isFinite0(slbdtrb0(W0)))) # label(mSegFin) # label(axiom) # label(non_clause). [assumption]. 0.57/0.89 22 (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.57/0.89 23 (all W0 (aElementOf0(W0,szNzAzT0) -> sdtlseqdt0(sz00,W0))) # label(mZeroLess) # label(axiom) # label(non_clause). [assumption]. 0.57/0.89 24 (all W0 (aFunction0(W0) -> $T)) # label(mFunSort) # label(axiom) # label(non_clause). [assumption]. 0.57/0.89 25 (all W0 (aSet0(W0) -> aElement0(sbrdtbr0(W0)))) # label(mCardS) # label(axiom) # label(non_clause). [assumption]. 0.57/0.89 26 (all W0 all W1 (aElement0(W0) & aSet0(W1) -> (-aElementOf0(W0,W1) -> sdtmndt0(sdtpldt0(W1,W0),W0) = W1))) # label(mDiffCons) # label(axiom) # label(non_clause). [assumption]. 0.57/0.89 27 (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.57/0.89 28 (all W0 (isCountable0(W0) & aSet0(W0) -> (all W1 (aElementOf0(W1,szNzAzT0) & sz00 != W1 -> isCountable0(slbdtsldtrb0(W0,W1)))))) # label(mSelCSet) # label(axiom) # label(non_clause). [assumption]. 0.57/0.89 29 (all W0 (aSet0(W0) -> (isCountable0(W0) -> $T))) # label(mCntRel) # label(axiom) # label(non_clause). [assumption]. 0.57/0.89 30 (all W0 all W1 (W1 != slcrc0 & slcrc0 != W0 & aSubsetOf0(W1,szNzAzT0) & aSubsetOf0(W0,szNzAzT0) -> (aElementOf0(szmzizndt0(W1),W0) & aElementOf0(szmzizndt0(W0),W1) -> szmzizndt0(W1) = szmzizndt0(W0)))) # label(mMinMin) # label(axiom) # label(non_clause). [assumption]. 0.57/0.89 31 (all W0 (aElementOf0(W0,szNzAzT0) -> (all W1 all W2 (aSet0(W1) & aSet0(W2) & W0 != sz00 -> (slbdtsldtrb0(W1,W0) != slcrc0 & aSubsetOf0(slbdtsldtrb0(W1,W0),slbdtsldtrb0(W2,W0)) -> aSubsetOf0(W1,W2)))))) # label(mSelSub) # label(axiom) # label(non_clause). [assumption]. 1.42/1.69 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]. 1.42/1.69 33 (all W0 (isCountable0(W0) & aSet0(W0) -> -isFinite0(W0))) # label(mCountNFin) # label(axiom) # label(non_clause). [assumption]. 1.42/1.69 34 (all W0 all W1 (aElementOf0(W0,szNzAzT0) & aElementOf0(W1,szNzAzT0) -> (sdtlseqdt0(szszuzczcdt0(W0),szszuzczcdt0(W1)) <-> sdtlseqdt0(W0,W1)))) # label(mSuccLess) # label(axiom) # label(non_clause). [assumption]. 1.42/1.69 35 (all W0 (aElementOf0(W0,szNzAzT0) -> W0 = sz00 | (exists W1 (aElementOf0(W1,szNzAzT0) & W0 = szszuzczcdt0(W1))))) # label(mNatExtra) # label(axiom) # label(non_clause). [assumption]. 1.42/1.69 36 (all W0 all W1 (aElementOf0(W1,szNzAzT0) & aElementOf0(W0,szNzAzT0) -> (sdtlseqdt0(W1,W0) -> (iLess0(W0,xi) -> 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]. 1.42/1.69 37 (all W0 (aElementOf0(W0,szNzAzT0) -> (all W1 ((aSubsetOf0(W1,szNzAzT0) | (all W2 (aElementOf0(W2,W1) -> aElementOf0(W2,szNzAzT0))) & aSet0(W1)) & isCountable0(W1) -> (all W2 ((szDzozmdt0(W2) = slbdtsldtrb0(W1,W0) | (all W3 ((aElementOf0(W3,szDzozmdt0(W2)) -> (aSet0(W3) & (all W4 (aElementOf0(W4,W3) -> aElementOf0(W4,W1))) | aSubsetOf0(W3,W1)) & sbrdtbr0(W3) = W0) & (aSet0(W3) & W0 = sbrdtbr0(W3) & aSubsetOf0(W3,W1) & (all W4 (aElementOf0(W4,W3) -> aElementOf0(W4,W1))) -> aElementOf0(W3,szDzozmdt0(W2)))))) & (aSet0(sdtlcdtrc0(W2,szDzozmdt0(W2))) & (all W3 ((exists W4 (aElementOf0(W4,szDzozmdt0(W2)) & sdtlpdtrp0(W2,W4) = W3)) <-> aElementOf0(W3,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 ((exists W4 (aSet0(W4) & (all W5 (aElementOf0(W5,W4) -> aElementOf0(W5,W1))) & aSubsetOf0(W4,W1) & (all W5 (W0 = sbrdtbr0(W5) & (aSet0(W5) & (all W6 (aElementOf0(W6,W5) -> aElementOf0(W6,W4))) | aSubsetOf0(W5,W4)) | aElementOf0(W5,slbdtsldtrb0(W4,W0)) -> W3 = sdtlpdtrp0(W2,W5))) & isCountable0(W4))) & aElementOf0(W3,xT)))))))))) # label(m__3398) # label(hypothesis) # label(non_clause). [assumption]. 1.42/1.69 38 (all W0 (aElementOf0(W0,szNzAzT0) -> -sdtlseqdt0(szszuzczcdt0(W0),sz00))) # label(mNoScLessZr) # label(axiom) # label(non_clause). [assumption]. 1.42/1.69 39 (all W0 (aElement0(W0) -> (all W1 (aSet0(W1) & isFinite0(W1) -> isFinite0(sdtmndt0(W1,W0)))))) # label(mFDiffSet) # label(axiom) # label(non_clause). [assumption]. 1.42/1.69 40 (all W0 all W1 (aFunction0(W0) & aElement0(W1) -> aSubsetOf0(sdtlbdtrb0(W0,W1),szDzozmdt0(W0)))) # label(mPttSet) # label(axiom) # label(non_clause). [assumption]. 1.42/1.69 41 (all W0 (aElementOf0(W0,xS) -> aElementOf0(W0,szNzAzT0))) # label(m__3435_AndRHS_AndRHS_AndRHS) # label(hypothesis) # label(non_clause). [assumption]. 1.42/1.69 42 (all W0 (aSet0(W0) -> (isFinite0(W0) -> $T))) # label(mFinRel) # label(axiom) # label(non_clause). [assumption]. 1.42/1.69 43 (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.42/1.69 44 (all W0 (aSet0(W0) -> (sz00 = sbrdtbr0(W0) <-> slcrc0 = W0))) # label(mCardEmpty) # label(axiom) # label(non_clause). [assumption]. 1.42/1.69 45 (all W0 (aElementOf0(W0,szNzAzT0) -> sdtlseqdt0(W0,szszuzczcdt0(W0)))) # label(mLessSucc) # label(axiom) # label(non_clause). [assumption]. 1.42/1.69 46 (all W0 (aElement0(W0) -> (all W1 (aSet0(W1) & isCountable0(W1) -> isCountable0(sdtmndt0(W1,W0)))))) # label(mCDiffSet) # label(axiom) # label(non_clause). [assumption]. 1.42/1.69 47 (all W0 (isFinite0(W0) & aSet0(W0) -> (all W1 (aElementOf0(W1,szNzAzT0) -> isFinite0(slbdtsldtrb0(W0,W1)))))) # label(mSelFSet) # label(axiom) # label(non_clause). [assumption]. 1.42/1.69 48 (all W0 (aElementOf0(W0,szNzAzT0) -> szszuzczcdt0(W0) != W0)) # label(mNatNSucc) # label(axiom) # label(non_clause). [assumption]. 1.42/1.69 49 (all W0 (aElement0(W0) -> $T)) # label(mElmSort) # label(axiom) # label(non_clause). [assumption]. 1.42/1.69 50 (all W0 all W1 (aElementOf0(W1,szNzAzT0) & aSet0(W0) -> (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]. 1.42/1.69 51 (all W0 all W1 (aElementOf0(W0,szNzAzT0) & aElementOf0(W1,szNzAzT0) -> (sdtlseqdt0(W0,W1) & sdtlseqdt0(W1,W0) -> W0 = W1))) # label(mLessASymm) # label(axiom) # label(non_clause). [assumption]. 1.42/1.69 52 (all W0 (aSet0(W0) -> (all W1 (isFinite0(W0) & aSubsetOf0(W1,W0) -> sdtlseqdt0(sbrdtbr0(W1),sbrdtbr0(W0)))))) # label(mCardSub) # label(axiom) # label(non_clause). [assumption]. 1.42/1.69 53 (all W0 (aElementOf0(W0,szNzAzT0) -> szszuzczcdt0(W0) != sz00 & aElementOf0(szszuzczcdt0(W0),szNzAzT0))) # label(mSuccNum) # label(axiom) # label(non_clause). [assumption]. 1.42/1.69 54 (all W0 (isCountable0(W0) & aSet0(W0) -> slcrc0 != W0)) # label(mCountNFin_01) # label(axiom) # label(non_clause). [assumption]. 1.42/1.69 55 (all W0 all W1 (aElementOf0(W0,szNzAzT0) & aElementOf0(W1,szNzAzT0) -> (szszuzczcdt0(W1) = szszuzczcdt0(W0) -> W1 = W0))) # label(mSuccEquSucc) # label(axiom) # label(non_clause). [assumption]. 1.42/1.69 56 (all W0 all W1 (aElementOf0(W0,szNzAzT0) & aElementOf0(W1,szNzAzT0) -> (sdtlseqdt0(W0,W1) -> $T))) # label(mLessRel) # label(axiom) # label(non_clause). [assumption]. 1.42/1.69 57 (all W0 (aElementOf0(W0,szNzAzT0) -> aSubsetOf0(sdtlpdtrp0(xN,W0),szNzAzT0) & isCountable0(sdtlpdtrp0(xN,W0)) & (all W1 (aElementOf0(W1,sdtlpdtrp0(xN,W0)) -> aElementOf0(W1,szNzAzT0))) & aSet0(sdtlpdtrp0(xN,W0)))) # label(m__3671) # label(hypothesis) # label(non_clause). [assumption]. 1.42/1.69 58 (all W0 (aElement0(W0) -> (all W1 (aSet0(W1) & isCountable0(W1) -> isCountable0(sdtpldt0(W1,W0)))))) # label(mCConsSet) # label(axiom) # label(non_clause). [assumption]. 1.42/1.69 59 (all W0 (aSet0(W0) -> aSubsetOf0(W0,W0))) # label(mSubRefl) # label(axiom) # label(non_clause). [assumption]. 1.42/1.69 60 (all W0 all W1 all W2 (aElementOf0(W0,szNzAzT0) & aElementOf0(W2,szNzAzT0) & aElementOf0(W1,szNzAzT0) -> (sdtlseqdt0(W1,W2) & sdtlseqdt0(W0,W1) -> sdtlseqdt0(W0,W2)))) # label(mLessTrans) # label(axiom) # label(non_clause). [assumption]. 1.42/1.69 61 (all W0 all W1 (aElementOf0(W1,szNzAzT0) & aElementOf0(W0,szNzAzT0) -> (W1 = W0 | aElementOf0(W0,slbdtrb0(W1)) <-> aElementOf0(W0,slbdtrb0(szszuzczcdt0(W1)))))) # label(mSegSucc) # label(axiom) # label(non_clause). [assumption]. 1.42/1.69 62 (all W0 (aElementOf0(W0,szNzAzT0) -> iLess0(W0,szszuzczcdt0(W0)))) # label(mIH) # label(axiom) # label(non_clause). [assumption]. 1.42/1.69 63 (all W0 (aElementOf0(W0,szNzAzT0) -> ((aSubsetOf0(sdtlpdtrp0(xN,W0),szNzAzT0) | (all W1 (aElementOf0(W1,sdtlpdtrp0(xN,W0)) -> aElementOf0(W1,szNzAzT0))) & aSet0(sdtlpdtrp0(xN,W0))) & isCountable0(sdtlpdtrp0(xN,W0)) -> aSet0(sdtmndt0(sdtlpdtrp0(xN,W0),szmzizndt0(sdtlpdtrp0(xN,W0)))) & aSet0(sdtlpdtrp0(xN,szszuzczcdt0(W0))) & (all W1 (aElementOf0(W1,sdtlpdtrp0(xN,szszuzczcdt0(W0))) -> 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 (W1 != szmzizndt0(sdtlpdtrp0(xN,W0)) & aElementOf0(W1,sdtlpdtrp0(xN,W0)) & aElement0(W1) <-> aElementOf0(W1,sdtmndt0(sdtlpdtrp0(xN,W0),szmzizndt0(sdtlpdtrp0(xN,W0)))))) & (all W1 (aElementOf0(W1,sdtlpdtrp0(xN,W0)) -> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,W0)),W1))) & aElementOf0(szmzizndt0(sdtlpdtrp0(xN,W0)),sdtlpdtrp0(xN,W0))))) # label(m__3623_AndRHS_AndLHS) # label(hypothesis) # label(non_clause). [assumption]. 1.42/1.69 64 (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,W2) != sdtlpdtrp0(W0,W3))) -> isCountable0(sdtlcdtrc0(W0,W1))))))) # label(mImgCount) # label(axiom) # label(non_clause). [assumption]. 2.56/2.83 65 (all W0 (-isFinite0(W0) & aSet0(W0) -> (all W1 (aElementOf0(W1,szNzAzT0) -> slbdtsldtrb0(W0,W1) != slcrc0)))) # label(mSelNSet) # label(axiom) # label(non_clause). [assumption]. 2.56/2.83 66 (all W0 (isFinite0(W0) & aSubsetOf0(W0,szNzAzT0) -> (exists W1 (aElementOf0(W1,szNzAzT0) & aSubsetOf0(W0,slbdtrb0(W1)))))) # label(mFinSubSeg) # label(axiom) # label(non_clause). [assumption]. 2.56/2.83 67 (all W0 all W1 all W2 (aSet0(W1) & aSet0(W2) & aSet0(W0) -> (aSubsetOf0(W0,W1) & aSubsetOf0(W1,W2) -> aSubsetOf0(W0,W2)))) # label(mSubTrans) # label(axiom) # label(non_clause). [assumption]. 2.56/2.83 68 (all W0 ((xK = sbrdtbr0(W0) & (aSet0(W0) & (all W1 (aElementOf0(W1,W0) -> aElementOf0(W1,xS))) | aSubsetOf0(W0,xS)) -> aElementOf0(W0,szDzozmdt0(xc))) & (aElementOf0(W0,szDzozmdt0(xc)) -> aSet0(W0) & (all W1 (aElementOf0(W1,W0) -> aElementOf0(W1,xS))) & aSubsetOf0(W0,xS) & sbrdtbr0(W0) = xK))) # label(m__3453_AndLHS) # label(hypothesis) # label(non_clause). [assumption]. 2.56/2.83 69 (all W0 ((exists W1 (aElementOf0(W1,szDzozmdt0(xc)) & W0 = sdtlpdtrp0(xc,W1))) <-> aElementOf0(W0,sdtlcdtrc0(xc,szDzozmdt0(xc))))) # label(m__3453_AndRHS_AndRHS_AndRHS_AndLHS) # label(hypothesis) # label(non_clause). [assumption]. 2.56/2.83 70 (all W0 (aElementOf0(W0,sdtlcdtrc0(xc,szDzozmdt0(xc))) -> aElementOf0(W0,xT))) # label(m__3453_AndRHS_AndRHS_AndRHS_AndRHS_AndRHS_AndLHS) # label(hypothesis) # label(non_clause). [assumption]. 2.56/2.83 71 (all W0 (aElementOf0(W0,szNzAzT0) -> sdtlseqdt0(W0,W0))) # label(mLessRefl) # label(axiom) # label(non_clause). [assumption]. 2.56/2.83 72 (all W0 (aElement0(W0) -> (all W1 (aSet0(W1) & isFinite0(W1) -> isFinite0(sdtpldt0(W1,W0)))))) # label(mFConsSet) # label(axiom) # label(non_clause). [assumption]. 2.56/2.83 73 (all W0 all W1 (aElementOf0(W1,szNzAzT0) & aElementOf0(W0,szNzAzT0) -> sdtlseqdt0(W0,W1) | sdtlseqdt0(szszuzczcdt0(W1),W0))) # label(mLessTotal) # label(axiom) # label(non_clause). [assumption]. 2.56/2.83 74 (all W0 (aSet0(W0) -> (all W1 (aElementOf0(W1,W0) -> aElement0(W1))))) # label(mEOfElem) # label(axiom) # label(non_clause). [assumption]. 2.56/2.83 75 (all W0 all W1 (aElementOf0(W1,szNzAzT0) & aElementOf0(W0,szNzAzT0) -> (iLess0(W0,W1) -> $T))) # label(mIHSort) # label(axiom) # label(non_clause). [assumption]. 2.56/2.83 76 (all W0 (aElementOf0(W0,szNzAzT0) -> W0 = sbrdtbr0(slbdtrb0(W0)))) # label(mCardSeg) # label(axiom) # label(non_clause). [assumption]. 2.56/2.83 77 (all W0 (aSet0(W0) -> (aElementOf0(sbrdtbr0(W0),szNzAzT0) <-> isFinite0(W0)))) # label(mCardNum) # label(axiom) # label(non_clause). [assumption]. 2.56/2.83 78 -(sdtlseqdt0(xj,xi) -> aSubsetOf0(sdtlpdtrp0(xN,xi),sdtlpdtrp0(xN,xj)) | (all W0 (aElementOf0(W0,sdtlpdtrp0(xN,xi)) -> aElementOf0(W0,sdtlpdtrp0(xN,xj))))) # label(m__) # label(negated_conjecture) # label(non_clause). [assumption]. 2.56/2.83 2.56/2.83 ============================== end of process non-clausal formulas === 2.56/2.83 2.56/2.83 ============================== PROCESS INITIAL CLAUSES =============== 2.56/2.83 2.56/2.83 ============================== PREDICATE ELIMINATION ================= 2.56/2.83 2.56/2.83 ============================== end predicate elimination ============= 2.56/2.83 2.56/2.83 Auto_denials: (non-Horn, no changes). 2.56/2.83 2.56/2.83 Term ordering decisions: 2.56/2.83 Function symbol KB weights: szNzAzT0=1. xK=1. xT=1. xN=1. xc=1. slcrc0=1. xi=1. sz00=1. xS=1. xj=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. f15=1. f23=1. f26=1. f27=1. szDzozmdt0=1. sbrdtbr0=1. szmzizndt0=1. szszuzczcdt0=1. slbdtrb0=1. szmzazxdt0=1. szDzizrdt0=1. f1=1. f14=1. f25=1. f28=1. f29=1. f30=1. f3=1. f4=1. f8=1. f9=1. f11=1. f12=1. f13=1. f16=1. f17=1. f19=1. f20=1. f21=1. f24=1. f10=1. f18=1. f22=1. 2.56/2.83 2.56/2.83 ============================== end of process initial clauses ======== 2.56/2.83 2.56/2.83 ============================== CLAUSES FOR SEARCH ==================== 2.56/2.83 2.56/2.83 ============================== end of clauses for search ============= 2.56/2.83 2.56/2.83 ============================== SEARCH ================================ 2.56/2.83 2.56/2.83 % Starting search at 1.95 seconds. 2.56/2.83 2.56/2.83 Low Water (keep): wt=2.0Alarm clock 119.77/120.03 Prover9 interrupted 119.77/120.03 EOF