0.07/0.13	% 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   : n026.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   : 180
0.13/0.34	% DateTime   : Thu Aug 29 12:58:05 EDT 2019
0.13/0.35	% CPUTime    : 
0.46/1.05	============================== Prover9 ===============================
0.46/1.05	Prover9 (32) version 2009-11A, November 2009.
0.46/1.05	Process 2619 was started by sandbox2 on n026.cluster.edu,
0.46/1.05	Thu Aug 29 12:58:06 2019
0.46/1.05	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 180 -f /tmp/Prover9_2466_n026.cluster.edu".
0.46/1.05	============================== end of head ===========================
0.46/1.05	
0.46/1.05	============================== INPUT =================================
0.46/1.05	
0.46/1.05	% Reading from file /tmp/Prover9_2466_n026.cluster.edu
0.46/1.05	
0.46/1.05	set(prolog_style_variables).
0.46/1.05	set(auto2).
0.46/1.05	    % set(auto2) -> set(auto).
0.46/1.05	    % set(auto) -> set(auto_inference).
0.46/1.05	    % set(auto) -> set(auto_setup).
0.46/1.05	    % set(auto_setup) -> set(predicate_elim).
0.46/1.05	    % set(auto_setup) -> assign(eq_defs, unfold).
0.46/1.05	    % set(auto) -> set(auto_limits).
0.46/1.05	    % set(auto_limits) -> assign(max_weight, "100.000").
0.46/1.05	    % set(auto_limits) -> assign(sos_limit, 20000).
0.46/1.05	    % set(auto) -> set(auto_denials).
0.46/1.05	    % set(auto) -> set(auto_process).
0.46/1.05	    % set(auto2) -> assign(new_constants, 1).
0.46/1.05	    % set(auto2) -> assign(fold_denial_max, 3).
0.46/1.05	    % set(auto2) -> assign(max_weight, "200.000").
0.46/1.05	    % set(auto2) -> assign(max_hours, 1).
0.46/1.05	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.46/1.05	    % set(auto2) -> assign(max_seconds, 0).
0.46/1.05	    % set(auto2) -> assign(max_minutes, 5).
0.46/1.05	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.46/1.05	    % set(auto2) -> set(sort_initial_sos).
0.46/1.05	    % set(auto2) -> assign(sos_limit, -1).
0.46/1.05	    % set(auto2) -> assign(lrs_ticks, 3000).
0.46/1.05	    % set(auto2) -> assign(max_megs, 400).
0.46/1.05	    % set(auto2) -> assign(stats, some).
0.46/1.05	    % set(auto2) -> clear(echo_input).
0.46/1.05	    % set(auto2) -> set(quiet).
0.46/1.05	    % set(auto2) -> clear(print_initial_clauses).
0.46/1.05	    % set(auto2) -> clear(print_given).
0.46/1.05	assign(lrs_ticks,-1).
0.46/1.05	assign(sos_limit,10000).
0.46/1.05	assign(order,kbo).
0.46/1.05	set(lex_order_vars).
0.46/1.05	clear(print_given).
0.46/1.05	
0.46/1.05	% formulas(sos).  % not echoed (12 formulas)
0.46/1.05	
0.46/1.05	============================== end of input ==========================
0.46/1.05	
0.46/1.05	% From the command line: assign(max_seconds, 180).
0.46/1.05	
0.46/1.05	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.46/1.05	
0.46/1.05	% Formulas that are not ordinary clauses:
0.46/1.05	1 (all X1 all X8 exists Y4 ((exists Y7 (r2(Y7,Y4) & r3(X1,X8,Y7))) & (exists Y5 ((exists Y15 (r2(X8,Y15) & r3(X1,Y15,Y5))) & Y4 = Y5)))) # label(axiom_1a) # label(axiom) # label(non_clause).  [assumption].
0.46/1.05	2 (all X16 all X17 exists Y23 all X18 (Y23 = X18 & r4(X16,X17,X18) | -r4(X16,X17,X18) & Y23 != X18)) # label(axiom_4) # label(axiom) # label(non_clause).  [assumption].
0.46/1.05	3 (all X6 ((exists Y1 exists Y11 (X6 = Y11 & r2(Y1,Y11))) | (exists Y19 (X6 = Y19 & r1(Y19))))) # label(axiom_6a) # label(axiom) # label(non_clause).  [assumption].
0.46/1.05	4 (all X2 all X9 exists Y2 ((exists Y6 (r4(X2,X9,Y6) & r3(Y6,X2,Y2))) & (exists Y3 (Y2 = Y3 & (exists Y14 (r2(X9,Y14) & r4(X2,Y14,Y3))))))) # label(axiom_2a) # label(axiom) # label(non_clause).  [assumption].
0.46/1.05	5 (all X11 exists Y21 all X12 (-r2(X11,X12) & Y21 != X12 | X12 = Y21 & r2(X11,X12))) # label(axiom_2) # label(axiom) # label(non_clause).  [assumption].
0.46/1.05	6 (all X13 all X14 exists Y22 all X15 (r3(X13,X14,X15) & Y22 = X15 | -r3(X13,X14,X15) & X15 != Y22)) # label(axiom_3) # label(axiom) # label(non_clause).  [assumption].
0.46/1.05	7 (all X3 all X10 (X3 = X10 | (all Y12 ((all Y13 (Y13 != Y12 | -r2(X3,Y13))) | -r2(X10,Y12))))) # label(axiom_3a) # label(axiom) # label(non_clause).  [assumption].
0.46/1.05	8 (exists Y24 all X19 (Y24 = X19 & r1(X19) | -r1(X19) & X19 != Y24)) # label(axiom_1) # label(axiom) # label(non_clause).  [assumption].
0.46/1.05	9 (all X7 all Y10 (-r2(X7,Y10) | (all Y20 (Y10 != Y20 | -r1(Y20))))) # label(axiom_7a) # label(axiom) # label(non_clause).  [assumption].
0.46/1.05	10 (all X5 exists Y8 ((exists Y17 (r4(X5,Y17,Y8) & r1(Y17))) & (exists Y18 (r1(Y18) & Y8 = Y18)))) # label(axiom_5a) # label(axiom) # label(non_clause).  [assumption].
0.46/1.05	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.46/1.05	12 -(exists Y1 ((exists Y3 (Y1 = Y3 & (exists Y6 (r2(Y6,Y3) & (exists Y9 (r2(Y9,Y6) & r1(Y9))))))) & (exists Y2 ((exists Y4 (r2(Y4,Y2) & (exists Y7 (r2(Y7,Y4) & r1(Y7))))) & (exists Y5 ((exists Y8 (r1(Y8) & r2(Y8,Y5))) & r4(Y5,Y2,Y1))))))) # label(onetimestwoeqtwo) # label(negated_conjecture) # label(non_clause).  [assumption].
1.95/2.24	
1.95/2.24	============================== end of process non-clausal formulas ===
1.95/2.24	
1.95/2.24	============================== PROCESS INITIAL CLAUSES ===============
1.95/2.24	
1.95/2.24	============================== PREDICATE ELIMINATION =================
1.95/2.24	13 A = f14(B,C) | -r3(B,C,A) # label(axiom_3) # label(axiom).  [clausify(6)].
1.95/2.24	14 r3(A,B,f2(A,B)) # label(axiom_1a) # label(axiom).  [clausify(1)].
1.95/2.24	15 r3(A,f19(A),f18(A)) # label(axiom_4a) # label(axiom).  [clausify(11)].
1.95/2.24	16 r3(A,f4(A,B),f3(A,B)) # label(axiom_1a) # label(axiom).  [clausify(1)].
1.95/2.24	17 r3(f10(A,B),A,f9(A,B)) # label(axiom_2a) # label(axiom).  [clausify(4)].
1.95/2.24	18 r3(A,B,C) | C != f14(A,B) # label(axiom_3) # label(axiom).  [clausify(6)].
1.95/2.24	Derived: f2(A,B) = f14(A,B).  [resolve(13,b,14,a)].
1.95/2.24	Derived: f18(A) = f14(A,f19(A)).  [resolve(13,b,15,a)].
1.95/2.24	Derived: f3(A,B) = f14(A,f4(A,B)).  [resolve(13,b,16,a)].
1.95/2.24	Derived: f9(A,B) = f14(f10(A,B),A).  [resolve(13,b,17,a)].
1.95/2.24	19 A != B | -r2(C,A) | -r2(D,C) | -r1(D) | -r2(E,F) | -r2(V6,E) | -r1(V6) | -r1(V7) | -r2(V7,V8) | -r4(V8,F,B) # label(onetimestwoeqtwo) # label(negated_conjecture).  [clausify(12)].
1.95/2.24	20 r4(A,B,f10(A,B)) # label(axiom_2a) # label(axiom).  [clausify(4)].
1.95/2.24	21 r4(A,f16(A),f15(A)) # label(axiom_5a) # label(axiom).  [clausify(10)].
1.95/2.24	22 r4(A,f12(A,B),f11(A,B)) # label(axiom_2a) # label(axiom).  [clausify(4)].
1.95/2.24	Derived: A != f10(B,C) | -r2(D,A) | -r2(E,D) | -r1(E) | -r2(F,C) | -r2(V6,F) | -r1(V6) | -r1(V7) | -r2(V7,B).  [resolve(19,j,20,a)].
1.95/2.24	Derived: A != f15(B) | -r2(C,A) | -r2(D,C) | -r1(D) | -r2(E,f16(B)) | -r2(F,E) | -r1(F) | -r1(V6) | -r2(V6,B).  [resolve(19,j,21,a)].
1.95/2.24	Derived: A != f11(B,C) | -r2(D,A) | -r2(E,D) | -r1(E) | -r2(F,f12(B,C)) | -r2(V6,F) | -r1(V6) | -r1(V7) | -r2(V7,B).  [resolve(19,j,22,a)].
1.95/2.24	23 A = f5(B,C) | -r4(B,C,A) # label(axiom_4) # label(axiom).  [clausify(2)].
1.95/2.24	Derived: f10(A,B) = f5(A,B).  [resolve(23,b,20,a)].
1.95/2.24	Derived: f15(A) = f5(A,f16(A)).  [resolve(23,b,21,a)].
1.95/2.24	Derived: f11(A,B) = f5(A,f12(A,B)).  [resolve(23,b,22,a)].
1.95/2.24	24 r4(A,B,C) | C != f5(A,B) # label(axiom_4) # label(axiom).  [clausify(2)].
1.95/2.24	Derived: A != f5(B,C) | D != A | -r2(E,D) | -r2(F,E) | -r1(F) | -r2(V6,C) | -r2(V7,V6) | -r1(V7) | -r1(V8) | -r2(V8,B).  [resolve(24,a,19,j)].
1.95/2.24	
1.95/2.24	============================== end predicate elimination =============
1.95/2.24	
1.95/2.24	Auto_denials:  (non-Horn, no changes).
1.95/2.24	
1.95/2.24	Term ordering decisions:
1.95/2.24	Function symbol KB weights:  c1=1. f1=1. f2=1. f3=1. f4=1. f5=1. f9=1. f10=1. f11=1. f12=1. f14=1. f6=1. f7=1. f8=1. f13=1. f15=1. f16=1. f17=1. f18=1. f19=1.
1.95/2.24	
1.95/2.24	============================== end of process initial clauses ========
1.95/2.24	
1.95/2.24	============================== CLAUSES FOR SEARCH ====================
1.95/2.24	
1.95/2.24	============================== end of clauses for search =============
1.95/2.24	
1.95/2.24	============================== SEARCH ================================
1.95/2.24	
1.95/2.24	% Starting search at 0.09 seconds.
1.95/2.24	
1.95/2.24	============================== PROOF =================================
1.95/2.24	% SZS status Theorem
1.95/2.24	% SZS output start Refutation
1.95/2.24	
1.95/2.24	% Proof 1 at 1.18 (+ 0.03) seconds.
1.95/2.24	% Length of proof is 66.
1.95/2.24	% Level of proof is 7.
1.95/2.24	% Maximum clause weight is 29.000.
1.95/2.24	% Given clauses 345.
1.95/2.24	
1.95/2.24	1 (all X1 all X8 exists Y4 ((exists Y7 (r2(Y7,Y4) & r3(X1,X8,Y7))) & (exists Y5 ((exists Y15 (r2(X8,Y15) & r3(X1,Y15,Y5))) & Y4 = Y5)))) # label(axiom_1a) # label(axiom) # label(non_clause).  [assumption].
1.95/2.24	2 (all X16 all X17 exists Y23 all X18 (Y23 = X18 & r4(X16,X17,X18) | -r4(X16,X17,X18) & Y23 != X18)) # label(axiom_4) # label(axiom) # label(non_clause).  [assumption].
1.95/2.24	4 (all X2 all X9 exists Y2 ((exists Y6 (r4(X2,X9,Y6) & r3(Y6,X2,Y2))) & (exists Y3 (Y2 = Y3 & (exists Y14 (r2(X9,Y14) & r4(X2,Y14,Y3))))))) # label(axiom_2a) # label(axiom) # label(non_clause).  [assumption].
1.95/2.24	5 (all X11 exists Y21 all X12 (-r2(X11,X12) & Y21 != X12 | X12 = Y21 & r2(X11,X12))) # label(axiom_2) # label(axiom) # label(non_clause).  [assumption].
1.95/2.24	6 (all X13 all X14 exists Y22 all X15 (r3(X13,X14,X15) & Y22 = X15 | -r3(X13,X14,X15) & X15 != Y22)) # label(axiom_3) # label(axiom) # label(non_clause).  [assumption].
1.95/2.24	8 (exists Y24 all X19 (Y24 = X19 & r1(X19) | -r1(X19) & X19 != Y24)) # label(axiom_1) # label(axiom) # label(non_clause).  [assumption].
1.95/2.24	10 (all X5 exists Y8 ((exists Y17 (r4(X5,Y17,Y8) & r1(Y17))) & (exists Y18 (r1(Y18) & Y8 = Y18)))) # label(axiom_5a) # label(axiom) # label(non_clause).  [assumption].
1.95/2.24	11 (all X4 exists Y9 (Y9 = X4 & (exists Y16 (r3(X4,Y16,Y9) & r1(Y16))))) # label(axiom_4a) # label(axiom) # label(non_clause).  [assumption].
1.95/2.24	12 -(exists Y1 ((exists Y3 (Y1 = Y3 & (exists Y6 (r2(Y6,Y3) & (exists Y9 (r2(Y9,Y6) & r1(Y9))))))) & (exists Y2 ((exists Y4 (r2(Y4,Y2) & (exists Y7 (r2(Y7,Y4) & r1(Y7))))) & (exists Y5 ((exists Y8 (r1(Y8) & r2(Y8,Y5))) & r4(Y5,Y2,Y1))))))) # label(onetimestwoeqtwo) # label(negated_conjecture) # label(non_clause).  [assumption].
1.95/2.24	13 A = f14(B,C) | -r3(B,C,A) # label(axiom_3) # label(axiom).  [clausify(6)].
1.95/2.24	14 r3(A,B,f2(A,B)) # label(axiom_1a) # label(axiom).  [clausify(1)].
1.95/2.24	15 r3(A,f19(A),f18(A)) # label(axiom_4a) # label(axiom).  [clausify(11)].
1.95/2.25	16 r3(A,f4(A,B),f3(A,B)) # label(axiom_1a) # label(axiom).  [clausify(1)].
1.95/2.25	17 r3(f10(A,B),A,f9(A,B)) # label(axiom_2a) # label(axiom).  [clausify(4)].
1.95/2.25	19 A != B | -r2(C,A) | -r2(D,C) | -r1(D) | -r2(E,F) | -r2(V6,E) | -r1(V6) | -r1(V7) | -r2(V7,V8) | -r4(V8,F,B) # label(onetimestwoeqtwo) # label(negated_conjecture).  [clausify(12)].
1.95/2.25	20 r4(A,B,f10(A,B)) # label(axiom_2a) # label(axiom).  [clausify(4)].
1.95/2.25	21 r4(A,f16(A),f15(A)) # label(axiom_5a) # label(axiom).  [clausify(10)].
1.95/2.25	22 r4(A,f12(A,B),f11(A,B)) # label(axiom_2a) # label(axiom).  [clausify(4)].
1.95/2.25	23 A = f5(B,C) | -r4(B,C,A) # label(axiom_4) # label(axiom).  [clausify(2)].
1.95/2.25	24 r4(A,B,C) | C != f5(A,B) # label(axiom_4) # label(axiom).  [clausify(2)].
1.95/2.25	25 r1(f16(A)) # label(axiom_5a) # label(axiom).  [clausify(10)].
1.95/2.25	26 r1(f17(A)) # label(axiom_5a) # label(axiom).  [clausify(10)].
1.95/2.25	27 r1(f19(A)) # label(axiom_4a) # label(axiom).  [clausify(11)].
1.95/2.25	28 f18(A) = A # label(axiom_4a) # label(axiom).  [clausify(11)].
1.95/2.25	29 r2(A,f4(B,A)) # label(axiom_1a) # label(axiom).  [clausify(1)].
1.95/2.25	30 r2(A,f12(B,A)) # label(axiom_2a) # label(axiom).  [clausify(4)].
1.95/2.25	31 f17(A) = f15(A) # label(axiom_5a) # label(axiom).  [clausify(10)].
1.95/2.25	32 r2(f2(A,B),f1(A,B)) # label(axiom_1a) # label(axiom).  [clausify(1)].
1.95/2.25	33 f3(A,B) = f1(A,B) # label(axiom_1a) # label(axiom).  [clausify(1)].
1.95/2.25	35 f11(A,B) = f9(A,B) # label(axiom_2a) # label(axiom).  [clausify(4)].
1.95/2.25	40 A = c1 | -r1(A) # label(axiom_1) # label(axiom).  [clausify(8)].
1.95/2.25	41 c1 = A | -r1(A).  [copy(40),flip(a)].
1.95/2.25	44 -r2(A,B) | B = f13(A) # label(axiom_2) # label(axiom).  [clausify(5)].
1.95/2.25	45 -r2(A,B) | f13(A) = B.  [copy(44),flip(b)].
1.95/2.25	49 f2(A,B) = f14(A,B).  [resolve(13,b,14,a)].
1.95/2.25	50 f18(A) = f14(A,f19(A)).  [resolve(13,b,15,a)].
1.95/2.25	51 f14(A,f19(A)) = A.  [copy(50),rewrite([28(1)]),flip(a)].
1.95/2.25	52 f3(A,B) = f14(A,f4(A,B)).  [resolve(13,b,16,a)].
1.95/2.25	53 f14(A,f4(A,B)) = f1(A,B).  [copy(52),rewrite([33(1)]),flip(a)].
1.95/2.25	54 f9(A,B) = f14(f10(A,B),A).  [resolve(13,b,17,a)].
1.95/2.25	61 f10(A,B) = f5(A,B).  [resolve(23,b,20,a)].
1.95/2.25	62 f15(A) = f5(A,f16(A)).  [resolve(23,b,21,a)].
1.95/2.25	63 f11(A,B) = f5(A,f12(A,B)).  [resolve(23,b,22,a)].
1.95/2.25	64 f14(f5(A,B),A) = f5(A,f12(A,B)).  [copy(63),rewrite([35(1),54(1),61(1)])].
1.95/2.25	65 A != f5(B,C) | D != A | -r2(E,D) | -r2(F,E) | -r1(F) | -r2(V6,C) | -r2(V7,V6) | -r1(V7) | -r1(V8) | -r2(V8,B).  [resolve(24,a,19,j)].
1.95/2.25	66 f5(A,B) != C | D != C | -r2(E,D) | -r2(F,E) | -r1(F) | -r2(V6,B) | -r2(V7,V6) | -r1(V7) | -r1(V8) | -r2(V8,A).  [copy(65),flip(a)].
1.95/2.25	67 r1(f5(A,f16(A))).  [back_rewrite(26),rewrite([31(1),62(1)])].
1.95/2.25	68 r2(f14(A,B),f1(A,B)).  [back_rewrite(32),rewrite([49(1)])].
1.95/2.25	96 f5(A,B) != C | D != C | -r2(E,D) | -r2(F,E) | -r1(F) | -r2(V6,B) | -r2(F,V6) | -r1(V7) | -r2(V7,A).  [factor(66,e,h)].
1.95/2.25	200 f5(A,B) != C | D != C | -r2(E,D) | -r2(F,E) | -r1(F) | -r2(A,B) | -r2(F,A).  [factor(96,g,i),merge(h)].
1.95/2.25	376 f19(A) = c1.  [resolve(41,b,27,a),flip(a)].
1.95/2.25	377 f16(A) = c1.  [resolve(41,b,25,a),flip(a)].
1.95/2.25	381 f14(A,c1) = A.  [back_rewrite(51),rewrite([376(1)])].
1.95/2.25	382 r1(c1).  [back_rewrite(27),rewrite([376(1)])].
1.95/2.25	384 r1(f5(A,c1)).  [back_rewrite(67),rewrite([377(1)])].
1.95/2.25	388 f12(A,B) = f13(B).  [resolve(45,a,30,a),flip(a)].
1.95/2.25	389 f4(A,B) = f13(B).  [resolve(45,a,29,a),flip(a)].
1.95/2.25	395 f14(f5(A,B),A) = f5(A,f13(B)).  [back_rewrite(64),rewrite([388(3)])].
1.95/2.25	396 r2(A,f13(A)).  [back_rewrite(30),rewrite([388(1)])].
1.95/2.25	397 f14(A,f13(B)) = f1(A,B).  [back_rewrite(53),rewrite([389(1)])].
1.95/2.25	2293 f5(A,c1) = c1.  [resolve(384,a,41,b),flip(a)].
1.95/2.25	2872 r2(A,f1(A,c1)).  [para(381(a,1),68(a,1))].
1.95/2.25	3415 f1(A,c1) = f13(A).  [resolve(2872,a,45,a),flip(a)].
1.95/2.25	3470 -r2(c1,f5(f13(c1),f13(c1))).  [ur(200,a,395,a(flip),b,397,a(flip),c,68,a,e,382,a,f,396,a,g,396,a),rewrite([381(8)])].
1.95/2.25	3473 f5(A,f13(c1)) = f14(c1,A).  [para(2293(a,1),395(a,1,1)),flip(a)].
1.95/2.25	3476 $F.  [back_rewrite(3470),rewrite([3473(6),397(5),3415(4)]),unit_del(a,396)].
1.95/2.25	
1.95/2.25	% SZS output end Refutation
1.95/2.25	============================== end of proof ==========================
1.95/2.25	
1.95/2.25	============================== STATISTICS ============================
1.95/2.25	
1.95/2.25	Given=345. Generated=27492. Kept=3440. proofs=1.
1.95/2.25	Usable=334. Sos=2390. Demods=26. Limbo=3, Disabled=756. Hints=0.
1.95/2.25	Megabytes=2.61.
1.95/2.25	User_CPU=1.18, System_CPU=0.03, Wall_clock=1.
1.95/2.25	
1.95/2.25	============================== end of statistics =====================
1.95/2.25	
1.95/2.25	============================== end of search =========================
1.95/2.25	
1.95/2.25	THEOREM PROVED
1.95/2.25	% SZS status Theorem
1.95/2.25	
1.95/2.25	Exiting with 1 proof.
1.95/2.25	
1.95/2.25	Process 2619 exit (max_proofs) Thu Aug 29 12:58:07 2019
1.95/2.25	Prover9 interrupted
1.95/2.25	EOF