0.04/0.06	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.04/0.06	% Command    : tptp2X_and_run_prover9 %d %s
0.06/0.25	% Computer   : n014.cluster.edu
0.06/0.25	% Model      : x86_64 x86_64
0.06/0.25	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.06/0.25	% Memory     : 8042.1875MB
0.06/0.25	% OS         : Linux 3.10.0-693.el7.x86_64
0.06/0.25	% CPULimit   : 1200
0.06/0.25	% DateTime   : Tue Jul 13 14:07:19 EDT 2021
0.06/0.25	% CPUTime    : 
0.67/0.93	============================== Prover9 ===============================
0.67/0.93	Prover9 (32) version 2009-11A, November 2009.
0.67/0.93	Process 6967 was started by sandbox on n014.cluster.edu,
0.67/0.93	Tue Jul 13 14:07:20 2021
0.67/0.93	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1200 -f /tmp/Prover9_6734_n014.cluster.edu".
0.67/0.93	============================== end of head ===========================
0.67/0.93	
0.67/0.93	============================== INPUT =================================
0.67/0.93	
0.67/0.93	% Reading from file /tmp/Prover9_6734_n014.cluster.edu
0.67/0.93	
0.67/0.93	set(prolog_style_variables).
0.67/0.93	set(auto2).
0.67/0.93	    % set(auto2) -> set(auto).
0.67/0.93	    % set(auto) -> set(auto_inference).
0.67/0.93	    % set(auto) -> set(auto_setup).
0.67/0.93	    % set(auto_setup) -> set(predicate_elim).
0.67/0.93	    % set(auto_setup) -> assign(eq_defs, unfold).
0.67/0.93	    % set(auto) -> set(auto_limits).
0.67/0.93	    % set(auto_limits) -> assign(max_weight, "100.000").
0.67/0.93	    % set(auto_limits) -> assign(sos_limit, 20000).
0.67/0.93	    % set(auto) -> set(auto_denials).
0.67/0.93	    % set(auto) -> set(auto_process).
0.67/0.93	    % set(auto2) -> assign(new_constants, 1).
0.67/0.93	    % set(auto2) -> assign(fold_denial_max, 3).
0.67/0.93	    % set(auto2) -> assign(max_weight, "200.000").
0.67/0.93	    % set(auto2) -> assign(max_hours, 1).
0.67/0.93	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.67/0.93	    % set(auto2) -> assign(max_seconds, 0).
0.67/0.93	    % set(auto2) -> assign(max_minutes, 5).
0.67/0.93	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.67/0.93	    % set(auto2) -> set(sort_initial_sos).
0.67/0.93	    % set(auto2) -> assign(sos_limit, -1).
0.67/0.93	    % set(auto2) -> assign(lrs_ticks, 3000).
0.67/0.93	    % set(auto2) -> assign(max_megs, 400).
0.67/0.93	    % set(auto2) -> assign(stats, some).
0.67/0.93	    % set(auto2) -> clear(echo_input).
0.67/0.93	    % set(auto2) -> set(quiet).
0.67/0.93	    % set(auto2) -> clear(print_initial_clauses).
0.67/0.93	    % set(auto2) -> clear(print_given).
0.67/0.93	assign(lrs_ticks,-1).
0.67/0.93	assign(sos_limit,10000).
0.67/0.93	assign(order,kbo).
0.67/0.93	set(lex_order_vars).
0.67/0.93	clear(print_given).
0.67/0.93	
0.67/0.93	% formulas(sos).  % not echoed (95 formulas)
0.67/0.93	
0.67/0.93	============================== end of input ==========================
0.67/0.93	
0.67/0.93	% From the command line: assign(max_seconds, 1200).
0.67/0.93	
0.67/0.93	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.67/0.93	
0.67/0.93	% Formulas that are not ordinary clauses:
0.67/0.93	1 (all A all B all C all P all Q all R (simtri(A,B,C,P,Q,R) -> eqratio(A,B,A,C,P,Q,P,R))) # label(ruleD59) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	2 (all A all B all C all H exists P exists Q (perp(A,H,B,C) & perp(B,H,A,C) -> coll(Q,C,A) & perp(B,Q,C,A) & perp(A,P,C,B) & coll(P,C,B))) # label(ruleX10) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	3 (all A all B all C all D (para(A,B,C,D) -> para(C,D,A,B))) # label(ruleD5) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	4 (all A all B all O (cong(O,A,O,B) -> eqangle(O,A,A,B,A,B,O,B))) # label(ruleD46) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	5 (all A all B all C all D (cyclic(A,B,C,D) -> cyclic(A,C,B,D))) # label(ruleD15) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	6 (all A all B all C all O all M (circle(O,A,B,C) & eqangle(A,B,A,C,O,B,O,M) & coll(M,B,C) -> midp(M,B,C))) # label(ruleD51) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	7 (all A all B all C all O all X (circle(O,A,B,C) & eqangle(A,X,A,B,C,A,C,B) -> perp(O,A,A,X))) # label(ruleD49) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	8 (all A all B all C all D all M (midp(M,A,B) & para(A,D,B,C) & para(A,C,B,D) -> midp(M,C,D))) # label(ruleD64) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	9 (all A all B all O all X exists M (perp(O,X,A,B) & cong(O,A,O,B) -> coll(B,A,M) & coll(M,O,X))) # label(ruleX4) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	10 (all A all B all C all P all Q all R (contri(A,B,C,P,Q,R) -> cong(A,B,P,Q))) # label(ruleD62) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	11 (all A all B all C all D all O (cong(O,A,O,D) & cong(O,A,O,C) & cong(O,A,O,B) -> cyclic(A,B,C,D))) # label(ruleD13) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	12 (all A all B all P all Q (cyclic(A,B,P,Q) -> eqangle(P,A,P,B,Q,A,Q,B))) # label(ruleD41) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	13 (all A all B all C all D all P all Q all U all V (eqangle(A,B,C,D,P,Q,U,V) -> eqangle(B,A,C,D,P,Q,U,V))) # label(ruleD18) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	14 (all A all B all C all D all E (cyclic(A,B,C,D) & cyclic(A,B,C,E) -> cyclic(B,C,D,E))) # label(ruleD17) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	15 (all A all B all C all D (perp(A,B,C,D) -> perp(A,B,D,C))) # label(ruleD7) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	16 (all A all B all C all D all M exists P (perp(C,A,C,D) & midp(M,B,D) & perp(A,B,A,C) -> midp(P,A,C))) # label(ruleX16) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	17 (all A all B all C (coll(A,B,C) -> coll(B,A,C))) # label(ruleD2) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	18 (all A all B all P all Q (cyclic(A,B,P,Q) & cong(A,Q,B,Q) & cong(A,P,B,P) -> perp(P,A,A,Q))) # label(ruleD57) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	19 (all A all B all C all D all E all F (cong(C,D,E,F) & cong(A,B,C,D) -> cong(A,B,E,F))) # label(ruleD25) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	20 (all A all B all C all D (cyclic(A,B,C,D) -> cyclic(A,B,D,C))) # label(ruleD14) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	21 (all A all B all O all X exists M (eqangle(A,O,O,X,O,X,O,B) & cong(O,A,O,B) -> coll(M,O,X) & coll(B,A,M))) # label(ruleX2) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	22 (all A all B all C (midp(A,B,C) -> cong(A,B,A,C))) # label(ruleD68) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	23 (all A all B all C all D all E all F (para(A,B,C,D) & para(C,D,E,F) -> para(A,B,E,F))) # label(ruleD6) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	24 (all A all B all C all P all Q all R (contri(A,C,B,P,R,Q) -> contri(A,B,C,P,Q,R))) # label(ruleD35) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	25 (all A all B all C all D (eqangle(A,B,C,D,C,D,A,B) & -perp(A,B,C,D) -> para(A,B,C,D))) # label(ruleD72) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	26 (all A all B all C all D all M exists O (cyclic(A,B,C,D) & para(A,B,C,D) & midp(M,A,B) -> circle(O,A,B,C))) # label(ruleX13) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	27 (all A all B all C all D all P all Q exists R (coll(P,A,C) & coll(P,B,D) & coll(Q,A,B) & para(A,B,C,D) -> coll(P,Q,R) & coll(R,C,D))) # label(ruleX18) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	28 (all A all B all O all X exists M (perp(O,X,A,B) & eqangle(A,O,O,X,O,X,O,B) -> coll(B,A,M) & coll(M,O,X))) # label(ruleX3) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	29 (all A all B all C all O (cong(O,A,O,B) & cong(O,A,O,C) -> circle(O,A,B,C))) # label(ruleD12) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	30 (all A all B all C all D all P all Q all U all V (eqratio(A,B,C,D,P,Q,U,V) -> eqratio(A,B,P,Q,C,D,U,V))) # label(ruleD29) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	31 (all A all B all P all X all Y exists Q (eqangle(A,P,B,P,A,X,B,Y) & -coll(A,B,P) -> eqangle(A,P,B,P,A,Q,B,Q) & cyclic(X,B,P,Q))) # label(ruleX5) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	32 (all A all B all C all D all P all Q all U all V all E all F all G all H (eqangle(A,B,C,D,P,Q,U,V) & eqangle(P,Q,U,V,E,F,G,H) -> eqangle(A,B,C,D,E,F,G,H))) # label(ruleD22) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	33 (all A all B all C all P all Q all R (contri(B,A,C,Q,P,R) -> contri(A,B,C,P,Q,R))) # label(ruleD36) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	34 (all A all B all C all D all P all Q all U all V (eqratio(A,B,C,D,P,Q,U,V) -> eqratio(C,D,A,B,U,V,P,Q))) # label(ruleD27) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	35 (all A all B all C all D all O (coll(O,B,D) & coll(O,A,C) & para(A,B,C,D) -> eqratio(O,A,A,C,O,B,B,D))) # label(ruleD65) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	36 (all A all B all C all E all F all G all P all Q all R (contri(A,B,C,E,F,G) & contri(E,F,G,P,Q,R) -> contri(A,B,C,P,Q,R))) # label(ruleD38) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	37 (all A all B all C all E all F all G all P all Q all R (simtri(A,B,C,E,F,G) & simtri(E,F,G,P,Q,R) -> simtri(A,B,C,P,Q,R))) # label(ruleD34) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	38 (all A all B all C all E all F (midp(E,A,B) & para(E,F,B,C) & coll(F,A,C) -> midp(F,A,C))) # label(ruleD45) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	39 (all A all B all C all D (perp(A,B,C,D) -> perp(C,D,A,B))) # label(ruleD8) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	40 (all A all B all C all D all P all Q all U all V (cong(P,Q,U,V) & eqratio(A,B,C,D,P,Q,U,V) -> cong(A,B,C,D))) # label(ruleD75) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	41 (all A all B all C all P all Q all R (simtri(A,C,B,P,R,Q) -> simtri(A,B,C,P,Q,R))) # label(ruleD31) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	42 (all A all B all C all D exists O (cyclic(A,B,C,D) & perp(A,C,C,B) -> circle(O,A,B,C))) # label(ruleX14) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	43 (all A all B all C all E all F exists P (coll(B,E,F) & perp(A,C,C,B) -> perp(P,A,E,F) & coll(P,E,F))) # label(ruleX15) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	44 (all A all B all C all D (para(A,B,C,D) -> para(A,B,D,C))) # label(ruleD4) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	45 (all A all B all C (para(A,B,A,C) -> coll(A,B,C))) # label(ruleD66) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	46 (all A all B all P all Q (cong(A,P,B,P) & cong(A,Q,B,Q) -> perp(A,B,P,Q))) # label(ruleD56) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	47 (all A all B all M (midp(M,B,A) -> midp(M,A,B))) # label(ruleD11) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	48 (all A all B all C all D (cong(A,B,C,D) -> cong(A,B,D,C))) # label(ruleD23) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	49 (all A all B all C all D all E all F (perp(C,D,E,F) & perp(A,B,C,D) -> para(A,B,E,F))) # label(ruleD9) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	50 (all A all B all O (-coll(O,A,B) & eqangle(O,A,A,B,A,B,O,B) -> cong(O,A,O,B))) # label(ruleD47) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	51 (all A all B all C all D all P all Q all U all V (eqratio(A,B,C,D,P,Q,U,V) -> eqratio(B,A,C,D,P,Q,U,V))) # label(ruleD26) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	52 (all A all B all C all D all E all F (perp(C,D,E,F) & para(A,B,C,D) -> perp(A,B,E,F))) # label(ruleD10) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	53 (all A all B all C all D (coll(A,B,C) & coll(A,B,D) -> coll(C,D,A))) # label(ruleD3) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	54 (all A all B all C all P all Q all R (eqangle(A,B,B,C,P,Q,Q,R) & eqangle(A,C,B,C,P,R,Q,R) & -coll(A,B,C) -> simtri(A,B,C,P,Q,R))) # label(ruleD58) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	55 (all A all B all C all P all Q all R (simtri(A,B,C,P,Q,R) & cong(A,B,P,Q) -> contri(A,B,C,P,Q,R))) # label(ruleD61) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	56 (all A all B all C all D (cong(A,B,C,D) -> cong(C,D,A,B))) # label(ruleD24) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	57 (all A all B all C all O all M (midp(M,B,C) & circle(O,A,B,C) -> eqangle(A,B,A,C,O,B,O,M))) # label(ruleD50) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	58 (all A all B all C all D all M all N all Q exists P (midp(M,A,B) & midp(N,C,D) & coll(D,A,B) & coll(C,A,B) -> midp(P,A,Q))) # label(ruleX7) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	59 (all A all B all C all O (circle(O,A,B,C) & coll(O,A,C) -> perp(A,B,B,C))) # label(ruleD53) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	60 (all A all B all C all D all P all Q all U all V (eqratio(A,B,C,D,P,Q,U,V) -> eqratio(P,Q,U,V,A,B,C,D))) # label(ruleD28) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	61 (all A all B all C all P all Q all R (contri(P,Q,R,A,B,C) -> contri(A,B,C,P,Q,R))) # label(ruleD37) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	62 (all A all B all C (coll(A,B,C) -> coll(A,C,B))) # label(ruleD1) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	63 (all A all B all C all D all M all N exists P (midp(M,A,B) & midp(N,C,D) -> para(P,N,A,C) & para(P,M,B,D) & midp(P,A,D))) # label(ruleX6) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	64 (all A all B all C (cong(A,B,A,C) & coll(A,B,C) -> midp(A,B,C))) # label(ruleD67) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	65 (all A all B all C all D (para(A,B,C,D) & cyclic(A,B,C,D) -> eqangle(A,D,C,D,C,D,C,B))) # label(ruleD54) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	66 (all A all B all C all D all P all Q all U all V (eqangle(A,B,C,D,P,Q,U,V) -> eqangle(P,Q,U,V,A,B,C,D))) # label(ruleD20) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	67 (all A all B all C all D (eqangle(A,B,C,D,C,D,A,B) & -para(A,B,C,D) -> perp(A,B,C,D))) # label(ruleD71) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	68 (all A all B all M all O (perp(O,M,A,B) & midp(M,A,B) -> cong(O,A,O,B))) # label(ruleD55) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	69 (all A all B all C all D all O exists P (cong(O,C,O,D) & perp(A,B,B,O) -> cong(O,C,O,P) & cong(B,C,B,P) & para(P,C,A,B))) # label(ruleX9) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	70 (all A all B all C all D all P all Q (para(A,B,C,D) -> eqangle(A,B,P,Q,C,D,P,Q))) # label(ruleD40) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	71 (all A all B all O exists C (cong(O,A,O,B) & perp(A,O,O,B) -> coll(A,O,C) & cong(O,A,O,C))) # label(ruleX17) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	72 (all A all B all C all P all Q all R (simtri(B,A,C,Q,P,R) -> simtri(A,B,C,P,Q,R))) # label(ruleD32) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	73 (all A all B all C all P all Q all R (cyclic(A,B,C,P) & eqangle(C,A,C,B,R,P,R,Q) & cyclic(A,B,C,R) & cyclic(A,B,C,Q) -> cong(A,B,P,Q))) # label(ruleD43) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	74 (all A all B all P all Q (eqangle(P,A,P,B,Q,A,Q,B) & coll(P,Q,B) -> cyclic(A,B,P,Q))) # label(ruleD42b) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	75 (all A all B all C all O exists P (circle(O,A,B,C) -> perp(P,A,A,O))) # label(ruleX11) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	76 (all A all B all C all P all Q all R (simtri(A,B,C,P,Q,R) -> eqangle(A,B,B,C,P,Q,Q,R))) # label(ruleD60) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	77 (all A all B all C all P all Q all R (simtri(P,Q,R,A,B,C) -> simtri(A,B,C,P,Q,R))) # label(ruleD33) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	78 (all A all B all C (midp(A,B,C) -> coll(A,B,C))) # label(ruleD69) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	79 (all A all M all O all X exists B (perp(O,M,M,A) & eqangle(X,O,M,O,M,O,A,O) -> coll(B,O,X) & coll(B,A,M))) # label(ruleX1) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	80 (all A all B all C all D all P all Q (eqangle(A,B,P,Q,C,D,P,Q) -> para(A,B,C,D))) # label(ruleD39) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	81 (all A all B all C all D all P all Q all U all V (eqangle(A,B,C,D,P,Q,U,V) -> eqangle(C,D,A,B,U,V,P,Q))) # label(ruleD19) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	82 (all A all B all C all O all X (perp(O,A,A,X) & circle(O,A,B,C) -> eqangle(A,X,A,B,C,A,C,B))) # label(ruleD48) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	83 (all A all B all P all Q (eqangle(P,A,P,B,Q,A,Q,B) & -coll(P,Q,A) -> cyclic(A,B,P,Q))) # label(ruleD42a) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	84 (all A all B all C all D (cyclic(A,B,C,D) -> cyclic(B,A,C,D))) # label(ruleD16) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	85 (all A all B all C all D all P all Q all U all V (eqangle(A,B,C,D,P,Q,U,V) -> eqangle(A,B,P,Q,C,D,U,V))) # label(ruleD21) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	86 (all A all B all C all D all P all Q all U all V (para(P,Q,U,V) & eqangle(A,B,C,D,P,Q,U,V) -> para(A,B,C,D))) # label(ruleD73) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	87 (all A all B all C all D all M (midp(M,C,D) & midp(M,A,B) -> para(A,C,B,D))) # label(ruleD63) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	88 (all A all B all C all D all P all Q all U all V (eqangle(A,B,C,D,P,Q,U,V) & perp(P,Q,U,V) -> perp(A,B,C,D))) # label(ruleD74) # label(axiom) # label(non_clause).  [assumption].
0.67/0.93	89 (all A all B all M all P all Q all R all M exists X (para(A,P,R,M) & coll(P,Q,R) & para(A,P,B,Q) & midp(M,A,B) -> coll(X,M,R) & coll(X,A,Q))) # label(ruleX8) # label(axiom) # label(non_clause).  [assumption].
0.67/0.94	90 (all A all B all C all D all M all N exists P exists Q (cong(M,A,M,D) & cong(N,A,N,B) & N != M & circle(M,A,B,C) -> coll(P,A,C) & cong(P,N,N,A) & coll(Q,B,D) & cong(Q,N,N,A))) # label(ruleX12) # label(axiom) # label(non_clause).  [assumption].
0.67/0.94	91 (all A all B all C all E all F (midp(E,A,B) & midp(F,A,C) -> para(E,F,B,C))) # label(ruleD44) # label(axiom) # label(non_clause).  [assumption].
0.67/0.94	92 (all A all B all C all D all M all N (midp(M,A,B) & midp(N,C,D) -> eqratio(M,A,A,B,N,C,C,D))) # label(ruleD70) # label(axiom) # label(non_clause).  [assumption].
0.67/0.94	93 (all A all B all C all M (midp(M,A,C) & perp(A,B,B,C) -> cong(A,M,B,M))) # label(ruleD52) # label(axiom) # label(non_clause).  [assumption].
0.67/0.94	94 (all A all B all C all D all E all F all G all H all P all Q all U all V (eqratio(P,Q,U,V,E,F,G,H) & eqratio(A,B,C,D,P,Q,U,V) -> eqratio(A,B,C,D,E,F,G,H))) # label(ruleD30) # label(axiom) # label(non_clause).  [assumption].
0.67/0.94	95 -(all A all B all C all A1 all B1 all C1 all O (midp(A1,C,B) & circle(O,A,B,C) & midp(C1,B,A) & midp(B1,C,A) -> perp(O,A1,B1,C1))) # label(exemplo6GDDFULL012002) # label(negated_conjecture) # label(non_clause).  [assumption].
0.67/0.94	
0.67/0.94	============================== end of process non-clausal formulas ===
0.67/0.94	
0.67/0.94	============================== PROCESS INITIAL CLAUSES ===============
0.67/0.94	
0.67/0.94	============================== PREDICATE ELIMINATION =================
0.67/0.94	96 -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | circle(f6(A,B,C,D,E),A,B,C) # label(ruleX13) # label(axiom).  [clausify(26)].
0.67/0.94	97 -circle(A,B,C,D) | -eqangle(B,C,B,D,A,C,A,E) | -coll(E,C,D) | midp(E,C,D) # label(ruleD51) # label(axiom).  [clausify(6)].
0.67/0.94	98 -circle(A,B,C,D) | -eqangle(B,E,B,C,D,B,D,C) | perp(A,B,B,E) # label(ruleD49) # label(axiom).  [clausify(7)].
0.67/0.94	Derived: -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | -eqangle(A,B,A,C,f6(A,B,C,D,E),B,f6(A,B,C,D,E),F) | -coll(F,B,C) | midp(F,B,C).  [resolve(96,d,97,a)].
0.67/0.94	Derived: -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | -eqangle(A,F,A,B,C,A,C,B) | perp(f6(A,B,C,D,E),A,A,F).  [resolve(96,d,98,a)].
0.67/0.94	99 -cong(A,B,A,C) | -cong(A,B,A,D) | circle(A,B,C,D) # label(ruleD12) # label(axiom).  [clausify(29)].
0.67/0.94	Derived: -cong(A,B,A,C) | -cong(A,B,A,D) | -eqangle(B,C,B,D,A,C,A,E) | -coll(E,C,D) | midp(E,C,D).  [resolve(99,c,97,a)].
0.67/0.94	Derived: -cong(A,B,A,C) | -cong(A,B,A,D) | -eqangle(B,E,B,C,D,B,D,C) | perp(A,B,B,E).  [resolve(99,c,98,a)].
0.67/0.94	100 -cyclic(A,B,C,D) | -perp(A,C,C,B) | circle(f10(A,B,C,D),A,B,C) # label(ruleX14) # label(axiom).  [clausify(42)].
0.67/0.94	Derived: -cyclic(A,B,C,D) | -perp(A,C,C,B) | -eqangle(A,B,A,C,f10(A,B,C,D),B,f10(A,B,C,D),E) | -coll(E,B,C) | midp(E,B,C).  [resolve(100,c,97,a)].
0.67/0.94	Derived: -cyclic(A,B,C,D) | -perp(A,C,C,B) | -eqangle(A,E,A,B,C,A,C,B) | perp(f10(A,B,C,D),A,A,E).  [resolve(100,c,98,a)].
0.67/0.94	101 -midp(A,B,C) | -circle(D,E,B,C) | eqangle(E,B,E,C,D,B,D,A) # label(ruleD50) # label(axiom).  [clausify(57)].
0.67/0.94	Derived: -midp(A,B,C) | eqangle(D,B,D,C,f6(D,B,C,E,F),B,f6(D,B,C,E,F),A) | -cyclic(D,B,C,E) | -para(D,B,C,E) | -midp(F,D,B).  [resolve(101,b,96,d)].
0.67/0.94	Derived: -midp(A,B,C) | eqangle(D,B,D,C,E,B,E,A) | -cong(E,D,E,B) | -cong(E,D,E,C).  [resolve(101,b,99,c)].
0.67/0.94	Derived: -midp(A,B,C) | eqangle(D,B,D,C,f10(D,B,C,E),B,f10(D,B,C,E),A) | -cyclic(D,B,C,E) | -perp(D,C,C,B).  [resolve(101,b,100,c)].
0.67/0.94	102 -circle(A,B,C,D) | -coll(A,B,D) | perp(B,C,C,D) # label(ruleD53) # label(axiom).  [clausify(59)].
0.67/0.94	Derived: -coll(f6(A,B,C,D,E),A,C) | perp(A,B,B,C) | -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B).  [resolve(102,a,96,d)].
0.67/0.94	Derived: -coll(A,B,C) | perp(B,D,D,C) | -cong(A,B,A,D) | -cong(A,B,A,C).  [resolve(102,a,99,c)].
0.67/0.94	Derived: -coll(f10(A,B,C,D),A,C) | perp(A,B,B,C) | -cyclic(A,B,C,D) | -perp(A,C,C,B).  [resolve(102,a,100,c)].
0.67/0.94	103 -circle(A,B,C,D) | perp(f16(B,C,D,A),B,B,A) # label(ruleX11) # label(axiom).  [clausify(75)].
0.67/0.94	Derived: perp(f16(A,B,C,f6(A,B,C,D,E)),A,A,f6(A,B,C,D,E)) | -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B).  [resolve(103,a,96,d)].
0.67/0.94	Derived: perp(f16(A,B,C,D),A,A,D) | -cong(D,A,D,B) | -cong(D,A,D,C).  [resolve(103,a,99,c)].
0.67/0.94	Derived: perp(f16(A,B,C,f10(A,B,C,D)),A,A,f10(A,B,C,D)) | -cyclic(A,B,C,D) | -perp(A,C,C,B).  [resolve(103,a,100,c)].
0.67/0.94	104 -perp(A,B,B,C) | -circle(A,B,D,E) | eqangle(B,C,B,D,E,B,E,D) # label(ruleD48) # label(axiom).  [clausify(82)].
0.67/0.94	Derived: -perp(f6(A,B,C,D,E),A,A,F) | eqangle(A,F,A,B,C,A,C,B) | -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B).  [resolve(104,b,96,d)].
0.67/0.94	Derived: -perp(A,B,B,C) | eqangle(B,C,B,D,E,B,E,D) | -cong(A,B,A,D) | -cong(A,B,A,E).  [resolve(104,b,99,c)].
0.67/0.94	Derived: -perp(f10(A,B,C,D),A,A,E) | eqangle(A,E,A,B,C,A,C,B) | -cyclic(A,B,C,D) | -perp(A,C,C,B).  [resolve(104,b,100,c)].
0.67/0.94	105 -cong(A,B,A,C) | -cong(D,B,D,E) | D = A | -circle(A,B,E,F) | coll(f19(B,E,F,C,A,D),B,F) # label(ruleX12) # label(axiom).  [clausify(90)].
0.67/0.94	Derived: -cong(f6(A,B,C,D,E),A,f6(A,B,C,D,E),F) | -cong(V6,A,V6,B) | V6 = f6(A,B,C,D,E) | coll(f19(A,B,C,F,f6(A,B,C,D,E),V6),A,C) | -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B).  [resolve(105,d,96,d)].
0.67/0.94	Derived: -cong(A,B,A,C) | -cong(D,B,D,E) | D = A | coll(f19(B,E,F,C,A,D),B,F) | -cong(A,B,A,E) | -cong(A,B,A,F).  [resolve(105,d,99,c)].
0.67/0.94	Derived: -cong(f10(A,B,C,D),A,f10(A,B,C,D),E) | -cong(F,A,F,B) | F = f10(A,B,C,D) | coll(f19(A,B,C,E,f10(A,B,C,D),F),A,C) | -cyclic(A,B,C,D) | -perp(A,C,C,B).  [resolve(105,d,100,c)].
0.67/0.94	106 -cong(A,B,A,C) | -cong(D,B,D,E) | D = A | -circle(A,B,E,F) | cong(f19(B,E,F,C,A,D),D,D,B) # label(ruleX12) # label(axiom).  [clausify(90)].
0.67/0.94	Derived: -cong(f6(A,B,C,D,E),A,f6(A,B,C,D,E),F) | -cong(V6,A,V6,B) | V6 = f6(A,B,C,D,E) | cong(f19(A,B,C,F,f6(A,B,C,D,E),V6),V6,V6,A) | -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B).  [resolve(106,d,96,d)].
0.67/0.94	Derived: -cong(A,B,A,C) | -cong(D,B,D,E) | D = A | cong(f19(B,E,F,C,A,D),D,D,B) | -cong(A,B,A,E) | -cong(A,B,A,F).  [resolve(106,d,99,c)].
0.67/0.94	Derived: -cong(f10(A,B,C,D),A,f10(A,B,C,D),E) | -cong(F,A,F,B) | F = f10(A,B,C,D) | cong(f19(A,B,C,E,f10(A,B,C,D),F),F,F,A) | -cyclic(A,B,C,D) | -perp(A,C,C,B).  [resolve(106,d,100,c)].
0.67/0.94	107 -cong(A,B,A,C) | -cong(D,B,D,E) | D = A | -circle(A,B,E,F) | coll(f20(B,E,F,C,A,D),E,C) # label(ruleX12) # label(axiom).  [clausify(90)].
0.67/0.94	Derived: -cong(f6(A,B,C,D,E),A,f6(A,B,C,D,E),F) | -cong(V6,A,V6,B) | V6 = f6(A,B,C,D,E) | coll(f20(A,B,C,F,f6(A,B,C,D,E),V6),B,F) | -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B).  [resolve(107,d,96,d)].
0.67/0.94	Derived: -cong(A,B,A,C) | -cong(D,B,D,E) | D = A | coll(f20(B,E,F,C,A,D),E,C) | -cong(A,B,A,E) | -cong(A,B,A,F).  [resolve(107,d,99,c)].
0.67/0.94	Derived: -cong(f10(A,B,C,D),A,f10(A,B,C,D),E) | -cong(F,A,F,B) | F = f10(A,B,C,D) | coll(f20(A,B,C,E,f10(A,B,C,D),F),B,E) | -cyclic(A,B,C,D) | -perp(A,C,C,B).  [resolve(107,d,100,c)].
0.67/0.94	108 -cong(A,B,A,C) | -cong(D,B,D,E) | D = A | -circle(A,B,E,F) | cong(f20(B,E,F,C,A,D),D,D,B) # label(ruleX12) # label(axiom).  [clausify(90)].
0.67/0.94	Derived: -cong(f6(A,B,C,D,E),A,f6(A,B,C,D,E),F) | -cong(V6,A,V6,B) | V6 = f6(A,B,C,D,E) | cong(f20(A,B,C,F,f6(A,B,C,D,E),V6),V6,V6,A) | -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B).  [resolve(108,d,96,d)].
0.67/0.94	Derived: -cong(A,B,A,C) | -cong(D,B,D,E) | D = A | cong(f20(B,E,F,C,A,D),D,D,B) | -cong(A,B,A,E) | -cong(A,B,A,F).  [resolve(108,d,99,c)].
0.67/0.94	Derived: -cong(f10(A,B,C,D),A,f10(A,B,C,D),E) | -cong(F,A,F,B) | F = f10(A,B,C,D) | cong(f20(A,B,C,E,f10(A,B,C,D),F),F,F,A) | -cyclic(A,B,C,D) | -perp(A,C,C,B).  [resolve(108,d,100,c)].
0.67/0.94	109 circle(c7,c1,c2,c3) # label(exemplo6GDDFULL012002) # label(negated_conjecture).  [clausify(95)].
0.67/0.94	Derived: -eqangle(c1,c2,c1,c3,c7,c2,c7,A) | -coll(A,c2,c3) | midp(A,c2,c3).  [resolve(109,a,97,a)].
0.67/0.94	Derived: -eqangle(c1,A,c1,c2,c3,c1,c3,c2) | perp(c7,c1,c1,A).  [resolve(109,a,98,a)].
0.67/0.94	Derived: -midp(A,c2,c3) | eqangle(c1,c2,c1,c3,c7,c2,c7,A).  [resolve(109,a,101,b)].
0.67/0.94	Derived: -coll(c7,c1,c3) | perp(c1,c2,c2,c3).  [resolve(109,a,102,a)].
0.67/0.94	Derived: perp(f16(c1,c2,c3,c7),c1,c1,c7).  [resolve(109,a,103,a)].
0.67/0.94	Derived: -perp(c7,c1,c1,A) | eqangle(c1,A,c1,c2,c3,c1,c3,c2).  [resolve(109,a,104,b)].
0.67/0.94	Derived: -cong(c7,c1,c7,A) | -cong(B,c1,B,c2) | B = c7 | coll(f19(c1,c2,c3,A,c7,B),c1,c3).  [resolve(109,a,105,d)].
0.67/0.94	Derived: -cong(c7,c1,c7,A) | -cong(B,c1,B,c2) | B = c7 | cong(f19(c1,c2,c3,A,c7,B),B,B,c1).  [resolve(109,a,106,d)].
5.32/5.61	Derived: -cong(c7,c1,c7,A) | -cong(B,c1,B,c2) | B = c7 | coll(f20(c1,c2,c3,A,c7,B),c2,A).  [resolve(109,a,107,d)].
5.32/5.61	Derived: -cong(c7,c1,c7,A) | -cong(B,c1,B,c2) | B = c7 | cong(f20(c1,c2,c3,A,c7,B),B,B,c1).  [resolve(109,a,108,d)].
5.32/5.61	
5.32/5.61	============================== end predicate elimination =============
5.32/5.61	
5.32/5.61	Auto_denials:  (non-Horn, no changes).
5.32/5.61	
5.32/5.61	Term ordering decisions:
5.32/5.61	Function symbol KB weights:  c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. f15=1. f1=1. f2=1. f3=1. f5=1. f8=1. f10=1. f16=1. f17=1. f4=1. f6=1. f9=1. f11=1. f14=1. f7=1. f13=1. f19=1. f20=1. f12=1. f18=1.
5.32/5.61	
5.32/5.61	============================== end of process initial clauses ========
5.32/5.61	
5.32/5.61	============================== CLAUSES FOR SEARCH ====================
5.32/5.61	
5.32/5.61	============================== end of clauses for search =============
5.32/5.61	
5.32/5.61	============================== SEARCH ================================
5.32/5.61	
5.32/5.61	% Starting search at 0.04 seconds.
5.32/5.61	
5.32/5.61	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 575 (0.00 of 0.23 sec).
5.32/5.61	
5.32/5.61	Low Water (keep): wt=48.000, iters=3432
5.32/5.61	
5.32/5.61	Low Water (keep): wt=42.000, iters=3349
5.32/5.61	
5.32/5.61	Low Water (keep): wt=40.000, iters=3349
5.32/5.61	
5.32/5.61	Low Water (keep): wt=33.000, iters=3333
5.32/5.61	
5.32/5.61	Low Water (keep): wt=32.000, iters=3359
5.32/5.61	
5.32/5.61	Low Water (keep): wt=29.000, iters=3336
5.32/5.61	
5.32/5.61	Low Water (keep): wt=27.000, iters=3371
5.32/5.61	
5.32/5.61	Low Water (keep): wt=26.000, iters=3346
5.32/5.61	
5.32/5.61	Low Water (keep): wt=25.000, iters=3356
5.32/5.61	
5.32/5.61	Low Water (keep): wt=24.000, iters=3563
5.32/5.61	
5.32/5.61	Low Water (keep): wt=23.000, iters=3439
5.32/5.61	
5.32/5.61	Low Water (keep): wt=22.000, iters=3423
5.32/5.61	
5.32/5.61	Low Water (keep): wt=19.000, iters=3347
5.32/5.61	
5.32/5.61	Low Water (keep): wt=18.000, iters=3338
5.32/5.61	
5.32/5.61	Low Water (keep): wt=17.000, iters=3609
5.32/5.61	
5.32/5.61	Low Water (keep): wt=15.000, iters=3346
5.32/5.61	
5.32/5.61	Low Water (keep): wt=14.000, iters=3360
5.32/5.61	
5.32/5.61	Low Water (displace): id=3085, wt=53.000
5.32/5.61	
5.32/5.61	Low Water (displace): id=12846, wt=13.000
5.32/5.61	
5.32/5.61	Low Water (displace): id=12856, wt=12.000
5.32/5.61	
5.32/5.61	Low Water (displace): id=12857, wt=10.000
5.32/5.61	
5.32/5.61	Low Water (keep): wt=13.000, iters=3333
5.32/5.61	
5.32/5.61	Low Water (displace): id=13489, wt=9.000
5.32/5.61	
5.32/5.61	Low Water (displace): id=13716, wt=8.000
5.32/5.61	
5.32/5.61	Low Water (keep): wt=12.000, iters=3345
5.32/5.61	
5.32/5.61	Low Water (keep): wt=11.000, iters=3333
5.32/5.61	
5.32/5.61	Low Water (keep): wt=10.000, iters=3333
5.32/5.61	
5.32/5.61	Low Water (displace): id=20515, wt=5.000
5.32/5.61	
5.32/5.61	Low Water (keep): wt=9.000, iters=3333
5.32/5.61	
5.32/5.61	============================== PROOF =================================
5.32/5.61	% SZS status Theorem
5.32/5.61	% SZS output start Refutation
5.32/5.61	
5.32/5.61	% Proof 1 at 4.62 (+ 0.08) seconds.
5.32/5.61	% Length of proof is 217.
5.32/5.61	% Level of proof is 36.
5.32/5.61	% Maximum clause weight is 29.000.
5.32/5.61	% Given clauses 8719.
5.32/5.61	
5.32/5.61	3 (all A all B all C all D (para(A,B,C,D) -> para(C,D,A,B))) # label(ruleD5) # label(axiom) # label(non_clause).  [assumption].
5.32/5.61	5 (all A all B all C all D (cyclic(A,B,C,D) -> cyclic(A,C,B,D))) # label(ruleD15) # label(axiom) # label(non_clause).  [assumption].
5.32/5.61	8 (all A all B all C all D all M (midp(M,A,B) & para(A,D,B,C) & para(A,C,B,D) -> midp(M,C,D))) # label(ruleD64) # label(axiom) # label(non_clause).  [assumption].
5.32/5.61	11 (all A all B all C all D all O (cong(O,A,O,D) & cong(O,A,O,C) & cong(O,A,O,B) -> cyclic(A,B,C,D))) # label(ruleD13) # label(axiom) # label(non_clause).  [assumption].
5.32/5.61	14 (all A all B all C all D all E (cyclic(A,B,C,D) & cyclic(A,B,C,E) -> cyclic(B,C,D,E))) # label(ruleD17) # label(axiom) # label(non_clause).  [assumption].
5.32/5.61	17 (all A all B all C (coll(A,B,C) -> coll(B,A,C))) # label(ruleD2) # label(axiom) # label(non_clause).  [assumption].
5.32/5.61	19 (all A all B all C all D all E all F (cong(C,D,E,F) & cong(A,B,C,D) -> cong(A,B,E,F))) # label(ruleD25) # label(axiom) # label(non_clause).  [assumption].
5.32/5.61	20 (all A all B all C all D (cyclic(A,B,C,D) -> cyclic(A,B,D,C))) # label(ruleD14) # label(axiom) # label(non_clause).  [assumption].
5.32/5.61	22 (all A all B all C (midp(A,B,C) -> cong(A,B,A,C))) # label(ruleD68) # label(axiom) # label(non_clause).  [assumption].
5.32/5.61	23 (all A all B all C all D all E all F (para(A,B,C,D) & para(C,D,E,F) -> para(A,B,E,F))) # label(ruleD6) # label(axiom) # label(non_clause).  [assumption].
5.32/5.61	29 (all A all B all C all O (cong(O,A,O,B) & cong(O,A,O,C) -> circle(O,A,B,C))) # label(ruleD12) # label(axiom) # label(non_clause).  [assumption].
5.32/5.61	39 (all A all B all C all D (perp(A,B,C,D) -> perp(C,D,A,B))) # label(ruleD8) # label(axiom) # label(non_clause).  [assumption].
5.32/5.61	44 (all A all B all C all D (para(A,B,C,D) -> para(A,B,D,C))) # label(ruleD4) # label(axiom) # label(non_clause).  [assumption].
5.32/5.61	45 (all A all B all C (para(A,B,A,C) -> coll(A,B,C))) # label(ruleD66) # label(axiom) # label(non_clause).  [assumption].
5.32/5.61	46 (all A all B all P all Q (cong(A,P,B,P) & cong(A,Q,B,Q) -> perp(A,B,P,Q))) # label(ruleD56) # label(axiom) # label(non_clause).  [assumption].
5.32/5.61	47 (all A all B all M (midp(M,B,A) -> midp(M,A,B))) # label(ruleD11) # label(axiom) # label(non_clause).  [assumption].
5.32/5.61	48 (all A all B all C all D (cong(A,B,C,D) -> cong(A,B,D,C))) # label(ruleD23) # label(axiom) # label(non_clause).  [assumption].
5.32/5.61	49 (all A all B all C all D all E all F (perp(C,D,E,F) & perp(A,B,C,D) -> para(A,B,E,F))) # label(ruleD9) # label(axiom) # label(non_clause).  [assumption].
5.32/5.61	52 (all A all B all C all D all E all F (perp(C,D,E,F) & para(A,B,C,D) -> perp(A,B,E,F))) # label(ruleD10) # label(axiom) # label(non_clause).  [assumption].
5.32/5.61	53 (all A all B all C all D (coll(A,B,C) & coll(A,B,D) -> coll(C,D,A))) # label(ruleD3) # label(axiom) # label(non_clause).  [assumption].
5.32/5.61	56 (all A all B all C all D (cong(A,B,C,D) -> cong(C,D,A,B))) # label(ruleD24) # label(axiom) # label(non_clause).  [assumption].
5.32/5.61	59 (all A all B all C all O (circle(O,A,B,C) & coll(O,A,C) -> perp(A,B,B,C))) # label(ruleD53) # label(axiom) # label(non_clause).  [assumption].
5.32/5.61	62 (all A all B all C (coll(A,B,C) -> coll(A,C,B))) # label(ruleD1) # label(axiom) # label(non_clause).  [assumption].
5.32/5.61	64 (all A all B all C (cong(A,B,A,C) & coll(A,B,C) -> midp(A,B,C))) # label(ruleD67) # label(axiom) # label(non_clause).  [assumption].
5.32/5.61	68 (all A all B all M all O (perp(O,M,A,B) & midp(M,A,B) -> cong(O,A,O,B))) # label(ruleD55) # label(axiom) # label(non_clause).  [assumption].
5.32/5.61	70 (all A all B all C all D all P all Q (para(A,B,C,D) -> eqangle(A,B,P,Q,C,D,P,Q))) # label(ruleD40) # label(axiom) # label(non_clause).  [assumption].
5.32/5.61	73 (all A all B all C all P all Q all R (cyclic(A,B,C,P) & eqangle(C,A,C,B,R,P,R,Q) & cyclic(A,B,C,R) & cyclic(A,B,C,Q) -> cong(A,B,P,Q))) # label(ruleD43) # label(axiom) # label(non_clause).  [assumption].
5.32/5.61	75 (all A all B all C all O exists P (circle(O,A,B,C) -> perp(P,A,A,O))) # label(ruleX11) # label(axiom) # label(non_clause).  [assumption].
5.32/5.61	78 (all A all B all C (midp(A,B,C) -> coll(A,B,C))) # label(ruleD69) # label(axiom) # label(non_clause).  [assumption].
5.32/5.61	84 (all A all B all C all D (cyclic(A,B,C,D) -> cyclic(B,A,C,D))) # label(ruleD16) # label(axiom) # label(non_clause).  [assumption].
5.32/5.61	87 (all A all B all C all D all M (midp(M,C,D) & midp(M,A,B) -> para(A,C,B,D))) # label(ruleD63) # label(axiom) # label(non_clause).  [assumption].
5.32/5.61	91 (all A all B all C all E all F (midp(E,A,B) & midp(F,A,C) -> para(E,F,B,C))) # label(ruleD44) # label(axiom) # label(non_clause).  [assumption].
5.32/5.61	93 (all A all B all C all M (midp(M,A,C) & perp(A,B,B,C) -> cong(A,M,B,M))) # label(ruleD52) # label(axiom) # label(non_clause).  [assumption].
5.32/5.61	95 -(all A all B all C all A1 all B1 all C1 all O (midp(A1,C,B) & circle(O,A,B,C) & midp(C1,B,A) & midp(B1,C,A) -> perp(O,A1,B1,C1))) # label(exemplo6GDDFULL012002) # label(negated_conjecture) # label(non_clause).  [assumption].
5.32/5.61	99 -cong(A,B,A,C) | -cong(A,B,A,D) | circle(A,B,C,D) # label(ruleD12) # label(axiom).  [clausify(29)].
5.32/5.61	102 -circle(A,B,C,D) | -coll(A,B,D) | perp(B,C,C,D) # label(ruleD53) # label(axiom).  [clausify(59)].
5.32/5.61	103 -circle(A,B,C,D) | perp(f16(B,C,D,A),B,B,A) # label(ruleX11) # label(axiom).  [clausify(75)].
5.32/5.61	109 circle(c7,c1,c2,c3) # label(exemplo6GDDFULL012002) # label(negated_conjecture).  [clausify(95)].
5.32/5.61	115 -para(A,B,C,D) | para(C,D,A,B) # label(ruleD5) # label(axiom).  [clausify(3)].
5.32/5.61	117 -cyclic(A,B,C,D) | cyclic(A,C,B,D) # label(ruleD15) # label(axiom).  [clausify(5)].
5.32/5.61	118 -midp(A,B,C) | -para(B,D,C,E) | -para(B,E,C,D) | midp(A,E,D) # label(ruleD64) # label(axiom).  [clausify(8)].
5.32/5.61	122 -cong(A,B,A,C) | -cong(A,B,A,D) | -cong(A,B,A,E) | cyclic(B,E,D,C) # label(ruleD13) # label(axiom).  [clausify(11)].
5.32/5.61	125 -cyclic(A,B,C,D) | -cyclic(A,B,C,E) | cyclic(B,C,D,E) # label(ruleD17) # label(axiom).  [clausify(14)].
5.32/5.61	128 -coll(A,B,C) | coll(B,A,C) # label(ruleD2) # label(axiom).  [clausify(17)].
5.32/5.61	130 -cong(A,B,C,D) | -cong(E,F,A,B) | cong(E,F,C,D) # label(ruleD25) # label(axiom).  [clausify(19)].
5.32/5.61	131 -cyclic(A,B,C,D) | cyclic(A,B,D,C) # label(ruleD14) # label(axiom).  [clausify(20)].
5.32/5.61	134 -midp(A,B,C) | cong(A,B,A,C) # label(ruleD68) # label(axiom).  [clausify(22)].
5.32/5.61	135 -para(A,B,C,D) | -para(C,D,E,F) | para(A,B,E,F) # label(ruleD6) # label(axiom).  [clausify(23)].
5.32/5.61	152 -perp(A,B,C,D) | perp(C,D,A,B) # label(ruleD8) # label(axiom).  [clausify(39)].
5.32/5.61	157 -para(A,B,C,D) | para(A,B,D,C) # label(ruleD4) # label(axiom).  [clausify(44)].
5.32/5.61	158 -para(A,B,A,C) | coll(A,B,C) # label(ruleD66) # label(axiom).  [clausify(45)].
5.32/5.61	159 -cong(A,B,C,B) | -cong(A,D,C,D) | perp(A,C,B,D) # label(ruleD56) # label(axiom).  [clausify(46)].
5.32/5.61	160 -midp(A,B,C) | midp(A,C,B) # label(ruleD11) # label(axiom).  [clausify(47)].
5.32/5.61	161 -cong(A,B,C,D) | cong(A,B,D,C) # label(ruleD23) # label(axiom).  [clausify(48)].
5.32/5.61	162 -perp(A,B,C,D) | -perp(E,F,A,B) | para(E,F,C,D) # label(ruleD9) # label(axiom).  [clausify(49)].
5.32/5.61	165 -perp(A,B,C,D) | -para(E,F,A,B) | perp(E,F,C,D) # label(ruleD10) # label(axiom).  [clausify(52)].
5.32/5.61	166 -coll(A,B,C) | -coll(A,B,D) | coll(C,D,A) # label(ruleD3) # label(axiom).  [clausify(53)].
5.32/5.61	169 -cong(A,B,C,D) | cong(C,D,A,B) # label(ruleD24) # label(axiom).  [clausify(56)].
5.32/5.61	173 -coll(A,B,C) | coll(A,C,B) # label(ruleD1) # label(axiom).  [clausify(62)].
5.32/5.61	177 -cong(A,B,A,C) | -coll(A,B,C) | midp(A,B,C) # label(ruleD67) # label(axiom).  [clausify(64)].
5.32/5.61	180 -perp(A,B,C,D) | -midp(B,C,D) | cong(A,C,A,D) # label(ruleD55) # label(axiom).  [clausify(68)].
5.32/5.61	184 -para(A,B,C,D) | eqangle(A,B,E,F,C,D,E,F) # label(ruleD40) # label(axiom).  [clausify(70)].
5.32/5.61	188 -cyclic(A,B,C,D) | -eqangle(C,A,C,B,E,D,E,F) | -cyclic(A,B,C,E) | -cyclic(A,B,C,F) | cong(A,B,D,F) # label(ruleD43) # label(axiom).  [clausify(73)].
5.32/5.61	192 -midp(A,B,C) | coll(A,B,C) # label(ruleD69) # label(axiom).  [clausify(78)].
5.32/5.61	198 -cyclic(A,B,C,D) | cyclic(B,A,C,D) # label(ruleD16) # label(axiom).  [clausify(84)].
5.32/5.61	201 -midp(A,B,C) | -midp(A,D,E) | para(D,B,E,C) # label(ruleD63) # label(axiom).  [clausify(87)].
5.32/5.61	205 -midp(A,B,C) | -midp(D,B,E) | para(A,D,C,E) # label(ruleD44) # label(axiom).  [clausify(91)].
5.32/5.61	207 -midp(A,B,C) | -perp(B,D,D,C) | cong(B,A,D,A) # label(ruleD52) # label(axiom).  [clausify(93)].
5.32/5.61	209 midp(c4,c3,c2) # label(exemplo6GDDFULL012002) # label(negated_conjecture).  [clausify(95)].
5.32/5.61	210 midp(c6,c2,c1) # label(exemplo6GDDFULL012002) # label(negated_conjecture).  [clausify(95)].
5.32/5.61	211 midp(c5,c3,c1) # label(exemplo6GDDFULL012002) # label(negated_conjecture).  [clausify(95)].
5.32/5.61	212 -perp(c7,c4,c5,c6) # label(exemplo6GDDFULL012002) # label(negated_conjecture).  [clausify(95)].
5.32/5.61	223 -coll(A,B,C) | perp(B,D,D,C) | -cong(A,B,A,D) | -cong(A,B,A,C).  [resolve(102,a,99,c)].
5.32/5.61	255 perp(f16(c1,c2,c3,c7),c1,c1,c7).  [resolve(109,a,103,a)].
5.32/5.61	269 -midp(A,B,C) | -para(B,D,C,D) | midp(A,D,D).  [factor(118,b,c)].
5.32/5.61	270 -cong(A,B,A,C) | -cong(A,B,A,D) | cyclic(B,D,C,C).  [factor(122,a,b)].
5.32/5.61	273 -cyclic(A,B,C,D) | cyclic(B,C,D,D).  [factor(125,a,b)].
5.32/5.61	283 -cong(A,B,C,B) | perp(A,C,B,B).  [factor(159,a,b)].
5.32/5.61	285 -coll(A,B,C) | coll(C,C,A).  [factor(166,a,b)].
5.32/5.61	294 -cyclic(A,B,C,D) | -eqangle(C,A,C,B,E,D,E,E) | -cyclic(A,B,C,E) | cong(A,B,D,E).  [factor(188,c,d)].
5.32/5.61	295 -midp(A,B,C) | para(B,B,C,C).  [factor(201,a,b)].
5.32/5.61	298 -midp(A,B,C) | para(A,A,C,C).  [factor(205,a,b)].
5.32/5.61	304 -coll(A,B,C) | perp(B,C,C,C) | -cong(A,B,A,C).  [factor(223,c,d)].
5.32/5.61	319 -cong(A,B,A,C) | cyclic(B,C,C,C).  [factor(270,a,b)].
5.32/5.61	330 -midp(A,c3,B) | para(A,c4,B,c2).  [resolve(209,a,205,b)].
5.32/5.61	332 -midp(c4,A,B) | para(c3,A,c2,B).  [resolve(209,a,201,b)].
5.32/5.61	333 -midp(c4,A,B) | para(A,c3,B,c2).  [resolve(209,a,201,a)].
5.32/5.61	334 coll(c4,c3,c2).  [resolve(209,a,192,a)].
5.32/5.61	343 midp(c4,c2,c3).  [resolve(209,a,160,a)].
5.32/5.61	344 cong(c4,c3,c4,c2).  [resolve(209,a,134,a)].
5.32/5.61	361 midp(c6,c1,c2).  [resolve(210,a,160,a)].
5.32/5.61	368 -midp(c5,A,B) | para(c3,A,c1,B).  [resolve(211,a,201,b)].
5.32/5.61	369 -midp(c5,A,B) | para(A,c3,B,c1).  [resolve(211,a,201,a)].
5.32/5.61	370 coll(c5,c3,c1).  [resolve(211,a,192,a)].
5.32/5.61	379 midp(c5,c1,c3).  [resolve(211,a,160,a)].
5.32/5.61	380 cong(c5,c3,c5,c1).  [resolve(211,a,134,a)].
5.32/5.61	391 -perp(A,B,f16(c1,c2,c3,c7),c1) | para(A,B,c1,c7).  [resolve(255,a,162,a)].
5.32/5.61	394 perp(c1,c7,f16(c1,c2,c3,c7),c1).  [resolve(255,a,152,a)].
5.32/5.61	419 para(c3,c3,c1,c1).  [resolve(295,a,211,a)].
5.32/5.61	422 para(c5,c5,c1,c1).  [resolve(298,a,211,a)].
5.32/5.61	431 coll(c4,c2,c3).  [resolve(334,a,173,a)].
5.32/5.61	447 -midp(A,c2,B) | para(A,c4,B,c3).  [resolve(343,a,205,b)].
5.32/5.61	450 -midp(c4,A,B) | para(A,c2,B,c3).  [resolve(343,a,201,a)].
5.32/5.61	459 cong(c4,c2,c4,c3).  [resolve(343,a,134,a)].
5.32/5.61	476 -midp(A,c1,B) | para(A,c6,B,c2).  [resolve(361,a,205,b)].
5.32/5.61	493 coll(c1,c1,c5).  [resolve(370,a,285,a)].
5.32/5.61	494 coll(c5,c1,c3).  [resolve(370,a,173,a)].
5.32/5.61	512 -midp(c5,A,B) | para(c1,A,c3,B).  [resolve(379,a,201,b)].
5.32/5.61	513 -midp(c5,A,B) | para(A,c1,B,c3).  [resolve(379,a,201,a)].
5.32/5.61	522 cong(c5,c1,c5,c3).  [resolve(379,a,134,a)].
5.32/5.61	527 coll(c3,c3,c4).  [resolve(431,a,285,a)].
5.32/5.61	530 coll(c2,c4,c3).  [resolve(431,a,128,a)].
5.32/5.61	531 para(c5,c4,c1,c2).  [resolve(330,a,211,a)].
5.32/5.61	553 -coll(c1,c1,A) | coll(A,c5,c1).  [resolve(493,a,166,b)].
5.32/5.61	555 coll(c3,c3,c5).  [resolve(494,a,285,a)].
5.32/5.61	567 para(c3,c2,c2,c3).  [resolve(332,a,343,a)].
5.32/5.61	573 coll(c3,c4,c3).  [resolve(527,a,173,a)].
5.32/5.61	576 coll(c3,c3,c2).  [resolve(530,a,285,a)].
5.32/5.61	627 coll(c3,c5,c3).  [resolve(555,a,173,a)].
5.32/5.61	664 coll(c4,c3,c3).  [resolve(573,a,128,a)].
5.32/5.61	665 coll(c3,c2,c3).  [resolve(576,a,173,a)].
5.32/5.61	727 coll(c5,c3,c3).  [resolve(627,a,128,a)].
5.32/5.61	746 cyclic(c3,c2,c2,c2).  [resolve(344,a,319,a)].
5.32/5.61	814 cong(c4,c3,c2,c4).  [resolve(344,a,161,a)].
5.32/5.61	815 -cong(c4,c2,A,B) | cong(c4,c3,A,B).  [resolve(344,a,130,b)].
5.32/5.61	832 coll(c2,c3,c3).  [resolve(665,a,128,a)].
5.32/5.61	1044 -cong(c5,c1,A,B) | cong(c5,c3,A,B).  [resolve(380,a,130,b)].
5.32/5.61	1061 -para(A,B,c3,c3) | para(A,B,c1,c1).  [resolve(419,a,135,b)].
5.32/5.61	1102 -para(c1,c1,A,B) | para(c5,c5,A,B).  [resolve(422,a,135,a)].
5.32/5.61	1171 cyclic(c2,c3,c3,c3).  [resolve(459,a,319,a)].
5.32/5.61	1209 perp(c2,c3,c3,c3).  [resolve(459,a,304,c),unit_del(a,431)].
5.32/5.61	1495 para(c1,c2,c5,c4).  [resolve(531,a,115,a)].
5.32/5.61	1527 -perp(c2,c3,A,B) | perp(c3,c2,A,B).  [resolve(567,a,165,b)].
5.32/5.61	1528 para(c3,c2,c3,c2).  [resolve(567,a,157,a)].
5.32/5.61	1566 cyclic(c2,c3,c2,c2).  [resolve(746,a,198,a)].
5.32/5.61	1597 cong(c2,c4,c4,c3).  [resolve(814,a,169,a)].
5.32/5.61	1845 -midp(A,c2,c3) | cong(c2,A,c3,A).  [resolve(1209,a,207,b)].
5.32/5.61	2015 -perp(c5,c4,A,B) | perp(c1,c2,A,B).  [resolve(1495,a,165,b)].
5.32/5.61	2064 eqangle(c3,c2,A,B,c3,c2,A,B).  [resolve(1528,a,184,a)].
5.32/5.61	2118 cyclic(c2,c2,c3,c2).  [resolve(1566,a,117,a)].
5.32/5.61	2132 cong(c2,c4,c3,c4).  [resolve(1597,a,161,a)].
5.32/5.61	2135 para(c3,c1,c1,c3).  [resolve(368,a,379,a)].
5.32/5.61	2507 cyclic(c2,c2,c2,c3).  [resolve(2118,a,131,a)].
5.32/5.61	2532 -cong(c2,A,c3,A) | perp(c2,c3,A,c4).  [resolve(2132,a,159,b)].
5.32/5.61	2549 para(c3,c1,c3,c1).  [resolve(2135,a,157,a)].
5.32/5.61	2825 cyclic(c2,c2,c3,c3).  [resolve(2507,a,273,a)].
5.32/5.61	2872 -midp(A,c3,c3) | midp(A,c1,c1).  [resolve(2549,a,269,b)].
5.32/5.61	3142 cyclic(c2,c3,c2,c3).  [resolve(2825,a,117,a)].
5.32/5.61	3327 cyclic(c2,c3,c3,c2).  [resolve(3142,a,131,a)].
5.32/5.61	3538 para(c1,c7,c1,c7).  [resolve(394,a,391,a)].
5.32/5.61	3556 -midp(A,c1,c1) | midp(A,c7,c7).  [resolve(3538,a,269,b)].
5.32/5.61	3562 coll(c1,c7,c7).  [resolve(3538,a,158,a)].
5.32/5.61	3568 coll(c7,c7,c1).  [resolve(3562,a,285,a)].
5.32/5.61	3576 coll(c1,c1,c7).  [resolve(3568,a,285,a)].
5.32/5.61	3598 coll(c1,c7,c1).  [resolve(3576,a,173,a)].
5.32/5.61	3606 coll(c7,c1,c1).  [resolve(3598,a,128,a)].
5.32/5.61	4883 coll(c7,c5,c1).  [resolve(553,a,3576,a)].
5.32/5.61	4886 coll(c7,c1,c5).  [resolve(4883,a,173,a)].
5.32/5.61	4898 coll(c5,c5,c7).  [resolve(4886,a,285,a)].
5.32/5.61	4906 coll(c5,c7,c5).  [resolve(4898,a,173,a)].
5.32/5.61	4927 coll(c7,c5,c5).  [resolve(4906,a,128,a)].
5.32/5.61	4930 para(c5,c6,c3,c2).  [resolve(476,a,379,a)].
5.32/5.61	4949 -perp(c3,c2,A,B) | perp(c5,c6,A,B).  [resolve(4930,a,165,b)].
5.32/5.61	7978 cong(c4,c3,c4,c3).  [resolve(815,a,459,a)].
5.32/5.61	8094 midp(c4,c3,c3).  [resolve(7978,a,177,a),unit_del(a,664)].
5.32/5.61	8116 midp(c4,c1,c1).  [resolve(8094,a,2872,a)].
5.32/5.61	8146 para(c3,c2,c3,c3).  [resolve(8094,a,450,a)].
5.32/5.61	8180 para(c3,c3,c3,c2).  [resolve(8094,a,333,a)].
5.32/5.61	8249 para(c1,c2,c1,c3).  [resolve(8116,a,450,a)].
5.32/5.61	8281 para(c1,c3,c1,c2).  [resolve(8116,a,333,a)].
5.32/5.61	8571 -midp(A,c3,c3) | midp(A,c2,c3).  [resolve(8146,a,118,c),unit_del(b,8180)].
5.32/5.61	8737 -midp(A,c1,c1) | midp(A,c2,c3).  [resolve(8249,a,118,c),unit_del(b,8281)].
5.32/5.61	13387 cong(c5,c3,c5,c3).  [resolve(1044,a,522,a)].
5.32/5.61	13555 midp(c5,c3,c3).  [resolve(13387,a,177,a),unit_del(a,727)].
5.32/5.61	13559 midp(c5,c2,c3).  [resolve(13555,a,8571,a)].
5.32/5.61	13560 midp(c5,c1,c1).  [resolve(13555,a,2872,a)].
5.32/5.61	13570 para(c3,c1,c3,c3).  [resolve(13555,a,513,a)].
5.32/5.61	13602 para(c3,c3,c3,c1).  [resolve(13555,a,369,a)].
5.32/5.61	13671 para(c5,c4,c3,c3).  [resolve(13559,a,447,a)].
5.32/5.61	13720 midp(c5,c7,c7).  [resolve(13560,a,3556,a)].
5.32/5.61	13963 para(c1,c7,c3,c7).  [resolve(13720,a,512,a)].
5.32/5.61	14027 cong(c5,c7,c5,c7).  [resolve(13720,a,134,a)].
5.32/5.61	14191 -midp(A,c3,c3) | midp(A,c1,c3).  [resolve(13602,a,118,b),unit_del(b,13570)].
5.32/5.61	14254 para(c5,c4,c1,c1).  [resolve(13671,a,1061,a)].
5.32/5.61	14394 -midp(A,c1,c3) | midp(A,c7,c7).  [resolve(13963,a,269,b)].
5.32/5.61	14429 cong(c5,c7,c7,c5).  [resolve(14027,a,161,a)].
5.32/5.61	14768 para(c1,c1,c5,c4).  [resolve(14254,a,115,a)].
5.32/5.61	15010 cong(c7,c5,c5,c7).  [resolve(14429,a,169,a)].
5.32/5.61	15242 cong(c7,c5,c7,c5).  [resolve(15010,a,161,a)].
5.32/5.61	15399 midp(c7,c5,c5).  [resolve(15242,a,177,a),unit_del(a,4927)].
5.32/5.61	15584 para(c5,c5,c5,c4).  [resolve(1102,a,14768,a)].
5.32/5.61	15597 para(c5,c4,c5,c5).  [resolve(15584,a,115,a)].
5.32/5.61	15637 -midp(A,c5,c5) | midp(A,c5,c4).  [resolve(15597,a,118,b),unit_del(b,15584)].
5.32/5.61	19545 midp(c7,c5,c4).  [resolve(15637,a,15399,a)].
5.32/5.61	19581 midp(c7,c4,c5).  [resolve(19545,a,160,a)].
5.32/5.61	19710 cong(c7,c4,c7,c5).  [resolve(19581,a,134,a)].
5.32/5.61	19895 cong(c7,c4,c5,c7).  [resolve(19710,a,161,a)].
5.32/5.61	19942 cong(c5,c7,c7,c4).  [resolve(19895,a,169,a)].
5.32/5.61	19988 cong(c5,c7,c4,c7).  [resolve(19942,a,161,a)].
5.32/5.61	20156 perp(c5,c4,c7,c7).  [resolve(19988,a,283,a)].
5.32/5.61	24538 perp(c1,c2,c7,c7).  [resolve(2015,a,20156,a)].
5.32/5.61	24540 -midp(c2,c7,c7) | cong(c1,c7,c1,c7).  [resolve(24538,a,180,a)].
5.32/5.61	25103 cong(c2,c3,c2,c3).  [resolve(2064,a,294,b),unit_del(a,3327),unit_del(b,1171)].
5.32/5.61	25123 midp(c2,c3,c3).  [resolve(25103,a,177,a),unit_del(a,832)].
5.32/5.61	25138 midp(c2,c1,c3).  [resolve(25123,a,14191,a)].
5.32/5.61	25252 midp(c2,c7,c7).  [resolve(25138,a,14394,a)].
5.32/5.61	25276 cong(c1,c7,c1,c7).  [back_unit_del(24540),unit_del(a,25252)].
5.32/5.61	26053 cong(c1,c7,c7,c1).  [resolve(25276,a,161,a)].
5.32/5.61	26397 cong(c7,c1,c1,c7).  [resolve(26053,a,169,a)].
5.32/5.61	26901 cong(c7,c1,c7,c1).  [resolve(26397,a,161,a)].
5.32/5.61	27289 midp(c7,c1,c1).  [resolve(26901,a,177,a),unit_del(a,3606)].
5.32/5.61	27296 midp(c7,c2,c3).  [resolve(27289,a,8737,a)].
5.32/5.61	27435 cong(c2,c7,c3,c7).  [resolve(27296,a,1845,a)].
5.32/5.61	27726 perp(c2,c3,c7,c4).  [resolve(27435,a,2532,a)].
5.32/5.61	27997 perp(c3,c2,c7,c4).  [resolve(27726,a,1527,a)].
5.32/5.61	32629 perp(c5,c6,c7,c4).  [resolve(4949,a,27997,a)].
5.32/5.61	33104 $F.  [resolve(32629,a,152,a),unit_del(a,212)].
5.32/5.61	
5.32/5.61	% SZS output end Refutation
5.32/5.61	============================== end of proof ==========================
5.32/5.61	
5.32/5.61	============================== STATISTICS ============================
5.32/5.61	
5.32/5.61	Given=8719. Generated=148429. Kept=32982. proofs=1.
5.32/5.61	Usable=8625. Sos=9999. Demods=0. Limbo=0, Disabled=14516. Hints=0.
5.32/5.61	Megabytes=16.84.
5.32/5.61	User_CPU=4.62, System_CPU=0.08, Wall_clock=4.
5.32/5.61	
5.32/5.61	============================== end of statistics =====================
5.32/5.61	
5.32/5.61	============================== end of search =========================
5.32/5.61	
5.32/5.61	THEOREM PROVED
5.32/5.61	% SZS status Theorem
5.32/5.61	
5.32/5.61	Exiting with 1 proof.
5.32/5.61	
5.32/5.61	Process 6967 exit (max_proofs) Tue Jul 13 14:07:24 2021
5.32/5.61	Prover9 interrupted
5.32/5.61	EOF