0.07/0.13	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.14	% Command    : tptp2X_and_run_prover9 %d %s
0.12/0.35	% Computer   : n004.cluster.edu
0.12/0.35	% Model      : x86_64 x86_64
0.12/0.35	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.35	% Memory     : 8042.1875MB
0.12/0.35	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.35	% CPULimit   : 180
0.12/0.35	% DateTime   : Thu Aug 29 09:05:53 EDT 2019
0.12/0.35	% CPUTime    : 
0.43/1.05	============================== Prover9 ===============================
0.43/1.05	Prover9 (32) version 2009-11A, November 2009.
0.43/1.05	Process 7377 was started by sandbox on n004.cluster.edu,
0.43/1.05	Thu Aug 29 09:05:54 2019
0.43/1.05	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 180 -f /tmp/Prover9_6994_n004.cluster.edu".
0.43/1.05	============================== end of head ===========================
0.43/1.05	
0.43/1.05	============================== INPUT =================================
0.43/1.05	
0.43/1.05	% Reading from file /tmp/Prover9_6994_n004.cluster.edu
0.43/1.05	
0.43/1.05	set(prolog_style_variables).
0.43/1.05	set(auto2).
0.43/1.05	    % set(auto2) -> set(auto).
0.43/1.05	    % set(auto) -> set(auto_inference).
0.43/1.05	    % set(auto) -> set(auto_setup).
0.43/1.05	    % set(auto_setup) -> set(predicate_elim).
0.43/1.05	    % set(auto_setup) -> assign(eq_defs, unfold).
0.43/1.05	    % set(auto) -> set(auto_limits).
0.43/1.05	    % set(auto_limits) -> assign(max_weight, "100.000").
0.43/1.05	    % set(auto_limits) -> assign(sos_limit, 20000).
0.43/1.05	    % set(auto) -> set(auto_denials).
0.43/1.05	    % set(auto) -> set(auto_process).
0.43/1.05	    % set(auto2) -> assign(new_constants, 1).
0.43/1.05	    % set(auto2) -> assign(fold_denial_max, 3).
0.43/1.05	    % set(auto2) -> assign(max_weight, "200.000").
0.43/1.05	    % set(auto2) -> assign(max_hours, 1).
0.43/1.05	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.43/1.05	    % set(auto2) -> assign(max_seconds, 0).
0.43/1.05	    % set(auto2) -> assign(max_minutes, 5).
0.43/1.05	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.43/1.05	    % set(auto2) -> set(sort_initial_sos).
0.43/1.05	    % set(auto2) -> assign(sos_limit, -1).
0.43/1.05	    % set(auto2) -> assign(lrs_ticks, 3000).
0.43/1.05	    % set(auto2) -> assign(max_megs, 400).
0.43/1.05	    % set(auto2) -> assign(stats, some).
0.43/1.05	    % set(auto2) -> clear(echo_input).
0.43/1.05	    % set(auto2) -> set(quiet).
0.43/1.05	    % set(auto2) -> clear(print_initial_clauses).
0.43/1.05	    % set(auto2) -> clear(print_given).
0.43/1.05	assign(lrs_ticks,-1).
0.43/1.05	assign(sos_limit,10000).
0.43/1.05	assign(order,kbo).
0.43/1.05	set(lex_order_vars).
0.43/1.05	clear(print_given).
0.43/1.05	
0.43/1.05	% formulas(sos).  % not echoed (19 formulas)
0.43/1.05	
0.43/1.05	============================== end of input ==========================
0.43/1.05	
0.43/1.05	% From the command line: assign(max_seconds, 180).
0.43/1.05	
0.43/1.05	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.43/1.05	
0.43/1.05	% Formulas that are not ordinary clauses:
0.43/1.05	1 (all X3 all X10 ((all Y12 ((all Y13 (-r2(X3,Y13) | -id(Y13,Y12))) | -r2(X10,Y12))) | id(X3,X10))) # label(axiom_3a) # label(axiom) # label(non_clause).  [assumption].
0.43/1.05	2 (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.43/1.05	3 (all X16 all X17 exists Y23 all X18 (r4(X16,X17,X18) & id(X18,Y23) | -id(X18,Y23) & -r4(X16,X17,X18))) # label(axiom_4) # label(axiom) # label(non_clause).  [assumption].
0.43/1.05	4 (all X26 all X27 (-id(X26,X27) | -r1(X26) & -r1(X27) | r1(X27) & r1(X26))) # label(axiom_8) # label(axiom) # label(non_clause).  [assumption].
0.43/1.05	5 (all X1 all X8 exists Y4 ((exists Y7 (r3(X1,X8,Y7) & r2(Y7,Y4))) & (exists Y5 ((exists Y15 (r2(X8,Y15) & r3(X1,Y15,Y5))) & id(Y5,Y4))))) # label(axiom_1a) # label(axiom) # label(non_clause).  [assumption].
0.43/1.05	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.43/1.05	7 (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.43/1.05	8 (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.43/1.05	9 (all X2 all X9 exists Y2 ((exists Y6 (r4(X2,X9,Y6) & r3(Y6,X2,Y2))) & (exists Y3 ((exists Y14 (r2(X9,Y14) & r4(X2,Y14,Y3))) & id(Y3,Y2))))) # label(axiom_2a) # label(axiom) # label(non_clause).  [assumption].
0.43/1.05	10 (exists Y24 all X19 (r1(X19) & id(X19,Y24) | -id(X19,Y24) & -r1(X19))) # label(axiom_1) # label(axiom) # label(non_clause).  [assumption].
0.43/1.05	11 (all X28 all X29 all X30 all X31 (-id(X28,X30) | -id(X29,X31) | r2(X30,X31) & r2(X28,X29) | -r2(X28,X29) & -r2(X30,X31))) # label(axiom_9) # label(axiom) # label(non_clause).  [assumption].
0.43/1.05	12 (all X38 all X39 all X40 all X41 all X42 all X43 (-id(X38,X41) | -r4(X38,X39,X40) & -r4(X41,X42,X43) | r4(X38,X39,X40) & r4(X41,X42,X43) | -id(X40,X43) | -id(X39,X42))) # label(axiom_11) # label(axiom) # label(non_clause).  [assumption].
1.16/1.46	13 (all X7 all Y10 (-r2(X7,Y10) | (all Y20 (-r1(Y20) | -id(Y20,Y10))))) # label(axiom_7a) # label(axiom) # label(non_clause).  [assumption].
1.16/1.46	14 (all X5 exists Y8 ((exists Y18 (id(Y8,Y18) & r1(Y18))) & (exists Y17 (r4(X5,Y17,Y8) & r1(Y17))))) # label(axiom_5a) # label(axiom) # label(non_clause).  [assumption].
1.16/1.46	15 (all X21 all X22 (id(X22,X21) | -id(X21,X22))) # label(axiom_6) # label(axiom) # label(non_clause).  [assumption].
1.16/1.46	16 (all X20 id(X20,X20)) # label(axiom_5) # label(axiom) # label(non_clause).  [assumption].
1.16/1.46	17 (all X32 all X33 all X34 all X35 all X36 all X37 (-id(X32,X35) | -id(X34,X37) | -r3(X32,X33,X34) & -r3(X35,X36,X37) | r3(X35,X36,X37) & r3(X32,X33,X34) | -id(X33,X36))) # label(axiom_10) # label(axiom) # label(non_clause).  [assumption].
1.16/1.46	18 (all X6 ((exists Y1 exists Y11 (r2(Y1,Y11) & id(X6,Y11))) | (exists Y19 (r1(Y19) & id(X6,Y19))))) # label(axiom_6a) # label(axiom) # label(non_clause).  [assumption].
1.16/1.46	19 -(exists Y1 exists Y2 exists Y3 ((exists Y5 (r3(Y2,Y3,Y5) & id(Y5,Y1))) & (exists Y4 ((exists Y6 ((exists Y7 ((exists Y8 (r2(Y8,Y7) & r1(Y8))) & r2(Y7,Y6))) & r4(Y6,Y2,Y4))) & id(Y4,Y1))))) # label(thereexistsanevennumberid) # label(negated_conjecture) # label(non_clause).  [assumption].
1.16/1.46	
1.16/1.46	============================== end of process non-clausal formulas ===
1.16/1.46	
1.16/1.46	============================== PROCESS INITIAL CLAUSES ===============
1.16/1.46	
1.16/1.46	============================== PREDICATE ELIMINATION =================
1.16/1.46	
1.16/1.46	============================== end predicate elimination =============
1.16/1.46	
1.16/1.46	Auto_denials:  (non-Horn, no changes).
1.16/1.46	
1.16/1.46	Term ordering decisions:
1.16/1.46	Function symbol KB weights:  c1=1. f3=1. f4=1. f5=1. f6=1. f7=1. f8=1. f10=1. f11=1. f12=1. f13=1. f1=1. f2=1. f9=1. f14=1. f15=1. f16=1. f17=1. f18=1. f19=1.
1.16/1.46	
1.16/1.46	============================== end of process initial clauses ========
1.16/1.46	
1.16/1.46	============================== CLAUSES FOR SEARCH ====================
1.16/1.46	
1.16/1.46	============================== end of clauses for search =============
1.16/1.46	
1.16/1.46	============================== SEARCH ================================
1.16/1.46	
1.16/1.46	% Starting search at 0.02 seconds.
1.16/1.46	
1.16/1.46	Low Water (keep): wt=16.000, iters=4015
1.16/1.46	
1.16/1.46	Low Water (keep): wt=14.000, iters=3922
1.16/1.46	
1.16/1.46	Low Water (keep): wt=13.000, iters=3700
1.16/1.46	
1.16/1.46	Low Water (keep): wt=12.000, iters=3614
1.16/1.46	
1.16/1.46	============================== PROOF =================================
1.16/1.46	% SZS status Theorem
1.16/1.46	% SZS output start Refutation
1.16/1.46	
1.16/1.46	% Proof 1 at 0.41 (+ 0.02) seconds.
1.16/1.46	% Length of proof is 26.
1.16/1.46	% Level of proof is 5.
1.16/1.46	% Maximum clause weight is 22.000.
1.16/1.46	% Given clauses 108.
1.16/1.46	
1.16/1.46	2 (all X4 exists Y9 (id(Y9,X4) & (exists Y16 (r1(Y16) & r3(X4,Y16,Y9))))) # label(axiom_4a) # label(axiom) # label(non_clause).  [assumption].
1.16/1.46	4 (all X26 all X27 (-id(X26,X27) | -r1(X26) & -r1(X27) | r1(X27) & r1(X26))) # label(axiom_8) # label(axiom) # label(non_clause).  [assumption].
1.16/1.46	5 (all X1 all X8 exists Y4 ((exists Y7 (r3(X1,X8,Y7) & r2(Y7,Y4))) & (exists Y5 ((exists Y15 (r2(X8,Y15) & r3(X1,Y15,Y5))) & id(Y5,Y4))))) # label(axiom_1a) # label(axiom) # label(non_clause).  [assumption].
1.16/1.46	10 (exists Y24 all X19 (r1(X19) & id(X19,Y24) | -id(X19,Y24) & -r1(X19))) # label(axiom_1) # label(axiom) # label(non_clause).  [assumption].
1.16/1.46	14 (all X5 exists Y8 ((exists Y18 (id(Y8,Y18) & r1(Y18))) & (exists Y17 (r4(X5,Y17,Y8) & r1(Y17))))) # label(axiom_5a) # label(axiom) # label(non_clause).  [assumption].
1.16/1.46	19 -(exists Y1 exists Y2 exists Y3 ((exists Y5 (r3(Y2,Y3,Y5) & id(Y5,Y1))) & (exists Y4 ((exists Y6 ((exists Y7 ((exists Y8 (r2(Y8,Y7) & r1(Y8))) & r2(Y7,Y6))) & r4(Y6,Y2,Y4))) & id(Y4,Y1))))) # label(thereexistsanevennumberid) # label(negated_conjecture) # label(non_clause).  [assumption].
1.16/1.46	21 r1(f15(A)) # label(axiom_5a) # label(axiom).  [clausify(14)].
1.16/1.46	22 r1(f16(A)) # label(axiom_5a) # label(axiom).  [clausify(14)].
1.16/1.46	24 id(f1(A),A) # label(axiom_4a) # label(axiom).  [clausify(2)].
1.16/1.46	25 r2(A,f7(B,A)) # label(axiom_1a) # label(axiom).  [clausify(5)].
1.16/1.46	27 id(f14(A),f15(A)) # label(axiom_5a) # label(axiom).  [clausify(14)].
1.16/1.46	28 r3(A,f2(A),f1(A)) # label(axiom_4a) # label(axiom).  [clausify(2)].
1.16/1.46	31 r4(A,f16(A),f14(A)) # label(axiom_5a) # label(axiom).  [clausify(14)].
1.16/1.46	43 -r3(A,B,C) | -id(C,D) | -r2(E,F) | -r1(E) | -r2(F,V6) | -r4(V6,A,V7) | -id(V7,D) # label(thereexistsanevennumberid) # label(negated_conjecture).  [clausify(19)].
1.16/1.46	44 r1(A) | -id(A,c1) # label(axiom_1) # label(axiom).  [clausify(10)].
1.16/1.46	45 id(A,c1) | -r1(A) # label(axiom_1) # label(axiom).  [clausify(10)].
1.16/1.46	48 -id(A,B) | -r1(B) | r1(A) # label(axiom_8) # label(axiom).  [clausify(4)].
1.16/1.46	804 r1(f1(c1)).  [resolve(44,b,24,a)].
1.16/1.46	821 r1(f14(A)).  [resolve(48,a,27,a),unit_del(a,21)].
1.16/1.46	822 -r1(A) | r1(f1(A)).  [resolve(48,a,24,a)].
1.16/1.46	1422 id(f14(A),c1).  [resolve(821,a,45,b)].
1.16/1.46	5798 r1(f1(f1(c1))).  [resolve(822,a,804,a)].
1.16/1.46	5799 r1(f1(f16(A))).  [resolve(822,a,22,a)].
1.16/1.46	6385 -id(f1(f16(f7(A,f7(B,f1(f1(c1)))))),c1).  [ur(43,a,28,a,c,25,a,d,5798,a,e,25,a,f,31,a,g,1422,a)].
1.16/1.46	6520 id(f1(f16(A)),c1).  [resolve(5799,a,45,b)].
1.16/1.46	6521 $F.  [resolve(6520,a,6385,a)].
1.16/1.46	
1.16/1.46	% SZS output end Refutation
1.16/1.46	============================== end of proof ==========================
1.16/1.46	
1.16/1.46	============================== STATISTICS ============================
1.16/1.46	
1.16/1.46	Given=108. Generated=13749. Kept=6501. proofs=1.
1.16/1.46	Usable=108. Sos=6018. Demods=0. Limbo=1, Disabled=416. Hints=0.
1.16/1.46	Megabytes=4.88.
1.16/1.46	User_CPU=0.41, System_CPU=0.02, Wall_clock=0.
1.16/1.46	
1.16/1.46	============================== end of statistics =====================
1.16/1.46	
1.16/1.46	============================== end of search =========================
1.16/1.46	
1.16/1.46	THEOREM PROVED
1.16/1.46	% SZS status Theorem
1.16/1.46	
1.16/1.46	Exiting with 1 proof.
1.16/1.46	
1.16/1.46	Process 7377 exit (max_proofs) Thu Aug 29 09:05:54 2019
1.16/1.46	Prover9 interrupted
1.16/1.46	EOF