0.07/0.13	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.13	% Command    : tptp2X_and_run_prover9 %d %s
0.14/0.35	% Computer   : n029.cluster.edu
0.14/0.35	% Model      : x86_64 x86_64
0.14/0.35	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.14/0.35	% Memory     : 8042.1875MB
0.14/0.35	% OS         : Linux 3.10.0-693.el7.x86_64
0.14/0.35	% CPULimit   : 1200
0.14/0.35	% DateTime   : Tue Jul 13 14:37:40 EDT 2021
0.14/0.35	% CPUTime    : 
0.48/1.13	============================== Prover9 ===============================
0.48/1.13	Prover9 (32) version 2009-11A, November 2009.
0.48/1.13	Process 23514 was started by sandbox on n029.cluster.edu,
0.48/1.13	Tue Jul 13 14:37:40 2021
0.48/1.13	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1200 -f /tmp/Prover9_23209_n029.cluster.edu".
0.48/1.13	============================== end of head ===========================
0.48/1.13	
0.48/1.13	============================== INPUT =================================
0.48/1.13	
0.48/1.13	% Reading from file /tmp/Prover9_23209_n029.cluster.edu
0.48/1.13	
0.48/1.13	set(prolog_style_variables).
0.48/1.13	set(auto2).
0.48/1.13	    % set(auto2) -> set(auto).
0.48/1.13	    % set(auto) -> set(auto_inference).
0.48/1.13	    % set(auto) -> set(auto_setup).
0.48/1.13	    % set(auto_setup) -> set(predicate_elim).
0.48/1.13	    % set(auto_setup) -> assign(eq_defs, unfold).
0.48/1.13	    % set(auto) -> set(auto_limits).
0.48/1.13	    % set(auto_limits) -> assign(max_weight, "100.000").
0.48/1.13	    % set(auto_limits) -> assign(sos_limit, 20000).
0.48/1.13	    % set(auto) -> set(auto_denials).
0.48/1.13	    % set(auto) -> set(auto_process).
0.48/1.13	    % set(auto2) -> assign(new_constants, 1).
0.48/1.13	    % set(auto2) -> assign(fold_denial_max, 3).
0.48/1.13	    % set(auto2) -> assign(max_weight, "200.000").
0.48/1.13	    % set(auto2) -> assign(max_hours, 1).
0.48/1.13	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.48/1.13	    % set(auto2) -> assign(max_seconds, 0).
0.48/1.13	    % set(auto2) -> assign(max_minutes, 5).
0.48/1.13	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.48/1.13	    % set(auto2) -> set(sort_initial_sos).
0.48/1.13	    % set(auto2) -> assign(sos_limit, -1).
0.48/1.13	    % set(auto2) -> assign(lrs_ticks, 3000).
0.48/1.13	    % set(auto2) -> assign(max_megs, 400).
0.48/1.13	    % set(auto2) -> assign(stats, some).
0.48/1.13	    % set(auto2) -> clear(echo_input).
0.48/1.13	    % set(auto2) -> set(quiet).
0.48/1.13	    % set(auto2) -> clear(print_initial_clauses).
0.48/1.13	    % set(auto2) -> clear(print_given).
0.48/1.13	assign(lrs_ticks,-1).
0.48/1.13	assign(sos_limit,10000).
0.48/1.13	assign(order,kbo).
0.48/1.13	set(lex_order_vars).
0.48/1.13	clear(print_given).
0.48/1.13	
0.48/1.13	% formulas(sos).  % not echoed (95 formulas)
0.48/1.13	
0.48/1.13	============================== end of input ==========================
0.48/1.13	
0.48/1.13	% From the command line: assign(max_seconds, 1200).
0.48/1.13	
0.48/1.13	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.48/1.13	
0.48/1.13	% Formulas that are not ordinary clauses:
0.48/1.13	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.48/1.13	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.48/1.13	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.48/1.13	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.48/1.13	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.48/1.13	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.48/1.13	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.48/1.13	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.48/1.13	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.48/1.13	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.48/1.13	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.48/1.13	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.48/1.13	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.48/1.13	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.48/1.13	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.48/1.13	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.48/1.13	17 (all A all B all C (coll(A,B,C) -> coll(B,A,C))) # label(ruleD2) # label(axiom) # label(non_clause).  [assumption].
0.48/1.13	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.48/1.13	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.48/1.13	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.48/1.13	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.48/1.13	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.48/1.13	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.48/1.13	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.48/1.13	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.48/1.13	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.48/1.13	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.48/1.13	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.48/1.13	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.48/1.13	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.48/1.13	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.48/1.13	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.48/1.13	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.48/1.13	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.48/1.13	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.48/1.13	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.48/1.13	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.48/1.13	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.48/1.13	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.48/1.13	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.48/1.13	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.48/1.13	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.48/1.13	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.48/1.13	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.48/1.13	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.48/1.13	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.48/1.13	47 (all A all B all M (midp(M,B,A) -> midp(M,A,B))) # label(ruleD11) # label(axiom) # label(non_clause).  [assumption].
0.48/1.13	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.48/1.13	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.48/1.13	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.48/1.13	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.48/1.13	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.48/1.13	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.48/1.13	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.48/1.13	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.48/1.13	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.48/1.13	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.48/1.13	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.48/1.13	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.48/1.13	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.48/1.13	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.48/1.13	62 (all A all B all C (coll(A,B,C) -> coll(A,C,B))) # label(ruleD1) # label(axiom) # label(non_clause).  [assumption].
0.48/1.13	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.48/1.13	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.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	78 (all A all B all C (midp(A,B,C) -> coll(A,B,C))) # label(ruleD69) # label(axiom) # label(non_clause).  [assumption].
0.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	95 -(all A all B all C all O all G all E all K all H all N all NWPNT1 (midp(G,C,B) & circle(O,A,E,NWPNT1) & perp(H,A,O,G) & coll(H,O,G) & circle(N,K,G,H) & coll(K,A,B) & perp(K,E,A,B) & coll(E,O,G) & circle(O,A,B,C) -> perp(E,K,K,N))) # label(exemplo6GDDFULL618076) # label(negated_conjecture) # label(non_clause).  [assumption].
0.48/1.14	
0.48/1.14	============================== end of process non-clausal formulas ===
0.48/1.14	
0.48/1.14	============================== PROCESS INITIAL CLAUSES ===============
0.48/1.14	
0.48/1.14	============================== PREDICATE ELIMINATION =================
0.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	99 -cong(A,B,A,C) | -cong(A,B,A,D) | circle(A,B,C,D) # label(ruleD12) # label(axiom).  [clausify(29)].
0.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	102 -circle(A,B,C,D) | -coll(A,B,D) | perp(B,C,C,D) # label(ruleD53) # label(axiom).  [clausify(59)].
0.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	103 -circle(A,B,C,D) | perp(f16(B,C,D,A),B,B,A) # label(ruleX11) # label(axiom).  [clausify(75)].
0.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	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.48/1.14	109 circle(c4,c1,c6,c10) # label(exemplo6GDDFULL618076) # label(negated_conjecture).  [clausify(95)].
0.48/1.14	Derived: -eqangle(c1,c6,c1,c10,c4,c6,c4,A) | -coll(A,c6,c10) | midp(A,c6,c10).  [resolve(109,a,97,a)].
0.48/1.14	Derived: -eqangle(c1,A,c1,c6,c10,c1,c10,c6) | perp(c4,c1,c1,A).  [resolve(109,a,98,a)].
0.48/1.14	Derived: -midp(A,c6,c10) | eqangle(c1,c6,c1,c10,c4,c6,c4,A).  [resolve(109,a,101,b)].
0.48/1.14	Derived: -coll(c4,c1,c10) | perp(c1,c6,c6,c10).  [resolve(109,a,102,a)].
0.48/1.14	Derived: perp(f16(c1,c6,c10,c4),c1,c1,c4).  [resolve(109,a,103,a)].
0.48/1.14	Derived: -perp(c4,c1,c1,A) | eqangle(c1,A,c1,c6,c10,c1,c10,c6).  [resolve(109,a,104,b)].
0.48/1.14	Derived: -cong(c4,c1,c4,A) | -cong(B,c1,B,c6) | B = c4 | coll(f19(c1,c6,c10,A,c4,B),c1,c10).  [resolve(109,a,105,d)].
2.57/2.86	Derived: -cong(c4,c1,c4,A) | -cong(B,c1,B,c6) | B = c4 | cong(f19(c1,c6,c10,A,c4,B),B,B,c1).  [resolve(109,a,106,d)].
2.57/2.86	Derived: -cong(c4,c1,c4,A) | -cong(B,c1,B,c6) | B = c4 | coll(f20(c1,c6,c10,A,c4,B),c6,A).  [resolve(109,a,107,d)].
2.57/2.86	Derived: -cong(c4,c1,c4,A) | -cong(B,c1,B,c6) | B = c4 | cong(f20(c1,c6,c10,A,c4,B),B,B,c1).  [resolve(109,a,108,d)].
2.57/2.86	110 circle(c9,c7,c5,c8) # label(exemplo6GDDFULL618076) # label(negated_conjecture).  [clausify(95)].
2.57/2.86	Derived: -eqangle(c7,c5,c7,c8,c9,c5,c9,A) | -coll(A,c5,c8) | midp(A,c5,c8).  [resolve(110,a,97,a)].
2.57/2.86	Derived: -eqangle(c7,A,c7,c5,c8,c7,c8,c5) | perp(c9,c7,c7,A).  [resolve(110,a,98,a)].
2.57/2.86	Derived: -midp(A,c5,c8) | eqangle(c7,c5,c7,c8,c9,c5,c9,A).  [resolve(110,a,101,b)].
2.57/2.86	Derived: -coll(c9,c7,c8) | perp(c7,c5,c5,c8).  [resolve(110,a,102,a)].
2.57/2.86	Derived: perp(f16(c7,c5,c8,c9),c7,c7,c9).  [resolve(110,a,103,a)].
2.57/2.86	Derived: -perp(c9,c7,c7,A) | eqangle(c7,A,c7,c5,c8,c7,c8,c5).  [resolve(110,a,104,b)].
2.57/2.86	Derived: -cong(c9,c7,c9,A) | -cong(B,c7,B,c5) | B = c9 | coll(f19(c7,c5,c8,A,c9,B),c7,c8).  [resolve(110,a,105,d)].
2.57/2.86	Derived: -cong(c9,c7,c9,A) | -cong(B,c7,B,c5) | B = c9 | cong(f19(c7,c5,c8,A,c9,B),B,B,c7).  [resolve(110,a,106,d)].
2.57/2.86	Derived: -cong(c9,c7,c9,A) | -cong(B,c7,B,c5) | B = c9 | coll(f20(c7,c5,c8,A,c9,B),c5,A).  [resolve(110,a,107,d)].
2.57/2.86	Derived: -cong(c9,c7,c9,A) | -cong(B,c7,B,c5) | B = c9 | cong(f20(c7,c5,c8,A,c9,B),B,B,c7).  [resolve(110,a,108,d)].
2.57/2.86	111 circle(c4,c1,c2,c3) # label(exemplo6GDDFULL618076) # label(negated_conjecture).  [clausify(95)].
2.57/2.86	Derived: -eqangle(c1,c2,c1,c3,c4,c2,c4,A) | -coll(A,c2,c3) | midp(A,c2,c3).  [resolve(111,a,97,a)].
2.57/2.86	Derived: -eqangle(c1,A,c1,c2,c3,c1,c3,c2) | perp(c4,c1,c1,A).  [resolve(111,a,98,a)].
2.57/2.86	Derived: -midp(A,c2,c3) | eqangle(c1,c2,c1,c3,c4,c2,c4,A).  [resolve(111,a,101,b)].
2.57/2.86	Derived: -coll(c4,c1,c3) | perp(c1,c2,c2,c3).  [resolve(111,a,102,a)].
2.57/2.86	Derived: perp(f16(c1,c2,c3,c4),c1,c1,c4).  [resolve(111,a,103,a)].
2.57/2.86	Derived: -perp(c4,c1,c1,A) | eqangle(c1,A,c1,c2,c3,c1,c3,c2).  [resolve(111,a,104,b)].
2.57/2.86	Derived: -cong(c4,c1,c4,A) | -cong(B,c1,B,c2) | B = c4 | coll(f19(c1,c2,c3,A,c4,B),c1,c3).  [resolve(111,a,105,d)].
2.57/2.86	Derived: -cong(c4,c1,c4,A) | -cong(B,c1,B,c2) | B = c4 | cong(f19(c1,c2,c3,A,c4,B),B,B,c1).  [resolve(111,a,106,d)].
2.57/2.86	Derived: -cong(c4,c1,c4,A) | -cong(B,c1,B,c2) | B = c4 | coll(f20(c1,c2,c3,A,c4,B),c2,A).  [resolve(111,a,107,d)].
2.57/2.86	Derived: -cong(c4,c1,c4,A) | -cong(B,c1,B,c2) | B = c4 | cong(f20(c1,c2,c3,A,c4,B),B,B,c1).  [resolve(111,a,108,d)].
2.57/2.86	
2.57/2.86	============================== end predicate elimination =============
2.57/2.86	
2.57/2.86	Auto_denials:  (non-Horn, no changes).
2.57/2.86	
2.57/2.86	Term ordering decisions:
2.57/2.86	Function symbol KB weights:  c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. c9=1. c10=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.
2.57/2.86	
2.57/2.86	============================== end of process initial clauses ========
2.57/2.86	
2.57/2.86	============================== CLAUSES FOR SEARCH ====================
2.57/2.86	
2.57/2.86	============================== end of clauses for search =============
2.57/2.86	
2.57/2.86	============================== SEARCH ================================
2.57/2.86	
2.57/2.86	% Starting search at 0.05 seconds.
2.57/2.86	
2.57/2.86	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 1018 (0.00 of 0.19 sec).
2.57/2.86	
2.57/2.86	Low Water (keep): wt=40.000, iters=3398
2.57/2.86	
2.57/2.86	Low Water (keep): wt=39.000, iters=3365
2.57/2.86	
2.57/2.86	Low Water (keep): wt=29.000, iters=3348
2.57/2.86	
2.57/2.86	Low Water (keep): wt=28.000, iters=3383
2.57/2.86	
2.57/2.86	Low Water (keep): wt=24.000, iters=3357
2.57/2.86	
2.57/2.86	Low Water (keep): wt=23.000, iters=3361
2.57/2.86	
2.57/2.86	Low Water (keep): wt=22.000, iters=3333
2.57/2.86	
2.57/2.86	Low Water (keep): wt=19.000, iters=3334
2.57/2.86	
2.57/2.86	Low Water (keep): wt=18.000, iters=3337
2.57/2.86	
2.57/2.86	Low Water (keep): wt=15.000, iters=3346
2.57/2.86	
2.57/2.86	Low Water (keep): wt=14.000, iters=3340
2.57/2.86	
2.57/2.86	Low Water (keep): wt=13.000, iters=3371
2.57/2.86	
2.57/2.86	Low Water (displace): id=7212, wt=48.000
2.57/2.86	
2.57/2.86	Low Water (keep): wt=12.000, iters=3356
2.57/2.86	
2.57/2.86	Low Water (displace): id=13275, wt=10.000
2.57/2.86	
2.57/2.86	Low Water (displace): id=13292, wt=9.000
2.57/2.86	
2.57/2.86	Low Water (keep): wt=11.000, iters=3335
2.57/2.86	
2.57/2.86	Low Water (displace): id=13737, wt=8.000
2.57/2.86	
2.57/2.86	Low Water (displace): id=15684, wt=7.000
30.82/31.10	
30.82/31.10	Low Water (keep): wt=10.000, iters=3333
30.82/31.10	
30.82/31.10	Low Water (displace): id=19367, wt=5.000
30.82/31.10	
30.82/31.10	Low Water (keep): wt=9.000, iters=3333
30.82/31.10	
30.82/31.10	Low Water (keep): wt=8.000, iters=3340
30.82/31.10	
30.82/31.10	Low Water (keep): wt=7.000, iters=3333
30.82/31.10	
30.82/31.10	============================== PROOF =================================
30.82/31.10	% SZS status Theorem
30.82/31.10	% SZS output start Refutation
30.82/31.10	
30.82/31.10	% Proof 1 at 29.74 (+ 0.24) seconds.
30.82/31.10	% Length of proof is 215.
30.82/31.10	% Level of proof is 26.
30.82/31.10	% Maximum clause weight is 29.000.
30.82/31.10	% Given clauses 26057.
30.82/31.10	
30.82/31.10	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].
30.82/31.10	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].
30.82/31.10	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].
30.82/31.10	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].
30.82/31.10	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].
30.82/31.10	17 (all A all B all C (coll(A,B,C) -> coll(B,A,C))) # label(ruleD2) # label(axiom) # label(non_clause).  [assumption].
30.82/31.10	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].
30.82/31.10	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].
30.82/31.10	22 (all A all B all C (midp(A,B,C) -> cong(A,B,A,C))) # label(ruleD68) # label(axiom) # label(non_clause).  [assumption].
30.82/31.10	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].
30.82/31.10	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].
30.82/31.10	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].
30.82/31.10	45 (all A all B all C (para(A,B,A,C) -> coll(A,B,C))) # label(ruleD66) # label(axiom) # label(non_clause).  [assumption].
30.82/31.10	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].
30.82/31.10	47 (all A all B all M (midp(M,B,A) -> midp(M,A,B))) # label(ruleD11) # label(axiom) # label(non_clause).  [assumption].
30.82/31.10	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].
30.82/31.10	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].
30.82/31.10	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].
30.82/31.10	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].
30.82/31.10	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].
30.82/31.10	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].
30.82/31.10	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].
30.82/31.10	62 (all A all B all C (coll(A,B,C) -> coll(A,C,B))) # label(ruleD1) # label(axiom) # label(non_clause).  [assumption].
30.82/31.10	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].
30.82/31.10	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].
30.82/31.10	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].
30.82/31.10	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].
30.82/31.10	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].
30.82/31.10	78 (all A all B all C (midp(A,B,C) -> coll(A,B,C))) # label(ruleD69) # label(axiom) # label(non_clause).  [assumption].
30.82/31.10	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].
30.82/31.10	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].
30.82/31.10	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].
30.82/31.10	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].
30.82/31.10	95 -(all A all B all C all O all G all E all K all H all N all NWPNT1 (midp(G,C,B) & circle(O,A,E,NWPNT1) & perp(H,A,O,G) & coll(H,O,G) & circle(N,K,G,H) & coll(K,A,B) & perp(K,E,A,B) & coll(E,O,G) & circle(O,A,B,C) -> perp(E,K,K,N))) # label(exemplo6GDDFULL618076) # label(negated_conjecture) # label(non_clause).  [assumption].
30.82/31.10	102 -circle(A,B,C,D) | -coll(A,B,D) | perp(B,C,C,D) # label(ruleD53) # label(axiom).  [clausify(59)].
30.82/31.10	103 -circle(A,B,C,D) | perp(f16(B,C,D,A),B,B,A) # label(ruleX11) # label(axiom).  [clausify(75)].
30.82/31.10	109 circle(c4,c1,c6,c10) # label(exemplo6GDDFULL618076) # label(negated_conjecture).  [clausify(95)].
30.82/31.10	111 circle(c4,c1,c2,c3) # label(exemplo6GDDFULL618076) # label(negated_conjecture).  [clausify(95)].
30.82/31.10	117 -para(A,B,C,D) | para(C,D,A,B) # label(ruleD5) # label(axiom).  [clausify(3)].
30.82/31.10	119 -cyclic(A,B,C,D) | cyclic(A,C,B,D) # label(ruleD15) # label(axiom).  [clausify(5)].
30.82/31.10	120 -midp(A,B,C) | -para(B,D,C,E) | -para(B,E,C,D) | midp(A,E,D) # label(ruleD64) # label(axiom).  [clausify(8)].
30.82/31.10	127 -cyclic(A,B,C,D) | -cyclic(A,B,C,E) | cyclic(B,C,D,E) # label(ruleD17) # label(axiom).  [clausify(14)].
30.82/31.10	128 -perp(A,B,C,D) | perp(A,B,D,C) # label(ruleD7) # label(axiom).  [clausify(15)].
30.82/31.10	130 -coll(A,B,C) | coll(B,A,C) # label(ruleD2) # label(axiom).  [clausify(17)].
30.82/31.10	132 -cong(A,B,C,D) | -cong(E,F,A,B) | cong(E,F,C,D) # label(ruleD25) # label(axiom).  [clausify(19)].
30.82/31.10	133 -cyclic(A,B,C,D) | cyclic(A,B,D,C) # label(ruleD14) # label(axiom).  [clausify(20)].
30.82/31.10	136 -midp(A,B,C) | cong(A,B,A,C) # label(ruleD68) # label(axiom).  [clausify(22)].
30.82/31.10	137 -para(A,B,C,D) | -para(C,D,E,F) | para(A,B,E,F) # label(ruleD6) # label(axiom).  [clausify(23)].
30.82/31.10	154 -perp(A,B,C,D) | perp(C,D,A,B) # label(ruleD8) # label(axiom).  [clausify(39)].
30.82/31.10	159 -para(A,B,C,D) | para(A,B,D,C) # label(ruleD4) # label(axiom).  [clausify(44)].
30.82/31.10	160 -para(A,B,A,C) | coll(A,B,C) # label(ruleD66) # label(axiom).  [clausify(45)].
30.82/31.10	161 -cong(A,B,C,B) | -cong(A,D,C,D) | perp(A,C,B,D) # label(ruleD56) # label(axiom).  [clausify(46)].
30.82/31.10	162 -midp(A,B,C) | midp(A,C,B) # label(ruleD11) # label(axiom).  [clausify(47)].
30.82/31.10	163 -cong(A,B,C,D) | cong(A,B,D,C) # label(ruleD23) # label(axiom).  [clausify(48)].
30.82/31.10	164 -perp(A,B,C,D) | -perp(E,F,A,B) | para(E,F,C,D) # label(ruleD9) # label(axiom).  [clausify(49)].
30.82/31.10	167 -perp(A,B,C,D) | -para(E,F,A,B) | perp(E,F,C,D) # label(ruleD10) # label(axiom).  [clausify(52)].
30.82/31.10	168 -coll(A,B,C) | -coll(A,B,D) | coll(C,D,A) # label(ruleD3) # label(axiom).  [clausify(53)].
30.82/31.10	171 -cong(A,B,C,D) | cong(C,D,A,B) # label(ruleD24) # label(axiom).  [clausify(56)].
30.82/31.10	172 -midp(A,B,C) | -midp(D,E,F) | -coll(F,B,C) | -coll(E,B,C) | midp(f12(B,C,E,F,A,D,V6),B,V6) # label(ruleX7) # label(axiom).  [clausify(58)].
30.82/31.10	175 -coll(A,B,C) | coll(A,C,B) # label(ruleD1) # label(axiom).  [clausify(62)].
30.82/31.10	179 -cong(A,B,A,C) | -coll(A,B,C) | midp(A,B,C) # label(ruleD67) # label(axiom).  [clausify(64)].
30.82/31.10	186 -para(A,B,C,D) | eqangle(A,B,E,F,C,D,E,F) # label(ruleD40) # label(axiom).  [clausify(70)].
30.82/31.10	190 -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)].
30.82/31.10	191 -eqangle(A,B,A,C,D,B,D,C) | -coll(A,D,C) | cyclic(B,C,A,D) # label(ruleD42b) # label(axiom).  [clausify(74)].
30.82/31.10	194 -midp(A,B,C) | coll(A,B,C) # label(ruleD69) # label(axiom).  [clausify(78)].
30.82/31.10	197 -eqangle(A,B,C,D,E,F,C,D) | para(A,B,E,F) # label(ruleD39) # label(axiom).  [clausify(80)].
30.82/31.10	198 -eqangle(A,B,C,D,E,F,V6,V7) | eqangle(C,D,A,B,V6,V7,E,F) # label(ruleD19) # label(axiom).  [clausify(81)].
30.82/31.10	203 -midp(A,B,C) | -midp(A,D,E) | para(D,B,E,C) # label(ruleD63) # label(axiom).  [clausify(87)].
30.82/31.10	207 -midp(A,B,C) | -midp(D,B,E) | para(A,D,C,E) # label(ruleD44) # label(axiom).  [clausify(91)].
30.82/31.10	211 midp(c5,c3,c2) # label(exemplo6GDDFULL618076) # label(negated_conjecture).  [clausify(95)].
30.82/31.10	212 perp(c8,c1,c4,c5) # label(exemplo6GDDFULL618076) # label(negated_conjecture).  [clausify(95)].
30.82/31.10	214 coll(c7,c1,c2) # label(exemplo6GDDFULL618076) # label(negated_conjecture).  [clausify(95)].
30.82/31.10	215 perp(c7,c6,c1,c2) # label(exemplo6GDDFULL618076) # label(negated_conjecture).  [clausify(95)].
30.82/31.10	216 coll(c6,c4,c5) # label(exemplo6GDDFULL618076) # label(negated_conjecture).  [clausify(95)].
30.82/31.10	217 -perp(c6,c7,c7,c9) # label(exemplo6GDDFULL618076) # label(negated_conjecture).  [clausify(95)].
30.82/31.10	260 perp(f16(c1,c6,c10,c4),c1,c1,c4).  [resolve(109,a,103,a)].
30.82/31.10	287 -coll(c4,c1,c3) | perp(c1,c2,c2,c3).  [resolve(111,a,102,a)].
30.82/31.10	302 -midp(A,B,C) | -para(B,D,C,D) | midp(A,D,D).  [factor(120,b,c)].
30.82/31.10	318 -coll(A,B,C) | coll(C,C,A).  [factor(168,a,b)].
30.82/31.10	328 -midp(A,B,C) | para(B,B,C,C).  [factor(203,a,b)].
30.82/31.10	331 -midp(A,B,C) | para(A,A,C,C).  [factor(207,a,b)].
30.82/31.10	363 -midp(A,c3,B) | para(A,c5,B,c2).  [resolve(211,a,207,b)].
30.82/31.10	365 -midp(c5,A,B) | para(c3,A,c2,B).  [resolve(211,a,203,b)].
30.82/31.10	367 coll(c5,c3,c2).  [resolve(211,a,194,a)].
30.82/31.10	374 -midp(A,B,C) | -coll(c2,B,C) | -coll(c3,B,C) | midp(f12(B,C,c3,c2,A,c5,D),B,D).  [resolve(211,a,172,b)].
30.82/31.10	376 midp(c5,c2,c3).  [resolve(211,a,162,a)].
30.82/31.10	377 cong(c5,c3,c5,c2).  [resolve(211,a,136,a)].
30.82/31.10	380 -perp(c4,c5,A,B) | para(c8,c1,A,B).  [resolve(212,a,164,b)].
30.82/31.10	381 -perp(A,B,c8,c1) | para(A,B,c4,c5).  [resolve(212,a,164,a)].
30.82/31.10	382 perp(c4,c5,c8,c1).  [resolve(212,a,154,a)].
30.82/31.10	398 coll(c7,c2,c1).  [resolve(214,a,175,a)].
30.82/31.10	403 -perp(c1,c2,A,B) | para(c7,c6,A,B).  [resolve(215,a,164,b)].
30.82/31.10	404 -perp(A,B,c7,c6) | para(A,B,c1,c2).  [resolve(215,a,164,a)].
30.82/31.10	406 perp(c7,c6,c2,c1).  [resolve(215,a,128,a)].
30.82/31.10	417 coll(c6,c5,c4).  [resolve(216,a,175,a)].
30.82/31.10	430 -perp(A,B,f16(c1,c6,c10,c4),c1) | para(A,B,c1,c4).  [resolve(260,a,164,a)].
30.82/31.10	433 perp(c1,c4,f16(c1,c6,c10,c4),c1).  [resolve(260,a,154,a)].
30.82/31.10	496 coll(c5,c5,c6).  [resolve(318,a,216,a)].
30.82/31.10	497 coll(c2,c2,c7).  [resolve(318,a,214,a)].
30.82/31.10	504 para(c5,c5,c2,c2).  [resolve(331,a,211,a)].
30.82/31.10	506 coll(c2,c2,c5).  [resolve(367,a,318,a)].
30.82/31.10	507 coll(c5,c2,c3).  [resolve(367,a,175,a)].
30.82/31.10	510 coll(c3,c5,c2).  [resolve(367,a,130,a)].
30.82/31.10	535 cong(c5,c2,c5,c3).  [resolve(376,a,136,a)].
30.82/31.10	547 -coll(c7,c2,A) | coll(c1,A,c7).  [resolve(398,a,168,a)].
30.82/31.10	555 -coll(c6,c5,A) | coll(c4,A,c6).  [resolve(417,a,168,a)].
30.82/31.10	562 -coll(c5,c5,A) | coll(A,c6,c5).  [resolve(496,a,168,b)].
30.82/31.10	563 -coll(c5,c5,A) | coll(c6,A,c5).  [resolve(496,a,168,a)].
30.82/31.10	566 -coll(c2,c2,A) | coll(A,c7,c2).  [resolve(497,a,168,b)].
30.82/31.10	576 coll(c3,c3,c5).  [resolve(507,a,318,a)].
30.82/31.10	579 coll(c2,c5,c3).  [resolve(507,a,130,a)].
30.82/31.10	580 coll(c2,c2,c3).  [resolve(510,a,318,a)].
30.82/31.10	593 para(c3,c2,c2,c3).  [resolve(365,a,376,a)].
30.82/31.10	651 coll(c5,c5,c3).  [resolve(576,a,318,a)].
30.82/31.10	652 coll(c3,c5,c3).  [resolve(576,a,175,a)].
30.82/31.10	655 coll(c3,c3,c2).  [resolve(579,a,318,a)].
30.82/31.10	702 -coll(c3,c2,c3) | midp(f12(c2,c3,c3,c2,c5,c5,A),c2,A).  [resolve(374,a,376,a),unit_del(a,580)].
30.82/31.10	800 -cong(c5,c2,A,B) | cong(c5,c3,A,B).  [resolve(377,a,132,b)].
30.82/31.10	823 coll(c5,c3,c3).  [resolve(652,a,130,a)].
30.82/31.10	824 coll(c3,c2,c3).  [resolve(655,a,175,a)].
30.82/31.10	827 midp(f12(c2,c3,c3,c2,c5,c5,A),c2,A).  [back_unit_del(702),unit_del(a,824)].
30.82/31.10	859 para(c4,c5,c4,c5).  [resolve(382,a,381,a)].
30.82/31.10	860 para(c8,c1,c8,c1).  [resolve(382,a,380,a)].
30.82/31.10	944 perp(c2,c1,c7,c6).  [resolve(406,a,154,a)].
30.82/31.10	980 -para(c2,c2,A,B) | para(c5,c5,A,B).  [resolve(504,a,137,a)].
30.82/31.10	1102 para(c3,c2,c3,c2).  [resolve(593,a,159,a)].
30.82/31.10	1177 eqangle(c4,c5,A,B,c4,c5,A,B).  [resolve(859,a,186,a)].
30.82/31.10	1192 para(c8,c1,c1,c8).  [resolve(860,a,159,a)].
30.82/31.10	1347 -midp(A,c3,c3) | midp(A,c2,c2).  [resolve(1102,a,302,b)].
30.82/31.10	1453 para(c1,c8,c8,c1).  [resolve(1192,a,117,a)].
30.82/31.10	1633 para(c1,c8,c1,c8).  [resolve(1453,a,159,a)].
30.82/31.10	1664 para(c2,c1,c1,c2).  [resolve(404,a,944,a)].
30.82/31.10	1820 -midp(A,c1,c1) | midp(A,c8,c8).  [resolve(1633,a,302,b)].
30.82/31.10	1825 eqangle(c1,c8,A,B,c1,c8,A,B).  [resolve(1633,a,186,a)].
30.82/31.10	1840 para(c2,c1,c2,c1).  [resolve(1664,a,159,a)].
30.82/31.10	1954 -midp(A,c2,c2) | midp(A,c1,c1).  [resolve(1840,a,302,b)].
30.82/31.10	2098 coll(c3,c6,c5).  [resolve(562,a,651,a)].
30.82/31.10	2104 coll(c6,c3,c5).  [resolve(2098,a,130,a)].
30.82/31.10	2117 coll(c6,c5,c3).  [resolve(2104,a,175,a)].
30.82/31.10	2143 coll(c4,c3,c6).  [resolve(2117,a,555,a)].
30.82/31.10	2182 coll(c4,c6,c3).  [resolve(2143,a,175,a)].
30.82/31.10	2263 -coll(c4,c6,A) | coll(A,c3,c4).  [resolve(2182,a,168,b)].
30.82/31.10	2275 para(c1,c4,c1,c4).  [resolve(433,a,430,a)].
30.82/31.10	2430 coll(c1,c4,c4).  [resolve(2275,a,160,a)].
30.82/31.10	2431 para(c1,c4,c4,c1).  [resolve(2275,a,159,a)].
30.82/31.10	2436 coll(c4,c4,c1).  [resolve(2430,a,318,a)].
30.82/31.10	2476 para(c4,c1,c1,c4).  [resolve(2431,a,117,a)].
30.82/31.10	2487 para(c4,c1,c4,c1).  [resolve(2476,a,159,a)].
30.82/31.10	2500 eqangle(c4,c1,A,B,c4,c1,A,B).  [resolve(2487,a,186,a)].
30.82/31.10	2508 coll(c5,c7,c2).  [resolve(566,a,506,a)].
30.82/31.10	2526 coll(c7,c5,c2).  [resolve(2508,a,130,a)].
30.82/31.10	2553 coll(c7,c2,c5).  [resolve(2526,a,175,a)].
30.82/31.10	2592 coll(c1,c5,c7).  [resolve(2553,a,547,a)].
30.82/31.10	2646 coll(c1,c7,c5).  [resolve(2592,a,175,a)].
30.82/31.10	2725 coll(c5,c5,c1).  [resolve(2646,a,318,a)].
30.82/31.10	2811 coll(c6,c1,c5).  [resolve(2725,a,563,a)].
30.82/31.10	2873 coll(c6,c5,c1).  [resolve(2811,a,175,a)].
30.82/31.10	2919 coll(c4,c1,c6).  [resolve(2873,a,555,a)].
30.82/31.10	2943 coll(c4,c6,c1).  [resolve(2919,a,175,a)].
30.82/31.10	4927 coll(c1,c3,c4).  [resolve(2263,a,2943,a)].
30.82/31.10	4935 coll(c1,c4,c3).  [resolve(4927,a,175,a)].
30.82/31.10	4953 coll(c4,c1,c3).  [resolve(4935,a,130,a)].
30.82/31.10	4954 perp(c1,c2,c2,c3).  [back_unit_del(287),unit_del(a,4953)].
30.82/31.10	5009 para(c7,c6,c2,c3).  [resolve(4954,a,403,a)].
30.82/31.10	5043 para(c7,c6,c3,c2).  [resolve(5009,a,159,a)].
30.82/31.10	5082 cong(c5,c3,c5,c3).  [resolve(800,a,535,a)].
30.82/31.10	5099 para(c3,c2,c7,c6).  [resolve(5043,a,117,a)].
30.82/31.10	5268 midp(c5,c3,c3).  [resolve(5082,a,179,a),unit_del(a,823)].
30.82/31.10	5303 midp(c5,c2,c2).  [resolve(5268,a,1347,a)].
30.82/31.10	5327 para(c5,c5,c3,c2).  [resolve(5268,a,363,a)].
30.82/31.10	5380 midp(c5,c1,c1).  [resolve(5303,a,1954,a)].
30.82/31.10	5460 midp(c5,c8,c8).  [resolve(5380,a,1820,a)].
30.82/31.10	5533 para(c5,c5,c8,c8).  [resolve(5460,a,331,a)].
30.82/31.10	5561 para(c3,c2,c6,c7).  [resolve(5099,a,159,a)].
30.82/31.10	5905 para(c2,c2,A,A).  [resolve(827,a,328,a)].
30.82/31.10	5963 para(c3,c2,c5,c5).  [resolve(5327,a,117,a)].
30.82/31.10	6330 -perp(c8,c8,A,B) | perp(c5,c5,A,B).  [resolve(5533,a,167,b)].
30.82/31.10	6445 para(c6,c7,c3,c2).  [resolve(5561,a,117,a)].
30.82/31.10	6919 -perp(c5,c5,A,B) | perp(c3,c2,A,B).  [resolve(5963,a,167,b)].
30.82/31.10	7197 -perp(c3,c2,A,B) | perp(c6,c7,A,B).  [resolve(6445,a,167,b)].
30.82/31.10	9679 para(c5,c5,A,A).  [resolve(980,a,5905,a)].
30.82/31.10	9685 para(A,A,c5,c5).  [resolve(9679,a,117,a)].
30.82/31.10	9688 -perp(c5,c5,A,B) | perp(C,C,A,B).  [resolve(9685,a,167,b)].
30.82/31.10	13666 eqangle(A,B,c4,c5,A,B,c4,c5).  [resolve(1177,a,198,a)].
30.82/31.10	13667 -coll(c4,c4,A) | cyclic(c5,A,c4,c4).  [resolve(1177,a,191,a)].
30.82/31.10	17104 eqangle(A,B,c1,c8,A,B,c1,c8).  [resolve(1825,a,198,a)].
30.82/31.10	20242 -coll(c4,c4,A) | cyclic(c1,A,c4,c4).  [resolve(2500,a,191,a)].
30.82/31.10	44773 para(A,B,A,B).  [resolve(13666,a,197,a)].
30.82/31.10	44781 cyclic(c5,c1,c4,c4).  [resolve(13667,a,2436,a)].
30.82/31.10	45857 coll(A,B,B).  [resolve(44773,a,160,a)].
30.82/31.10	45859 coll(A,A,B).  [resolve(45857,a,318,a)].
30.82/31.10	45861 cyclic(c1,A,c4,c4).  [back_unit_del(20242),unit_del(a,45859)].
30.82/31.10	45872 cyclic(c5,A,c4,c4).  [back_unit_del(13667),unit_del(a,45859)].
30.82/31.10	46041 cyclic(c5,c4,c1,c4).  [resolve(44781,a,119,a)].
30.82/31.10	46840 cyclic(c1,c4,A,c4).  [resolve(45861,a,119,a)].
30.82/31.10	46868 cyclic(c5,c4,A,c4).  [resolve(45872,a,119,a)].
30.82/31.10	46905 cyclic(c5,c4,c4,c1).  [resolve(46041,a,133,a)].
30.82/31.10	47087 cyclic(c1,c4,c4,A).  [resolve(46840,a,133,a)].
30.82/31.10	47134 cyclic(c5,c4,c4,A).  [resolve(46868,a,133,a)].
30.82/31.10	47157 cyclic(c4,c4,A,c1).  [resolve(46905,a,127,b),unit_del(a,47134)].
30.82/31.10	47286 cyclic(c4,c4,A,B).  [resolve(47087,a,127,b),unit_del(a,47087)].
30.82/31.10	47380 cyclic(c4,A,B,c1).  [resolve(47157,a,127,b),unit_del(a,47286)].
30.82/31.10	47558 cyclic(c4,A,B,C).  [resolve(47286,a,127,b),unit_del(a,47286)].
30.82/31.10	47673 cyclic(A,B,C,c1).  [resolve(47380,a,127,b),unit_del(a,47558)].
30.82/31.10	47674 cyclic(A,B,c1,C).  [resolve(47380,a,127,a),unit_del(a,47558)].
30.82/31.10	47690 cong(A,c8,A,c8).  [resolve(17104,a,190,b),unit_del(a,47674),unit_del(b,47673),unit_del(c,47674)].
30.82/31.10	47801 cong(A,c8,c8,A).  [resolve(47690,a,163,a)].
30.82/31.10	47844 cong(c8,A,A,c8).  [resolve(47801,a,171,a)].
30.82/31.10	47858 cong(c8,A,c8,A).  [resolve(47844,a,163,a)].
30.82/31.10	47871 perp(c8,c8,A,B).  [resolve(47858,a,161,b),unit_del(a,47858)].
30.82/31.10	47880 perp(c5,c5,A,B).  [back_unit_del(6330),unit_del(a,47871)].
30.82/31.10	47884 perp(A,A,B,C).  [back_unit_del(9688),unit_del(a,47880)].
30.82/31.10	47885 perp(c3,c2,A,B).  [back_unit_del(6919),unit_del(a,47884)].
30.82/31.10	47909 perp(c6,c7,A,B).  [back_unit_del(7197),unit_del(a,47885)].
30.82/31.10	47910 $F.  [resolve(47909,a,217,a)].
30.82/31.10	
30.82/31.10	% SZS output end Refutation
30.82/31.10	============================== end of proof ==========================
30.82/31.10	
30.82/31.10	============================== STATISTICS ============================
30.82/31.10	
30.82/31.10	Given=26057. Generated=431223. Kept=47778. proofs=1.
30.82/31.10	Usable=24082. Sos=7929. Demods=0. Limbo=24, Disabled=15925. Hints=0.
30.82/31.10	Megabytes=21.68.
30.82/31.10	User_CPU=29.74, System_CPU=0.24, Wall_clock=30.
30.82/31.10	
30.82/31.10	============================== end of statistics =====================
30.82/31.10	
30.82/31.10	============================== end of search =========================
30.82/31.10	
30.82/31.10	THEOREM PROVED
30.82/31.10	% SZS status Theorem
30.82/31.10	
30.82/31.10	Exiting with 1 proof.
30.82/31.10	
30.82/31.10	Process 23514 exit (max_proofs) Tue Jul 13 14:38:10 2021
30.82/31.10	Prover9 interrupted
30.82/31.10	EOF