0.11/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/0.12	% Command    : tptp2X_and_run_prover9 %d %s
0.12/0.33	% Computer   : n013.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:35:48 EDT 2021
0.12/0.33	% CPUTime    : 
0.45/1.04	============================== Prover9 ===============================
0.45/1.04	Prover9 (32) version 2009-11A, November 2009.
0.45/1.04	Process 10411 was started by sandbox2 on n013.cluster.edu,
0.45/1.04	Tue Jul 13 16:35:49 2021
0.45/1.04	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1200 -f /tmp/Prover9_10142_n013.cluster.edu".
0.45/1.04	============================== end of head ===========================
0.45/1.04	
0.45/1.04	============================== INPUT =================================
0.45/1.04	
0.45/1.04	% Reading from file /tmp/Prover9_10142_n013.cluster.edu
0.45/1.04	
0.45/1.04	set(prolog_style_variables).
0.45/1.04	set(auto2).
0.45/1.04	    % set(auto2) -> set(auto).
0.45/1.04	    % set(auto) -> set(auto_inference).
0.45/1.04	    % set(auto) -> set(auto_setup).
0.45/1.04	    % set(auto_setup) -> set(predicate_elim).
0.45/1.04	    % set(auto_setup) -> assign(eq_defs, unfold).
0.45/1.04	    % set(auto) -> set(auto_limits).
0.45/1.04	    % set(auto_limits) -> assign(max_weight, "100.000").
0.45/1.04	    % set(auto_limits) -> assign(sos_limit, 20000).
0.45/1.04	    % set(auto) -> set(auto_denials).
0.45/1.04	    % set(auto) -> set(auto_process).
0.45/1.04	    % set(auto2) -> assign(new_constants, 1).
0.45/1.04	    % set(auto2) -> assign(fold_denial_max, 3).
0.45/1.04	    % set(auto2) -> assign(max_weight, "200.000").
0.45/1.04	    % set(auto2) -> assign(max_hours, 1).
0.45/1.04	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.45/1.04	    % set(auto2) -> assign(max_seconds, 0).
0.45/1.04	    % set(auto2) -> assign(max_minutes, 5).
0.45/1.04	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.45/1.04	    % set(auto2) -> set(sort_initial_sos).
0.45/1.04	    % set(auto2) -> assign(sos_limit, -1).
0.45/1.04	    % set(auto2) -> assign(lrs_ticks, 3000).
0.45/1.04	    % set(auto2) -> assign(max_megs, 400).
0.45/1.04	    % set(auto2) -> assign(stats, some).
0.45/1.04	    % set(auto2) -> clear(echo_input).
0.45/1.04	    % set(auto2) -> set(quiet).
0.45/1.04	    % set(auto2) -> clear(print_initial_clauses).
0.45/1.04	    % set(auto2) -> clear(print_given).
0.45/1.04	assign(lrs_ticks,-1).
0.45/1.04	assign(sos_limit,10000).
0.45/1.04	assign(order,kbo).
0.45/1.04	set(lex_order_vars).
0.45/1.04	clear(print_given).
0.45/1.04	
0.45/1.04	% formulas(sos).  % not echoed (12 formulas)
0.45/1.04	
0.45/1.04	============================== end of input ==========================
0.45/1.04	
0.45/1.04	% From the command line: assign(max_seconds, 1200).
0.45/1.04	
0.45/1.04	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.45/1.04	
0.45/1.04	% Formulas that are not ordinary clauses:
0.45/1.04	1 (all X3 all X10 ((all Y12 ((all Y13 (-r2(X3,Y13) | Y13 != Y12)) | -r2(X10,Y12))) | X10 = X3)) # label(axiom_3a) # label(axiom) # label(non_clause).  [assumption].
0.45/1.04	2 (all X4 exists Y9 (X4 = Y9 & (exists Y16 (r3(X4,Y16,Y9) & r1(Y16))))) # label(axiom_4a) # label(axiom) # label(non_clause).  [assumption].
0.45/1.04	3 (all X16 all X17 exists Y23 all X18 (Y23 = X18 & r4(X16,X17,X18) | X18 != Y23 & -r4(X16,X17,X18))) # label(axiom_4) # label(axiom) # label(non_clause).  [assumption].
0.45/1.04	4 (all X13 all X14 exists Y22 all X15 (Y22 = X15 & r3(X13,X14,X15) | X15 != Y22 & -r3(X13,X14,X15))) # label(axiom_3) # label(axiom) # label(non_clause).  [assumption].
0.45/1.04	5 (all X5 exists Y8 ((exists Y18 (r1(Y18) & Y8 = Y18)) & (exists Y17 (r4(X5,Y17,Y8) & r1(Y17))))) # label(axiom_5a) # label(axiom) # label(non_clause).  [assumption].
0.45/1.04	6 (all X1 all X8 exists Y4 ((exists Y7 (r3(X1,X8,Y7) & r2(Y7,Y4))) & (exists Y5 (Y4 = Y5 & (exists Y15 (r3(X1,Y15,Y5) & r2(X8,Y15))))))) # label(axiom_1a) # label(axiom) # label(non_clause).  [assumption].
0.45/1.04	7 (exists Y24 all X19 (r1(X19) & Y24 = X19 | X19 != Y24 & -r1(X19))) # label(axiom_1) # label(axiom) # label(non_clause).  [assumption].
0.45/1.04	8 (all X2 all X9 exists Y2 ((exists Y6 (r4(X2,X9,Y6) & r3(Y6,X2,Y2))) & (exists Y3 ((exists Y14 (r4(X2,Y14,Y3) & r2(X9,Y14))) & Y3 = Y2)))) # label(axiom_2a) # label(axiom) # label(non_clause).  [assumption].
0.45/1.04	9 (all X6 ((exists Y1 exists Y11 (X6 = Y11 & r2(Y1,Y11))) | (exists Y19 (r1(Y19) & Y19 = X6)))) # label(axiom_6a) # label(axiom) # label(non_clause).  [assumption].
0.45/1.04	10 (all X7 all Y10 (-r2(X7,Y10) | (all Y20 (-r1(Y20) | Y10 != Y20)))) # label(axiom_7a) # label(axiom) # label(non_clause).  [assumption].
0.45/1.04	11 (all X11 exists Y21 all X12 (Y21 != X12 & -r2(X11,X12) | r2(X11,X12) & X12 = Y21)) # label(axiom_2) # label(axiom) # label(non_clause).  [assumption].
0.45/1.04	12 -(exists Y1 ((all Y4 (Y1 != Y4 | -r1(Y4))) & (all Y2 ((all Y3 (-r2(Y3,Y2) | -r1(Y3))) | Y2 != Y1)))) # label(nonzerosnononesexist) # label(negated_conjecture) # label(non_clause).  [assumption].
0.77/1.08	
0.77/1.08	============================== end of process non-clausal formulas ===
0.77/1.08	
0.77/1.08	============================== PROCESS INITIAL CLAUSES ===============
0.77/1.08	
0.77/1.08	============================== PREDICATE ELIMINATION =================
0.77/1.08	13 A = f4(B,C) | -r3(B,C,A) # label(axiom_3) # label(axiom).  [clausify(4)].
0.77/1.08	14 r3(A,f2(A),f1(A)) # label(axiom_4a) # label(axiom).  [clausify(2)].
0.77/1.08	15 r3(A,B,f9(A,B)) # label(axiom_1a) # label(axiom).  [clausify(6)].
0.77/1.08	16 r3(A,f11(A,B),f10(A,B)) # label(axiom_1a) # label(axiom).  [clausify(6)].
0.77/1.08	17 r3(f13(A,B),A,f12(A,B)) # label(axiom_2a) # label(axiom).  [clausify(8)].
0.77/1.08	Derived: f1(A) = f4(A,f2(A)).  [resolve(13,b,14,a)].
0.77/1.08	Derived: f9(A,B) = f4(A,B).  [resolve(13,b,15,a)].
0.77/1.08	Derived: f10(A,B) = f4(A,f11(A,B)).  [resolve(13,b,16,a)].
0.77/1.08	Derived: f12(A,B) = f4(f13(A,B),A).  [resolve(13,b,17,a)].
0.77/1.08	18 r3(A,B,C) | C != f4(A,B) # label(axiom_3) # label(axiom).  [clausify(4)].
0.77/1.08	19 A = f3(B,C) | -r4(B,C,A) # label(axiom_4) # label(axiom).  [clausify(3)].
0.77/1.08	20 r4(A,f7(A),f5(A)) # label(axiom_5a) # label(axiom).  [clausify(5)].
0.77/1.08	21 r4(A,B,f13(A,B)) # label(axiom_2a) # label(axiom).  [clausify(8)].
0.77/1.08	22 r4(A,f15(A,B),f14(A,B)) # label(axiom_2a) # label(axiom).  [clausify(8)].
0.77/1.08	Derived: f5(A) = f3(A,f7(A)).  [resolve(19,b,20,a)].
0.77/1.08	Derived: f13(A,B) = f3(A,B).  [resolve(19,b,21,a)].
0.77/1.08	Derived: f14(A,B) = f3(A,f15(A,B)).  [resolve(19,b,22,a)].
0.77/1.08	23 r4(A,B,C) | C != f3(A,B) # label(axiom_4) # label(axiom).  [clausify(3)].
0.77/1.08	
0.77/1.08	============================== end predicate elimination =============
0.77/1.08	
0.77/1.08	Auto_denials:  (non-Horn, no changes).
0.77/1.08	
0.77/1.08	Term ordering decisions:
0.77/1.08	Function symbol KB weights:  c1=1. f3=1. f4=1. f8=1. f9=1. f10=1. f11=1. f12=1. f13=1. f14=1. f15=1. f1=1. f2=1. f5=1. f6=1. f7=1. f16=1. f17=1. f18=1. f19=1. f20=1. f21=1. f22=1.
0.77/1.08	
0.77/1.08	============================== end of process initial clauses ========
0.77/1.08	
0.77/1.08	============================== CLAUSES FOR SEARCH ====================
0.77/1.08	
0.77/1.08	============================== end of clauses for search =============
0.77/1.08	
0.77/1.08	============================== SEARCH ================================
0.77/1.08	
0.77/1.08	% Starting search at 0.01 seconds.
0.77/1.08	
0.77/1.08	============================== PROOF =================================
0.77/1.08	% SZS status Theorem
0.77/1.08	% SZS output start Refutation
0.77/1.08	
0.77/1.08	% Proof 1 at 0.05 (+ 0.01) seconds.
0.77/1.08	% Length of proof is 48.
0.77/1.08	% Level of proof is 9.
0.77/1.08	% Maximum clause weight is 12.000.
0.77/1.08	% Given clauses 120.
0.77/1.08	
0.77/1.08	1 (all X3 all X10 ((all Y12 ((all Y13 (-r2(X3,Y13) | Y13 != Y12)) | -r2(X10,Y12))) | X10 = X3)) # label(axiom_3a) # label(axiom) # label(non_clause).  [assumption].
0.77/1.08	2 (all X4 exists Y9 (X4 = Y9 & (exists Y16 (r3(X4,Y16,Y9) & r1(Y16))))) # label(axiom_4a) # label(axiom) # label(non_clause).  [assumption].
0.77/1.08	5 (all X5 exists Y8 ((exists Y18 (r1(Y18) & Y8 = Y18)) & (exists Y17 (r4(X5,Y17,Y8) & r1(Y17))))) # label(axiom_5a) # label(axiom) # label(non_clause).  [assumption].
0.77/1.08	7 (exists Y24 all X19 (r1(X19) & Y24 = X19 | X19 != Y24 & -r1(X19))) # label(axiom_1) # label(axiom) # label(non_clause).  [assumption].
0.77/1.08	8 (all X2 all X9 exists Y2 ((exists Y6 (r4(X2,X9,Y6) & r3(Y6,X2,Y2))) & (exists Y3 ((exists Y14 (r4(X2,Y14,Y3) & r2(X9,Y14))) & Y3 = Y2)))) # label(axiom_2a) # label(axiom) # label(non_clause).  [assumption].
0.77/1.08	10 (all X7 all Y10 (-r2(X7,Y10) | (all Y20 (-r1(Y20) | Y10 != Y20)))) # label(axiom_7a) # label(axiom) # label(non_clause).  [assumption].
0.77/1.08	11 (all X11 exists Y21 all X12 (Y21 != X12 & -r2(X11,X12) | r2(X11,X12) & X12 = Y21)) # label(axiom_2) # label(axiom) # label(non_clause).  [assumption].
0.77/1.08	12 -(exists Y1 ((all Y4 (Y1 != Y4 | -r1(Y4))) & (all Y2 ((all Y3 (-r2(Y3,Y2) | -r1(Y3))) | Y2 != Y1)))) # label(nonzerosnononesexist) # label(negated_conjecture) # label(non_clause).  [assumption].
0.77/1.08	26 r1(f7(A)) # label(axiom_5a) # label(axiom).  [clausify(5)].
0.77/1.08	27 f1(A) = A # label(axiom_4a) # label(axiom).  [clausify(2)].
0.77/1.08	30 r2(A,f15(B,A)) # label(axiom_2a) # label(axiom).  [clausify(8)].
0.77/1.08	31 r1(f20(A)) | r1(f22(A)) # label(nonzerosnononesexist) # label(negated_conjecture).  [clausify(12)].
0.77/1.08	36 A = f20(A) | r1(f22(A)) # label(nonzerosnononesexist) # label(negated_conjecture).  [clausify(12)].
0.77/1.08	37 f20(A) = A | r1(f22(A)).  [copy(36),flip(a)].
0.77/1.08	38 r1(f20(A)) | A = f21(A) # label(nonzerosnononesexist) # label(negated_conjecture).  [clausify(12)].
0.77/1.08	39 r1(f20(A)) | f21(A) = A.  [copy(38),flip(b)].
0.77/1.08	42 A = f20(A) | A = f21(A) # label(nonzerosnononesexist) # label(negated_conjecture).  [clausify(12)].
0.77/1.08	43 f20(A) = A | f21(A) = A.  [copy(42),flip(a),flip(b)].
0.77/1.08	44 r1(f20(A)) | r2(f22(A),f21(A)) # label(nonzerosnononesexist) # label(negated_conjecture).  [clausify(12)].
0.77/1.08	46 A = f20(A) | r2(f22(A),f21(A)) # label(nonzerosnononesexist) # label(negated_conjecture).  [clausify(12)].
0.77/1.08	47 f20(A) = A | r2(f22(A),f21(A)).  [copy(46),flip(a)].
0.77/1.08	48 -r2(A,B) | -r1(C) | C != B # label(axiom_7a) # label(axiom).  [clausify(10)].
0.77/1.08	51 A = c1 | -r1(A) # label(axiom_1) # label(axiom).  [clausify(7)].
0.77/1.08	52 c1 = A | -r1(A).  [copy(51),flip(a)].
0.77/1.08	53 A != f19(B) | r2(B,A) # label(axiom_2) # label(axiom).  [clausify(11)].
0.77/1.08	54 f19(A) != B | r2(A,B).  [copy(53),flip(a)].
0.77/1.08	55 -r2(A,B) | B = f19(A) # label(axiom_2) # label(axiom).  [clausify(11)].
0.77/1.08	56 -r2(A,B) | f19(A) = B.  [copy(55),flip(b)].
0.77/1.08	57 -r2(A,B) | B != C | -r2(D,C) | D = A # label(axiom_3a) # label(axiom).  [clausify(1)].
0.77/1.08	75 f20(A) = A | r2(f22(A),A).  [para(43(b,1),47(b,2)),merge(b)].
0.77/1.08	84 -r1(f15(A,B)).  [ur(48,a,30,a,c,27,a),rewrite([27(2)])].
0.77/1.08	86 f15(A,B) != f7(C).  [ur(48,a,30,a,b,26,a),flip(a)].
0.77/1.08	93 f22(A) = c1 | f20(A) = A.  [resolve(52,b,37,b),flip(a)].
0.77/1.08	95 f22(A) = c1 | r1(f20(A)).  [resolve(52,b,31,b),flip(a)].
0.77/1.08	96 f7(A) = c1.  [resolve(52,b,26,a),flip(a)].
0.77/1.08	99 f15(A,B) != c1.  [back_rewrite(86),rewrite([96(2)])].
0.77/1.08	107 r2(A,f19(A)).  [resolve(54,a,27,a(flip)),rewrite([27(2)])].
0.77/1.08	110 f19(f22(A)) = f21(A) | r1(f20(A)).  [resolve(56,a,44,b)].
0.77/1.08	112 f15(A,B) = f19(B).  [resolve(56,a,30,a),flip(a)].
0.77/1.08	114 f19(A) != c1.  [back_rewrite(99),rewrite([112(1)])].
0.77/1.08	115 -r1(f19(A)).  [back_rewrite(84),rewrite([112(1)])].
0.77/1.08	154 -r2(c1,f19(f19(A))).  [ur(57,b,27,a,c,107,a,d,114,a),rewrite([27(4)])].
0.77/1.08	158 f19(f19(A)) != f19(c1).  [ur(57,a,107,a,c,107,a,d,114,a),flip(a)].
0.77/1.08	211 f20(A) = A | r2(c1,A).  [para(93(a,1),75(b,1)),merge(b)].
0.77/1.08	222 f20(f19(f19(A))) = f19(f19(A)).  [resolve(211,b,154,a)].
0.77/1.08	365 f21(f19(f19(A))) = f19(f19(A)).  [para(222(a,1),39(a,1)),unit_del(a,115)].
0.77/1.08	366 f22(f19(f19(A))) = c1.  [para(222(a,1),95(b,1)),unit_del(b,115)].
0.77/1.08	371 $F.  [para(222(a,1),110(b,1)),rewrite([366(3),365(5)]),flip(a),unit_del(a,158),unit_del(b,115)].
0.77/1.08	
0.77/1.08	% SZS output end Refutation
0.77/1.08	============================== end of proof ==========================
0.77/1.08	
0.77/1.08	============================== STATISTICS ============================
0.77/1.08	
0.77/1.08	Given=120. Generated=1121. Kept=336. proofs=1.
0.77/1.08	Usable=106. Sos=172. Demods=28. Limbo=6, Disabled=96. Hints=0.
0.77/1.08	Megabytes=0.38.
0.77/1.08	User_CPU=0.05, System_CPU=0.01, Wall_clock=0.
0.77/1.08	
0.77/1.08	============================== end of statistics =====================
0.77/1.08	
0.77/1.08	============================== end of search =========================
0.77/1.08	
0.77/1.08	THEOREM PROVED
0.77/1.08	% SZS status Theorem
0.77/1.08	
0.77/1.08	Exiting with 1 proof.
0.77/1.08	
0.77/1.08	Process 10411 exit (max_proofs) Tue Jul 13 16:35:49 2021
0.77/1.08	Prover9 interrupted
0.77/1.09	EOF