0.10/0.19	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.10/0.19	% Command    : tptp2X_and_run_prover9 %d %s
0.10/0.41	% Computer   : n010.cluster.edu
0.10/0.41	% Model      : x86_64 x86_64
0.10/0.41	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.10/0.41	% Memory     : 8042.1875MB
0.10/0.41	% OS         : Linux 3.10.0-693.el7.x86_64
0.10/0.41	% CPULimit   : 1200
0.10/0.41	% DateTime   : Tue Jul 13 11:39:51 EDT 2021
0.10/0.41	% CPUTime    : 
0.71/1.13	============================== Prover9 ===============================
0.71/1.13	Prover9 (32) version 2009-11A, November 2009.
0.71/1.13	Process 22178 was started by sandbox on n010.cluster.edu,
0.71/1.13	Tue Jul 13 11:39:52 2021
0.71/1.13	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1200 -f /tmp/Prover9_22024_n010.cluster.edu".
0.71/1.13	============================== end of head ===========================
0.71/1.13	
0.71/1.13	============================== INPUT =================================
0.71/1.13	
0.71/1.13	% Reading from file /tmp/Prover9_22024_n010.cluster.edu
0.71/1.13	
0.71/1.13	set(prolog_style_variables).
0.71/1.13	set(auto2).
0.71/1.13	    % set(auto2) -> set(auto).
0.71/1.13	    % set(auto) -> set(auto_inference).
0.71/1.13	    % set(auto) -> set(auto_setup).
0.71/1.13	    % set(auto_setup) -> set(predicate_elim).
0.71/1.13	    % set(auto_setup) -> assign(eq_defs, unfold).
0.71/1.13	    % set(auto) -> set(auto_limits).
0.71/1.13	    % set(auto_limits) -> assign(max_weight, "100.000").
0.71/1.13	    % set(auto_limits) -> assign(sos_limit, 20000).
0.71/1.13	    % set(auto) -> set(auto_denials).
0.71/1.13	    % set(auto) -> set(auto_process).
0.71/1.13	    % set(auto2) -> assign(new_constants, 1).
0.71/1.13	    % set(auto2) -> assign(fold_denial_max, 3).
0.71/1.13	    % set(auto2) -> assign(max_weight, "200.000").
0.71/1.13	    % set(auto2) -> assign(max_hours, 1).
0.71/1.13	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.71/1.13	    % set(auto2) -> assign(max_seconds, 0).
0.71/1.13	    % set(auto2) -> assign(max_minutes, 5).
0.71/1.13	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.71/1.13	    % set(auto2) -> set(sort_initial_sos).
0.71/1.13	    % set(auto2) -> assign(sos_limit, -1).
0.71/1.13	    % set(auto2) -> assign(lrs_ticks, 3000).
0.71/1.13	    % set(auto2) -> assign(max_megs, 400).
0.71/1.13	    % set(auto2) -> assign(stats, some).
0.71/1.13	    % set(auto2) -> clear(echo_input).
0.71/1.13	    % set(auto2) -> set(quiet).
0.71/1.13	    % set(auto2) -> clear(print_initial_clauses).
0.71/1.13	    % set(auto2) -> clear(print_given).
0.71/1.13	assign(lrs_ticks,-1).
0.71/1.13	assign(sos_limit,10000).
0.71/1.13	assign(order,kbo).
0.71/1.13	set(lex_order_vars).
0.71/1.13	clear(print_given).
0.71/1.13	
0.71/1.13	% formulas(sos).  % not echoed (19 formulas)
0.71/1.13	
0.71/1.13	============================== end of input ==========================
0.71/1.13	
0.71/1.13	% From the command line: assign(max_seconds, 1200).
0.71/1.13	
0.71/1.13	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.71/1.13	
0.71/1.13	% Formulas that are not ordinary clauses:
0.71/1.13	1 (all X32 all X33 all X34 all X35 all X36 all X37 (-id(X33,X36) | r3(X35,X36,X37) & r3(X32,X33,X34) | -r3(X32,X33,X34) & -r3(X35,X36,X37) | -id(X34,X37) | -id(X32,X35))) # label(axiom_10) # label(axiom) # label(non_clause).  [assumption].
0.71/1.13	2 (all X2 all X9 exists Y2 ((exists Y3 ((exists Y14 (r4(X2,Y14,Y3) & r2(X9,Y14))) & id(Y3,Y2))) & (exists Y6 (r3(Y6,X2,Y2) & r4(X2,X9,Y6))))) # label(axiom_2a) # label(axiom) # label(non_clause).  [assumption].
0.71/1.13	3 (all X20 id(X20,X20)) # label(axiom_5) # label(axiom) # label(non_clause).  [assumption].
0.71/1.13	4 (all X4 exists Y9 ((exists Y16 (r1(Y16) & r3(X4,Y16,Y9))) & id(Y9,X4))) # label(axiom_4a) # label(axiom) # label(non_clause).  [assumption].
0.71/1.13	5 (all X11 exists Y21 all X12 (id(X12,Y21) & r2(X11,X12) | -r2(X11,X12) & -id(X12,Y21))) # label(axiom_2) # label(axiom) # label(non_clause).  [assumption].
0.71/1.13	6 (all X26 all X27 (-id(X26,X27) | -r1(X26) & -r1(X27) | r1(X26) & r1(X27))) # label(axiom_8) # label(axiom) # label(non_clause).  [assumption].
0.71/1.13	7 (all X16 all X17 exists Y23 all X18 (-id(X18,Y23) & -r4(X16,X17,X18) | id(X18,Y23) & r4(X16,X17,X18))) # label(axiom_4) # label(axiom) # label(non_clause).  [assumption].
0.71/1.13	8 (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.71/1.13	9 (all X23 all X24 all X25 (-id(X24,X25) | id(X23,X25) | -id(X23,X24))) # label(axiom_7) # label(axiom) # label(non_clause).  [assumption].
0.71/1.13	10 (all X7 all Y10 (-r2(X7,Y10) | (all Y20 (-id(Y20,Y10) | -r1(Y20))))) # label(axiom_7a) # label(axiom) # label(non_clause).  [assumption].
0.71/1.13	11 (all X28 all X29 all X30 all X31 (-id(X29,X31) | r2(X28,X29) & r2(X30,X31) | -r2(X28,X29) & -r2(X30,X31) | -id(X28,X30))) # label(axiom_9) # label(axiom) # label(non_clause).  [assumption].
0.71/1.13	12 (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].
30.40/30.92	13 (all X21 all X22 (id(X22,X21) | -id(X21,X22))) # label(axiom_6) # label(axiom) # label(non_clause).  [assumption].
30.40/30.92	14 (all X38 all X39 all X40 all X41 all X42 all X43 (-id(X38,X41) | -id(X40,X43) | -r4(X41,X42,X43) & -r4(X38,X39,X40) | r4(X38,X39,X40) & r4(X41,X42,X43) | -id(X39,X42))) # label(axiom_11) # label(axiom) # label(non_clause).  [assumption].
30.40/30.92	15 (exists Y24 all X19 (id(X19,Y24) & r1(X19) | -r1(X19) & -id(X19,Y24))) # label(axiom_1) # label(axiom) # label(non_clause).  [assumption].
30.40/30.92	16 (all X5 exists Y8 ((exists Y17 (r1(Y17) & r4(X5,Y17,Y8))) & (exists Y18 (id(Y8,Y18) & r1(Y18))))) # label(axiom_5a) # label(axiom) # label(non_clause).  [assumption].
30.40/30.92	17 (all X1 all X8 exists Y4 ((exists Y5 ((exists Y15 (r2(X8,Y15) & r3(X1,Y15,Y5))) & id(Y5,Y4))) & (exists Y7 (r2(Y7,Y4) & r3(X1,X8,Y7))))) # label(axiom_1a) # label(axiom) # label(non_clause).  [assumption].
30.40/30.92	18 (all X3 all X10 (id(X3,X10) | (all Y12 (-r2(X10,Y12) | (all Y13 (-r2(X3,Y13) | -id(Y13,Y12))))))) # label(axiom_3a) # label(axiom) # label(non_clause).  [assumption].
30.40/30.92	19 -(all X1 exists Y2 exists Y1 ((exists Y3 (id(Y3,Y2) & r3(X1,Y1,Y3))) & (all Y4 (-r1(Y4) | -id(Y1,Y4))))) # label(infiniteNumbersid) # label(negated_conjecture) # label(non_clause).  [assumption].
30.40/30.92	
30.40/30.92	============================== end of process non-clausal formulas ===
30.40/30.92	
30.40/30.92	============================== PROCESS INITIAL CLAUSES ===============
30.40/30.92	
30.40/30.92	============================== PREDICATE ELIMINATION =================
30.40/30.92	
30.40/30.92	============================== end predicate elimination =============
30.40/30.92	
30.40/30.92	Auto_denials:  (non-Horn, no changes).
30.40/30.92	
30.40/30.92	Term ordering decisions:
30.40/30.92	Function symbol KB weights:  c1=1. c2=1. f1=1. f2=1. f3=1. f4=1. f8=1. f12=1. f16=1. f17=1. f18=1. f19=1. f20=1. f5=1. f6=1. f7=1. f9=1. f10=1. f11=1. f13=1. f14=1. f15=1.
30.40/30.92	
30.40/30.92	============================== end of process initial clauses ========
30.40/30.92	
30.40/30.92	============================== CLAUSES FOR SEARCH ====================
30.40/30.92	
30.40/30.92	============================== end of clauses for search =============
30.40/30.92	
30.40/30.92	============================== SEARCH ================================
30.40/30.92	
30.40/30.92	% Starting search at 0.01 seconds.
30.40/30.92	
30.40/30.92	Low Water (keep): wt=10.000, iters=3441
30.40/30.92	
30.40/30.92	Low Water (keep): wt=9.000, iters=3344
30.40/30.92	
30.40/30.92	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 22 (0.00 of 7.28 sec).
30.40/30.92	
30.40/30.92	============================== PROOF =================================
30.40/30.92	% SZS status Theorem
30.40/30.92	% SZS output start Refutation
30.40/30.92	
30.40/30.92	% Proof 1 at 29.40 (+ 0.29) seconds.
30.40/30.92	% Length of proof is 24.
30.40/30.92	% Level of proof is 5.
30.40/30.92	% Maximum clause weight is 12.000.
30.40/30.92	% Given clauses 693.
30.40/30.92	
30.40/30.92	3 (all X20 id(X20,X20)) # label(axiom_5) # label(axiom) # label(non_clause).  [assumption].
30.40/30.92	5 (all X11 exists Y21 all X12 (id(X12,Y21) & r2(X11,X12) | -r2(X11,X12) & -id(X12,Y21))) # label(axiom_2) # label(axiom) # label(non_clause).  [assumption].
30.40/30.92	6 (all X26 all X27 (-id(X26,X27) | -r1(X26) & -r1(X27) | r1(X26) & r1(X27))) # label(axiom_8) # label(axiom) # label(non_clause).  [assumption].
30.40/30.92	10 (all X7 all Y10 (-r2(X7,Y10) | (all Y20 (-id(Y20,Y10) | -r1(Y20))))) # label(axiom_7a) # label(axiom) # label(non_clause).  [assumption].
30.40/30.92	12 (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].
30.40/30.92	17 (all X1 all X8 exists Y4 ((exists Y5 ((exists Y15 (r2(X8,Y15) & r3(X1,Y15,Y5))) & id(Y5,Y4))) & (exists Y7 (r2(Y7,Y4) & r3(X1,X8,Y7))))) # label(axiom_1a) # label(axiom) # label(non_clause).  [assumption].
30.40/30.92	19 -(all X1 exists Y2 exists Y1 ((exists Y3 (id(Y3,Y2) & r3(X1,Y1,Y3))) & (all Y4 (-r1(Y4) | -id(Y1,Y4))))) # label(infiniteNumbersid) # label(negated_conjecture) # label(non_clause).  [assumption].
30.40/30.92	20 id(A,A) # label(axiom_5) # label(axiom).  [clausify(3)].
30.40/30.92	31 r3(A,B,f19(A,B)) # label(axiom_1a) # label(axiom).  [clausify(17)].
30.40/30.92	42 -r2(A,B) | -id(C,B) | -r1(C) # label(axiom_7a) # label(axiom).  [clausify(10)].
30.40/30.92	47 r2(A,B) | -id(B,f7(A)) # label(axiom_2) # label(axiom).  [clausify(5)].
30.40/30.92	49 -id(A,B) | -r1(B) | r1(A) # label(axiom_8) # label(axiom).  [clausify(6)].
30.40/30.92	53 id(A,f12(B,C)) | -r3(B,C,A) # label(axiom_3) # label(axiom).  [clausify(12)].
30.40/30.92	55 -id(A,B) | -r3(c2,C,A) | r1(f20(B,C)) # label(infiniteNumbersid) # label(negated_conjecture).  [clausify(19)].
30.40/30.92	59 -id(A,B) | -r3(c2,C,A) | id(C,f20(B,C)) # label(infiniteNumbersid) # label(negated_conjecture).  [clausify(19)].
30.40/30.92	123 r2(A,f7(A)).  [resolve(47,b,20,a)].
30.40/30.92	152 id(f19(A,B),f12(A,B)).  [resolve(53,b,31,a)].
30.40/30.92	157 -id(f19(c2,A),B) | r1(f20(B,A)).  [resolve(55,b,31,a)].
30.40/30.92	180 -id(f19(c2,A),B) | id(A,f20(B,A)).  [resolve(59,b,31,a)].
30.40/30.92	336 -r1(f7(A)).  [ur(42,a,123,a,b,20,a)].
30.40/30.92	5374 r1(f20(f12(c2,A),A)).  [resolve(157,a,152,a)].
30.40/30.92	6335 -id(f7(A),f20(f12(c2,B),B)).  [ur(49,b,5374,a,c,336,a)].
30.40/30.92	7023 id(A,f20(f12(c2,A),A)).  [resolve(180,a,152,a)].
30.40/30.92	7024 $F.  [resolve(7023,a,6335,a)].
30.40/30.92	
30.40/30.92	% SZS output end Refutation
30.40/30.92	============================== end of proof ==========================
30.40/30.92	
30.40/30.92	============================== STATISTICS ============================
30.40/30.92	
30.40/30.92	Given=693. Generated=325413. Kept=7004. proofs=1.
30.40/30.92	Usable=690. Sos=6073. Demods=0. Limbo=2, Disabled=282. Hints=0.
30.40/30.92	Megabytes=4.32.
30.40/30.92	User_CPU=29.40, System_CPU=0.29, Wall_clock=30.
30.40/30.92	
30.40/30.92	============================== end of statistics =====================
30.40/30.92	
30.40/30.92	============================== end of search =========================
30.40/30.92	
30.40/30.92	THEOREM PROVED
30.40/30.92	% SZS status Theorem
30.40/30.92	
30.40/30.92	Exiting with 1 proof.
30.40/30.92	
30.40/30.92	Process 22178 exit (max_proofs) Tue Jul 13 11:40:22 2021
30.40/30.92	Prover9 interrupted
30.40/30.92	EOF