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