TSTP Solution File: NUM447+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : NUM447+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n007.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Mon Jul 18 13:27:40 EDT 2022
% Result : Timeout 300.04s 300.30s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM447+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n007.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Wed Jul 6 20:31:14 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.43/1.03 ============================== Prover9 ===============================
% 0.43/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.43/1.03 Process 11333 was started by sandbox2 on n007.cluster.edu,
% 0.43/1.03 Wed Jul 6 20:31:14 2022
% 0.43/1.03 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_11180_n007.cluster.edu".
% 0.43/1.03 ============================== end of head ===========================
% 0.43/1.03
% 0.43/1.03 ============================== INPUT =================================
% 0.43/1.03
% 0.43/1.03 % Reading from file /tmp/Prover9_11180_n007.cluster.edu
% 0.43/1.03
% 0.43/1.03 set(prolog_style_variables).
% 0.43/1.03 set(auto2).
% 0.43/1.03 % set(auto2) -> set(auto).
% 0.43/1.03 % set(auto) -> set(auto_inference).
% 0.43/1.03 % set(auto) -> set(auto_setup).
% 0.43/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.43/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/1.03 % set(auto) -> set(auto_limits).
% 0.43/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/1.03 % set(auto) -> set(auto_denials).
% 0.43/1.03 % set(auto) -> set(auto_process).
% 0.43/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.43/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.43/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.43/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.43/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.43/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.43/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.43/1.03 % set(auto2) -> assign(stats, some).
% 0.43/1.03 % set(auto2) -> clear(echo_input).
% 0.43/1.03 % set(auto2) -> set(quiet).
% 0.43/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.43/1.03 % set(auto2) -> clear(print_given).
% 0.43/1.03 assign(lrs_ticks,-1).
% 0.43/1.03 assign(sos_limit,10000).
% 0.43/1.03 assign(order,kbo).
% 0.43/1.03 set(lex_order_vars).
% 0.43/1.03 clear(print_given).
% 0.43/1.03
% 0.43/1.03 % formulas(sos). % not echoed (44 formulas)
% 0.43/1.03
% 0.43/1.03 ============================== end of input ==========================
% 0.43/1.03
% 0.43/1.03 % From the command line: assign(max_seconds, 300).
% 0.43/1.03
% 0.43/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/1.03
% 0.43/1.03 % Formulas that are not ordinary clauses:
% 0.43/1.03 1 (all W0 (aInteger0(W0) -> $T)) # label(mIntegers) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.03 2 (all W0 (aInteger0(W0) -> aInteger0(smndt0(W0)))) # label(mIntNeg) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.03 3 (all W0 all W1 (aInteger0(W0) & aInteger0(W1) -> aInteger0(sdtpldt0(W0,W1)))) # label(mIntPlus) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.03 4 (all W0 all W1 (aInteger0(W0) & aInteger0(W1) -> aInteger0(sdtasdt0(W0,W1)))) # label(mIntMult) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.03 5 (all W0 all W1 all W2 (aInteger0(W0) & aInteger0(W1) & aInteger0(W2) -> sdtpldt0(W0,sdtpldt0(W1,W2)) = sdtpldt0(sdtpldt0(W0,W1),W2))) # label(mAddAsso) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.03 6 (all W0 all W1 (aInteger0(W0) & aInteger0(W1) -> sdtpldt0(W0,W1) = sdtpldt0(W1,W0))) # label(mAddComm) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.03 7 (all W0 (aInteger0(W0) -> sdtpldt0(W0,sz00) = W0 & W0 = sdtpldt0(sz00,W0))) # label(mAddZero) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.03 8 (all W0 (aInteger0(W0) -> sdtpldt0(W0,smndt0(W0)) = sz00 & sz00 = sdtpldt0(smndt0(W0),W0))) # label(mAddNeg) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.03 9 (all W0 all W1 all W2 (aInteger0(W0) & aInteger0(W1) & aInteger0(W2) -> sdtasdt0(W0,sdtasdt0(W1,W2)) = sdtasdt0(sdtasdt0(W0,W1),W2))) # label(mMulAsso) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.03 10 (all W0 all W1 (aInteger0(W0) & aInteger0(W1) -> sdtasdt0(W0,W1) = sdtasdt0(W1,W0))) # label(mMulComm) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.03 11 (all W0 (aInteger0(W0) -> sdtasdt0(W0,sz10) = W0 & W0 = sdtasdt0(sz10,W0))) # label(mMulOne) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.03 12 (all W0 all W1 all W2 (aInteger0(W0) & aInteger0(W1) & aInteger0(W2) -> sdtasdt0(W0,sdtpldt0(W1,W2)) = sdtpldt0(sdtasdt0(W0,W1),sdtasdt0(W0,W2)) & sdtasdt0(sdtpldt0(W0,W1),W2) = sdtpldt0(sdtasdt0(W0,W2),sdtasdt0(W1,W2)))) # label(mDistrib) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.03 13 (all W0 (aInteger0(W0) -> sdtasdt0(W0,sz00) = sz00 & sz00 = sdtasdt0(sz00,W0))) # label(mMulZero) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.03 14 (all W0 (aInteger0(W0) -> sdtasdt0(smndt0(sz10),W0) = smndt0(W0) & smndt0(W0) = sdtasdt0(W0,smndt0(sz10)))) # label(mMulMinOne) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.03 15 (all W0 all W1 (aInteger0(W0) & aInteger0(W1) -> (sdtasdt0(W0,W1) = sz00 -> W0 = sz00 | W1 = sz00))) # label(mZeroDiv) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.03 16 (all W0 (aInteger0(W0) -> (all W1 (aDivisorOf0(W1,W0) <-> aInteger0(W1) & W1 != sz00 & (exists W2 (aInteger0(W2) & sdtasdt0(W1,W2) = W0)))))) # label(mDivisor) # label(definition) # label(non_clause). [assumption].
% 0.43/1.03 17 (all W0 all W1 all W2 (aInteger0(W0) & aInteger0(W1) & aInteger0(W2) & W2 != sz00 -> (sdteqdtlpzmzozddtrp0(W0,W1,W2) <-> aDivisorOf0(W2,sdtpldt0(W0,smndt0(W1)))))) # label(mEquMod) # label(definition) # label(non_clause). [assumption].
% 0.43/1.03 18 (all W0 all W1 (aInteger0(W0) & aInteger0(W1) & W1 != sz00 -> sdteqdtlpzmzozddtrp0(W0,W0,W1))) # label(mEquModRef) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.03 19 (all W0 all W1 all W2 (aInteger0(W0) & aInteger0(W1) & aInteger0(W2) & W2 != sz00 -> (sdteqdtlpzmzozddtrp0(W0,W1,W2) -> sdteqdtlpzmzozddtrp0(W1,W0,W2)))) # label(mEquModSym) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.03 20 (all W0 all W1 all W2 all W3 (aInteger0(W0) & aInteger0(W1) & aInteger0(W2) & W2 != sz00 & aInteger0(W3) -> (sdteqdtlpzmzozddtrp0(W0,W1,W2) & sdteqdtlpzmzozddtrp0(W1,W3,W2) -> sdteqdtlpzmzozddtrp0(W0,W3,W2)))) # label(mEquModTrn) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.03 21 (all W0 all W1 all W2 all W3 (aInteger0(W0) & aInteger0(W1) & aInteger0(W2) & W2 != sz00 & aInteger0(W3) & W3 != sz00 -> (sdteqdtlpzmzozddtrp0(W0,W1,sdtasdt0(W2,W3)) -> sdteqdtlpzmzozddtrp0(W0,W1,W2) & sdteqdtlpzmzozddtrp0(W0,W1,W3)))) # label(mEquModMul) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.03 22 (all W0 (aInteger0(W0) & W0 != sz00 -> (isPrime0(W0) -> $T))) # label(mPrime) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.03 23 (all W0 (aInteger0(W0) -> ((exists W1 (aDivisorOf0(W1,W0) & isPrime0(W1))) <-> W0 != sz10 & W0 != smndt0(sz10)))) # label(mPrimeDivisor) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.03 24 (all W0 (aSet0(W0) -> $T)) # label(mSets) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.03 25 (all W0 (aSet0(W0) -> (all W1 (aElementOf0(W1,W0) -> $T)))) # label(mElements) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.03 26 (all W0 (aSet0(W0) -> (all W1 (aSubsetOf0(W1,W0) <-> aSet0(W1) & (all W2 (aElementOf0(W2,W1) -> aElementOf0(W2,W0))))))) # label(mSubset) # label(definition) # label(non_clause). [assumption].
% 0.43/1.03 27 (all W0 (aSet0(W0) -> (isFinite0(W0) -> $T))) # label(mFinSet) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.03 28 (all W0 all W1 (aSubsetOf0(W0,cS1395) & aSubsetOf0(W1,cS1395) -> (all W2 (W2 = sdtbsmnsldt0(W0,W1) <-> aSet0(W2) & (all W3 (aElementOf0(W3,W2) <-> aInteger0(W3) & (aElementOf0(W3,W0) | aElementOf0(W3,W1)))))))) # label(mUnion) # label(definition) # label(non_clause). [assumption].
% 0.43/1.03 29 (all W0 all W1 (aSubsetOf0(W0,cS1395) & aSubsetOf0(W1,cS1395) -> (all W2 (W2 = sdtslmnbsdt0(W0,W1) <-> aSet0(W2) & (all W3 (aElementOf0(W3,W2) <-> aInteger0(W3) & aElementOf0(W3,W0) & aElementOf0(W3,W1))))))) # label(mIntersection) # label(definition) # label(non_clause). [assumption].
% 0.43/1.03 30 (all W0 (aSet0(W0) & (all W1 (aElementOf0(W1,W0) -> aSubsetOf0(W1,cS1395))) -> (all W1 (W1 = sbsmnsldt0(W0) <-> aSet0(W1) & (all W2 (aElementOf0(W2,W1) <-> aInteger0(W2) & (exists W3 (aElementOf0(W3,W0) & aElementOf0(W2,W3))))))))) # label(mUnionSet) # label(definition) # label(non_clause). [assumption].
% 0.43/1.03 31 (all W0 (aSubsetOf0(W0,cS1395) -> (all W1 (W1 = stldt0(W0) <-> aSet0(W1) & (all W2 (aElementOf0(W2,W1) <-> aInteger0(W2) & -aElementOf0(W2,W0))))))) # label(mComplement) # label(definition) # label(non_clause). [assumption].
% 0.43/1.03 32 (all W0 all W1 (aInteger0(W0) & aInteger0(W1) & W1 != sz00 -> (all W2 (W2 = szAzrzSzezqlpdtcmdtrp0(W0,W1) <-> aSet0(W2) & (all W3 (aElementOf0(W3,W2) <-> aInteger0(W3) & sdteqdtlpzmzozddtrp0(W3,W0,W1))))))) # label(mArSeq) # label(definition) # label(non_clause). [assumption].
% 1.35/1.62 33 (all W0 (aSubsetOf0(W0,cS1395) -> (isOpen0(W0) <-> (all W1 (aElementOf0(W1,W0) -> (exists W2 (aInteger0(W2) & W2 != sz00 & aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(W1,W2),W0)))))))) # label(mOpen) # label(definition) # label(non_clause). [assumption].
% 1.35/1.62 34 (all W0 (aSubsetOf0(W0,cS1395) -> (isClosed0(W0) <-> isOpen0(stldt0(W0))))) # label(mClosed) # label(definition) # label(non_clause). [assumption].
% 1.35/1.62 35 (all W0 (aSet0(W0) & (all W1 (aElementOf0(W1,W0) -> aSubsetOf0(W1,cS1395) & isOpen0(W1))) -> isOpen0(sbsmnsldt0(W0)))) # label(mUnionOpen) # label(axiom) # label(non_clause). [assumption].
% 1.35/1.62 36 (all W0 all W1 (aSubsetOf0(W0,cS1395) & aSubsetOf0(W1,cS1395) & isOpen0(W0) & isOpen0(W1) -> isOpen0(sdtslmnbsdt0(W0,W1)))) # label(mInterOpen) # label(axiom) # label(non_clause). [assumption].
% 1.35/1.62 37 (all W0 all W1 (aSubsetOf0(W0,cS1395) & aSubsetOf0(W1,cS1395) & isClosed0(W0) & isClosed0(W1) -> isClosed0(sdtbsmnsldt0(W0,W1)))) # label(mUnionClosed) # label(axiom) # label(non_clause). [assumption].
% 1.35/1.62 38 (all W0 (aSet0(W0) & isFinite0(W0) & (all W1 (aElementOf0(W1,W0) -> aSubsetOf0(W1,cS1395) & isClosed0(W1))) -> isClosed0(sbsmnsldt0(W0)))) # label(mUnionSClosed) # label(axiom) # label(non_clause). [assumption].
% 1.35/1.62 39 (all W0 all W1 (aInteger0(W0) & aInteger0(W1) & W1 != sz00 -> aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(W0,W1),cS1395) & isClosed0(szAzrzSzezqlpdtcmdtrp0(W0,W1)))) # label(mArSeqClosed) # label(axiom) # label(non_clause). [assumption].
% 1.35/1.62 40 -(aElementOf0(xn,sbsmnsldt0(xS)) <-> (exists W0 (aDivisorOf0(W0,xn) & isPrime0(W0)))) # label(m__) # label(negated_conjecture) # label(non_clause). [assumption].
% 1.35/1.62
% 1.35/1.62 ============================== end of process non-clausal formulas ===
% 1.35/1.62
% 1.35/1.62 ============================== PROCESS INITIAL CLAUSES ===============
% 1.35/1.62
% 1.35/1.62 ============================== PREDICATE ELIMINATION =================
% 1.35/1.62 41 -aInteger0(A) | isPrime0(f2(A)) | sz10 = A | smndt0(sz10) = A # label(mPrimeDivisor) # label(axiom). [clausify(23)].
% 1.35/1.62 42 -aInteger0(A) | -aDivisorOf0(B,A) | -isPrime0(B) | sz10 != A # label(mPrimeDivisor) # label(axiom). [clausify(23)].
% 1.35/1.62 43 -aInteger0(A) | -aDivisorOf0(B,A) | -isPrime0(B) | smndt0(sz10) != A # label(mPrimeDivisor) # label(axiom). [clausify(23)].
% 1.35/1.62 Derived: -aInteger0(A) | sz10 = A | smndt0(sz10) = A | -aInteger0(B) | -aDivisorOf0(f2(A),B) | sz10 != B. [resolve(41,b,42,c)].
% 1.35/1.62 Derived: -aInteger0(A) | sz10 = A | smndt0(sz10) = A | -aInteger0(B) | -aDivisorOf0(f2(A),B) | smndt0(sz10) != B. [resolve(41,b,43,c)].
% 1.35/1.62 44 aElementOf0(xn,sbsmnsldt0(xS)) | isPrime0(c1) # label(m__) # label(negated_conjecture). [clausify(40)].
% 1.35/1.62 Derived: aElementOf0(xn,sbsmnsldt0(xS)) | -aInteger0(A) | -aDivisorOf0(c1,A) | sz10 != A. [resolve(44,b,42,c)].
% 1.35/1.62 Derived: aElementOf0(xn,sbsmnsldt0(xS)) | -aInteger0(A) | -aDivisorOf0(c1,A) | smndt0(sz10) != A. [resolve(44,b,43,c)].
% 1.35/1.62 45 -aElementOf0(xn,sbsmnsldt0(xS)) | -aDivisorOf0(A,xn) | -isPrime0(A) # label(m__) # label(negated_conjecture). [clausify(40)].
% 1.35/1.62 Derived: -aElementOf0(xn,sbsmnsldt0(xS)) | -aDivisorOf0(f2(A),xn) | -aInteger0(A) | sz10 = A | smndt0(sz10) = A. [resolve(45,c,41,b)].
% 1.35/1.62
% 1.35/1.62 ============================== end predicate elimination =============
% 1.35/1.62
% 1.35/1.62 Auto_denials: (non-Horn, no changes).
% 1.35/1.62
% 1.35/1.62 Term ordering decisions:
% 1.35/1.62 Function symbol KB weights: cS1395=1. sz00=1. sz10=1. xn=1. xS=1. cS2043=1. c1=1. sdtasdt0=1. sdtpldt0=1. szAzrzSzezqlpdtcmdtrp0=1. sdtbsmnsldt0=1. sdtslmnbsdt0=1. f1=1. f3=1. f8=1. f9=1. f10=1. f12=1. sbsmnsldt0=1. smndt0=1. stldt0=1. f2=1. f6=1. f13=1. f14=1. f4=1. f5=1. f7=1. f11=1.
% 1.35/1.62
% 1.35/1.62 ============================== end of process initial clauses ========
% 1.35/1.62
% 1.35/1.62 ============================== CLAUSES FOR SEARCH ====================
% 1.35/1.62
% 1.35/1.62 ============================== end of clauses for search =============
% 1.35/1.62
% 1.35/1.62 ============================== SEARCH ================================
% 1.35/1.62
% 1.35/1.62 % Starting search at 0.04 seconds.
% 1.35/1.62
% 1.35/1.62 Low Water (keep): wt=41.000, iters=3343
% 1.35/1.62
% 1.35/1.62 Low Water (keep): wt=35.000, iters=3374
% 1.35/1.62
% 1.35/1.62 Low Water (keep): wt=33.000, iterCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------