0.12/0.13	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.12/0.13	% Command    : tptp2X_and_run_prover9 %d %s
0.13/0.34	% Computer   : n027.cluster.edu
0.13/0.34	% Model      : x86_64 x86_64
0.13/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory     : 8042.1875MB
0.13/0.34	% OS         : Linux 3.10.0-693.el7.x86_64
0.19/0.35	% CPULimit   : 1200
0.19/0.35	% DateTime   : Tue Jul 13 14:20:40 EDT 2021
0.19/0.35	% CPUTime    : 
0.85/1.16	============================== Prover9 ===============================
0.85/1.16	Prover9 (32) version 2009-11A, November 2009.
0.85/1.16	Process 24757 was started by sandbox on n027.cluster.edu,
0.85/1.16	Tue Jul 13 14:20:41 2021
0.85/1.16	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1200 -f /tmp/Prover9_24375_n027.cluster.edu".
0.85/1.16	============================== end of head ===========================
0.85/1.16	
0.85/1.16	============================== INPUT =================================
0.85/1.16	
0.85/1.16	% Reading from file /tmp/Prover9_24375_n027.cluster.edu
0.85/1.16	
0.85/1.16	set(prolog_style_variables).
0.85/1.16	set(auto2).
0.85/1.16	    % set(auto2) -> set(auto).
0.85/1.16	    % set(auto) -> set(auto_inference).
0.85/1.16	    % set(auto) -> set(auto_setup).
0.85/1.16	    % set(auto_setup) -> set(predicate_elim).
0.85/1.16	    % set(auto_setup) -> assign(eq_defs, unfold).
0.85/1.16	    % set(auto) -> set(auto_limits).
0.85/1.16	    % set(auto_limits) -> assign(max_weight, "100.000").
0.85/1.16	    % set(auto_limits) -> assign(sos_limit, 20000).
0.85/1.16	    % set(auto) -> set(auto_denials).
0.85/1.16	    % set(auto) -> set(auto_process).
0.85/1.16	    % set(auto2) -> assign(new_constants, 1).
0.85/1.16	    % set(auto2) -> assign(fold_denial_max, 3).
0.85/1.16	    % set(auto2) -> assign(max_weight, "200.000").
0.85/1.16	    % set(auto2) -> assign(max_hours, 1).
0.85/1.16	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.85/1.16	    % set(auto2) -> assign(max_seconds, 0).
0.85/1.16	    % set(auto2) -> assign(max_minutes, 5).
0.85/1.16	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.85/1.16	    % set(auto2) -> set(sort_initial_sos).
0.85/1.16	    % set(auto2) -> assign(sos_limit, -1).
0.85/1.16	    % set(auto2) -> assign(lrs_ticks, 3000).
0.85/1.16	    % set(auto2) -> assign(max_megs, 400).
0.85/1.16	    % set(auto2) -> assign(stats, some).
0.85/1.16	    % set(auto2) -> clear(echo_input).
0.85/1.16	    % set(auto2) -> set(quiet).
0.85/1.16	    % set(auto2) -> clear(print_initial_clauses).
0.85/1.16	    % set(auto2) -> clear(print_given).
0.85/1.16	assign(lrs_ticks,-1).
0.85/1.16	assign(sos_limit,10000).
0.85/1.16	assign(order,kbo).
0.85/1.16	set(lex_order_vars).
0.85/1.16	clear(print_given).
0.85/1.16	
0.85/1.16	% formulas(sos).  % not echoed (95 formulas)
0.85/1.16	
0.85/1.16	============================== end of input ==========================
0.85/1.16	
0.85/1.16	% From the command line: assign(max_seconds, 1200).
0.85/1.16	
0.85/1.16	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.85/1.16	
0.85/1.16	% Formulas that are not ordinary clauses:
0.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	17 (all A all B all C (coll(A,B,C) -> coll(B,A,C))) # label(ruleD2) # label(axiom) # label(non_clause).  [assumption].
0.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	47 (all A all B all M (midp(M,B,A) -> midp(M,A,B))) # label(ruleD11) # label(axiom) # label(non_clause).  [assumption].
0.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	62 (all A all B all C (coll(A,B,C) -> coll(A,C,B))) # label(ruleD1) # label(axiom) # label(non_clause).  [assumption].
0.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	78 (all A all B all C (midp(A,B,C) -> coll(A,B,C))) # label(ruleD69) # label(axiom) # label(non_clause).  [assumption].
0.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	95 -(all A all B all C all O all D all U all V all NWPNT1 (perp(A,B,D,U) & perp(A,D,B,U) & perp(B,D,A,U) & perp(A,C,D,V) & perp(A,D,C,V) & perp(C,D,A,V) & circle(O,A,D,NWPNT1) & circle(O,A,B,C) -> cyclic(A,U,D,V))) # label(exemplo6GDDFULL416047) # label(negated_conjecture) # label(non_clause).  [assumption].
0.85/1.16	
0.85/1.16	============================== end of process non-clausal formulas ===
0.85/1.16	
0.85/1.16	============================== PROCESS INITIAL CLAUSES ===============
0.85/1.16	
0.85/1.16	============================== PREDICATE ELIMINATION =================
0.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	99 -cong(A,B,A,C) | -cong(A,B,A,D) | circle(A,B,C,D) # label(ruleD12) # label(axiom).  [clausify(29)].
0.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	102 -circle(A,B,C,D) | -coll(A,B,D) | perp(B,C,C,D) # label(ruleD53) # label(axiom).  [clausify(59)].
0.85/1.16	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.85/1.16	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.85/1.16	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.85/1.16	103 -circle(A,B,C,D) | perp(f16(B,C,D,A),B,B,A) # label(ruleX11) # label(axiom).  [clausify(75)].
0.85/1.16	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.88/1.17	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.88/1.17	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.88/1.17	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.88/1.17	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.88/1.17	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.88/1.17	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.88/1.17	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.88/1.17	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.88/1.17	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.88/1.17	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.88/1.17	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.88/1.17	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.88/1.17	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.88/1.17	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.88/1.17	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.88/1.17	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.88/1.17	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.88/1.17	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.88/1.17	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.88/1.17	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.88/1.17	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.88/1.17	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.88/1.17	109 circle(c4,c1,c5,c8) # label(exemplo6GDDFULL416047) # label(negated_conjecture).  [clausify(95)].
0.88/1.17	Derived: -eqangle(c1,c5,c1,c8,c4,c5,c4,A) | -coll(A,c5,c8) | midp(A,c5,c8).  [resolve(109,a,97,a)].
0.88/1.17	Derived: -eqangle(c1,A,c1,c5,c8,c1,c8,c5) | perp(c4,c1,c1,A).  [resolve(109,a,98,a)].
0.88/1.17	Derived: -midp(A,c5,c8) | eqangle(c1,c5,c1,c8,c4,c5,c4,A).  [resolve(109,a,101,b)].
0.88/1.17	Derived: -coll(c4,c1,c8) | perp(c1,c5,c5,c8).  [resolve(109,a,102,a)].
0.88/1.17	Derived: perp(f16(c1,c5,c8,c4),c1,c1,c4).  [resolve(109,a,103,a)].
0.88/1.17	Derived: -perp(c4,c1,c1,A) | eqangle(c1,A,c1,c5,c8,c1,c8,c5).  [resolve(109,a,104,b)].
0.88/1.17	Derived: -cong(c4,c1,c4,A) | -cong(B,c1,B,c5) | B = c4 | coll(f19(c1,c5,c8,A,c4,B),c1,c8).  [resolve(109,a,105,d)].
11.84/12.14	Derived: -cong(c4,c1,c4,A) | -cong(B,c1,B,c5) | B = c4 | cong(f19(c1,c5,c8,A,c4,B),B,B,c1).  [resolve(109,a,106,d)].
11.84/12.14	Derived: -cong(c4,c1,c4,A) | -cong(B,c1,B,c5) | B = c4 | coll(f20(c1,c5,c8,A,c4,B),c5,A).  [resolve(109,a,107,d)].
11.84/12.14	Derived: -cong(c4,c1,c4,A) | -cong(B,c1,B,c5) | B = c4 | cong(f20(c1,c5,c8,A,c4,B),B,B,c1).  [resolve(109,a,108,d)].
11.84/12.14	110 circle(c4,c1,c2,c3) # label(exemplo6GDDFULL416047) # label(negated_conjecture).  [clausify(95)].
11.84/12.14	Derived: -eqangle(c1,c2,c1,c3,c4,c2,c4,A) | -coll(A,c2,c3) | midp(A,c2,c3).  [resolve(110,a,97,a)].
11.84/12.14	Derived: -eqangle(c1,A,c1,c2,c3,c1,c3,c2) | perp(c4,c1,c1,A).  [resolve(110,a,98,a)].
11.84/12.14	Derived: -midp(A,c2,c3) | eqangle(c1,c2,c1,c3,c4,c2,c4,A).  [resolve(110,a,101,b)].
11.84/12.14	Derived: -coll(c4,c1,c3) | perp(c1,c2,c2,c3).  [resolve(110,a,102,a)].
11.84/12.14	Derived: perp(f16(c1,c2,c3,c4),c1,c1,c4).  [resolve(110,a,103,a)].
11.84/12.14	Derived: -perp(c4,c1,c1,A) | eqangle(c1,A,c1,c2,c3,c1,c3,c2).  [resolve(110,a,104,b)].
11.84/12.14	Derived: -cong(c4,c1,c4,A) | -cong(B,c1,B,c2) | B = c4 | coll(f19(c1,c2,c3,A,c4,B),c1,c3).  [resolve(110,a,105,d)].
11.84/12.14	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(110,a,106,d)].
11.84/12.14	Derived: -cong(c4,c1,c4,A) | -cong(B,c1,B,c2) | B = c4 | coll(f20(c1,c2,c3,A,c4,B),c2,A).  [resolve(110,a,107,d)].
11.84/12.14	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(110,a,108,d)].
11.84/12.14	
11.84/12.14	============================== end predicate elimination =============
11.84/12.14	
11.84/12.14	Auto_denials:  (non-Horn, no changes).
11.84/12.14	
11.84/12.14	Term ordering decisions:
11.84/12.14	Function symbol KB weights:  c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=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.
11.84/12.14	
11.84/12.14	============================== end of process initial clauses ========
11.84/12.14	
11.84/12.14	============================== CLAUSES FOR SEARCH ====================
11.84/12.14	
11.84/12.14	============================== end of clauses for search =============
11.84/12.14	
11.84/12.14	============================== SEARCH ================================
11.84/12.14	
11.84/12.14	% Starting search at 0.04 seconds.
11.84/12.14	
11.84/12.14	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 2147483647 (0.00 of 0.18 sec).
11.84/12.14	
11.84/12.14	Low Water (keep): wt=30.000, iters=3366
11.84/12.14	
11.84/12.14	Low Water (keep): wt=26.000, iters=3364
11.84/12.14	
11.84/12.14	Low Water (keep): wt=25.000, iters=3339
11.84/12.14	
11.84/12.14	Low Water (keep): wt=22.000, iters=3348
11.84/12.14	
11.84/12.14	Low Water (keep): wt=21.000, iters=3557
11.84/12.14	
11.84/12.14	Low Water (keep): wt=18.000, iters=3398
11.84/12.14	
11.84/12.14	Low Water (keep): wt=16.000, iters=3334
11.84/12.14	
11.84/12.14	Low Water (keep): wt=15.000, iters=3466
11.84/12.14	
11.84/12.14	Low Water (keep): wt=14.000, iters=3375
11.84/12.14	
11.84/12.14	Low Water (keep): wt=12.000, iters=3333
11.84/12.14	
11.84/12.14	Low Water (displace): id=15046, wt=8.000
11.84/12.14	
11.84/12.14	Low Water (keep): wt=10.000, iters=3356
11.84/12.14	
11.84/12.14	Low Water (keep): wt=9.000, iters=3350
11.84/12.14	
11.84/12.14	============================== PROOF =================================
11.84/12.14	% SZS status Theorem
11.84/12.14	% SZS output start Refutation
11.84/12.14	
11.84/12.14	% Proof 1 at 10.90 (+ 0.10) seconds.
11.84/12.14	% Length of proof is 42.
11.84/12.14	% Level of proof is 13.
11.84/12.14	% Maximum clause weight is 18.000.
11.84/12.14	% Given clauses 15011.
11.84/12.14	
11.84/12.14	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].
11.84/12.14	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].
11.84/12.14	45 (all A all B all C (para(A,B,A,C) -> coll(A,B,C))) # label(ruleD66) # label(axiom) # label(non_clause).  [assumption].
11.84/12.14	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].
11.84/12.14	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].
11.84/12.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].
11.84/12.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].
11.84/12.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].
11.84/12.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].
11.84/12.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].
11.84/12.14	95 -(all A all B all C all O all D all U all V all NWPNT1 (perp(A,B,D,U) & perp(A,D,B,U) & perp(B,D,A,U) & perp(A,C,D,V) & perp(A,D,C,V) & perp(C,D,A,V) & circle(O,A,D,NWPNT1) & circle(O,A,B,C) -> cyclic(A,U,D,V))) # label(exemplo6GDDFULL416047) # label(negated_conjecture) # label(non_clause).  [assumption].
11.84/12.14	126 -cyclic(A,B,C,D) | -cyclic(A,B,C,E) | cyclic(B,C,D,E) # label(ruleD17) # label(axiom).  [clausify(14)].
11.84/12.14	153 -perp(A,B,C,D) | perp(C,D,A,B) # label(ruleD8) # label(axiom).  [clausify(39)].
11.84/12.14	159 -para(A,B,A,C) | coll(A,B,C) # label(ruleD66) # label(axiom).  [clausify(45)].
11.84/12.14	163 -perp(A,B,C,D) | -perp(E,F,A,B) | para(E,F,C,D) # label(ruleD9) # label(axiom).  [clausify(49)].
11.84/12.14	167 -coll(A,B,C) | -coll(A,B,D) | coll(C,D,A) # label(ruleD3) # label(axiom).  [clausify(53)].
11.84/12.14	185 -para(A,B,C,D) | eqangle(A,B,E,F,C,D,E,F) # label(ruleD40) # label(axiom).  [clausify(70)].
11.84/12.14	190 -eqangle(A,B,A,C,D,B,D,C) | -coll(A,D,C) | cyclic(B,C,A,D) # label(ruleD42b) # label(axiom).  [clausify(74)].
11.84/12.14	196 -eqangle(A,B,C,D,E,F,C,D) | para(A,B,E,F) # label(ruleD39) # label(axiom).  [clausify(80)].
11.84/12.14	197 -eqangle(A,B,C,D,E,F,V6,V7) | eqangle(C,D,A,B,V6,V7,E,F) # label(ruleD19) # label(axiom).  [clausify(81)].
11.84/12.14	200 -eqangle(A,B,C,D,E,F,V6,V7) | eqangle(A,B,E,F,C,D,V6,V7) # label(ruleD21) # label(axiom).  [clausify(85)].
11.84/12.14	210 perp(c1,c2,c5,c6) # label(exemplo6GDDFULL416047) # label(negated_conjecture).  [clausify(95)].
11.84/12.14	216 -cyclic(c1,c6,c5,c7) # label(exemplo6GDDFULL416047) # label(negated_conjecture).  [clausify(95)].
11.84/12.14	303 -coll(A,B,C) | coll(C,C,A).  [factor(167,a,b)].
11.84/12.14	347 -perp(c5,c6,A,B) | para(c1,c2,A,B).  [resolve(210,a,163,b)].
11.84/12.14	349 perp(c5,c6,c1,c2).  [resolve(210,a,153,a)].
11.84/12.14	534 para(c1,c2,c1,c2).  [resolve(347,a,349,a)].
11.84/12.14	705 eqangle(c1,c2,A,B,c1,c2,A,B).  [resolve(534,a,185,a)].
11.84/12.14	706 coll(c1,c2,c2).  [resolve(534,a,159,a)].
11.84/12.14	711 coll(c2,c2,c1).  [resolve(706,a,303,a)].
11.84/12.14	719 -coll(c2,c2,A) | coll(c1,A,c2).  [resolve(711,a,167,a)].
11.84/12.14	5473 eqangle(c1,c2,c1,c2,A,B,A,B).  [resolve(705,a,200,a)].
11.84/12.14	5474 eqangle(A,B,c1,c2,A,B,c1,c2).  [resolve(705,a,197,a)].
11.84/12.14	29176 -coll(c1,A,c2) | cyclic(c2,c2,c1,A).  [resolve(5473,a,190,a)].
11.84/12.14	29180 para(A,B,A,B).  [resolve(5474,a,196,a)].
11.84/12.14	29186 coll(A,B,B).  [resolve(29180,a,159,a)].
11.84/12.14	29239 coll(A,A,B).  [resolve(29186,a,303,a)].
11.84/12.14	29719 coll(c1,A,c2).  [back_unit_del(719),unit_del(a,29239)].
11.84/12.14	29950 cyclic(c2,c2,c1,A).  [back_unit_del(29176),unit_del(a,29719)].
11.84/12.14	30189 cyclic(c2,c1,A,B).  [resolve(29950,a,126,b),unit_del(a,29950)].
11.84/12.14	30505 cyclic(c1,A,B,C).  [resolve(30189,a,126,b),unit_del(a,30189)].
11.84/12.14	30506 $F.  [resolve(30505,a,216,a)].
11.84/12.14	
11.84/12.14	% SZS output end Refutation
11.84/12.14	============================== end of proof ==========================
11.84/12.14	
11.84/12.14	============================== STATISTICS ============================
11.84/12.14	
11.84/12.14	Given=15011. Generated=171791. Kept=30379. proofs=1.
11.84/12.14	Usable=13236. Sos=6008. Demods=0. Limbo=2, Disabled=11304. Hints=0.
11.84/12.14	Megabytes=16.32.
11.84/12.14	User_CPU=10.90, System_CPU=0.10, Wall_clock=11.
11.84/12.14	
11.84/12.14	============================== end of statistics =====================
11.84/12.14	
11.84/12.14	============================== end of search =========================
11.84/12.14	
11.84/12.14	THEOREM PROVED
11.84/12.14	% SZS status Theorem
11.84/12.14	
11.84/12.14	Exiting with 1 proof.
11.84/12.14	
11.84/12.14	Process 24757 exit (max_proofs) Tue Jul 13 14:20:52 2021
11.84/12.14	Prover9 interrupted
11.84/12.14	EOF