0.06/0.12	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.06/0.12	% Command  : tptp2X_and_run_prover9 %d %s
0.12/0.33	% Computer : n004.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 : 960
0.12/0.33	% WCLimit  : 120
0.12/0.33	% DateTime : Tue Aug  9 04:13:50 EDT 2022
0.12/0.33	% CPUTime  : 
0.72/0.99	============================== Prover9 ===============================
0.72/0.99	Prover9 (32) version 2009-11A, November 2009.
0.72/0.99	Process 19912 was started by sandbox on n004.cluster.edu,
0.72/0.99	Tue Aug  9 04:13:51 2022
0.72/0.99	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 960 -f /tmp/Prover9_19759_n004.cluster.edu".
0.72/0.99	============================== end of head ===========================
0.72/0.99	
0.72/0.99	============================== INPUT =================================
0.72/0.99	
0.72/0.99	% Reading from file /tmp/Prover9_19759_n004.cluster.edu
0.72/0.99	
0.72/0.99	set(prolog_style_variables).
0.72/0.99	set(auto2).
0.72/0.99	    % set(auto2) -> set(auto).
0.72/0.99	    % set(auto) -> set(auto_inference).
0.72/0.99	    % set(auto) -> set(auto_setup).
0.72/0.99	    % set(auto_setup) -> set(predicate_elim).
0.72/0.99	    % set(auto_setup) -> assign(eq_defs, unfold).
0.72/0.99	    % set(auto) -> set(auto_limits).
0.72/0.99	    % set(auto_limits) -> assign(max_weight, "100.000").
0.72/0.99	    % set(auto_limits) -> assign(sos_limit, 20000).
0.72/0.99	    % set(auto) -> set(auto_denials).
0.72/0.99	    % set(auto) -> set(auto_process).
0.72/0.99	    % set(auto2) -> assign(new_constants, 1).
0.72/0.99	    % set(auto2) -> assign(fold_denial_max, 3).
0.72/0.99	    % set(auto2) -> assign(max_weight, "200.000").
0.72/0.99	    % set(auto2) -> assign(max_hours, 1).
0.72/0.99	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.72/0.99	    % set(auto2) -> assign(max_seconds, 0).
0.72/0.99	    % set(auto2) -> assign(max_minutes, 5).
0.72/0.99	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.72/0.99	    % set(auto2) -> set(sort_initial_sos).
0.72/0.99	    % set(auto2) -> assign(sos_limit, -1).
0.72/0.99	    % set(auto2) -> assign(lrs_ticks, 3000).
0.72/0.99	    % set(auto2) -> assign(max_megs, 400).
0.72/0.99	    % set(auto2) -> assign(stats, some).
0.72/0.99	    % set(auto2) -> clear(echo_input).
0.72/0.99	    % set(auto2) -> set(quiet).
0.72/0.99	    % set(auto2) -> clear(print_initial_clauses).
0.72/0.99	    % set(auto2) -> clear(print_given).
0.72/0.99	assign(lrs_ticks,-1).
0.72/0.99	assign(sos_limit,10000).
0.72/0.99	assign(order,kbo).
0.72/0.99	set(lex_order_vars).
0.72/0.99	clear(print_given).
0.72/0.99	
0.72/0.99	% formulas(sos).  % not echoed (12 formulas)
0.72/0.99	
0.72/0.99	============================== end of input ==========================
0.72/0.99	
0.72/0.99	% From the command line: assign(max_seconds, 960).
0.72/0.99	
0.72/0.99	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.72/0.99	
0.72/0.99	% Formulas that are not ordinary clauses:
0.72/0.99	1 (all X11 exists Y21 all X12 (-r2(X11,X12) & Y21 != X12 | Y21 = X12 & r2(X11,X12))) # label(axiom_2) # label(axiom) # label(non_clause).  [assumption].
0.72/0.99	2 (all X2 all X9 exists Y2 ((exists Y3 ((exists Y14 (r2(X9,Y14) & r4(X2,Y14,Y3))) & Y2 = Y3)) & (exists Y6 (r3(Y6,X2,Y2) & r4(X2,X9,Y6))))) # label(axiom_2a) # label(axiom) # label(non_clause).  [assumption].
0.72/0.99	3 (all X1 all X8 exists Y4 ((exists Y5 ((exists Y15 (r2(X8,Y15) & r3(X1,Y15,Y5))) & Y5 = Y4)) & (exists Y7 (r2(Y7,Y4) & r3(X1,X8,Y7))))) # label(axiom_1a) # label(axiom) # label(non_clause).  [assumption].
0.72/0.99	4 (all X16 all X17 exists Y23 all X18 (X18 != Y23 & -r4(X16,X17,X18) | Y23 = X18 & r4(X16,X17,X18))) # label(axiom_4) # label(axiom) # label(non_clause).  [assumption].
0.72/0.99	5 (all X7 all Y10 ((all Y20 (-r1(Y20) | Y20 != Y10)) | -r2(X7,Y10))) # label(axiom_7a) # label(axiom) # label(non_clause).  [assumption].
0.72/0.99	6 (all X3 all X10 (X10 = X3 | (all Y12 ((all Y13 (-r2(X3,Y13) | Y12 != Y13)) | -r2(X10,Y12))))) # label(axiom_3a) # label(axiom) # label(non_clause).  [assumption].
0.72/0.99	7 (all X6 ((exists Y1 exists Y11 (Y11 = X6 & r2(Y1,Y11))) | (exists Y19 (X6 = Y19 & r1(Y19))))) # label(axiom_6a) # label(axiom) # label(non_clause).  [assumption].
0.72/0.99	8 (all X13 all X14 exists Y22 all X15 (-r3(X13,X14,X15) & X15 != Y22 | r3(X13,X14,X15) & Y22 = X15)) # label(axiom_3) # label(axiom) # label(non_clause).  [assumption].
0.72/0.99	9 (all X5 exists Y8 ((exists Y17 (r4(X5,Y17,Y8) & r1(Y17))) & (exists Y18 (r1(Y18) & Y18 = Y8)))) # label(axiom_5a) # label(axiom) # label(non_clause).  [assumption].
0.72/0.99	10 (exists Y24 all X19 (-r1(X19) & Y24 != X19 | X19 = Y24 & r1(X19))) # label(axiom_1) # label(axiom) # label(non_clause).  [assumption].
0.72/0.99	11 (all X4 exists Y9 (Y9 = X4 & (exists Y16 (r3(X4,Y16,Y9) & r1(Y16))))) # label(axiom_4a) # label(axiom) # label(non_clause).  [assumption].
0.72/0.99	12 -(exists Y1 ((exists Y2 ((exists Y4 ((exists Y7 (r2(Y7,Y4) & r1(Y7))) & r2(Y4,Y2))) & (exists Y5 ((exists Y8 (r2(Y8,Y5) & r1(Y8))) & r4(Y5,Y2,Y1))))) & (exists Y3 ((exists Y6 (r2(Y6,Y3) & (exists Y9 (r2(Y9,Y6) & r1(Y9))))) & Y1 = Y3)))) # label(onetimestwoeqtwo) # label(negated_conjecture) # label(non_clause).  [assumption].
2.18/2.54	
2.18/2.54	============================== end of process non-clausal formulas ===
2.18/2.54	
2.18/2.54	============================== PROCESS INITIAL CLAUSES ===============
2.18/2.54	
2.18/2.54	============================== PREDICATE ELIMINATION =================
2.18/2.54	13 -r2(A,B) | -r1(A) | -r2(B,C) | -r2(D,E) | -r1(D) | -r4(E,C,F) | -r2(V6,V7) | -r2(V8,V6) | -r1(V8) | F != V7 # label(onetimestwoeqtwo) # label(negated_conjecture).  [clausify(12)].
2.18/2.54	14 r4(A,B,f5(A,B)) # label(axiom_2a) # label(axiom).  [clausify(2)].
2.18/2.54	15 r4(A,f16(A),f15(A)) # label(axiom_5a) # label(axiom).  [clausify(9)].
2.18/2.54	16 r4(A,f4(A,B),f3(A,B)) # label(axiom_2a) # label(axiom).  [clausify(2)].
2.18/2.54	Derived: -r2(A,B) | -r1(A) | -r2(B,C) | -r2(D,E) | -r1(D) | -r2(F,V6) | -r2(V7,F) | -r1(V7) | f5(E,C) != V6.  [resolve(13,f,14,a)].
2.18/2.54	Derived: -r2(A,B) | -r1(A) | -r2(B,f16(C)) | -r2(D,C) | -r1(D) | -r2(E,F) | -r2(V6,E) | -r1(V6) | f15(C) != F.  [resolve(13,f,15,a)].
2.18/2.54	Derived: -r2(A,B) | -r1(A) | -r2(B,f4(C,D)) | -r2(E,C) | -r1(E) | -r2(F,V6) | -r2(V7,F) | -r1(V7) | f3(C,D) != V6.  [resolve(13,f,16,a)].
2.18/2.54	17 A != f10(B,C) | r4(B,C,A) # label(axiom_4) # label(axiom).  [clausify(4)].
2.18/2.54	Derived: A != f10(B,C) | -r2(D,E) | -r1(D) | -r2(E,C) | -r2(F,B) | -r1(F) | -r2(V6,V7) | -r2(V8,V6) | -r1(V8) | A != V7.  [resolve(17,b,13,f)].
2.18/2.54	18 -r4(A,B,C) | C = f10(A,B) # label(axiom_4) # label(axiom).  [clausify(4)].
2.18/2.54	Derived: f5(A,B) = f10(A,B).  [resolve(18,a,14,a)].
2.18/2.54	Derived: f15(A) = f10(A,f16(A)).  [resolve(18,a,15,a)].
2.18/2.54	Derived: f3(A,B) = f10(A,f4(A,B)).  [resolve(18,a,16,a)].
2.18/2.54	19 -r3(A,B,C) | C = f14(A,B) # label(axiom_3) # label(axiom).  [clausify(8)].
2.18/2.54	20 r3(A,B,f9(A,B)) # label(axiom_1a) # label(axiom).  [clausify(3)].
2.18/2.54	21 r3(A,f19(A),f18(A)) # label(axiom_4a) # label(axiom).  [clausify(11)].
2.18/2.54	22 r3(f5(A,B),A,f2(A,B)) # label(axiom_2a) # label(axiom).  [clausify(2)].
2.18/2.54	23 r3(A,f8(A,B),f7(A,B)) # label(axiom_1a) # label(axiom).  [clausify(3)].
2.18/2.54	Derived: f9(A,B) = f14(A,B).  [resolve(19,a,20,a)].
2.18/2.54	Derived: f18(A) = f14(A,f19(A)).  [resolve(19,a,21,a)].
2.18/2.54	Derived: f2(A,B) = f14(f5(A,B),A).  [resolve(19,a,22,a)].
2.18/2.54	Derived: f7(A,B) = f14(A,f8(A,B)).  [resolve(19,a,23,a)].
2.18/2.54	24 A != f14(B,C) | r3(B,C,A) # label(axiom_3) # label(axiom).  [clausify(8)].
2.18/2.54	
2.18/2.54	============================== end predicate elimination =============
2.18/2.54	
2.18/2.54	Auto_denials:  (non-Horn, no changes).
2.18/2.54	
2.18/2.54	Term ordering decisions:
2.18/2.54	Function symbol KB weights:  c1=1. f2=1. f3=1. f4=1. f5=1. f6=1. f7=1. f8=1. f9=1. f10=1. f14=1. f1=1. f11=1. f12=1. f13=1. f15=1. f16=1. f17=1. f18=1. f19=1.
2.18/2.54	
2.18/2.54	============================== end of process initial clauses ========
2.18/2.54	
2.18/2.54	============================== CLAUSES FOR SEARCH ====================
2.18/2.54	
2.18/2.54	============================== end of clauses for search =============
2.18/2.54	
2.18/2.54	============================== SEARCH ================================
2.18/2.54	
2.18/2.54	% Starting search at 0.15 seconds.
2.18/2.54	
2.18/2.54	============================== PROOF =================================
2.18/2.54	% SZS status Theorem
2.18/2.54	% SZS output start Refutation
2.18/2.54	
2.18/2.54	% Proof 1 at 1.54 (+ 0.02) seconds.
2.18/2.54	% Length of proof is 67.
2.18/2.54	% Level of proof is 7.
2.18/2.54	% Maximum clause weight is 29.000.
2.18/2.54	% Given clauses 345.
2.18/2.54	
2.18/2.54	1 (all X11 exists Y21 all X12 (-r2(X11,X12) & Y21 != X12 | Y21 = X12 & r2(X11,X12))) # label(axiom_2) # label(axiom) # label(non_clause).  [assumption].
2.18/2.54	2 (all X2 all X9 exists Y2 ((exists Y3 ((exists Y14 (r2(X9,Y14) & r4(X2,Y14,Y3))) & Y2 = Y3)) & (exists Y6 (r3(Y6,X2,Y2) & r4(X2,X9,Y6))))) # label(axiom_2a) # label(axiom) # label(non_clause).  [assumption].
2.18/2.54	3 (all X1 all X8 exists Y4 ((exists Y5 ((exists Y15 (r2(X8,Y15) & r3(X1,Y15,Y5))) & Y5 = Y4)) & (exists Y7 (r2(Y7,Y4) & r3(X1,X8,Y7))))) # label(axiom_1a) # label(axiom) # label(non_clause).  [assumption].
2.18/2.54	4 (all X16 all X17 exists Y23 all X18 (X18 != Y23 & -r4(X16,X17,X18) | Y23 = X18 & r4(X16,X17,X18))) # label(axiom_4) # label(axiom) # label(non_clause).  [assumption].
2.18/2.54	8 (all X13 all X14 exists Y22 all X15 (-r3(X13,X14,X15) & X15 != Y22 | r3(X13,X14,X15) & Y22 = X15)) # label(axiom_3) # label(axiom) # label(non_clause).  [assumption].
2.18/2.54	9 (all X5 exists Y8 ((exists Y17 (r4(X5,Y17,Y8) & r1(Y17))) & (exists Y18 (r1(Y18) & Y18 = Y8)))) # label(axiom_5a) # label(axiom) # label(non_clause).  [assumption].
2.18/2.54	10 (exists Y24 all X19 (-r1(X19) & Y24 != X19 | X19 = Y24 & r1(X19))) # label(axiom_1) # label(axiom) # label(non_clause).  [assumption].
2.18/2.54	11 (all X4 exists Y9 (Y9 = X4 & (exists Y16 (r3(X4,Y16,Y9) & r1(Y16))))) # label(axiom_4a) # label(axiom) # label(non_clause).  [assumption].
2.18/2.54	12 -(exists Y1 ((exists Y2 ((exists Y4 ((exists Y7 (r2(Y7,Y4) & r1(Y7))) & r2(Y4,Y2))) & (exists Y5 ((exists Y8 (r2(Y8,Y5) & r1(Y8))) & r4(Y5,Y2,Y1))))) & (exists Y3 ((exists Y6 (r2(Y6,Y3) & (exists Y9 (r2(Y9,Y6) & r1(Y9))))) & Y1 = Y3)))) # label(onetimestwoeqtwo) # label(negated_conjecture) # label(non_clause).  [assumption].
2.18/2.54	13 -r2(A,B) | -r1(A) | -r2(B,C) | -r2(D,E) | -r1(D) | -r4(E,C,F) | -r2(V6,V7) | -r2(V8,V6) | -r1(V8) | F != V7 # label(onetimestwoeqtwo) # label(negated_conjecture).  [clausify(12)].
2.18/2.54	14 r4(A,B,f5(A,B)) # label(axiom_2a) # label(axiom).  [clausify(2)].
2.18/2.54	15 r4(A,f16(A),f15(A)) # label(axiom_5a) # label(axiom).  [clausify(9)].
2.18/2.54	16 r4(A,f4(A,B),f3(A,B)) # label(axiom_2a) # label(axiom).  [clausify(2)].
2.18/2.54	17 A != f10(B,C) | r4(B,C,A) # label(axiom_4) # label(axiom).  [clausify(4)].
2.18/2.54	18 -r4(A,B,C) | C = f10(A,B) # label(axiom_4) # label(axiom).  [clausify(4)].
2.18/2.54	19 -r3(A,B,C) | C = f14(A,B) # label(axiom_3) # label(axiom).  [clausify(8)].
2.18/2.54	20 r3(A,B,f9(A,B)) # label(axiom_1a) # label(axiom).  [clausify(3)].
2.18/2.54	21 r3(A,f19(A),f18(A)) # label(axiom_4a) # label(axiom).  [clausify(11)].
2.18/2.54	22 r3(f5(A,B),A,f2(A,B)) # label(axiom_2a) # label(axiom).  [clausify(2)].
2.18/2.54	23 r3(A,f8(A,B),f7(A,B)) # label(axiom_1a) # label(axiom).  [clausify(3)].
2.18/2.54	25 r1(f16(A)) # label(axiom_5a) # label(axiom).  [clausify(9)].
2.18/2.54	26 r1(f17(A)) # label(axiom_5a) # label(axiom).  [clausify(9)].
2.18/2.54	27 r1(f19(A)) # label(axiom_4a) # label(axiom).  [clausify(11)].
2.18/2.54	28 f18(A) = A # label(axiom_4a) # label(axiom).  [clausify(11)].
2.18/2.54	29 r2(A,f4(B,A)) # label(axiom_2a) # label(axiom).  [clausify(2)].
2.18/2.54	30 r2(A,f8(B,A)) # label(axiom_1a) # label(axiom).  [clausify(3)].
2.18/2.54	31 f17(A) = f15(A) # label(axiom_5a) # label(axiom).  [clausify(9)].
2.18/2.54	32 f3(A,B) = f2(A,B) # label(axiom_2a) # label(axiom).  [clausify(2)].
2.18/2.54	33 f7(A,B) = f6(A,B) # label(axiom_1a) # label(axiom).  [clausify(3)].
2.18/2.54	34 r2(f9(A,B),f6(A,B)) # label(axiom_1a) # label(axiom).  [clausify(3)].
2.18/2.54	40 -r1(A) | A = c1 # label(axiom_1) # label(axiom).  [clausify(10)].
2.18/2.54	41 -r1(A) | c1 = A.  [copy(40),flip(b)].
2.18/2.54	44 -r2(A,B) | B = f1(A) # label(axiom_2) # label(axiom).  [clausify(1)].
2.18/2.54	45 -r2(A,B) | f1(A) = B.  [copy(44),flip(b)].
2.18/2.54	53 A != f10(B,C) | -r2(D,E) | -r1(D) | -r2(E,C) | -r2(F,B) | -r1(F) | -r2(V6,V7) | -r2(V8,V6) | -r1(V8) | A != V7.  [resolve(17,b,13,f)].
2.18/2.54	54 f10(A,B) != C | -r2(D,E) | -r1(D) | -r2(E,B) | -r2(F,A) | -r1(F) | -r2(V6,V7) | -r2(V8,V6) | -r1(V8) | C != V7.  [copy(53),flip(a)].
2.18/2.54	55 f5(A,B) = f10(A,B).  [resolve(18,a,14,a)].
2.18/2.54	56 f15(A) = f10(A,f16(A)).  [resolve(18,a,15,a)].
2.18/2.54	57 f3(A,B) = f10(A,f4(A,B)).  [resolve(18,a,16,a)].
2.18/2.54	58 f2(A,B) = f10(A,f4(A,B)).  [copy(57),rewrite([32(1)])].
2.18/2.54	59 f9(A,B) = f14(A,B).  [resolve(19,a,20,a)].
2.18/2.54	60 f18(A) = f14(A,f19(A)).  [resolve(19,a,21,a)].
2.18/2.54	61 f14(A,f19(A)) = A.  [copy(60),rewrite([28(1)]),flip(a)].
2.18/2.54	62 f2(A,B) = f14(f5(A,B),A).  [resolve(19,a,22,a)].
2.18/2.54	63 f14(f10(A,B),A) = f10(A,f4(A,B)).  [copy(62),rewrite([58(1),55(3)]),flip(a)].
2.18/2.54	64 f7(A,B) = f14(A,f8(A,B)).  [resolve(19,a,23,a)].
2.18/2.54	65 f14(A,f8(A,B)) = f6(A,B).  [copy(64),rewrite([33(1)]),flip(a)].
2.18/2.54	66 r1(f10(A,f16(A))).  [back_rewrite(26),rewrite([31(1),56(1)])].
2.18/2.54	85 f10(A,B) != C | -r2(D,E) | -r1(D) | -r2(E,B) | -r2(D,A) | -r2(F,V6) | -r2(V7,F) | -r1(V7) | C != V6.  [factor(54,c,f)].
2.18/2.54	96 r2(f14(A,B),f6(A,B)).  [back_rewrite(34),rewrite([59(1)])].
2.18/2.54	181 f10(A,B) != C | -r2(D,E) | -r1(D) | -r2(E,B) | -r2(D,A) | -r2(F,V6) | -r2(D,F) | C != V6.  [factor(85,c,h)].
2.18/2.54	371 f19(A) = c1.  [resolve(41,a,27,a),flip(a)].
2.18/2.54	372 f16(A) = c1.  [resolve(41,a,25,a),flip(a)].
2.18/2.54	376 f14(A,c1) = A.  [back_rewrite(61),rewrite([371(1)])].
2.18/2.54	377 r1(c1).  [back_rewrite(27),rewrite([371(1)])].
2.18/2.54	379 r1(f10(A,c1)).  [back_rewrite(66),rewrite([372(1)])].
2.18/2.54	383 f8(A,B) = f1(B).  [resolve(45,a,30,a),flip(a)].
2.18/2.54	384 f4(A,B) = f1(B).  [resolve(45,a,29,a),flip(a)].
2.18/2.54	388 f14(A,f1(B)) = f6(A,B).  [back_rewrite(65),rewrite([383(1)])].
2.18/2.54	389 r2(A,f1(A)).  [back_rewrite(30),rewrite([383(1)])].
2.18/2.54	391 f14(f10(A,B),A) = f10(A,f1(B)).  [back_rewrite(63),rewrite([384(3)])].
2.18/2.54	2303 f10(A,c1) = c1.  [resolve(379,a,41,a),flip(a)].
2.18/2.54	2882 r2(A,f6(A,c1)).  [para(376(a,1),96(a,1))].
2.18/2.54	3422 f6(A,c1) = f1(A).  [resolve(2882,a,45,a),flip(a)].
2.18/2.54	3480 -r2(c1,f10(f1(c1),f1(c1))).  [ur(181,a,391,a(flip),b,389,a,c,377,a,d,389,a,e,389,a,f,96,a,h,388,a),rewrite([376(8)])].
2.18/2.54	3483 f10(A,f1(c1)) = f14(c1,A).  [para(2303(a,1),391(a,1,1)),flip(a)].
2.18/2.54	3486 $F.  [back_rewrite(3480),rewrite([3483(6),388(5),3422(4)]),unit_del(a,389)].
2.18/2.54	
2.18/2.54	% SZS output end Refutation
2.18/2.54	============================== end of proof ==========================
2.18/2.54	
2.18/2.54	============================== STATISTICS ============================
2.18/2.54	
2.18/2.54	Given=345. Generated=27460. Kept=3451. proofs=1.
2.18/2.54	Usable=334. Sos=2395. Demods=26. Limbo=3, Disabled=762. Hints=0.
2.18/2.54	Megabytes=2.58.
2.18/2.54	User_CPU=1.54, System_CPU=0.02, Wall_clock=1.
2.18/2.54	
2.18/2.54	============================== end of statistics =====================
2.18/2.54	
2.18/2.54	============================== end of search =========================
2.18/2.54	
2.18/2.54	THEOREM PROVED
2.18/2.54	% SZS status Theorem
2.18/2.54	
2.18/2.54	Exiting with 1 proof.
2.18/2.54	
2.18/2.54	Process 19912 exit (max_proofs) Tue Aug  9 04:13:52 2022
2.18/2.54	Prover9 interrupted
2.29/2.54	EOF