0.04/0.11	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.04/0.12	% Command  : tptp2X_and_run_prover9 %d %s
0.12/0.33	% Computer : n009.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:43:11 EDT 2023
0.12/0.33	% CPUTime  : 
0.42/1.06	============================== Prover9 ===============================
0.42/1.06	Prover9 (32) version 2009-11A, November 2009.
0.42/1.06	Process 9529 was started by sandbox2 on n009.cluster.edu,
0.42/1.06	Mon Jul  3 03:43:12 2023
0.42/1.06	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1440 -f /tmp/Prover9_9216_n009.cluster.edu".
0.42/1.06	============================== end of head ===========================
0.42/1.06	
0.42/1.06	============================== INPUT =================================
0.42/1.06	
0.42/1.06	% Reading from file /tmp/Prover9_9216_n009.cluster.edu
0.42/1.06	
0.42/1.06	set(prolog_style_variables).
0.42/1.06	set(auto2).
0.42/1.06	    % set(auto2) -> set(auto).
0.42/1.06	    % set(auto) -> set(auto_inference).
0.42/1.06	    % set(auto) -> set(auto_setup).
0.42/1.06	    % set(auto_setup) -> set(predicate_elim).
0.42/1.06	    % set(auto_setup) -> assign(eq_defs, unfold).
0.42/1.06	    % set(auto) -> set(auto_limits).
0.42/1.06	    % set(auto_limits) -> assign(max_weight, "100.000").
0.42/1.06	    % set(auto_limits) -> assign(sos_limit, 20000).
0.42/1.06	    % set(auto) -> set(auto_denials).
0.42/1.06	    % set(auto) -> set(auto_process).
0.42/1.06	    % set(auto2) -> assign(new_constants, 1).
0.42/1.06	    % set(auto2) -> assign(fold_denial_max, 3).
0.42/1.06	    % set(auto2) -> assign(max_weight, "200.000").
0.42/1.06	    % set(auto2) -> assign(max_hours, 1).
0.42/1.06	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.42/1.06	    % set(auto2) -> assign(max_seconds, 0).
0.42/1.06	    % set(auto2) -> assign(max_minutes, 5).
0.42/1.06	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.42/1.06	    % set(auto2) -> set(sort_initial_sos).
0.42/1.06	    % set(auto2) -> assign(sos_limit, -1).
0.42/1.06	    % set(auto2) -> assign(lrs_ticks, 3000).
0.42/1.06	    % set(auto2) -> assign(max_megs, 400).
0.42/1.06	    % set(auto2) -> assign(stats, some).
0.42/1.06	    % set(auto2) -> clear(echo_input).
0.42/1.06	    % set(auto2) -> set(quiet).
0.42/1.06	    % set(auto2) -> clear(print_initial_clauses).
0.42/1.06	    % set(auto2) -> clear(print_given).
0.42/1.06	assign(lrs_ticks,-1).
0.42/1.06	assign(sos_limit,10000).
0.42/1.06	assign(order,kbo).
0.42/1.06	set(lex_order_vars).
0.42/1.06	clear(print_given).
0.42/1.06	
0.42/1.06	% formulas(sos).  % not echoed (19 formulas)
0.42/1.06	
0.42/1.06	============================== end of input ==========================
0.42/1.06	
0.42/1.06	% From the command line: assign(max_seconds, 1440).
0.42/1.06	
0.42/1.06	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.42/1.07	
0.42/1.07	% Formulas that are not ordinary clauses:
0.42/1.07	1 (all X6 ((exists Y1 exists Y11 (r2(Y1,Y11) & id(X6,Y11))) | (exists Y19 (id(X6,Y19) & r1(Y19))))) # label(axiom_6a) # label(axiom) # label(non_clause).  [assumption].
0.42/1.07	2 (all X7 all Y10 (-r2(X7,Y10) | (all Y20 (-r1(Y20) | -id(Y20,Y10))))) # label(axiom_7a) # label(axiom) # label(non_clause).  [assumption].
0.42/1.07	3 (all X26 all X27 (r1(X27) & r1(X26) | -r1(X26) & -r1(X27) | -id(X26,X27))) # label(axiom_8) # label(axiom) # label(non_clause).  [assumption].
0.42/1.07	4 (all X1 all X8 exists Y4 ((exists Y7 (r3(X1,X8,Y7) & r2(Y7,Y4))) & (exists Y5 (id(Y5,Y4) & (exists Y15 (r2(X8,Y15) & r3(X1,Y15,Y5))))))) # label(axiom_1a) # label(axiom) # label(non_clause).  [assumption].
0.42/1.07	5 (all X2 all X9 exists Y2 ((exists Y6 (r3(Y6,X2,Y2) & r4(X2,X9,Y6))) & (exists Y3 ((exists Y14 (r4(X2,Y14,Y3) & r2(X9,Y14))) & id(Y3,Y2))))) # label(axiom_2a) # label(axiom) # label(non_clause).  [assumption].
0.42/1.07	6 (all X13 all X14 exists Y22 all X15 (id(X15,Y22) & r3(X13,X14,X15) | -r3(X13,X14,X15) & -id(X15,Y22))) # label(axiom_3) # label(axiom) # label(non_clause).  [assumption].
0.42/1.07	7 (all X5 exists Y8 ((exists Y18 (r1(Y18) & id(Y8,Y18))) & (exists Y17 (r1(Y17) & r4(X5,Y17,Y8))))) # label(axiom_5a) # label(axiom) # label(non_clause).  [assumption].
0.42/1.07	8 (all X32 all X33 all X34 all X35 all X36 all X37 (r3(X32,X33,X34) & r3(X35,X36,X37) | -r3(X32,X33,X34) & -r3(X35,X36,X37) | -id(X34,X37) | -id(X33,X36) | -id(X32,X35))) # label(axiom_10) # label(axiom) # label(non_clause).  [assumption].
0.42/1.07	9 (all X3 all X10 ((all Y12 ((all Y13 (-id(Y13,Y12) | -r2(X3,Y13))) | -r2(X10,Y12))) | id(X3,X10))) # label(axiom_3a) # label(axiom) # label(non_clause).  [assumption].
0.42/1.07	10 (all X20 id(X20,X20)) # label(axiom_5) # label(axiom) # label(non_clause).  [assumption].
0.42/1.07	11 (all X11 exists Y21 all X12 (-r2(X11,X12) & -id(X12,Y21) | id(X12,Y21) & r2(X11,X12))) # label(axiom_2) # label(axiom) # label(non_clause).  [assumption].
0.42/1.07	12 (exists Y24 all X19 (r1(X19) & id(X19,Y24) | -r1(X19) & -id(X19,Y24))) # label(axiom_1) # label(axiom) # label(non_clause).  [assumption].
0.81/1.07	13 (all X4 exists Y9 (id(Y9,X4) & (exists Y16 (r1(Y16) & r3(X4,Y16,Y9))))) # label(axiom_4a) # label(axiom) # label(non_clause).  [assumption].
0.81/1.07	14 (all X38 all X39 all X40 all X41 all X42 all X43 (-id(X38,X41) | -id(X40,X43) | r4(X38,X39,X40) & r4(X41,X42,X43) | -r4(X41,X42,X43) & -r4(X38,X39,X40) | -id(X39,X42))) # label(axiom_11) # label(axiom) # label(non_clause).  [assumption].
0.81/1.07	15 (all X21 all X22 (-id(X21,X22) | id(X22,X21))) # label(axiom_6) # label(axiom) # label(non_clause).  [assumption].
0.81/1.07	16 (all X28 all X29 all X30 all X31 (-id(X29,X31) | r2(X30,X31) & r2(X28,X29) | -r2(X28,X29) & -r2(X30,X31) | -id(X28,X30))) # label(axiom_9) # label(axiom) # label(non_clause).  [assumption].
0.81/1.07	17 (all X23 all X24 all X25 (-id(X23,X24) | id(X23,X25) | -id(X24,X25))) # label(axiom_7) # label(axiom) # label(non_clause).  [assumption].
0.81/1.07	18 (all X16 all X17 exists Y23 all X18 (-id(X18,Y23) & -r4(X16,X17,X18) | r4(X16,X17,X18) & id(X18,Y23))) # label(axiom_4) # label(axiom) # label(non_clause).  [assumption].
0.81/1.07	19 -(exists Y1 exists Y2 exists Y3 (r3(Y1,Y2,Y3) & (exists Y4 ((exists Y5 (r2(Y5,Y4) & (exists Y6 (r2(Y6,Y5) & (exists Y7 (r2(Y7,Y6) & r1(Y7))))))) & id(Y3,Y4))))) # label(xplusyidthree) # label(negated_conjecture) # label(non_clause).  [assumption].
0.81/1.07	
0.81/1.07	============================== end of process non-clausal formulas ===
0.81/1.07	
0.81/1.07	============================== PROCESS INITIAL CLAUSES ===============
0.81/1.07	
0.81/1.07	============================== PREDICATE ELIMINATION =================
0.81/1.07	
0.81/1.07	============================== end predicate elimination =============
0.81/1.07	
0.81/1.07	Auto_denials:  (non-Horn, no changes).
0.81/1.07	
0.81/1.07	Term ordering decisions:
0.81/1.07	Function symbol KB weights:  c1=1. f4=1. f5=1. f6=1. f7=1. f8=1. f9=1. f10=1. f11=1. f12=1. f19=1. f1=1. f2=1. f3=1. f13=1. f14=1. f15=1. f16=1. f17=1. f18=1.
0.81/1.07	
0.81/1.07	============================== end of process initial clauses ========
0.81/1.07	
0.81/1.07	============================== CLAUSES FOR SEARCH ====================
0.81/1.07	
0.81/1.07	============================== end of clauses for search =============
0.81/1.07	
0.81/1.07	============================== SEARCH ================================
0.81/1.07	
0.81/1.07	% Starting search at 0.01 seconds.
0.81/1.07	
0.81/1.07	============================== PROOF =================================
0.81/1.07	% SZS status Theorem
0.81/1.07	% SZS output start Refutation
0.81/1.07	
0.81/1.07	% Proof 1 at 0.01 (+ 0.01) seconds.
0.81/1.07	% Length of proof is 10.
0.81/1.07	% Level of proof is 3.
0.81/1.07	% Maximum clause weight is 18.000.
0.81/1.07	% Given clauses 24.
0.81/1.07	
0.81/1.07	5 (all X2 all X9 exists Y2 ((exists Y6 (r3(Y6,X2,Y2) & r4(X2,X9,Y6))) & (exists Y3 ((exists Y14 (r4(X2,Y14,Y3) & r2(X9,Y14))) & id(Y3,Y2))))) # label(axiom_2a) # label(axiom) # label(non_clause).  [assumption].
0.81/1.07	13 (all X4 exists Y9 (id(Y9,X4) & (exists Y16 (r1(Y16) & r3(X4,Y16,Y9))))) # label(axiom_4a) # label(axiom) # label(non_clause).  [assumption].
0.81/1.07	19 -(exists Y1 exists Y2 exists Y3 (r3(Y1,Y2,Y3) & (exists Y4 ((exists Y5 (r2(Y5,Y4) & (exists Y6 (r2(Y6,Y5) & (exists Y7 (r2(Y7,Y6) & r1(Y7))))))) & id(Y3,Y4))))) # label(xplusyidthree) # label(negated_conjecture) # label(non_clause).  [assumption].
0.81/1.07	23 r1(f18(A)) # label(axiom_4a) # label(axiom).  [clausify(13)].
0.81/1.07	24 id(f17(A),A) # label(axiom_4a) # label(axiom).  [clausify(13)].
0.81/1.07	26 r2(A,f11(B,A)) # label(axiom_2a) # label(axiom).  [clausify(5)].
0.81/1.07	31 r3(A,f18(A),f17(A)) # label(axiom_4a) # label(axiom).  [clausify(13)].
0.81/1.07	43 -r3(A,B,C) | -r2(D,E) | -r2(F,D) | -r2(V6,F) | -r1(V6) | -id(C,E) # label(xplusyidthree) # label(negated_conjecture).  [clausify(19)].
0.81/1.07	113 -r3(A,B,f17(f11(C,f11(D,f11(E,f18(F)))))).  [ur(43,b,26,a,c,26,a,d,26,a,e,23,a,f,24,a)].
0.81/1.07	114 $F.  [resolve(113,a,31,a)].
0.81/1.07	
0.81/1.07	% SZS output end Refutation
0.81/1.07	============================== end of proof ==========================
0.81/1.07	
0.81/1.07	============================== STATISTICS ============================
0.81/1.07	
0.81/1.07	Given=24. Generated=106. Kept=94. proofs=1.
0.81/1.07	Usable=24. Sos=65. Demods=0. Limbo=4, Disabled=43. Hints=0.
0.81/1.07	Megabytes=0.16.
0.81/1.07	User_CPU=0.01, System_CPU=0.01, Wall_clock=0.
0.81/1.07	
0.81/1.07	============================== end of statistics =====================
0.81/1.07	
0.81/1.07	============================== end of search =========================
0.81/1.07	
0.81/1.07	THEOREM PROVED
0.81/1.07	% SZS status Theorem
0.81/1.07	
0.81/1.07	Exiting with 1 proof.
0.81/1.07	
0.81/1.07	Process 9529 exit (max_proofs) Mon Jul  3 03:43:12 2023
0.81/1.07	Prover9 interrupted
0.81/1.07	EOF