0.11/0.13 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s 0.14/0.35 % Computer : n002.cluster.edu 0.14/0.35 % Model : x86_64 x86_64 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.14/0.35 % Memory : 8042.1875MB 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 0.14/0.35 % CPULimit : 1440 0.14/0.35 % WCLimit : 180 0.14/0.35 % DateTime : Mon Jul 3 08:07:52 EDT 2023 0.14/0.35 % CPUTime : 0.46/1.06 ============================== Prover9 =============================== 0.46/1.06 Prover9 (32) version 2009-11A, November 2009. 0.46/1.06 Process 6584 was started by sandbox on n002.cluster.edu, 0.46/1.06 Mon Jul 3 08:07:53 2023 0.46/1.06 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1440 -f /tmp/Prover9_6430_n002.cluster.edu". 0.46/1.06 ============================== end of head =========================== 0.46/1.06 0.46/1.06 ============================== INPUT ================================= 0.46/1.06 0.46/1.06 % Reading from file /tmp/Prover9_6430_n002.cluster.edu 0.46/1.06 0.46/1.06 set(prolog_style_variables). 0.46/1.06 set(auto2). 0.46/1.06 % set(auto2) -> set(auto). 0.46/1.06 % set(auto) -> set(auto_inference). 0.46/1.06 % set(auto) -> set(auto_setup). 0.46/1.06 % set(auto_setup) -> set(predicate_elim). 0.46/1.06 % set(auto_setup) -> assign(eq_defs, unfold). 0.46/1.06 % set(auto) -> set(auto_limits). 0.46/1.06 % set(auto_limits) -> assign(max_weight, "100.000"). 0.46/1.06 % set(auto_limits) -> assign(sos_limit, 20000). 0.46/1.06 % set(auto) -> set(auto_denials). 0.46/1.06 % set(auto) -> set(auto_process). 0.46/1.06 % set(auto2) -> assign(new_constants, 1). 0.46/1.06 % set(auto2) -> assign(fold_denial_max, 3). 0.46/1.06 % set(auto2) -> assign(max_weight, "200.000"). 0.46/1.06 % set(auto2) -> assign(max_hours, 1). 0.46/1.06 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.46/1.06 % set(auto2) -> assign(max_seconds, 0). 0.46/1.06 % set(auto2) -> assign(max_minutes, 5). 0.46/1.06 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.46/1.06 % set(auto2) -> set(sort_initial_sos). 0.46/1.06 % set(auto2) -> assign(sos_limit, -1). 0.46/1.06 % set(auto2) -> assign(lrs_ticks, 3000). 0.46/1.06 % set(auto2) -> assign(max_megs, 400). 0.46/1.06 % set(auto2) -> assign(stats, some). 0.46/1.06 % set(auto2) -> clear(echo_input). 0.46/1.06 % set(auto2) -> set(quiet). 0.46/1.06 % set(auto2) -> clear(print_initial_clauses). 0.46/1.06 % set(auto2) -> clear(print_given). 0.46/1.06 assign(lrs_ticks,-1). 0.46/1.06 assign(sos_limit,10000). 0.46/1.06 assign(order,kbo). 0.46/1.06 set(lex_order_vars). 0.46/1.06 clear(print_given). 0.46/1.06 0.46/1.06 % formulas(sos). % not echoed (69 formulas) 0.46/1.06 0.46/1.06 ============================== end of input ========================== 0.46/1.06 0.46/1.06 % From the command line: assign(max_seconds, 1440). 0.46/1.06 0.46/1.06 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.46/1.06 0.46/1.06 % Formulas that are not ordinary clauses: 0.46/1.06 1 (all W0 all W1 (aNaturalNumber0(W0) & aNaturalNumber0(W1) -> (sdtlseqdt0(W0,W1) <-> (exists W2 (aNaturalNumber0(W2) & sdtpldt0(W0,W2) = W1))))) # label(mDefLE) # label(definition) # label(non_clause). [assumption]. 0.46/1.06 2 (all W0 all W1 (aNaturalNumber0(W0) & aNaturalNumber0(W1) -> (sdtlseqdt0(W0,W1) -> (all W2 (W2 = sdtmndt0(W1,W0) <-> aNaturalNumber0(W2) & sdtpldt0(W0,W2) = W1))))) # label(mDefDiff) # label(definition) # label(non_clause). [assumption]. 0.46/1.06 3 (all W0 all W1 (aNaturalNumber0(W0) & aNaturalNumber0(W1) -> (doDivides0(W0,W1) <-> (exists W2 (aNaturalNumber0(W2) & W1 = sdtasdt0(W0,W2)))))) # label(mDefDiv) # label(definition) # label(non_clause). [assumption]. 0.46/1.06 4 (all W0 all W1 (aNaturalNumber0(W0) & aNaturalNumber0(W1) -> (W0 != sz00 & doDivides0(W0,W1) -> (all W2 (W2 = sdtsldt0(W1,W0) <-> aNaturalNumber0(W2) & W1 = sdtasdt0(W0,W2)))))) # label(mDefQuot) # label(definition) # label(non_clause). [assumption]. 0.46/1.06 5 (all W0 (aNaturalNumber0(W0) -> (isPrime0(W0) <-> W0 != sz00 & W0 != sz10 & (all W1 (aNaturalNumber0(W1) & doDivides0(W1,W0) -> W1 = sz10 | W1 = W0))))) # label(mDefPrime) # label(definition) # label(non_clause). [assumption]. 0.46/1.06 6 (all W0 all W1 all W2 (aNaturalNumber0(W0) & aNaturalNumber0(W1) & aNaturalNumber0(W2) -> sdtasdt0(W0,sdtpldt0(W1,W2)) = sdtpldt0(sdtasdt0(W0,W1),sdtasdt0(W0,W2)) & sdtpldt0(sdtasdt0(W1,W0),sdtasdt0(W2,W0)) = sdtasdt0(sdtpldt0(W1,W2),W0))) # label(mAMDistr) # label(axiom) # label(non_clause). [assumption]. 0.46/1.06 7 (all W0 (aNaturalNumber0(W0) -> W0 = sz10 | sdtlseqdt0(sz10,W0) & W0 != sz10 | W0 = sz00)) # label(mLENTr) # label(axiom) # label(non_clause). [assumption]. 0.46/1.06 8 (all W0 all W1 (aNaturalNumber0(W1) & aNaturalNumber0(W0) -> (sdtlseqdt0(W0,W1) & W0 != W1 -> iLess0(W0,W1)))) # label(mIH_03) # label(axiom) # label(non_clause). [assumption]. 0.46/1.06 9 (all W0 all W1 all W2 (aNaturalNumber0(W0) & aNaturalNumber0(W2) & aNaturalNumber0(W1) -> (doDivides0(W0,W1) & doDivides0(W0,sdtpldt0(W1,W2)) -> doDivides0(W0,W2)))) # label(mDivMin) # label(axiom) # label(non_clause). [assumption]. 0.46/1.06 10 (all W0 all W1 all W2 (aNaturalNumber0(W0) & aNaturalNumber0(W2) & aNaturalNumber0(W1) -> (doDivides0(W0,W1) & doDivides0(W0,W2) -> doDivides0(W0,sdtpldt0(W1,W2))))) # label(mDivSum) # label(axiom) # label(non_clause). [assumption]. 0.46/1.06 11 (all W0 all W1 (aNaturalNumber0(W0) & aNaturalNumber0(W1) -> sdtpldt0(W1,W0) = sdtpldt0(W0,W1))) # label(mAddComm) # label(axiom) # label(non_clause). [assumption]. 0.46/1.06 12 (all W0 all W1 all W2 (aNaturalNumber0(W1) & aNaturalNumber0(W2) & aNaturalNumber0(W0) -> (doDivides0(W2,sdtasdt0(W0,W1)) & isPrime0(W2) -> (iLess0(sdtpldt0(sdtpldt0(W0,W1),W2),sdtpldt0(sdtpldt0(xn,xm),xp)) -> doDivides0(W2,W1) | doDivides0(W2,W0))))) # label(m__1799) # label(hypothesis) # label(non_clause). [assumption]. 0.46/1.06 13 (all W0 all W1 (aNaturalNumber0(W0) & aNaturalNumber0(W1) -> (sdtasdt0(W0,W1) = sz00 -> W1 = sz00 | W0 = sz00))) # label(mZeroMul) # label(axiom) # label(non_clause). [assumption]. 0.46/1.06 14 (all W0 (aNaturalNumber0(W0) -> sdtlseqdt0(W0,W0))) # label(mLERefl) # label(axiom) # label(non_clause). [assumption]. 0.46/1.06 15 (all W0 all W1 (aNaturalNumber0(W1) & aNaturalNumber0(W0) -> (sdtlseqdt0(W1,W0) & sdtlseqdt0(W0,W1) -> W0 = W1))) # label(mLEAsym) # label(axiom) # label(non_clause). [assumption]. 0.46/1.06 16 (all W0 all W1 (aNaturalNumber0(W0) & aNaturalNumber0(W1) -> sdtlseqdt0(W0,W1) | sdtlseqdt0(W1,W0) & W0 != W1)) # label(mLETotal) # label(axiom) # label(non_clause). [assumption]. 0.46/1.06 17 (all W0 all W1 (aNaturalNumber0(W1) & aNaturalNumber0(W0) -> (sz00 = sdtpldt0(W0,W1) -> sz00 = W1 & sz00 = W0))) # label(mZeroAdd) # label(axiom) # label(non_clause). [assumption]. 0.46/1.06 18 (all W0 all W1 (aNaturalNumber0(W1) & aNaturalNumber0(W0) -> (W0 != sz00 -> sdtlseqdt0(W1,sdtasdt0(W1,W0))))) # label(mMonMul2) # label(axiom) # label(non_clause). [assumption]. 0.46/1.06 19 (all W0 all W1 (aNaturalNumber0(W1) & aNaturalNumber0(W0) -> (W0 != sz00 & doDivides0(W0,W1) -> (all W2 (aNaturalNumber0(W2) -> sdtsldt0(sdtasdt0(W2,W1),W0) = sdtasdt0(W2,sdtsldt0(W1,W0))))))) # label(mDivAsso) # label(axiom) # label(non_clause). [assumption]. 0.46/1.06 20 (all W0 all W1 (aNaturalNumber0(W1) & aNaturalNumber0(W0) -> (iLess0(W0,W1) -> $T))) # label(mIH) # label(axiom) # label(non_clause). [assumption]. 0.46/1.06 21 (all W0 all W1 all W2 (aNaturalNumber0(W0) & aNaturalNumber0(W2) & aNaturalNumber0(W1) -> sdtpldt0(sdtpldt0(W0,W1),W2) = sdtpldt0(W0,sdtpldt0(W1,W2)))) # label(mAddAsso) # label(axiom) # label(non_clause). [assumption]. 0.46/1.06 22 -(sz10 = xk | xk = sz00) # label(m__2315) # label(hypothesis) # label(non_clause). [assumption]. 0.46/1.06 23 (all W0 all W1 (aNaturalNumber0(W1) & aNaturalNumber0(W0) -> (doDivides0(W0,W1) & W1 != sz00 -> sdtlseqdt0(W0,W1)))) # label(mDivLE) # label(axiom) # label(non_clause). [assumption]. 0.46/1.06 24 (all W0 (aNaturalNumber0(W0) -> $T)) # label(mNatSort) # label(axiom) # label(non_clause). [assumption]. 0.46/1.06 25 (all W0 all W1 all W2 (aNaturalNumber0(W0) & aNaturalNumber0(W1) & aNaturalNumber0(W2) -> (sdtlseqdt0(W1,W2) & W2 != W1 & sz00 != W0 -> sdtasdt0(W0,W2) != sdtasdt0(W0,W1) & sdtasdt0(W1,W0) != sdtasdt0(W2,W0) & sdtlseqdt0(sdtasdt0(W1,W0),sdtasdt0(W2,W0)) & sdtlseqdt0(sdtasdt0(W0,W1),sdtasdt0(W0,W2))))) # label(mMonMul) # label(axiom) # label(non_clause). [assumption]. 0.46/1.06 26 (all W0 (aNaturalNumber0(W0) -> sdtasdt0(sz10,W0) = W0 & sdtasdt0(W0,sz10) = W0)) # label(m_MulUnit) # label(axiom) # label(non_clause). [assumption]. 0.46/1.06 27 (all W0 all W1 all W2 (aNaturalNumber0(W2) & aNaturalNumber0(W1) & aNaturalNumber0(W0) -> (sdtlseqdt0(W0,W1) & sdtlseqdt0(W1,W2) -> sdtlseqdt0(W0,W2)))) # label(mLETran) # label(axiom) # label(non_clause). [assumption]. 0.46/1.06 28 (all W0 (aNaturalNumber0(W0) & W0 != sz10 & W0 != sz00 -> (exists W1 (doDivides0(W1,W0) & isPrime0(W1) & aNaturalNumber0(W1))))) # label(mPrimDiv) # label(axiom) # label(non_clause). [assumption]. 0.46/1.06 29 (all W0 all W1 all W2 (aNaturalNumber0(W1) & aNaturalNumber0(W2) & aNaturalNumber0(W0) -> (sdtpldt0(W0,W2) = sdtpldt0(W0,W1) | sdtpldt0(W1,W0) = sdtpldt0(W2,W0) -> W2 = W1))) # label(mAddCanc) # label(axiom) # label(non_clause). [assumption]. 0.46/1.07 30 (all W0 all W1 (aNaturalNumber0(W0) & aNaturalNumber0(W1) -> aNaturalNumber0(sdtpldt0(W0,W1)))) # label(mSortsB) # label(axiom) # label(non_clause). [assumption]. 0.46/1.07 31 (all W0 all W1 (aNaturalNumber0(W0) & aNaturalNumber0(W1) -> sdtasdt0(W0,W1) = sdtasdt0(W1,W0))) # label(mMulComm) # label(axiom) # label(non_clause). [assumption]. 0.46/1.07 32 (all W0 (aNaturalNumber0(W0) -> (sz00 != W0 -> (all W1 all W2 (aNaturalNumber0(W2) & aNaturalNumber0(W1) -> (sdtasdt0(W2,W0) = sdtasdt0(W1,W0) | sdtasdt0(W0,W1) = sdtasdt0(W0,W2) -> W2 = W1)))))) # label(mMulCanc) # label(axiom) # label(non_clause). [assumption]. 0.46/1.07 33 (all W0 (aNaturalNumber0(W0) -> W0 = sdtpldt0(W0,sz00) & W0 = sdtpldt0(sz00,W0))) # label(m_AddZero) # label(axiom) # label(non_clause). [assumption]. 0.46/1.07 34 (all W0 (aNaturalNumber0(W0) -> sdtasdt0(W0,sz00) = sz00 & sdtasdt0(sz00,W0) = sz00)) # label(m_MulZero) # label(axiom) # label(non_clause). [assumption]. 0.46/1.07 35 (all W0 all W1 (aNaturalNumber0(W1) & aNaturalNumber0(W0) -> aNaturalNumber0(sdtasdt0(W0,W1)))) # label(mSortsB_02) # label(axiom) # label(non_clause). [assumption]. 0.46/1.07 36 (all W0 all W1 all W2 (aNaturalNumber0(W0) & aNaturalNumber0(W2) & aNaturalNumber0(W1) -> sdtasdt0(W0,sdtasdt0(W1,W2)) = sdtasdt0(sdtasdt0(W0,W1),W2))) # label(mMulAsso) # label(axiom) # label(non_clause). [assumption]. 0.46/1.07 37 (all W0 all W1 all W2 (aNaturalNumber0(W1) & aNaturalNumber0(W2) & aNaturalNumber0(W0) -> (doDivides0(W0,W1) & doDivides0(W1,W2) -> doDivides0(W0,W2)))) # label(mDivTrans) # label(axiom) # label(non_clause). [assumption]. 0.46/1.07 38 (all W0 all W1 (aNaturalNumber0(W1) & aNaturalNumber0(W0) -> (W0 != W1 & sdtlseqdt0(W0,W1) -> (all W2 (aNaturalNumber0(W2) -> sdtpldt0(W2,W0) != sdtpldt0(W2,W1) & sdtpldt0(W1,W2) != sdtpldt0(W0,W2) & sdtlseqdt0(sdtpldt0(W0,W2),sdtpldt0(W1,W2)) & sdtlseqdt0(sdtpldt0(W2,W0),sdtpldt0(W2,W1))))))) # label(mMonAdd) # label(axiom) # label(non_clause). [assumption]. 0.46/1.07 0.46/1.07 ============================== end of process non-clausal formulas === 0.46/1.07 0.46/1.07 ============================== PROCESS INITIAL CLAUSES =============== 0.46/1.07 0.46/1.07 ============================== PREDICATE ELIMINATION ================= 0.46/1.07 39 -aNaturalNumber0(A) | -isPrime0(A) | sz00 != A # label(mDefPrime) # label(definition). [clausify(5)]. 0.46/1.07 40 isPrime0(xr) # label(m__2342_AndRHS_AndRHS) # label(hypothesis). [assumption]. 0.46/1.07 41 isPrime0(xp) # label(m__1860_AndLHS) # label(hypothesis). [assumption]. 0.46/1.07 Derived: -aNaturalNumber0(xr) | sz00 != xr. [resolve(39,b,40,a)]. 0.46/1.07 Derived: -aNaturalNumber0(xp) | sz00 != xp. [resolve(39,b,41,a)]. 0.46/1.07 42 -aNaturalNumber0(A) | -isPrime0(A) | sz10 != A # label(mDefPrime) # label(definition). [clausify(5)]. 0.46/1.07 Derived: -aNaturalNumber0(xr) | sz10 != xr. [resolve(42,b,40,a)]. 0.46/1.07 Derived: -aNaturalNumber0(xp) | sz10 != xp. [resolve(42,b,41,a)]. 0.46/1.07 43 -aNaturalNumber0(A) | sz10 = A | sz00 = A | isPrime0(f4(A)) # label(mPrimDiv) # label(axiom). [clausify(28)]. 0.46/1.07 Derived: -aNaturalNumber0(A) | sz10 = A | sz00 = A | -aNaturalNumber0(f4(A)) | sz00 != f4(A). [resolve(43,d,39,b)]. 0.46/1.07 Derived: -aNaturalNumber0(A) | sz10 = A | sz00 = A | -aNaturalNumber0(f4(A)) | sz10 != f4(A). [resolve(43,d,42,b)]. 0.46/1.07 44 -aNaturalNumber0(A) | isPrime0(A) | sz00 = A | sz10 = A | aNaturalNumber0(f3(A)) # label(mDefPrime) # label(definition). [clausify(5)]. 0.46/1.07 45 -aNaturalNumber0(A) | isPrime0(A) | sz00 = A | sz10 = A | doDivides0(f3(A),A) # label(mDefPrime) # label(definition). [clausify(5)]. 0.46/1.07 46 -aNaturalNumber0(A) | isPrime0(A) | sz00 = A | sz10 = A | sz10 != f3(A) # label(mDefPrime) # label(definition). [clausify(5)]. 0.46/1.07 47 -aNaturalNumber0(A) | isPrime0(A) | sz00 = A | sz10 = A | f3(A) != A # label(mDefPrime) # label(definition). [clausify(5)]. 0.46/1.07 48 -aNaturalNumber0(A) | -isPrime0(A) | -aNaturalNumber0(B) | -doDivides0(B,A) | sz10 = B | B = A # label(mDefPrime) # label(definition). [clausify(5)]. 0.46/1.07 Derived: -aNaturalNumber0(xr) | -aNaturalNumber0(A) | -doDivides0(A,xr) | sz10 = A | A = xr. [resolve(48,b,40,a)]. 0.46/1.07 Derived: -aNaturalNumber0(xp) | -aNaturalNumber0(A) | -doDivides0(A,xp) | sz10 = A | A = xp. [resolve(48,b,41,a)]. 0.46/1.07 Derived: -aNaturalNumber0(f4(A)) | -aNaturalNumber0(B) | -doDivides0(B,f4(A)) | sz10 = B | B = f4(A) | -aNaturalNumber0(A) | sz10 = A | sz00 = A. [resolve(48,b,43,d)]. 1.29/1.56 Derived: -aNaturalNumber0(A) | -aNaturalNumber0(B) | -doDivides0(B,A) | sz10 = B | B = A | -aNaturalNumber0(A) | sz00 = A | sz10 = A | aNaturalNumber0(f3(A)). [resolve(48,b,44,b)]. 1.29/1.56 Derived: -aNaturalNumber0(A) | -aNaturalNumber0(B) | -doDivides0(B,A) | sz10 = B | B = A | -aNaturalNumber0(A) | sz00 = A | sz10 = A | doDivides0(f3(A),A). [resolve(48,b,45,b)]. 1.29/1.56 Derived: -aNaturalNumber0(A) | -aNaturalNumber0(B) | -doDivides0(B,A) | sz10 = B | B = A | -aNaturalNumber0(A) | sz00 = A | sz10 = A | sz10 != f3(A). [resolve(48,b,46,b)]. 1.29/1.56 Derived: -aNaturalNumber0(A) | -aNaturalNumber0(B) | -doDivides0(B,A) | sz10 = B | B = A | -aNaturalNumber0(A) | sz00 = A | sz10 = A | f3(A) != A. [resolve(48,b,47,b)]. 1.29/1.56 49 -aNaturalNumber0(A) | -aNaturalNumber0(B) | -aNaturalNumber0(C) | -doDivides0(B,sdtasdt0(C,A)) | -isPrime0(B) | -iLess0(sdtpldt0(sdtpldt0(C,A),B),sdtpldt0(sdtpldt0(xn,xm),xp)) | doDivides0(B,A) | doDivides0(B,C) # label(m__1799) # label(hypothesis). [clausify(12)]. 1.29/1.56 Derived: -aNaturalNumber0(A) | -aNaturalNumber0(xr) | -aNaturalNumber0(B) | -doDivides0(xr,sdtasdt0(B,A)) | -iLess0(sdtpldt0(sdtpldt0(B,A),xr),sdtpldt0(sdtpldt0(xn,xm),xp)) | doDivides0(xr,A) | doDivides0(xr,B). [resolve(49,e,40,a)]. 1.29/1.56 Derived: -aNaturalNumber0(A) | -aNaturalNumber0(xp) | -aNaturalNumber0(B) | -doDivides0(xp,sdtasdt0(B,A)) | -iLess0(sdtpldt0(sdtpldt0(B,A),xp),sdtpldt0(sdtpldt0(xn,xm),xp)) | doDivides0(xp,A) | doDivides0(xp,B). [resolve(49,e,41,a)]. 1.29/1.56 Derived: -aNaturalNumber0(A) | -aNaturalNumber0(f4(B)) | -aNaturalNumber0(C) | -doDivides0(f4(B),sdtasdt0(C,A)) | -iLess0(sdtpldt0(sdtpldt0(C,A),f4(B)),sdtpldt0(sdtpldt0(xn,xm),xp)) | doDivides0(f4(B),A) | doDivides0(f4(B),C) | -aNaturalNumber0(B) | sz10 = B | sz00 = B. [resolve(49,e,43,d)]. 1.29/1.56 Derived: -aNaturalNumber0(A) | -aNaturalNumber0(B) | -aNaturalNumber0(C) | -doDivides0(B,sdtasdt0(C,A)) | -iLess0(sdtpldt0(sdtpldt0(C,A),B),sdtpldt0(sdtpldt0(xn,xm),xp)) | doDivides0(B,A) | doDivides0(B,C) | -aNaturalNumber0(B) | sz00 = B | sz10 = B | aNaturalNumber0(f3(B)). [resolve(49,e,44,b)]. 1.29/1.56 Derived: -aNaturalNumber0(A) | -aNaturalNumber0(B) | -aNaturalNumber0(C) | -doDivides0(B,sdtasdt0(C,A)) | -iLess0(sdtpldt0(sdtpldt0(C,A),B),sdtpldt0(sdtpldt0(xn,xm),xp)) | doDivides0(B,A) | doDivides0(B,C) | -aNaturalNumber0(B) | sz00 = B | sz10 = B | doDivides0(f3(B),B). [resolve(49,e,45,b)]. 1.29/1.56 Derived: -aNaturalNumber0(A) | -aNaturalNumber0(B) | -aNaturalNumber0(C) | -doDivides0(B,sdtasdt0(C,A)) | -iLess0(sdtpldt0(sdtpldt0(C,A),B),sdtpldt0(sdtpldt0(xn,xm),xp)) | doDivides0(B,A) | doDivides0(B,C) | -aNaturalNumber0(B) | sz00 = B | sz10 = B | sz10 != f3(B). [resolve(49,e,46,b)]. 1.29/1.56 Derived: -aNaturalNumber0(A) | -aNaturalNumber0(B) | -aNaturalNumber0(C) | -doDivides0(B,sdtasdt0(C,A)) | -iLess0(sdtpldt0(sdtpldt0(C,A),B),sdtpldt0(sdtpldt0(xn,xm),xp)) | doDivides0(B,A) | doDivides0(B,C) | -aNaturalNumber0(B) | sz00 = B | sz10 = B | f3(B) != B. [resolve(49,e,47,b)]. 1.29/1.56 1.29/1.56 ============================== end predicate elimination ============= 1.29/1.56 1.29/1.56 Auto_denials: (non-Horn, no changes). 1.29/1.56 1.29/1.56 Term ordering decisions: 1.29/1.56 Function symbol KB weights: sz00=1. sz10=1. xp=1. xr=1. xn=1. xm=1. xk=1. sdtpldt0=1. sdtasdt0=1. sdtsldt0=1. sdtmndt0=1. f1=1. f2=1. f3=1. f4=1. 1.29/1.56 1.29/1.56 ============================== end of process initial clauses ======== 1.29/1.56 1.29/1.56 ============================== CLAUSES FOR SEARCH ==================== 1.29/1.56 1.29/1.56 ============================== end of clauses for search ============= 1.29/1.56 1.29/1.56 ============================== SEARCH ================================ 1.29/1.56 1.29/1.56 % Starting search at 0.04 seconds. 1.29/1.56 1.29/1.56 Low Water (keep): wt=27.000, iters=3620 1.29/1.56 1.29/1.56 Low Water (keep): wt=23.000, iters=3414 1.29/1.56 1.29/1.56 Low Water (keep): wt=21.000, iters=3373 1.29/1.56 1.29/1.56 Low Water (keep): wt=20.000, iters=3351 1.29/1.56 1.29/1.56 Low Water (keep): wt=19.000, iters=3352 1.29/1.56 1.29/1.56 Low Water (keep): wt=18.000, iters=3364 1.29/1.56 1.29/1.56 Low Water (keep): wt=17.000, iters=3423 1.29/1.56 1.29/1.56 Low Water (keep): wt=16.000, iters=3343 1.29/1.56 1.29/1.56 Low Water (keep): wt=15.000, iters=3343 1.29/1.56 1.29/1.56 Low Water (keep): wt=14.000, iters=3407 1.29/1.56 1.29/1.56 NOTE: Back_subsumption disabled, ratio of kept to back_suAlarm clock 178.26/180.05 Prover9 interrupted 178.26/180.05 EOF