0.03/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.12	% Command    : tptp2X_and_run_prover9 %d %s
0.12/0.33	% Computer   : n008.cluster.edu
0.12/0.33	% Model      : x86_64 x86_64
0.12/0.33	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.33	% Memory     : 8042.1875MB
0.12/0.33	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.33	% CPULimit   : 1200
0.12/0.33	% DateTime   : Tue Jul 13 16:26:44 EDT 2021
0.12/0.33	% CPUTime    : 
0.42/1.04	============================== Prover9 ===============================
0.42/1.04	Prover9 (32) version 2009-11A, November 2009.
0.42/1.04	Process 31360 was started by sandbox2 on n008.cluster.edu,
0.42/1.04	Tue Jul 13 16:26:45 2021
0.42/1.04	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1200 -f /tmp/Prover9_31206_n008.cluster.edu".
0.42/1.04	============================== end of head ===========================
0.42/1.04	
0.42/1.04	============================== INPUT =================================
0.42/1.04	
0.42/1.04	% Reading from file /tmp/Prover9_31206_n008.cluster.edu
0.42/1.04	
0.42/1.04	set(prolog_style_variables).
0.42/1.04	set(auto2).
0.42/1.04	    % set(auto2) -> set(auto).
0.42/1.04	    % set(auto) -> set(auto_inference).
0.42/1.04	    % set(auto) -> set(auto_setup).
0.42/1.04	    % set(auto_setup) -> set(predicate_elim).
0.42/1.04	    % set(auto_setup) -> assign(eq_defs, unfold).
0.42/1.04	    % set(auto) -> set(auto_limits).
0.42/1.04	    % set(auto_limits) -> assign(max_weight, "100.000").
0.42/1.04	    % set(auto_limits) -> assign(sos_limit, 20000).
0.42/1.04	    % set(auto) -> set(auto_denials).
0.42/1.04	    % set(auto) -> set(auto_process).
0.42/1.04	    % set(auto2) -> assign(new_constants, 1).
0.42/1.04	    % set(auto2) -> assign(fold_denial_max, 3).
0.42/1.04	    % set(auto2) -> assign(max_weight, "200.000").
0.42/1.04	    % set(auto2) -> assign(max_hours, 1).
0.42/1.04	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.42/1.04	    % set(auto2) -> assign(max_seconds, 0).
0.42/1.04	    % set(auto2) -> assign(max_minutes, 5).
0.42/1.04	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.42/1.04	    % set(auto2) -> set(sort_initial_sos).
0.42/1.04	    % set(auto2) -> assign(sos_limit, -1).
0.42/1.04	    % set(auto2) -> assign(lrs_ticks, 3000).
0.42/1.04	    % set(auto2) -> assign(max_megs, 400).
0.42/1.04	    % set(auto2) -> assign(stats, some).
0.42/1.04	    % set(auto2) -> clear(echo_input).
0.42/1.04	    % set(auto2) -> set(quiet).
0.42/1.04	    % set(auto2) -> clear(print_initial_clauses).
0.42/1.04	    % set(auto2) -> clear(print_given).
0.42/1.04	assign(lrs_ticks,-1).
0.42/1.04	assign(sos_limit,10000).
0.42/1.04	assign(order,kbo).
0.42/1.04	set(lex_order_vars).
0.42/1.04	clear(print_given).
0.42/1.04	
0.42/1.04	% formulas(sos).  % not echoed (39 formulas)
0.42/1.04	
0.42/1.04	============================== end of input ==========================
0.42/1.04	
0.42/1.04	% From the command line: assign(max_seconds, 1200).
0.42/1.04	
0.42/1.04	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.42/1.04	
0.42/1.04	% Formulas that are not ordinary clauses:
0.42/1.04	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.42/1.04	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.42/1.04	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.42/1.04	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.42/1.04	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.42/1.04	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.42/1.04	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.42/1.04	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.42/1.04	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.42/1.04	10 (all W0 (aSubsetOf0(W0,cS1395) -> (isClosed0(W0) <-> isOpen0(stldt0(W0))))) # label(mClosed) # label(definition) # label(non_clause).  [assumption].
0.42/1.04	11 (all W0 (aSet0(W0) -> (isFinite0(W0) -> $T))) # label(mFinSet) # label(axiom) # label(non_clause).  [assumption].
0.42/1.04	12 (all W0 all W1 (W1 != sz00 & aInteger0(W1) & aInteger0(W0) -> sdteqdtlpzmzozddtrp0(W0,W0,W1))) # label(mEquModRef) # label(axiom) # label(non_clause).  [assumption].
0.42/1.04	13 (all W0 (aInteger0(W0) -> (W0 != smndt0(sz10) & W0 != sz10 <-> (exists W1 (aDivisorOf0(W1,W0) & isPrime0(W1)))))) # label(mPrimeDivisor) # label(axiom) # label(non_clause).  [assumption].
0.42/1.04	14 (all W0 all W1 all W2 (aInteger0(W2) & sz00 != W2 & aInteger0(W1) & aInteger0(W0) -> (sdteqdtlpzmzozddtrp0(W0,W1,W2) -> sdteqdtlpzmzozddtrp0(W1,W0,W2)))) # label(mEquModSym) # label(axiom) # label(non_clause).  [assumption].
0.42/1.04	15 (all W0 (aElementOf0(W0,xS) -> aSet0(cS1395) & aSet0(W0) & aSubsetOf0(W0,cS1395) & (all W1 (aElementOf0(W1,W0) -> (exists W2 (aInteger0(W2) & W2 != sz00 & (all W3 ((aElementOf0(W3,szAzrzSzezqlpdtcmdtrp0(W1,W2)) -> sdteqdtlpzmzozddtrp0(W3,W1,W2) & aDivisorOf0(W2,sdtpldt0(W3,smndt0(W1))) & (exists W4 (aInteger0(W4) & sdtpldt0(W3,smndt0(W1)) = sdtasdt0(W2,W4))) & aInteger0(W3)) & ((aDivisorOf0(W2,sdtpldt0(W3,smndt0(W1))) | sdteqdtlpzmzozddtrp0(W3,W1,W2) | (exists W4 (aInteger0(W4) & sdtasdt0(W2,W4) = sdtpldt0(W3,smndt0(W1))))) & aInteger0(W3) -> aElementOf0(W3,szAzrzSzezqlpdtcmdtrp0(W1,W2))))) & (all W3 (aElementOf0(W3,szAzrzSzezqlpdtcmdtrp0(W1,W2)) -> aElementOf0(W3,W0))) & aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(W1,W2),W0) & aSet0(szAzrzSzezqlpdtcmdtrp0(W1,W2)))))) & isOpen0(W0) & (all W1 (aElementOf0(W1,W0) -> aElementOf0(W1,cS1395))) & (all W1 (aElementOf0(W1,cS1395) <-> aInteger0(W1))))) # label(m__1750_AndRHS) # label(hypothesis) # label(non_clause).  [assumption].
0.42/1.04	16 (all W0 all W1 all W2 all W3 (aInteger0(W0) & aInteger0(W2) & aInteger0(W3) & W2 != sz00 & aInteger0(W1) -> (sdteqdtlpzmzozddtrp0(W1,W3,W2) & sdteqdtlpzmzozddtrp0(W0,W1,W2) -> sdteqdtlpzmzozddtrp0(W0,W3,W2)))) # label(mEquModTrn) # label(axiom) # label(non_clause).  [assumption].
0.42/1.04	17 (all W0 (aInteger0(W0) -> sdtasdt0(sz10,W0) = W0 & sdtasdt0(W0,sz10) = W0)) # label(mMulOne) # label(axiom) # label(non_clause).  [assumption].
0.42/1.04	18 (all W0 (aSet0(W0) -> $T)) # label(mSets) # label(axiom) # label(non_clause).  [assumption].
0.42/1.04	19 (all W0 (aInteger0(W0) -> sz00 = sdtasdt0(W0,sz00) & sdtasdt0(sz00,W0) = sz00)) # label(mMulZero) # label(axiom) # label(non_clause).  [assumption].
0.42/1.04	20 (all W0 (aInteger0(W0) -> sz00 = sdtpldt0(smndt0(W0),W0) & sdtpldt0(W0,smndt0(W0)) = sz00)) # label(mAddNeg) # label(axiom) # label(non_clause).  [assumption].
0.42/1.04	21 (all W0 all W1 all W2 (aInteger0(W2) & aInteger0(W1) & aInteger0(W0) -> 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.42/1.04	22 (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.42/1.04	23 (all W0 all W1 (aInteger0(W0) & aInteger0(W1) -> sdtpldt0(W0,W1) = sdtpldt0(W1,W0))) # label(mAddComm) # label(axiom) # label(non_clause).  [assumption].
0.42/1.04	24 (all W0 all W1 (aInteger0(W0) & aInteger0(W1) -> aInteger0(sdtasdt0(W0,W1)))) # label(mIntMult) # label(axiom) # label(non_clause).  [assumption].
0.42/1.04	25 (all W0 all W1 all W2 (aInteger0(W1) & aInteger0(W2) & aInteger0(W0) -> sdtpldt0(sdtpldt0(W0,W1),W2) = sdtpldt0(W0,sdtpldt0(W1,W2)))) # label(mAddAsso) # label(axiom) # label(non_clause).  [assumption].
0.42/1.04	26 (all W0 (W0 != sz00 & aInteger0(W0) -> (isPrime0(W0) -> $T))) # label(mPrime) # label(axiom) # label(non_clause).  [assumption].
0.76/1.07	27 (all W0 all W1 (aInteger0(W1) & aInteger0(W0) -> sdtasdt0(W0,W1) = sdtasdt0(W1,W0))) # label(mMulComm) # label(axiom) # label(non_clause).  [assumption].
0.76/1.07	28 (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.76/1.07	29 (all W0 all W1 all W2 all W3 (sz00 != W2 & aInteger0(W3) & W3 != sz00 & aInteger0(W2) & aInteger0(W1) & aInteger0(W0) -> (sdteqdtlpzmzozddtrp0(W0,W1,sdtasdt0(W2,W3)) -> sdteqdtlpzmzozddtrp0(W0,W1,W3) & sdteqdtlpzmzozddtrp0(W0,W1,W2)))) # label(mEquModMul) # label(axiom) # label(non_clause).  [assumption].
0.76/1.07	30 (all W0 all W1 (aInteger0(W1) & aInteger0(W0) -> aInteger0(sdtpldt0(W0,W1)))) # label(mIntPlus) # label(axiom) # label(non_clause).  [assumption].
0.76/1.07	31 (all W0 (aInteger0(W0) -> sdtpldt0(sz00,W0) = W0 & sdtpldt0(W0,sz00) = W0)) # label(mAddZero) # label(axiom) # label(non_clause).  [assumption].
0.76/1.07	32 (all W0 (aInteger0(W0) -> $T)) # label(mIntegers) # label(axiom) # label(non_clause).  [assumption].
0.76/1.07	33 (all W0 all W1 (aInteger0(W1) & aInteger0(W0) -> (sdtasdt0(W0,W1) = sz00 -> sz00 = W1 | sz00 = W0))) # label(mZeroDiv) # label(axiom) # label(non_clause).  [assumption].
0.76/1.07	34 (all W0 (aSet0(W0) -> (all W1 (aElementOf0(W1,W0) -> $T)))) # label(mElements) # label(axiom) # label(non_clause).  [assumption].
0.76/1.07	35 (all W0 (aInteger0(W0) -> aInteger0(smndt0(W0)))) # label(mIntNeg) # label(axiom) # label(non_clause).  [assumption].
0.76/1.07	36 -((all W0 (aInteger0(W0) & (exists W1 (aElementOf0(W1,xS) & aElementOf0(W0,W1))) <-> aElementOf0(W0,sbsmnsldt0(xS)))) & aSet0(sbsmnsldt0(xS)) -> (all W0 (aElementOf0(W0,sbsmnsldt0(xS)) -> (exists W1 (W1 != sz00 & (aSet0(szAzrzSzezqlpdtcmdtrp0(W0,W1)) & (all W2 ((aElementOf0(W2,szAzrzSzezqlpdtcmdtrp0(W0,W1)) -> aInteger0(W2) & (exists W3 (sdtasdt0(W1,W3) = sdtpldt0(W2,smndt0(W0)) & aInteger0(W3))) & aDivisorOf0(W1,sdtpldt0(W2,smndt0(W0))) & sdteqdtlpzmzozddtrp0(W2,W0,W1)) & (((exists W3 (sdtpldt0(W2,smndt0(W0)) = sdtasdt0(W1,W3) & aInteger0(W3))) | aDivisorOf0(W1,sdtpldt0(W2,smndt0(W0))) | sdteqdtlpzmzozddtrp0(W2,W0,W1)) & aInteger0(W2) -> aElementOf0(W2,szAzrzSzezqlpdtcmdtrp0(W0,W1))))) -> aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(W0,W1),sbsmnsldt0(xS)) | (all W2 (aElementOf0(W2,szAzrzSzezqlpdtcmdtrp0(W0,W1)) -> aElementOf0(W2,sbsmnsldt0(xS))))) & aInteger0(W1))))) | isOpen0(sbsmnsldt0(xS))) # label(m__) # label(negated_conjecture) # label(non_clause).  [assumption].
0.76/1.07	
0.76/1.07	============================== end of process non-clausal formulas ===
0.76/1.07	
0.76/1.07	============================== PROCESS INITIAL CLAUSES ===============
0.76/1.07	
0.76/1.07	============================== PREDICATE ELIMINATION =================
0.76/1.07	37 -aSubsetOf0(A,cS1395) | isClosed0(A) | -isOpen0(stldt0(A)) # label(mClosed) # label(definition).  [clausify(10)].
0.76/1.07	38 -aSubsetOf0(A,cS1395) | -isClosed0(A) | isOpen0(stldt0(A)) # label(mClosed) # label(definition).  [clausify(10)].
0.76/1.07	39 -aInteger0(A) | smndt0(sz10) != A | -aDivisorOf0(B,A) | -isPrime0(B) # label(mPrimeDivisor) # label(axiom).  [clausify(13)].
0.76/1.07	40 -aInteger0(A) | smndt0(sz10) = A | sz10 = A | isPrime0(f13(A)) # label(mPrimeDivisor) # label(axiom).  [clausify(13)].
0.76/1.07	Derived: -aInteger0(A) | smndt0(sz10) != A | -aDivisorOf0(f13(B),A) | -aInteger0(B) | smndt0(sz10) = B | sz10 = B.  [resolve(39,d,40,d)].
0.76/1.07	41 -aInteger0(A) | sz10 != A | -aDivisorOf0(B,A) | -isPrime0(B) # label(mPrimeDivisor) # label(axiom).  [clausify(13)].
0.76/1.07	Derived: -aInteger0(A) | sz10 != A | -aDivisorOf0(f13(B),A) | -aInteger0(B) | smndt0(sz10) = B | sz10 = B.  [resolve(41,d,40,d)].
0.76/1.07	
0.76/1.07	============================== end predicate elimination =============
0.76/1.07	
0.76/1.07	Auto_denials:  (non-Horn, no changes).
0.76/1.07	
0.76/1.07	Term ordering decisions:
0.76/1.07	Function symbol KB weights:  cS1395=1. sz00=1. xS=1. sz10=1. c1=1. szAzrzSzezqlpdtcmdtrp0=1. sdtasdt0=1. sdtpldt0=1. sdtbsmnsldt0=1. sdtslmnbsdt0=1. f1=1. f2=1. f7=1. f8=1. f9=1. f11=1. f14=1. f17=1. sbsmnsldt0=1. smndt0=1. stldt0=1. f5=1. f12=1. f13=1. f16=1. f18=1. f3=1. f4=1. f6=1. f10=1. f15=1.
0.76/1.07	
0.76/1.07	============================== end of process initial clauses ========
20.95/21.22	
20.95/21.22	============================== CLAUSES FOR SEARCH ====================
20.95/21.22	
20.95/21.22	============================== end of clauses for search =============
20.95/21.22	
20.95/21.22	============================== SEARCH ================================
20.95/21.22	
20.95/21.22	% Starting search at 0.05 seconds.
20.95/21.22	
20.95/21.22	Low Water (keep): wt=34.000, iters=3997
20.95/21.22	
20.95/21.22	Low Water (keep): wt=31.000, iters=3892
20.95/21.22	
20.95/21.22	Low Water (keep): wt=25.000, iters=3391
20.95/21.22	
20.95/21.22	Low Water (keep): wt=24.000, iters=3393
20.95/21.22	
20.95/21.22	Low Water (keep): wt=23.000, iters=3353
20.95/21.22	
20.95/21.22	Low Water (keep): wt=21.000, iters=3631
20.95/21.22	
20.95/21.22	Low Water (keep): wt=20.000, iters=3471
20.95/21.22	
20.95/21.22	Low Water (keep): wt=19.000, iters=3352
20.95/21.22	
20.95/21.22	Low Water (keep): wt=18.000, iters=3515
20.95/21.22	
20.95/21.22	Low Water (keep): wt=17.000, iters=3571
20.95/21.22	
20.95/21.22	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 55 (0.00 of 0.82 sec).
20.95/21.22	
20.95/21.22	Low Water (displace): id=6285, wt=57.000
20.95/21.22	
20.95/21.22	Low Water (displace): id=3618, wt=48.000
20.95/21.22	
20.95/21.22	Low Water (displace): id=6284, wt=47.000
20.95/21.22	
20.95/21.22	Low Water (displace): id=6428, wt=43.000
20.95/21.22	
20.95/21.22	Low Water (displace): id=2247, wt=42.000
20.95/21.22	
20.95/21.22	Low Water (displace): id=6381, wt=41.000
20.95/21.22	
20.95/21.22	Low Water (displace): id=6430, wt=40.000
20.95/21.22	
20.95/21.22	Low Water (keep): wt=16.000, iters=5443
20.95/21.22	
20.95/21.22	Low Water (keep): wt=15.000, iters=5016
20.95/21.22	
20.95/21.22	Low Water (keep): wt=14.000, iters=3929
20.95/21.22	
20.95/21.22	Low Water (keep): wt=13.000, iters=3673
20.95/21.22	
20.95/21.22	Low Water (keep): wt=12.000, iters=3430
20.95/21.22	
20.95/21.22	Low Water (keep): wt=11.000, iters=3346
20.95/21.22	
20.95/21.22	Low Water (displace): id=6429, wt=39.000
20.95/21.22	
20.95/21.22	Low Water (displace): id=6436, wt=38.000
20.95/21.22	
20.95/21.22	Low Water (displace): id=6426, wt=37.000
20.95/21.22	
20.95/21.22	Low Water (displace): id=4809, wt=36.000
20.95/21.22	
20.95/21.22	Low Water (displace): id=6598, wt=35.000
20.95/21.22	
20.95/21.22	Low Water (displace): id=6571, wt=34.000
20.95/21.22	
20.95/21.22	Low Water (displace): id=6565, wt=33.000
20.95/21.22	
20.95/21.22	Low Water (displace): id=15311, wt=9.000
20.95/21.22	
20.95/21.22	Low Water (displace): id=15431, wt=8.000
20.95/21.22	
20.95/21.22	Low Water (keep): wt=10.000, iters=3342
20.95/21.22	
20.95/21.22	============================== PROOF =================================
20.95/21.22	% SZS status Theorem
20.95/21.22	% SZS output start Refutation
20.95/21.22	
20.95/21.22	% Proof 1 at 19.04 (+ 1.17) seconds.
20.95/21.22	% Length of proof is 22.
20.95/21.22	% Level of proof is 7.
20.95/21.22	% Maximum clause weight is 16.000.
20.95/21.22	% Given clauses 4453.
20.95/21.22	
20.95/21.22	15 (all W0 (aElementOf0(W0,xS) -> aSet0(cS1395) & aSet0(W0) & aSubsetOf0(W0,cS1395) & (all W1 (aElementOf0(W1,W0) -> (exists W2 (aInteger0(W2) & W2 != sz00 & (all W3 ((aElementOf0(W3,szAzrzSzezqlpdtcmdtrp0(W1,W2)) -> sdteqdtlpzmzozddtrp0(W3,W1,W2) & aDivisorOf0(W2,sdtpldt0(W3,smndt0(W1))) & (exists W4 (aInteger0(W4) & sdtpldt0(W3,smndt0(W1)) = sdtasdt0(W2,W4))) & aInteger0(W3)) & ((aDivisorOf0(W2,sdtpldt0(W3,smndt0(W1))) | sdteqdtlpzmzozddtrp0(W3,W1,W2) | (exists W4 (aInteger0(W4) & sdtasdt0(W2,W4) = sdtpldt0(W3,smndt0(W1))))) & aInteger0(W3) -> aElementOf0(W3,szAzrzSzezqlpdtcmdtrp0(W1,W2))))) & (all W3 (aElementOf0(W3,szAzrzSzezqlpdtcmdtrp0(W1,W2)) -> aElementOf0(W3,W0))) & aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(W1,W2),W0) & aSet0(szAzrzSzezqlpdtcmdtrp0(W1,W2)))))) & isOpen0(W0) & (all W1 (aElementOf0(W1,W0) -> aElementOf0(W1,cS1395))) & (all W1 (aElementOf0(W1,cS1395) <-> aInteger0(W1))))) # label(m__1750_AndRHS) # label(hypothesis) # label(non_clause).  [assumption].
20.95/21.22	36 -((all W0 (aInteger0(W0) & (exists W1 (aElementOf0(W1,xS) & aElementOf0(W0,W1))) <-> aElementOf0(W0,sbsmnsldt0(xS)))) & aSet0(sbsmnsldt0(xS)) -> (all W0 (aElementOf0(W0,sbsmnsldt0(xS)) -> (exists W1 (W1 != sz00 & (aSet0(szAzrzSzezqlpdtcmdtrp0(W0,W1)) & (all W2 ((aElementOf0(W2,szAzrzSzezqlpdtcmdtrp0(W0,W1)) -> aInteger0(W2) & (exists W3 (sdtasdt0(W1,W3) = sdtpldt0(W2,smndt0(W0)) & aInteger0(W3))) & aDivisorOf0(W1,sdtpldt0(W2,smndt0(W0))) & sdteqdtlpzmzozddtrp0(W2,W0,W1)) & (((exists W3 (sdtpldt0(W2,smndt0(W0)) = sdtasdt0(W1,W3) & aInteger0(W3))) | aDivisorOf0(W1,sdtpldt0(W2,smndt0(W0))) | sdteqdtlpzmzozddtrp0(W2,W0,W1)) & aInteger0(W2) -> aElementOf0(W2,szAzrzSzezqlpdtcmdtrp0(W0,W1))))) -> aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(W0,W1),sbsmnsldt0(xS)) | (all W2 (aElementOf0(W2,szAzrzSzezqlpdtcmdtrp0(W0,W1)) -> aElementOf0(W2,sbsmnsldt0(xS))))) & aInteger0(W1))))) | isOpen0(sbsmnsldt0(xS))) # label(m__) # label(negated_conjecture) # label(non_clause).  [assumption].
20.95/21.22	119 -aElementOf0(A,xS) | -aElementOf0(B,A) | aInteger0(f14(A,B)) # label(m__1750_AndRHS) # label(hypothesis).  [clausify(15)].
20.95/21.22	120 -aElementOf0(A,xS) | -aElementOf0(B,A) | f14(A,B) != sz00 # label(m__1750_AndRHS) # label(hypothesis).  [clausify(15)].
20.95/21.22	130 -aElementOf0(A,xS) | -aElementOf0(B,A) | -aElementOf0(C,szAzrzSzezqlpdtcmdtrp0(B,f14(A,B))) | aElementOf0(C,A) # label(m__1750_AndRHS) # label(hypothesis).  [clausify(15)].
20.95/21.22	167 -aInteger0(A) | -aElementOf0(B,xS) | -aElementOf0(A,B) | aElementOf0(A,sbsmnsldt0(xS)) # label(m__) # label(negated_conjecture).  [clausify(36)].
20.95/21.22	169 aElementOf0(f16(A),xS) | -aElementOf0(A,sbsmnsldt0(xS)) # label(m__) # label(negated_conjecture).  [clausify(36)].
20.95/21.22	170 aElementOf0(A,f16(A)) | -aElementOf0(A,sbsmnsldt0(xS)) # label(m__) # label(negated_conjecture).  [clausify(36)].
20.95/21.22	172 aElementOf0(c1,sbsmnsldt0(xS)) # label(m__) # label(negated_conjecture).  [clausify(36)].
20.95/21.22	174 sz00 = A | -aElementOf0(B,szAzrzSzezqlpdtcmdtrp0(c1,A)) | aInteger0(B) | -aInteger0(A) # label(m__) # label(negated_conjecture).  [clausify(36)].
20.95/21.22	184 sz00 = A | aElementOf0(f18(A),szAzrzSzezqlpdtcmdtrp0(c1,A)) | -aInteger0(A) # label(m__) # label(negated_conjecture).  [clausify(36)].
20.95/21.22	185 sz00 = A | -aElementOf0(f18(A),sbsmnsldt0(xS)) | -aInteger0(A) # label(m__) # label(negated_conjecture).  [clausify(36)].
20.95/21.22	440 aElementOf0(c1,f16(c1)).  [resolve(172,a,170,b)].
20.95/21.22	441 aElementOf0(f16(c1),xS).  [resolve(172,a,169,b)].
20.95/21.22	890 f14(f16(c1),c1) != sz00.  [resolve(440,a,120,b),unit_del(a,441)].
20.95/21.22	891 aInteger0(f14(f16(c1),c1)).  [resolve(440,a,119,b),unit_del(a,441)].
20.95/21.22	916 -aInteger0(A) | -aElementOf0(A,f16(c1)) | aElementOf0(A,sbsmnsldt0(xS)).  [resolve(441,a,167,b)].
20.95/21.22	1620 aElementOf0(f18(f14(f16(c1),c1)),szAzrzSzezqlpdtcmdtrp0(c1,f14(f16(c1),c1))).  [resolve(891,a,184,c),flip(a),unit_del(a,890)].
20.95/21.22	58255 aInteger0(f18(f14(f16(c1),c1))).  [resolve(1620,a,174,b),flip(a),unit_del(a,890),unit_del(c,891)].
20.95/21.22	58256 aElementOf0(f18(f14(f16(c1),c1)),f16(c1)).  [resolve(1620,a,130,c),unit_del(a,441),unit_del(b,440)].
20.95/21.22	58381 aElementOf0(f18(f14(f16(c1),c1)),sbsmnsldt0(xS)).  [resolve(58256,a,916,b),unit_del(a,58255)].
20.95/21.22	58543 $F.  [resolve(58381,a,185,b),flip(a),unit_del(a,890),unit_del(b,891)].
20.95/21.22	
20.95/21.22	% SZS output end Refutation
20.95/21.22	============================== end of proof ==========================
20.95/21.22	
20.95/21.22	============================== STATISTICS ============================
20.95/21.22	
20.95/21.22	Given=4453. Generated=2058536. Kept=58490. proofs=1.
20.95/21.22	Usable=4142. Sos=9997. Demods=1465. Limbo=0, Disabled=44492. Hints=0.
20.95/21.22	Megabytes=32.79.
20.95/21.22	User_CPU=19.04, System_CPU=1.17, Wall_clock=20.
20.95/21.22	
20.95/21.22	============================== end of statistics =====================
20.95/21.22	
20.95/21.22	============================== end of search =========================
20.95/21.22	
20.95/21.22	THEOREM PROVED
20.95/21.22	% SZS status Theorem
20.95/21.22	
20.95/21.22	Exiting with 1 proof.
20.95/21.22	
20.95/21.22	Process 31360 exit (max_proofs) Tue Jul 13 16:27:05 2021
20.95/21.23	Prover9 interrupted
20.95/21.23	EOF