0.07/0.12	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.13	% Command  : tptp2X_and_run_prover9 %d %s
0.13/0.34	% Computer : n011.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 : 1440
0.13/0.34	% WCLimit  : 180
0.13/0.34	% DateTime : Mon Jul  3 09:03:54 EDT 2023
0.13/0.34	% CPUTime  : 
0.44/1.05	============================== Prover9 ===============================
0.44/1.05	Prover9 (32) version 2009-11A, November 2009.
0.44/1.05	Process 11068 was started by sandbox on n011.cluster.edu,
0.44/1.05	Mon Jul  3 09:03:55 2023
0.44/1.05	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1440 -f /tmp/Prover9_10914_n011.cluster.edu".
0.44/1.05	============================== end of head ===========================
0.44/1.05	
0.44/1.05	============================== INPUT =================================
0.44/1.05	
0.44/1.05	% Reading from file /tmp/Prover9_10914_n011.cluster.edu
0.44/1.05	
0.44/1.05	set(prolog_style_variables).
0.44/1.05	set(auto2).
0.44/1.05	    % set(auto2) -> set(auto).
0.44/1.05	    % set(auto) -> set(auto_inference).
0.44/1.05	    % set(auto) -> set(auto_setup).
0.44/1.05	    % set(auto_setup) -> set(predicate_elim).
0.44/1.05	    % set(auto_setup) -> assign(eq_defs, unfold).
0.44/1.05	    % set(auto) -> set(auto_limits).
0.44/1.05	    % set(auto_limits) -> assign(max_weight, "100.000").
0.44/1.05	    % set(auto_limits) -> assign(sos_limit, 20000).
0.44/1.05	    % set(auto) -> set(auto_denials).
0.44/1.05	    % set(auto) -> set(auto_process).
0.44/1.05	    % set(auto2) -> assign(new_constants, 1).
0.44/1.05	    % set(auto2) -> assign(fold_denial_max, 3).
0.44/1.05	    % set(auto2) -> assign(max_weight, "200.000").
0.44/1.05	    % set(auto2) -> assign(max_hours, 1).
0.44/1.05	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.44/1.05	    % set(auto2) -> assign(max_seconds, 0).
0.44/1.05	    % set(auto2) -> assign(max_minutes, 5).
0.44/1.05	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.44/1.05	    % set(auto2) -> set(sort_initial_sos).
0.44/1.05	    % set(auto2) -> assign(sos_limit, -1).
0.44/1.05	    % set(auto2) -> assign(lrs_ticks, 3000).
0.44/1.05	    % set(auto2) -> assign(max_megs, 400).
0.44/1.05	    % set(auto2) -> assign(stats, some).
0.44/1.05	    % set(auto2) -> clear(echo_input).
0.44/1.05	    % set(auto2) -> set(quiet).
0.44/1.05	    % set(auto2) -> clear(print_initial_clauses).
0.44/1.05	    % set(auto2) -> clear(print_given).
0.44/1.05	assign(lrs_ticks,-1).
0.44/1.05	assign(sos_limit,10000).
0.44/1.05	assign(order,kbo).
0.44/1.05	set(lex_order_vars).
0.44/1.05	clear(print_given).
0.44/1.05	
0.44/1.05	% formulas(sos).  % not echoed (44 formulas)
0.44/1.05	
0.44/1.05	============================== end of input ==========================
0.44/1.05	
0.44/1.05	% From the command line: assign(max_seconds, 1440).
0.44/1.05	
0.44/1.05	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.44/1.05	
0.44/1.05	% Formulas that are not ordinary clauses:
0.44/1.05	1 (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.44/1.05	2 (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.44/1.05	3 (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.44/1.05	4 (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.44/1.05	5 (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.44/1.05	6 (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.44/1.05	7 (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.44/1.05	8 (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].
0.44/1.05	9 (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].
0.44/1.05	10 (all W0 (aSubsetOf0(W0,cS1395) -> (isClosed0(W0) <-> isOpen0(stldt0(W0))))) # label(mClosed) # label(definition) # label(non_clause).  [assumption].
0.44/1.05	11 (all W0 (aInteger0(W0) -> smndt0(W0) = sdtasdt0(W0,smndt0(sz10)) & sdtasdt0(smndt0(sz10),W0) = smndt0(W0))) # label(mMulMinOne) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	12 (all W0 (aInteger0(W0) -> sdtpldt0(W0,smndt0(W0)) = sz00 & sdtpldt0(smndt0(W0),W0) = sz00)) # label(mAddNeg) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	13 (all W0 (aSet0(W0) -> (isFinite0(W0) -> $T))) # label(mFinSet) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	14 (all W0 (aInteger0(W0) -> aInteger0(smndt0(W0)))) # label(mIntNeg) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	15 (all W0 (aInteger0(W0) -> W0 = sdtpldt0(sz00,W0) & W0 = sdtpldt0(W0,sz00))) # label(mAddZero) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	16 (all W0 (aInteger0(W0) -> $T)) # label(mIntegers) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	17 (all W0 all W1 all W2 (aInteger0(W0) & aInteger0(W1) & aInteger0(W2) & sz00 != W2 -> (sdteqdtlpzmzozddtrp0(W0,W1,W2) -> sdteqdtlpzmzozddtrp0(W1,W0,W2)))) # label(mEquModSym) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	18 (all W0 all W1 (sz00 != W1 & aInteger0(W1) & aInteger0(W0) -> sdteqdtlpzmzozddtrp0(W0,W0,W1))) # label(mEquModRef) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	19 (all W0 all W1 (aInteger0(W0) & aInteger0(W1) -> aInteger0(sdtasdt0(W0,W1)))) # label(mIntMult) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	20 (all W0 all W1 (aInteger0(W1) & aInteger0(W0) -> aInteger0(sdtpldt0(W0,W1)))) # label(mIntPlus) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	21 (all W0 (aInteger0(W0) -> ((exists W1 (aDivisorOf0(W1,W0) & isPrime0(W1))) <-> W0 != smndt0(sz10) & sz10 != W0))) # label(mPrimeDivisor) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	22 (all W0 (aInteger0(W0) -> sz00 = sdtasdt0(sz00,W0) & sdtasdt0(W0,sz00) = sz00)) # label(mMulZero) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	23 (all W0 all W1 (aInteger0(W0) & aInteger0(W1) -> sdtasdt0(W0,W1) = sdtasdt0(W1,W0))) # label(mMulComm) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	24 (all W0 all W1 (aSubsetOf0(W1,cS1395) & isClosed0(W0) & isClosed0(W1) & aSubsetOf0(W0,cS1395) -> isClosed0(sdtbsmnsldt0(W0,W1)))) # label(mUnionClosed) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	25 (all W0 all W1 all W2 (aInteger0(W0) & aInteger0(W1) & aInteger0(W2) -> sdtasdt0(W0,sdtpldt0(W1,W2)) = sdtpldt0(sdtasdt0(W0,W1),sdtasdt0(W0,W2)) & sdtpldt0(sdtasdt0(W0,W2),sdtasdt0(W1,W2)) = sdtasdt0(sdtpldt0(W0,W1),W2))) # label(mDistrib) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	26 (all W0 ((all W1 (aElementOf0(W1,W0) -> isClosed0(W1) & aSubsetOf0(W1,cS1395))) & isFinite0(W0) & aSet0(W0) -> isClosed0(sbsmnsldt0(W0)))) # label(mUnionSClosed) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	27 (all W0 all W1 (aInteger0(W1) & aInteger0(W0) -> sdtpldt0(W0,W1) = sdtpldt0(W1,W0))) # label(mAddComm) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	28 (all W0 (aSet0(W0) -> $T)) # label(mSets) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	29 (all W0 all W1 all W2 all W3 (aInteger0(W0) & sz00 != W2 & aInteger0(W3) & aInteger0(W2) & aInteger0(W1) -> (sdteqdtlpzmzozddtrp0(W1,W3,W2) & sdteqdtlpzmzozddtrp0(W0,W1,W2) -> sdteqdtlpzmzozddtrp0(W0,W3,W2)))) # label(mEquModTrn) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	30 (all W0 all W1 all W2 all W3 (aInteger0(W1) & aInteger0(W3) & W3 != sz00 & W2 != sz00 & aInteger0(W2) & aInteger0(W0) -> (sdteqdtlpzmzozddtrp0(W0,W1,sdtasdt0(W2,W3)) -> sdteqdtlpzmzozddtrp0(W0,W1,W2) & sdteqdtlpzmzozddtrp0(W0,W1,W3)))) # label(mEquModMul) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	31 (all W0 (aSet0(W0) -> (all W1 (aElementOf0(W1,W0) -> $T)))) # label(mElements) # label(axiom) # label(non_clause).  [assumption].
0.44/1.08	32 (all W0 all W1 (aSubsetOf0(W1,cS1395) & isOpen0(W0) & isOpen0(W1) & aSubsetOf0(W0,cS1395) -> isOpen0(sdtslmnbsdt0(W0,W1)))) # label(mInterOpen) # label(axiom) # label(non_clause).  [assumption].
0.44/1.08	33 (all W0 all W1 all W2 (aInteger0(W0) & aInteger0(W2) & aInteger0(W1) -> sdtpldt0(W0,sdtpldt0(W1,W2)) = sdtpldt0(sdtpldt0(W0,W1),W2))) # label(mAddAsso) # label(axiom) # label(non_clause).  [assumption].
0.44/1.08	34 (all W0 (aInteger0(W0) -> W0 = sdtasdt0(W0,sz10) & W0 = sdtasdt0(sz10,W0))) # label(mMulOne) # label(axiom) # label(non_clause).  [assumption].
0.44/1.08	35 (all W0 all W1 (aInteger0(W1) & aInteger0(W0) -> (sdtasdt0(W0,W1) = sz00 -> sz00 = W0 | W1 = sz00))) # label(mZeroDiv) # label(axiom) # label(non_clause).  [assumption].
0.44/1.08	36 (all W0 (aInteger0(W0) & sz00 != W0 -> (isPrime0(W0) -> $T))) # label(mPrime) # label(axiom) # label(non_clause).  [assumption].
0.44/1.08	37 (all W0 (aSet0(W0) & (all W1 (aElementOf0(W1,W0) -> isOpen0(W1) & aSubsetOf0(W1,cS1395))) -> isOpen0(sbsmnsldt0(W0)))) # label(mUnionOpen) # label(axiom) # label(non_clause).  [assumption].
0.44/1.08	38 (all W0 all W1 all W2 (aInteger0(W2) & aInteger0(W1) & aInteger0(W0) -> sdtasdt0(sdtasdt0(W0,W1),W2) = sdtasdt0(W0,sdtasdt0(W1,W2)))) # label(mMulAsso) # label(axiom) # label(non_clause).  [assumption].
0.44/1.08	39 -(((all W0 ((aElementOf0(W0,szAzrzSzezqlpdtcmdtrp0(xa,xq)) -> sdteqdtlpzmzozddtrp0(W0,xa,xq) & aDivisorOf0(xq,sdtpldt0(W0,smndt0(xa))) & (exists W1 (sdtasdt0(xq,W1) = sdtpldt0(W0,smndt0(xa)) & aInteger0(W1))) & aInteger0(W0)) & (aInteger0(W0) & ((exists W1 (aInteger0(W1) & sdtasdt0(xq,W1) = sdtpldt0(W0,smndt0(xa)))) | aDivisorOf0(xq,sdtpldt0(W0,smndt0(xa))) | sdteqdtlpzmzozddtrp0(W0,xa,xq)) -> aElementOf0(W0,szAzrzSzezqlpdtcmdtrp0(xa,xq))))) & aSet0(szAzrzSzezqlpdtcmdtrp0(xa,xq)) -> ((all W0 (aInteger0(W0) <-> aElementOf0(W0,cS1395))) & aSet0(cS1395) -> aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(xa,xq),cS1395) | (all W0 (aElementOf0(W0,szAzrzSzezqlpdtcmdtrp0(xa,xq)) -> aElementOf0(W0,cS1395))))) & ((all W0 ((aElementOf0(W0,szAzrzSzezqlpdtcmdtrp0(xa,xq)) -> aDivisorOf0(xq,sdtpldt0(W0,smndt0(xa))) & sdteqdtlpzmzozddtrp0(W0,xa,xq) & (exists W1 (sdtasdt0(xq,W1) = sdtpldt0(W0,smndt0(xa)) & aInteger0(W1))) & aInteger0(W0)) & ((sdteqdtlpzmzozddtrp0(W0,xa,xq) | aDivisorOf0(xq,sdtpldt0(W0,smndt0(xa))) | (exists W1 (sdtpldt0(W0,smndt0(xa)) = sdtasdt0(xq,W1) & aInteger0(W1)))) & aInteger0(W0) -> aElementOf0(W0,szAzrzSzezqlpdtcmdtrp0(xa,xq))))) -> (aSet0(stldt0(szAzrzSzezqlpdtcmdtrp0(xa,xq))) & (all W0 (aInteger0(W0) & -aElementOf0(W0,szAzrzSzezqlpdtcmdtrp0(xa,xq)) <-> aElementOf0(W0,stldt0(szAzrzSzezqlpdtcmdtrp0(xa,xq))))) -> (all W0 (aElementOf0(W0,stldt0(szAzrzSzezqlpdtcmdtrp0(xa,xq))) -> (exists W1 (aInteger0(W1) & ((all W2 ((aElementOf0(W2,szAzrzSzezqlpdtcmdtrp0(W0,W1)) -> aInteger0(W2) & aDivisorOf0(W1,sdtpldt0(W2,smndt0(W0))) & sdteqdtlpzmzozddtrp0(W2,W0,W1) & (exists W3 (aInteger0(W3) & sdtpldt0(W2,smndt0(W0)) = sdtasdt0(W1,W3)))) & (((exists W3 (sdtpldt0(W2,smndt0(W0)) = sdtasdt0(W1,W3) & aInteger0(W3))) | sdteqdtlpzmzozddtrp0(W2,W0,W1) | aDivisorOf0(W1,sdtpldt0(W2,smndt0(W0)))) & aInteger0(W2) -> aElementOf0(W2,szAzrzSzezqlpdtcmdtrp0(W0,W1))))) & aSet0(szAzrzSzezqlpdtcmdtrp0(W0,W1)) -> aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(W0,W1),stldt0(szAzrzSzezqlpdtcmdtrp0(xa,xq))) | (all W2 (aElementOf0(W2,szAzrzSzezqlpdtcmdtrp0(W0,W1)) -> aElementOf0(W2,stldt0(szAzrzSzezqlpdtcmdtrp0(xa,xq)))))) & sz00 != W1)))) | isOpen0(stldt0(szAzrzSzezqlpdtcmdtrp0(xa,xq)))) | isClosed0(szAzrzSzezqlpdtcmdtrp0(xa,xq)))) # label(m__) # label(negated_conjecture) # label(non_clause).  [assumption].
0.44/1.08	
0.44/1.08	============================== end of process non-clausal formulas ===
0.44/1.08	
0.44/1.08	============================== PROCESS INITIAL CLAUSES ===============
0.44/1.08	
0.44/1.08	============================== PREDICATE ELIMINATION =================
0.44/1.08	40 -aInteger0(A) | isPrime0(f13(A)) | smndt0(sz10) = A | sz10 = A # label(mPrimeDivisor) # label(axiom).  [clausify(21)].
0.44/1.08	41 -aInteger0(A) | -aDivisorOf0(B,A) | -isPrime0(B) | smndt0(sz10) != A # label(mPrimeDiAlarm clock 
179.72/180.02	Prover9 interrupted
179.72/180.03	EOF