0.00/0.03 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.04 % Command : tptp2X_and_run_prover9 %d %s 0.03/0.23 % Computer : n189.star.cs.uiowa.edu 0.03/0.23 % Model : x86_64 x86_64 0.03/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz 0.03/0.23 % Memory : 32218.625MB 0.03/0.23 % OS : Linux 3.10.0-693.2.2.el7.x86_64 0.03/0.23 % CPULimit : 300 0.03/0.23 % DateTime : Sat Jul 14 05:29:39 CDT 2018 0.03/0.23 % CPUTime : 0.07/0.48 ============================== Prover9 =============================== 0.07/0.48 Prover9 (32) version 2009-11A, November 2009. 0.07/0.48 Process 43321 was started by sandbox on n189.star.cs.uiowa.edu, 0.07/0.48 Sat Jul 14 05:29:40 2018 0.07/0.48 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_43289_n189.star.cs.uiowa.edu". 0.07/0.48 ============================== end of head =========================== 0.07/0.48 0.07/0.48 ============================== INPUT ================================= 0.07/0.48 0.07/0.48 % Reading from file /tmp/Prover9_43289_n189.star.cs.uiowa.edu 0.07/0.48 0.07/0.48 set(prolog_style_variables). 0.07/0.48 set(auto2). 0.07/0.48 % set(auto2) -> set(auto). 0.07/0.48 % set(auto) -> set(auto_inference). 0.07/0.48 % set(auto) -> set(auto_setup). 0.07/0.48 % set(auto_setup) -> set(predicate_elim). 0.07/0.48 % set(auto_setup) -> assign(eq_defs, unfold). 0.07/0.48 % set(auto) -> set(auto_limits). 0.07/0.48 % set(auto_limits) -> assign(max_weight, "100.000"). 0.07/0.48 % set(auto_limits) -> assign(sos_limit, 20000). 0.07/0.48 % set(auto) -> set(auto_denials). 0.07/0.48 % set(auto) -> set(auto_process). 0.07/0.48 % set(auto2) -> assign(new_constants, 1). 0.07/0.48 % set(auto2) -> assign(fold_denial_max, 3). 0.07/0.48 % set(auto2) -> assign(max_weight, "200.000"). 0.07/0.48 % set(auto2) -> assign(max_hours, 1). 0.07/0.48 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.07/0.48 % set(auto2) -> assign(max_seconds, 0). 0.07/0.48 % set(auto2) -> assign(max_minutes, 5). 0.07/0.48 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.07/0.48 % set(auto2) -> set(sort_initial_sos). 0.07/0.48 % set(auto2) -> assign(sos_limit, -1). 0.07/0.48 % set(auto2) -> assign(lrs_ticks, 3000). 0.07/0.48 % set(auto2) -> assign(max_megs, 400). 0.07/0.48 % set(auto2) -> assign(stats, some). 0.07/0.48 % set(auto2) -> clear(echo_input). 0.07/0.48 % set(auto2) -> set(quiet). 0.07/0.48 % set(auto2) -> clear(print_initial_clauses). 0.07/0.48 % set(auto2) -> clear(print_given). 0.07/0.48 assign(lrs_ticks,-1). 0.07/0.48 assign(sos_limit,10000). 0.07/0.48 assign(order,kbo). 0.07/0.48 set(lex_order_vars). 0.07/0.48 clear(print_given). 0.07/0.48 0.07/0.48 % formulas(sos). % not echoed (79 formulas) 0.07/0.48 0.07/0.48 ============================== end of input ========================== 0.07/0.48 0.07/0.48 % From the command line: assign(max_seconds, 300). 0.07/0.48 0.07/0.48 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.07/0.48 0.07/0.48 % Formulas that are not ordinary clauses: 0.07/0.48 1 (all W0 (W0 = slcrc0 <-> aSet0(W0) & -(exists W1 aElementOf0(W1,W0)))) # label(mDefEmp) # label(definition) # label(non_clause). [assumption]. 0.07/0.48 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.07/0.48 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.07/0.48 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.07/0.48 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.07/0.48 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.07/0.48 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.07/0.48 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.07/0.48 9 (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.07/0.48 10 (all W0 (aElement0(W0) -> $T)) # label(mElmSort) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 11 (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]. 0.07/0.48 12 (all W0 all W1 (aElementOf0(W1,szNzAzT0) & aElementOf0(W0,szNzAzT0) -> (sdtlseqdt0(W0,W1) -> $T))) # label(mLessRel) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 13 (all W0 (aSet0(W0) -> (isFinite0(W0) <-> aElementOf0(sbrdtbr0(W0),szNzAzT0)))) # label(mCardNum) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 14 (all W0 (isFinite0(W0) & aSet0(W0) -> (all W1 (aElementOf0(W1,szNzAzT0) -> isFinite0(slbdtsldtrb0(W0,W1)))))) # label(mSelFSet) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 15 (all W0 (aElementOf0(W0,szNzAzT0) -> sdtlseqdt0(W0,szszuzczcdt0(W0)))) # label(mLessSucc) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 16 (all W0 (aSet0(W0) -> (all W1 (aElementOf0(W1,W0) -> aElement0(W1))))) # label(mEOfElem) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 17 (all W0 all W1 (aElementOf0(W1,szNzAzT0) & aElementOf0(W0,szNzAzT0) -> (sdtlseqdt0(W0,W1) & sdtlseqdt0(W1,W0) -> W1 = W0))) # label(mLessASymm) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 18 (all W0 (aSet0(W0) -> aElement0(sbrdtbr0(W0)))) # label(mCardS) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 19 (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]. 0.07/0.48 20 (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.07/0.48 21 (all W0 all W1 (aSubsetOf0(W0,szNzAzT0) & W0 != slcrc0 & slcrc0 != W1 & aSubsetOf0(W1,szNzAzT0) -> (aElementOf0(szmzizndt0(W1),W0) & aElementOf0(szmzizndt0(W0),W1) -> szmzizndt0(W0) = szmzizndt0(W1)))) # label(mMinMin) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 22 (all W0 (aSet0(W0) -> (slcrc0 = W0 <-> sz00 = sbrdtbr0(W0)))) # label(mCardEmpty) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 23 (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.07/0.48 24 (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]. 0.07/0.48 25 (all W0 all W1 (aElementOf0(W1,szNzAzT0) & aElementOf0(W0,szNzAzT0) -> (iLess0(W0,W1) -> $T))) # label(mIHSort) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 26 (all W0 all W1 (aElementOf0(W1,szNzAzT0) & aElementOf0(W0,szNzAzT0) -> (aElementOf0(W0,slbdtrb0(szszuzczcdt0(W1))) <-> W1 = W0 | aElementOf0(W0,slbdtrb0(W1))))) # label(mSegSucc) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 27 (all W0 (aElementOf0(W0,szNzAzT0) -> -sdtlseqdt0(szszuzczcdt0(W0),sz00))) # label(mNoScLessZr) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 28 (all W0 (aElementOf0(W0,szNzAzT0) -> W0 != szszuzczcdt0(W0))) # label(mNatNSucc) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 29 (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.07/0.48 30 (all W0 (isCountable0(W0) & aSet0(W0) -> W0 != slcrc0)) # label(mCountNFin_01) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 31 (all W0 (aSet0(W0) -> (isCountable0(W0) -> $T))) # label(mCntRel) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 32 (all W0 (aSet0(W0) -> $T)) # label(mSetSort) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 33 (all W0 (aElement0(W0) -> (all W1 (aSet0(W1) & isCountable0(W1) -> isCountable0(sdtpldt0(W1,W0)))))) # label(mCConsSet) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 34 (all W0 (aElement0(W0) -> (all W1 (aSet0(W1) & isFinite0(W1) -> isFinite0(sdtpldt0(W1,W0)))))) # label(mFConsSet) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 35 (all W0 (aSet0(W0) & -isFinite0(W0) -> (all W1 (aElementOf0(W1,szNzAzT0) -> slcrc0 != slbdtsldtrb0(W0,W1))))) # label(mSelNSet) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 36 (all W0 (aElementOf0(W0,szNzAzT0) -> W0 = sbrdtbr0(slbdtrb0(W0)))) # label(mCardSeg) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 37 (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]. 0.07/0.48 38 (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.07/0.48 39 (all W0 (aSet0(W0) -> (all W1 (aElementOf0(W1,W0) & isFinite0(W0) -> sbrdtbr0(W0) = szszuzczcdt0(sbrdtbr0(sdtmndt0(W0,W1))))))) # label(mCardDiff) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 40 (all W0 (isCountable0(W0) & aSet0(W0) -> -isFinite0(W0))) # label(mCountNFin) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 41 (all W0 (aElementOf0(W0,szNzAzT0) -> szszuzczcdt0(W0) != sz00 & aElementOf0(szszuzczcdt0(W0),szNzAzT0))) # label(mSuccNum) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 42 (all W0 (aSet0(W0) & isFinite0(W0) -> (all W1 (aSubsetOf0(W1,W0) -> isFinite0(W1))))) # label(mSubFSet) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 43 (all W0 (aElement0(W0) -> (all W1 (isCountable0(W1) & aSet0(W1) -> isCountable0(sdtmndt0(W1,W0)))))) # label(mCDiffSet) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 44 (all W0 (aElementOf0(W0,szNzAzT0) -> sdtlseqdt0(sz00,W0))) # label(mZeroLess) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 45 (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.07/0.48 46 (all W0 (aElementOf0(W0,szNzAzT0) -> sdtlseqdt0(W0,W0))) # label(mLessRefl) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 47 (all W0 (aSet0(W0) -> (all W1 (aElementOf0(W1,W0) -> sdtpldt0(sdtmndt0(W0,W1),W1) = W0)))) # label(mConsDiff) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 48 (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.07/0.48 49 (all W0 (aElementOf0(W0,szNzAzT0) -> (exists W1 (aElementOf0(W1,szNzAzT0) & W0 = szszuzczcdt0(W1))) | W0 = sz00)) # label(mNatExtra) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 50 (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.07/0.48 51 (all W0 (aSet0(W0) -> aSubsetOf0(W0,W0))) # label(mSubRefl) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 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.07/0.48 53 (all W0 (aElement0(W0) -> (all W1 (isFinite0(W1) & aSet0(W1) -> isFinite0(sdtmndt0(W1,W0)))))) # label(mFDiffSet) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 54 (all W0 (aElementOf0(W0,szNzAzT0) -> iLess0(W0,szszuzczcdt0(W0)))) # label(mIH) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 55 (all W0 (aSet0(W0) -> (isFinite0(W0) -> $T))) # label(mFinRel) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 56 (all W0 (aElementOf0(W0,szNzAzT0) -> isFinite0(slbdtrb0(W0)))) # label(mSegFin) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 0.07/0.48 ============================== end of process non-clausal formulas === 0.07/0.48 0.07/0.48 ============================== PROCESS INITIAL CLAUSES =============== 0.07/0.48 0.07/0.48 ============================== PREDICATE ELIMINATION ================= 0.07/0.48 0.07/0.48 ===Cputime limit exceeded (core dumped) 300.04/300.21 EOF