0.10/0.21	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.10/0.21	% Command    : tptp2X_and_run_prover9 %d %s
0.13/0.44	% Computer   : n022.cluster.edu
0.13/0.44	% Model      : x86_64 x86_64
0.13/0.44	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.44	% Memory     : 8042.1875MB
0.13/0.44	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.44	% CPULimit   : 180
0.13/0.44	% DateTime   : Thu Aug 29 09:05:58 EDT 2019
0.13/0.44	% CPUTime    : 
0.42/1.10	============================== Prover9 ===============================
0.42/1.10	Prover9 (32) version 2009-11A, November 2009.
0.42/1.10	Process 1572 was started by sandbox on n022.cluster.edu,
0.42/1.10	Thu Aug 29 09:05:59 2019
0.42/1.10	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 180 -f /tmp/Prover9_1257_n022.cluster.edu".
0.42/1.10	============================== end of head ===========================
0.42/1.10	
0.42/1.10	============================== INPUT =================================
0.42/1.10	
0.42/1.10	% Reading from file /tmp/Prover9_1257_n022.cluster.edu
0.42/1.10	
0.42/1.10	set(prolog_style_variables).
0.42/1.10	set(auto2).
0.42/1.10	    % set(auto2) -> set(auto).
0.42/1.10	    % set(auto) -> set(auto_inference).
0.42/1.10	    % set(auto) -> set(auto_setup).
0.42/1.10	    % set(auto_setup) -> set(predicate_elim).
0.42/1.10	    % set(auto_setup) -> assign(eq_defs, unfold).
0.42/1.10	    % set(auto) -> set(auto_limits).
0.42/1.10	    % set(auto_limits) -> assign(max_weight, "100.000").
0.42/1.10	    % set(auto_limits) -> assign(sos_limit, 20000).
0.42/1.10	    % set(auto) -> set(auto_denials).
0.42/1.10	    % set(auto) -> set(auto_process).
0.42/1.10	    % set(auto2) -> assign(new_constants, 1).
0.42/1.10	    % set(auto2) -> assign(fold_denial_max, 3).
0.42/1.10	    % set(auto2) -> assign(max_weight, "200.000").
0.42/1.10	    % set(auto2) -> assign(max_hours, 1).
0.42/1.10	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.42/1.10	    % set(auto2) -> assign(max_seconds, 0).
0.42/1.10	    % set(auto2) -> assign(max_minutes, 5).
0.42/1.10	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.42/1.10	    % set(auto2) -> set(sort_initial_sos).
0.42/1.10	    % set(auto2) -> assign(sos_limit, -1).
0.42/1.10	    % set(auto2) -> assign(lrs_ticks, 3000).
0.42/1.10	    % set(auto2) -> assign(max_megs, 400).
0.42/1.10	    % set(auto2) -> assign(stats, some).
0.42/1.10	    % set(auto2) -> clear(echo_input).
0.42/1.10	    % set(auto2) -> set(quiet).
0.42/1.10	    % set(auto2) -> clear(print_initial_clauses).
0.42/1.10	    % set(auto2) -> clear(print_given).
0.42/1.10	assign(lrs_ticks,-1).
0.42/1.10	assign(sos_limit,10000).
0.42/1.10	assign(order,kbo).
0.42/1.10	set(lex_order_vars).
0.42/1.10	clear(print_given).
0.42/1.10	
0.42/1.10	% formulas(sos).  % not echoed (12 formulas)
0.42/1.10	
0.42/1.10	============================== end of input ==========================
0.42/1.10	
0.42/1.10	% From the command line: assign(max_seconds, 180).
0.42/1.10	
0.42/1.10	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.42/1.10	
0.42/1.10	% Formulas that are not ordinary clauses:
0.42/1.10	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.42/1.10	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.42/1.10	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.42/1.10	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.42/1.10	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.42/1.10	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.42/1.10	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.42/1.10	8 (exists Y24 all X19 (Y24 = X19 & r1(X19) | -r1(X19) & X19 != Y24)) # label(axiom_1) # label(axiom) # label(non_clause).  [assumption].
0.42/1.10	9 (all X7 all Y10 (-r2(X7,Y10) | (all Y20 (Y10 != Y20 | -r1(Y20))))) # label(axiom_7a) # label(axiom) # label(non_clause).  [assumption].
0.42/1.10	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.42/1.10	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.42/1.10	12 -(exists Y1 ((exists Y2 ((exists Y5 (r2(Y5,Y2) & r1(Y5))) & (exists Y4 (r3(Y4,Y2,Y1) & r1(Y4))))) & (exists Y3 (Y3 = Y1 & (exists Y6 (r1(Y6) & r2(Y6,Y3))))))) # label(zeroplusoneeqone) # label(negated_conjecture) # label(non_clause).  [assumption].
0.42/1.15	
0.42/1.15	============================== end of process non-clausal formulas ===
0.42/1.15	
0.42/1.15	============================== PROCESS INITIAL CLAUSES ===============
0.42/1.15	
0.42/1.15	============================== PREDICATE ELIMINATION =================
0.42/1.15	13 -r2(A,B) | -r1(A) | -r3(C,B,D) | -r1(C) | E != D | -r1(F) | -r2(F,E) # label(zeroplusoneeqone) # label(negated_conjecture).  [clausify(12)].
0.42/1.15	14 r3(A,B,f2(A,B)) # label(axiom_1a) # label(axiom).  [clausify(1)].
0.42/1.15	15 r3(A,f19(A),f18(A)) # label(axiom_4a) # label(axiom).  [clausify(11)].
0.42/1.15	16 r3(A,f4(A,B),f3(A,B)) # label(axiom_1a) # label(axiom).  [clausify(1)].
0.42/1.15	17 r3(f10(A,B),A,f9(A,B)) # label(axiom_2a) # label(axiom).  [clausify(4)].
0.42/1.15	Derived: -r2(A,B) | -r1(A) | -r1(C) | D != f2(C,B) | -r1(E) | -r2(E,D).  [resolve(13,c,14,a)].
0.42/1.15	Derived: -r2(A,f19(B)) | -r1(A) | -r1(B) | C != f18(B) | -r1(D) | -r2(D,C).  [resolve(13,c,15,a)].
0.42/1.15	Derived: -r2(A,f4(B,C)) | -r1(A) | -r1(B) | D != f3(B,C) | -r1(E) | -r2(E,D).  [resolve(13,c,16,a)].
0.42/1.15	Derived: -r2(A,B) | -r1(A) | -r1(f10(B,C)) | D != f9(B,C) | -r1(E) | -r2(E,D).  [resolve(13,c,17,a)].
0.42/1.15	18 r3(A,B,C) | C != f14(A,B) # label(axiom_3) # label(axiom).  [clausify(6)].
0.42/1.15	Derived: A != f14(B,C) | -r2(D,C) | -r1(D) | -r1(B) | E != A | -r1(F) | -r2(F,E).  [resolve(18,a,13,c)].
0.42/1.15	19 A = f14(B,C) | -r3(B,C,A) # label(axiom_3) # label(axiom).  [clausify(6)].
0.42/1.15	Derived: f2(A,B) = f14(A,B).  [resolve(19,b,14,a)].
0.42/1.15	Derived: f18(A) = f14(A,f19(A)).  [resolve(19,b,15,a)].
0.42/1.15	Derived: f3(A,B) = f14(A,f4(A,B)).  [resolve(19,b,16,a)].
0.42/1.15	Derived: f9(A,B) = f14(f10(A,B),A).  [resolve(19,b,17,a)].
0.42/1.15	20 A = f5(B,C) | -r4(B,C,A) # label(axiom_4) # label(axiom).  [clausify(2)].
0.42/1.15	21 r4(A,B,f10(A,B)) # label(axiom_2a) # label(axiom).  [clausify(4)].
0.42/1.15	22 r4(A,f16(A),f15(A)) # label(axiom_5a) # label(axiom).  [clausify(10)].
0.42/1.15	23 r4(A,f12(A,B),f11(A,B)) # label(axiom_2a) # label(axiom).  [clausify(4)].
0.42/1.15	Derived: f10(A,B) = f5(A,B).  [resolve(20,b,21,a)].
0.42/1.15	Derived: f15(A) = f5(A,f16(A)).  [resolve(20,b,22,a)].
0.42/1.15	Derived: f11(A,B) = f5(A,f12(A,B)).  [resolve(20,b,23,a)].
0.42/1.15	24 r4(A,B,C) | C != f5(A,B) # label(axiom_4) # label(axiom).  [clausify(2)].
0.42/1.15	
0.42/1.15	============================== end predicate elimination =============
0.42/1.15	
0.42/1.15	Auto_denials:  (non-Horn, no changes).
0.42/1.15	
0.42/1.15	Term ordering decisions:
0.42/1.15	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.
0.42/1.15	
0.42/1.15	============================== end of process initial clauses ========
0.42/1.15	
0.42/1.15	============================== CLAUSES FOR SEARCH ====================
0.42/1.15	
0.42/1.15	============================== end of clauses for search =============
0.42/1.15	
0.42/1.15	============================== SEARCH ================================
0.42/1.15	
0.42/1.15	% Starting search at 0.02 seconds.
0.42/1.15	
0.42/1.15	============================== PROOF =================================
0.42/1.15	% SZS status Theorem
0.42/1.15	% SZS output start Refutation
0.42/1.15	
0.42/1.15	% Proof 1 at 0.06 (+ 0.00) seconds.
0.42/1.15	% Length of proof is 44.
0.42/1.15	% Level of proof is 8.
0.42/1.15	% Maximum clause weight is 20.000.
0.42/1.15	% Given clauses 56.
0.42/1.15	
0.42/1.15	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.42/1.15	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.42/1.15	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.42/1.15	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.42/1.15	8 (exists Y24 all X19 (Y24 = X19 & r1(X19) | -r1(X19) & X19 != Y24)) # label(axiom_1) # label(axiom) # label(non_clause).  [assumption].
0.42/1.15	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.42/1.15	12 -(exists Y1 ((exists Y2 ((exists Y5 (r2(Y5,Y2) & r1(Y5))) & (exists Y4 (r3(Y4,Y2,Y1) & r1(Y4))))) & (exists Y3 (Y3 = Y1 & (exists Y6 (r1(Y6) & r2(Y6,Y3))))))) # label(zeroplusoneeqone) # label(negated_conjecture) # label(non_clause).  [assumption].
0.42/1.15	13 -r2(A,B) | -r1(A) | -r3(C,B,D) | -r1(C) | E != D | -r1(F) | -r2(F,E) # label(zeroplusoneeqone) # label(negated_conjecture).  [clausify(12)].
0.42/1.15	14 r3(A,B,f2(A,B)) # label(axiom_1a) # label(axiom).  [clausify(1)].
0.42/1.15	15 r3(A,f19(A),f18(A)) # label(axiom_4a) # label(axiom).  [clausify(11)].
0.42/1.15	16 r3(A,f4(A,B),f3(A,B)) # label(axiom_1a) # label(axiom).  [clausify(1)].
0.42/1.15	18 r3(A,B,C) | C != f14(A,B) # label(axiom_3) # label(axiom).  [clausify(6)].
0.42/1.15	19 A = f14(B,C) | -r3(B,C,A) # label(axiom_3) # label(axiom).  [clausify(6)].
0.42/1.15	27 r1(f19(A)) # label(axiom_4a) # label(axiom).  [clausify(11)].
0.42/1.15	28 f18(A) = A # label(axiom_4a) # label(axiom).  [clausify(11)].
0.42/1.15	29 r2(A,f4(B,A)) # label(axiom_1a) # label(axiom).  [clausify(1)].
0.42/1.15	30 r2(A,f12(B,A)) # label(axiom_2a) # label(axiom).  [clausify(4)].
0.42/1.15	32 r2(f2(A,B),f1(A,B)) # label(axiom_1a) # label(axiom).  [clausify(1)].
0.42/1.15	33 f3(A,B) = f1(A,B) # label(axiom_1a) # label(axiom).  [clausify(1)].
0.42/1.15	40 A = c1 | -r1(A) # label(axiom_1) # label(axiom).  [clausify(8)].
0.42/1.15	41 c1 = A | -r1(A).  [copy(40),flip(a)].
0.42/1.15	44 -r2(A,B) | B = f13(A) # label(axiom_2) # label(axiom).  [clausify(5)].
0.42/1.15	45 -r2(A,B) | f13(A) = B.  [copy(44),flip(b)].
0.42/1.15	57 A != f14(B,C) | -r2(D,C) | -r1(D) | -r1(B) | E != A | -r1(F) | -r2(F,E).  [resolve(18,a,13,c)].
0.42/1.15	58 f14(A,B) != C | -r2(D,B) | -r1(D) | -r1(A) | E != C | -r1(F) | -r2(F,E).  [copy(57),flip(a)].
0.42/1.15	59 f2(A,B) = f14(A,B).  [resolve(19,b,14,a)].
0.42/1.15	60 f18(A) = f14(A,f19(A)).  [resolve(19,b,15,a)].
0.42/1.15	61 f14(A,f19(A)) = A.  [copy(60),rewrite([28(1)]),flip(a)].
0.42/1.15	62 f3(A,B) = f14(A,f4(A,B)).  [resolve(19,b,16,a)].
0.42/1.15	63 f14(A,f4(A,B)) = f1(A,B).  [copy(62),rewrite([33(1)]),flip(a)].
0.42/1.15	86 -r2(A,B) | -r1(A) | -r1(C) | -r1(D) | -r2(D,f14(C,B)).  [factor(58,a,e),xx(a)].
0.42/1.15	92 r2(f14(A,B),f1(A,B)).  [back_rewrite(32),rewrite([59(1)])].
0.42/1.15	105 -r2(A,B) | -r1(A) | -r1(C) | -r2(C,f14(A,B)).  [factor(86,b,c)].
0.42/1.15	110 -r2(A,B) | -r1(A) | -r2(A,f14(A,B)).  [factor(105,b,c)].
0.42/1.15	125 f19(A) = c1.  [resolve(41,b,27,a),flip(a)].
0.42/1.15	130 f14(A,c1) = A.  [back_rewrite(61),rewrite([125(1)])].
0.42/1.15	131 r1(c1).  [back_rewrite(27),rewrite([125(1)])].
0.42/1.15	137 f12(A,B) = f13(B).  [resolve(45,a,30,a),flip(a)].
0.42/1.15	138 f4(A,B) = f13(B).  [resolve(45,a,29,a),flip(a)].
0.42/1.15	152 r2(A,f13(A)).  [back_rewrite(30),rewrite([137(1)])].
0.42/1.15	159 f14(A,f13(B)) = f1(A,B).  [back_rewrite(63),rewrite([138(1)])].
0.42/1.15	298 -r2(c1,f1(c1,c1)).  [ur(110,a,152,a,b,131,a),rewrite([159(5)])].
0.42/1.15	308 r2(A,f1(A,c1)).  [para(130(a,1),92(a,1))].
0.42/1.15	309 $F.  [resolve(308,a,298,a)].
0.42/1.15	
0.42/1.15	% SZS output end Refutation
0.42/1.15	============================== end of proof ==========================
0.42/1.15	
0.42/1.15	============================== STATISTICS ============================
0.42/1.15	
0.42/1.15	Given=56. Generated=791. Kept=272. proofs=1.
0.42/1.15	Usable=51. Sos=164. Demods=19. Limbo=0, Disabled=100. Hints=0.
0.42/1.15	Megabytes=0.30.
0.42/1.15	User_CPU=0.06, System_CPU=0.00, Wall_clock=0.
0.42/1.15	
0.42/1.15	============================== end of statistics =====================
0.42/1.15	
0.42/1.15	============================== end of search =========================
0.42/1.15	
0.42/1.15	THEOREM PROVED
0.42/1.15	% SZS status Theorem
0.42/1.15	
0.42/1.15	Exiting with 1 proof.
0.42/1.15	
0.42/1.15	Process 1572 exit (max_proofs) Thu Aug 29 09:05:59 2019
0.42/1.15	Prover9 interrupted
0.42/1.15	EOF