0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.12	% Command    : tptp2X_and_run_prover9 %d %s
0.12/0.34	% Computer   : n026.cluster.edu
0.12/0.34	% Model      : x86_64 x86_64
0.12/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.34	% Memory     : 8042.1875MB
0.12/0.34	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.34	% CPULimit   : 1200
0.12/0.34	% DateTime   : Tue Jul 13 11:28:29 EDT 2021
0.12/0.34	% CPUTime    : 
1.69/1.98	============================== Prover9 ===============================
1.69/1.98	Prover9 (32) version 2009-11A, November 2009.
1.69/1.98	Process 18990 was started by sandbox2 on n026.cluster.edu,
1.69/1.98	Tue Jul 13 11:28:29 2021
1.69/1.98	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1200 -f /tmp/Prover9_18837_n026.cluster.edu".
1.69/1.98	============================== end of head ===========================
1.69/1.98	
1.69/1.98	============================== INPUT =================================
1.69/1.98	
1.69/1.98	% Reading from file /tmp/Prover9_18837_n026.cluster.edu
1.69/1.98	
1.69/1.98	set(prolog_style_variables).
1.69/1.98	set(auto2).
1.69/1.98	    % set(auto2) -> set(auto).
1.69/1.98	    % set(auto) -> set(auto_inference).
1.69/1.98	    % set(auto) -> set(auto_setup).
1.69/1.98	    % set(auto_setup) -> set(predicate_elim).
1.69/1.98	    % set(auto_setup) -> assign(eq_defs, unfold).
1.69/1.98	    % set(auto) -> set(auto_limits).
1.69/1.98	    % set(auto_limits) -> assign(max_weight, "100.000").
1.69/1.98	    % set(auto_limits) -> assign(sos_limit, 20000).
1.69/1.98	    % set(auto) -> set(auto_denials).
1.69/1.98	    % set(auto) -> set(auto_process).
1.69/1.98	    % set(auto2) -> assign(new_constants, 1).
1.69/1.98	    % set(auto2) -> assign(fold_denial_max, 3).
1.69/1.98	    % set(auto2) -> assign(max_weight, "200.000").
1.69/1.98	    % set(auto2) -> assign(max_hours, 1).
1.69/1.98	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
1.69/1.98	    % set(auto2) -> assign(max_seconds, 0).
1.69/1.98	    % set(auto2) -> assign(max_minutes, 5).
1.69/1.98	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
1.69/1.98	    % set(auto2) -> set(sort_initial_sos).
1.69/1.98	    % set(auto2) -> assign(sos_limit, -1).
1.69/1.98	    % set(auto2) -> assign(lrs_ticks, 3000).
1.69/1.98	    % set(auto2) -> assign(max_megs, 400).
1.69/1.98	    % set(auto2) -> assign(stats, some).
1.69/1.98	    % set(auto2) -> clear(echo_input).
1.69/1.98	    % set(auto2) -> set(quiet).
1.69/1.98	    % set(auto2) -> clear(print_initial_clauses).
1.69/1.98	    % set(auto2) -> clear(print_given).
1.69/1.98	assign(lrs_ticks,-1).
1.69/1.98	assign(sos_limit,10000).
1.69/1.98	assign(order,kbo).
1.69/1.98	set(lex_order_vars).
1.69/1.98	clear(print_given).
1.69/1.98	
1.69/1.98	% formulas(sos).  % not echoed (1 formulas)
1.69/1.98	
1.69/1.98	============================== end of input ==========================
1.69/1.98	
1.69/1.98	% From the command line: assign(max_seconds, 1200).
1.69/1.98	
1.69/1.98	============================== PROCESS NON-CLAUSAL FORMULAS ==========
1.69/1.98	
1.69/1.98	% Formulas that are not ordinary clauses:
1.69/1.98	1 -(all X exists Y1 exists Y2 exists Y3 all Z ((big_f(Y1,Y2,Y3) -> (big_f(X,X,Z) -> big_f(Y3,Y1,Y2) | big_f(Y2,Y3,Y1))) -> ((big_f(Y2,Y1,Z) <-> (big_f(Y3,Y1,Y2) -> big_f(Y1,Y2,Y3) & big_f(Y2,Y3,Y1))) -> ((big_f(Y1,Z,Y2) <-> (big_f(Y2,Y3,Y1) -> big_f(Y1,Y2,Y3) & big_f(Y3,Y1,Y2))) -> ((big_f(Z,Y2,Y1) <-> ((big_f(Y3,Y1,Y2) -> -big_f(Y2,Y3,Y1)) -> big_f(Y1,Y2,Y3))) -> (big_f(Z,Z,Z) <-> big_f(Y3,Y1,Y2) & big_f(Y2,Y3,Y1) & big_f(Y1,Y2,Y3))))))) # label(church_46_18_5) # label(negated_conjecture) # label(non_clause).  [assumption].
1.69/1.98	
1.69/1.98	============================== end of process non-clausal formulas ===
1.69/1.98	
1.69/1.98	============================== PROCESS INITIAL CLAUSES ===============
1.69/1.98	
1.69/1.98	============================== PREDICATE ELIMINATION =================
1.69/1.98	
1.69/1.98	============================== end predicate elimination =============
1.69/1.98	
1.69/1.98	Auto_denials:  (non-Horn, no changes).
1.69/1.98	
1.69/1.98	Term ordering decisions:
1.69/1.98	Function symbol KB weights:  c1=1. f1=1.
1.69/1.98	
1.69/1.98	============================== end of process initial clauses ========
1.69/1.98	
1.69/1.98	============================== CLAUSES FOR SEARCH ====================
1.69/1.98	
1.69/1.98	============================== end of clauses for search =============
1.69/1.98	
1.69/1.98	============================== SEARCH ================================
1.69/1.98	
1.69/1.98	% Starting search at 0.01 seconds.
1.69/1.98	
1.69/1.98	============================== PROOF =================================
1.69/1.98	% SZS status Theorem
1.69/1.98	% SZS output start Refutation
1.69/1.98	
1.69/1.98	% Proof 1 at 0.96 (+ 0.01) seconds.
1.69/1.98	% Length of proof is 53.
1.69/1.98	% Level of proof is 26.
1.69/1.98	% Maximum clause weight is 40.000.
1.69/1.98	% Given clauses 401.
1.69/1.98	
1.69/1.98	1 -(all X exists Y1 exists Y2 exists Y3 all Z ((big_f(Y1,Y2,Y3) -> (big_f(X,X,Z) -> big_f(Y3,Y1,Y2) | big_f(Y2,Y3,Y1))) -> ((big_f(Y2,Y1,Z) <-> (big_f(Y3,Y1,Y2) -> big_f(Y1,Y2,Y3) & big_f(Y2,Y3,Y1))) -> ((big_f(Y1,Z,Y2) <-> (big_f(Y2,Y3,Y1) -> big_f(Y1,Y2,Y3) & big_f(Y3,Y1,Y2))) -> ((big_f(Z,Y2,Y1) <-> ((big_f(Y3,Y1,Y2) -> -big_f(Y2,Y3,Y1)) -> big_f(Y1,Y2,Y3))) -> (big_f(Z,Z,Z) <-> big_f(Y3,Y1,Y2) & big_f(Y2,Y3,Y1) & big_f(Y1,Y2,Y3))))))) # label(church_46_18_5) # label(negated_conjecture) # label(non_clause).  [assumption].
1.69/1.98	2 big_f(A,B,f1(B,A,C)) | big_f(C,B,A) # label(church_46_18_5) # label(negated_conjecture).  [clausify(1)].
1.69/1.98	3 big_f(A,f1(A,B,C),B) | big_f(B,C,A) # label(church_46_18_5) # label(negated_conjecture).  [clausify(1)].
1.69/1.98	7 -big_f(f1(A,B,C),f1(A,B,C),f1(A,B,C)) | -big_f(C,A,B) | -big_f(B,C,A) | -big_f(A,B,C) # label(church_46_18_5) # label(negated_conjecture).  [clausify(1)].
1.69/1.98	9 -big_f(A,B,f1(B,A,C)) | -big_f(C,B,A) | big_f(B,A,C) # label(church_46_18_5) # label(negated_conjecture).  [clausify(1)].
1.69/1.98	10 -big_f(A,B,f1(B,A,C)) | -big_f(C,B,A) | big_f(A,C,B) # label(church_46_18_5) # label(negated_conjecture).  [clausify(1)].
1.69/1.98	12 -big_f(A,f1(A,B,C),B) | -big_f(B,C,A) | big_f(A,B,C) # label(church_46_18_5) # label(negated_conjecture).  [clausify(1)].
1.69/1.98	13 -big_f(A,f1(A,B,C),B) | -big_f(B,C,A) | big_f(C,A,B) # label(church_46_18_5) # label(negated_conjecture).  [clausify(1)].
1.69/1.98	15 -big_f(f1(A,B,C),B,A) | big_f(C,A,B) | big_f(A,B,C) # label(church_46_18_5) # label(negated_conjecture).  [clausify(1)].
1.69/1.98	16 -big_f(f1(A,B,C),B,A) | big_f(B,C,A) | big_f(A,B,C) # label(church_46_18_5) # label(negated_conjecture).  [clausify(1)].
1.69/1.98	17 big_f(f1(A,B,C),B,A) | -big_f(C,A,B) | -big_f(B,C,A) # label(church_46_18_5) # label(negated_conjecture).  [clausify(1)].
1.69/1.98	18 -big_f(A,B,C) | -big_f(c1,c1,f1(A,B,C)) | big_f(C,A,B) | big_f(B,C,A) # label(church_46_18_5) # label(negated_conjecture).  [clausify(1)].
1.69/1.98	22 -big_f(f1(A,A,A),A,A) | big_f(A,A,A).  [factor(15,b,c)].
1.69/1.98	36 big_f(f1(f1(A,B,C),B,A),B,f1(A,B,C)) | -big_f(B,A,f1(A,B,C)) | big_f(B,C,A).  [resolve(17,b,3,a)].
1.69/1.98	38 big_f(f1(A,B,f1(B,A,C)),B,A) | -big_f(f1(B,A,C),A,B) | big_f(A,C,B).  [resolve(17,c,3,a)].
1.69/1.98	40 -big_f(c1,c1,A) | big_f(A,c1,c1) | big_f(c1,A,c1).  [resolve(18,b,2,a),merge(d)].
1.69/1.98	54 big_f(f1(c1,c1,A),c1,c1) | big_f(c1,f1(c1,c1,A),c1) | big_f(A,c1,c1).  [resolve(40,a,2,a)].
1.69/1.98	70 big_f(c1,f1(c1,c1,A),c1) | big_f(A,c1,c1) | big_f(c1,c1,A).  [resolve(54,a,15,a),merge(c)].
1.69/1.98	81 big_f(A,c1,c1) | big_f(c1,c1,A) | -big_f(c1,A,c1).  [resolve(70,a,13,a),merge(d)].
1.69/1.98	84 big_f(f1(c1,c1,A),c1,c1) | big_f(c1,c1,f1(c1,c1,A)) | big_f(c1,A,c1).  [resolve(81,c,3,a)].
1.69/1.98	86 big_f(c1,c1,f1(c1,c1,A)) | big_f(c1,A,c1) | big_f(c1,c1,A).  [resolve(84,a,16,a),merge(c)].
1.69/1.98	91 big_f(c1,A,c1) | big_f(c1,c1,A) | -big_f(A,c1,c1).  [resolve(86,a,10,a),merge(d)].
1.69/1.98	156 big_f(f1(c1,c1,f1(c1,c1,A)),c1,c1) | big_f(c1,A,c1) | big_f(c1,c1,f1(c1,c1,A)).  [resolve(38,b,84,a),merge(d)].
1.69/1.98	215 big_f(c1,A,c1) | big_f(c1,c1,f1(c1,c1,A)) | big_f(c1,f1(c1,c1,f1(c1,c1,A)),c1) | big_f(c1,c1,f1(c1,c1,f1(c1,c1,A))).  [resolve(156,a,91,c)].
1.69/1.98	702 big_f(c1,A,c1) | big_f(c1,c1,f1(c1,c1,A)) | big_f(c1,c1,f1(c1,c1,f1(c1,c1,A))) | -big_f(c1,f1(c1,c1,A),c1).  [resolve(215,c,12,a),merge(e)].
1.69/1.98	710 big_f(c1,A,c1) | big_f(c1,c1,f1(c1,c1,A)) | big_f(c1,c1,f1(c1,c1,f1(c1,c1,A))).  [resolve(702,d,3,a),merge(d)].
1.69/1.98	720 big_f(c1,A,c1) | big_f(c1,c1,f1(c1,c1,A)) | -big_f(f1(c1,c1,A),c1,c1).  [resolve(710,c,9,a),merge(d)].
1.69/1.98	726 big_f(c1,A,c1) | big_f(c1,c1,f1(c1,c1,A)).  [resolve(720,c,84,a),merge(c),merge(d)].
1.69/1.98	734 big_f(c1,A,c1) | -big_f(A,c1,c1).  [resolve(726,b,10,a),merge(c)].
1.69/1.98	739 big_f(c1,f1(c1,c1,A),c1) | big_f(A,c1,c1).  [resolve(734,b,54,a),merge(b)].
1.69/1.98	752 big_f(A,c1,c1) | -big_f(c1,A,c1).  [resolve(739,a,13,a),merge(c)].
1.69/1.98	755 big_f(f1(c1,c1,A),c1,c1) | big_f(A,c1,c1).  [resolve(752,b,739,a)].
1.69/1.98	762 big_f(A,c1,c1) | big_f(c1,c1,A).  [resolve(755,a,15,a),merge(b)].
1.69/1.98	787 big_f(A,c1,c1) | big_f(c1,A,c1).  [resolve(762,b,40,a),merge(b)].
1.69/1.98	799 big_f(c1,A,c1).  [resolve(787,a,734,b),merge(b)].
1.69/1.98	800 big_f(A,c1,c1).  [resolve(787,b,752,b),merge(b)].
1.69/1.98	805 big_f(c1,c1,A).  [resolve(799,a,12,a),unit_del(a,799)].
1.69/1.98	810 -big_f(A,B,C) | big_f(C,A,B) | big_f(B,C,A).  [back_unit_del(18),unit_del(b,805)].
1.69/1.98	813 -big_f(f1(c1,c1,A),f1(c1,c1,A),f1(c1,c1,A)).  [ur(7,b,800,a,c,799,a,d,805,a)].
1.69/1.98	814 -big_f(f1(A,c1,c1),f1(A,c1,c1),f1(A,c1,c1)).  [ur(7,b,799,a,c,805,a,d,800,a)].
1.69/1.98	815 -big_f(f1(c1,A,c1),f1(c1,A,c1),f1(c1,A,c1)).  [ur(7,b,805,a,c,800,a,d,799,a)].
1.69/1.98	834 -big_f(f1(f1(c1,c1,A),f1(c1,c1,A),f1(c1,c1,A)),f1(c1,c1,A),f1(c1,c1,A)).  [ur(22,b,813,a)].
1.69/1.98	835 -big_f(f1(f1(A,c1,c1),f1(A,c1,c1),f1(A,c1,c1)),f1(A,c1,c1),f1(A,c1,c1)).  [ur(22,b,814,a)].
1.69/1.98	836 -big_f(f1(f1(c1,A,c1),f1(c1,A,c1),f1(c1,A,c1)),f1(c1,A,c1),f1(c1,A,c1)).  [ur(22,b,815,a)].
1.69/1.98	896 big_f(A,B,f1(B,A,C)) | big_f(f1(B,A,C),A,B) | big_f(A,C,B).  [resolve(810,a,3,a)].
1.69/1.98	897 big_f(f1(A,B,C),B,A) | big_f(A,f1(A,B,C),B) | big_f(C,A,B).  [resolve(810,a,2,a)].
1.69/1.98	1032 big_f(f1(A,c1,c1),f1(A,c1,c1),f1(f1(A,c1,c1),f1(A,c1,c1),f1(A,c1,c1))).  [resolve(896,b,835,a),unit_del(b,814)].
1.69/1.98	1033 big_f(f1(c1,c1,A),f1(c1,c1,A),f1(f1(c1,c1,A),f1(c1,c1,A),f1(c1,c1,A))).  [resolve(896,b,834,a),unit_del(b,813)].
1.69/1.98	1058 big_f(f1(c1,A,c1),f1(f1(c1,A,c1),f1(c1,A,c1),f1(c1,A,c1)),f1(c1,A,c1)).  [resolve(897,a,836,a),unit_del(b,815)].
1.69/1.98	1458 big_f(f1(f1(f1(A,c1,c1),f1(A,c1,c1),f1(A,c1,c1)),f1(A,c1,c1),f1(A,c1,c1)),f1(A,c1,c1),f1(f1(A,c1,c1),f1(A,c1,c1),f1(A,c1,c1))).  [resolve(1032,a,36,b),unit_del(b,814)].
1.69/1.98	1474 -big_f(f1(f1(c1,c1,A),f1(c1,c1,A),f1(c1,c1,A)),f1(f1(f1(c1,c1,A),f1(c1,c1,A),f1(c1,c1,A)),f1(c1,c1,A),f1(c1,c1,A)),f1(c1,c1,A)).  [ur(12,b,1033,a,c,834,a)].
1.69/1.98	1486 -big_f(f1(c1,A,c1),f1(f1(c1,A,c1),f1(c1,A,c1),f1(c1,A,c1)),f1(f1(f1(c1,A,c1),f1(c1,A,c1),f1(c1,A,c1)),f1(c1,A,c1),f1(c1,A,c1))).  [ur(9,b,1058,a,c,836,a)].
1.69/1.98	1524 $F.  [ur(810,b,1474,a,c,1486,a),unit_del(a,1458)].
1.69/1.98	
1.69/1.98	% SZS output end Refutation
1.69/1.98	============================== end of proof ==========================
1.69/1.98	
1.69/1.98	============================== STATISTICS ============================
1.69/1.98	
1.69/1.98	Given=401. Generated=7121. Kept=1522. proofs=1.
1.69/1.98	Usable=317. Sos=704. Demods=0. Limbo=0, Disabled=518. Hints=0.
1.69/1.98	Megabytes=2.47.
1.69/1.98	User_CPU=0.96, System_CPU=0.01, Wall_clock=1.
1.69/1.98	
1.69/1.98	============================== end of statistics =====================
1.69/1.98	
1.69/1.98	============================== end of search =========================
1.69/1.98	
1.69/1.98	THEOREM PROVED
1.69/1.98	% SZS status Theorem
1.69/1.98	
1.69/1.98	Exiting with 1 proof.
1.69/1.98	
1.69/1.98	Process 18990 exit (max_proofs) Tue Jul 13 11:28:30 2021
1.69/1.98	Prover9 interrupted
1.75/1.98	EOF