0.12/0.12	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.12/0.13	% Command  : tptp2X_and_run_prover9 %d %s
0.13/0.34	% Computer : n012.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 : 1440
0.13/0.34	% WCLimit  : 180
0.13/0.34	% DateTime : Mon Jul  3 03:19:37 EDT 2023
0.13/0.34	% CPUTime  : 
0.44/1.02	============================== Prover9 ===============================
0.44/1.02	Prover9 (32) version 2009-11A, November 2009.
0.44/1.02	Process 30888 was started by sandbox2 on n012.cluster.edu,
0.44/1.02	Mon Jul  3 03:19:38 2023
0.44/1.02	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1440 -f /tmp/Prover9_30648_n012.cluster.edu".
0.44/1.02	============================== end of head ===========================
0.44/1.02	
0.44/1.02	============================== INPUT =================================
0.44/1.02	
0.44/1.02	% Reading from file /tmp/Prover9_30648_n012.cluster.edu
0.44/1.02	
0.44/1.02	set(prolog_style_variables).
0.44/1.02	set(auto2).
0.44/1.02	    % set(auto2) -> set(auto).
0.44/1.02	    % set(auto) -> set(auto_inference).
0.44/1.02	    % set(auto) -> set(auto_setup).
0.44/1.02	    % set(auto_setup) -> set(predicate_elim).
0.44/1.02	    % set(auto_setup) -> assign(eq_defs, unfold).
0.44/1.02	    % set(auto) -> set(auto_limits).
0.44/1.02	    % set(auto_limits) -> assign(max_weight, "100.000").
0.44/1.02	    % set(auto_limits) -> assign(sos_limit, 20000).
0.44/1.02	    % set(auto) -> set(auto_denials).
0.44/1.02	    % set(auto) -> set(auto_process).
0.44/1.02	    % set(auto2) -> assign(new_constants, 1).
0.44/1.02	    % set(auto2) -> assign(fold_denial_max, 3).
0.44/1.02	    % set(auto2) -> assign(max_weight, "200.000").
0.44/1.02	    % set(auto2) -> assign(max_hours, 1).
0.44/1.02	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.44/1.02	    % set(auto2) -> assign(max_seconds, 0).
0.44/1.02	    % set(auto2) -> assign(max_minutes, 5).
0.44/1.02	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.44/1.02	    % set(auto2) -> set(sort_initial_sos).
0.44/1.02	    % set(auto2) -> assign(sos_limit, -1).
0.44/1.02	    % set(auto2) -> assign(lrs_ticks, 3000).
0.44/1.02	    % set(auto2) -> assign(max_megs, 400).
0.44/1.02	    % set(auto2) -> assign(stats, some).
0.44/1.02	    % set(auto2) -> clear(echo_input).
0.44/1.02	    % set(auto2) -> set(quiet).
0.44/1.02	    % set(auto2) -> clear(print_initial_clauses).
0.44/1.02	    % set(auto2) -> clear(print_given).
0.44/1.02	assign(lrs_ticks,-1).
0.44/1.02	assign(sos_limit,10000).
0.44/1.02	assign(order,kbo).
0.44/1.02	set(lex_order_vars).
0.44/1.02	clear(print_given).
0.44/1.02	
0.44/1.02	% formulas(sos).  % not echoed (19 formulas)
0.44/1.02	
0.44/1.02	============================== end of input ==========================
0.44/1.02	
0.44/1.02	% From the command line: assign(max_seconds, 1440).
0.44/1.02	
0.44/1.02	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.44/1.02	
0.44/1.02	% Formulas that are not ordinary clauses:
0.44/1.02	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.44/1.02	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.44/1.02	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.44/1.02	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.44/1.02	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.44/1.02	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.44/1.02	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.44/1.02	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.44/1.02	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.44/1.02	10 (all X20 id(X20,X20)) # label(axiom_5) # label(axiom) # label(non_clause).  [assumption].
0.44/1.02	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.44/1.02	12 (exists Y24 all X19 (r1(X19) & id(X19,Y24) | -r1(X19) & -id(X19,Y24))) # label(axiom_1) # label(axiom) # label(non_clause).  [assumption].
14.46/14.76	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].
14.46/14.76	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].
14.46/14.76	15 (all X21 all X22 (-id(X21,X22) | id(X22,X21))) # label(axiom_6) # label(axiom) # label(non_clause).  [assumption].
14.46/14.76	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].
14.46/14.76	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].
14.46/14.76	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].
14.46/14.76	19 -(all X1 exists Y2 exists Y1 ((exists Y3 (r3(X1,Y1,Y3) & id(Y3,Y2))) & (all Y4 (-r1(Y4) | -id(Y1,Y4))))) # label(infiniteNumbersid) # label(negated_conjecture) # label(non_clause).  [assumption].
14.46/14.76	
14.46/14.76	============================== end of process non-clausal formulas ===
14.46/14.76	
14.46/14.76	============================== PROCESS INITIAL CLAUSES ===============
14.46/14.76	
14.46/14.76	============================== PREDICATE ELIMINATION =================
14.46/14.76	
14.46/14.76	============================== end predicate elimination =============
14.46/14.76	
14.46/14.76	Auto_denials:  (non-Horn, no changes).
14.46/14.76	
14.46/14.76	Term ordering decisions:
14.46/14.76	Function symbol KB weights:  c1=1. c2=1. f4=1. f5=1. f6=1. f7=1. f8=1. f9=1. f10=1. f11=1. f12=1. f19=1. f20=1. f1=1. f2=1. f3=1. f13=1. f14=1. f15=1. f16=1. f17=1. f18=1.
14.46/14.76	
14.46/14.76	============================== end of process initial clauses ========
14.46/14.76	
14.46/14.76	============================== CLAUSES FOR SEARCH ====================
14.46/14.76	
14.46/14.76	============================== end of clauses for search =============
14.46/14.76	
14.46/14.76	============================== SEARCH ================================
14.46/14.76	
14.46/14.76	% Starting search at 0.01 seconds.
14.46/14.76	
14.46/14.76	Low Water (keep): wt=10.000, iters=3441
14.46/14.76	
14.46/14.76	Low Water (keep): wt=9.000, iters=3334
14.46/14.76	
14.46/14.76	============================== PROOF =================================
14.46/14.76	% SZS status Theorem
14.46/14.76	% SZS output start Refutation
14.46/14.76	
14.46/14.76	% Proof 1 at 13.59 (+ 0.17) seconds.
14.46/14.76	% Length of proof is 24.
14.46/14.76	% Level of proof is 5.
14.46/14.76	% Maximum clause weight is 12.000.
14.46/14.76	% Given clauses 702.
14.46/14.76	
14.46/14.76	2 (all X7 all Y10 (-r2(X7,Y10) | (all Y20 (-r1(Y20) | -id(Y20,Y10))))) # label(axiom_7a) # label(axiom) # label(non_clause).  [assumption].
14.46/14.76	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].
14.46/14.76	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].
14.46/14.76	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].
14.46/14.76	10 (all X20 id(X20,X20)) # label(axiom_5) # label(axiom) # label(non_clause).  [assumption].
14.46/14.76	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].
14.46/14.76	19 -(all X1 exists Y2 exists Y1 ((exists Y3 (r3(X1,Y1,Y3) & id(Y3,Y2))) & (all Y4 (-r1(Y4) | -id(Y1,Y4))))) # label(infiniteNumbersid) # label(negated_conjecture) # label(non_clause).  [assumption].
14.46/14.76	22 id(A,A) # label(axiom_5) # label(axiom).  [clausify(10)].
14.46/14.76	28 r3(A,B,f5(A,B)) # label(axiom_1a) # label(axiom).  [clausify(4)].
14.46/14.76	42 -r2(A,B) | -r1(C) | -id(C,B) # label(axiom_7a) # label(axiom).  [clausify(2)].
14.46/14.76	47 r1(A) | -r1(B) | -id(A,B) # label(axiom_8) # label(axiom).  [clausify(3)].
14.46/14.76	49 -id(A,f16(B)) | r2(B,A) # label(axiom_2) # label(axiom).  [clausify(11)].
14.46/14.76	50 id(A,f12(B,C)) | -r3(B,C,A) # label(axiom_3) # label(axiom).  [clausify(6)].
14.46/14.76	55 -r3(c2,A,B) | -id(B,C) | r1(f20(C,A)) # label(infiniteNumbersid) # label(negated_conjecture).  [clausify(19)].
14.46/14.76	59 -r3(c2,A,B) | -id(B,C) | id(A,f20(C,A)) # label(infiniteNumbersid) # label(negated_conjecture).  [clausify(19)].
14.46/14.76	131 r2(A,f16(A)).  [resolve(49,a,22,a)].
14.46/14.76	135 id(f5(A,B),f12(A,B)).  [resolve(50,b,28,a)].
14.46/14.76	158 -id(f5(c2,A),B) | r1(f20(B,A)).  [resolve(55,a,28,a)].
14.46/14.76	181 -id(f5(c2,A),B) | id(A,f20(B,A)).  [resolve(59,a,28,a)].
14.46/14.76	334 -r1(f16(A)).  [ur(42,a,131,a,c,22,a)].
14.46/14.76	5423 r1(f20(f12(c2,A),A)).  [resolve(158,a,135,a)].
14.46/14.76	5821 -id(f16(A),f20(f12(c2,B),B)).  [ur(47,a,334,a,b,5423,a)].
14.46/14.76	6968 id(A,f20(f12(c2,A),A)).  [resolve(181,a,135,a)].
14.46/14.76	6969 $F.  [resolve(6968,a,5821,a)].
14.46/14.76	
14.46/14.76	% SZS output end Refutation
14.46/14.76	============================== end of proof ==========================
14.46/14.76	
14.46/14.76	============================== STATISTICS ============================
14.46/14.76	
14.46/14.76	Given=702. Generated=328064. Kept=6949. proofs=1.
14.46/14.76	Usable=698. Sos=5954. Demods=0. Limbo=2, Disabled=338. Hints=0.
14.46/14.76	Megabytes=4.31.
14.46/14.76	User_CPU=13.59, System_CPU=0.17, Wall_clock=13.
14.46/14.76	
14.46/14.76	============================== end of statistics =====================
14.46/14.76	
14.46/14.76	============================== end of search =========================
14.46/14.76	
14.46/14.76	THEOREM PROVED
14.46/14.76	% SZS status Theorem
14.46/14.76	
14.46/14.76	Exiting with 1 proof.
14.46/14.76	
14.46/14.76	Process 30888 exit (max_proofs) Mon Jul  3 03:19:51 2023
14.46/14.76	Prover9 interrupted
14.52/14.77	EOF