TSTP Solution File: GEO576+1 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : GEO576+1 : TPTP v8.1.0. Released v7.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n019.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 600s
% DateTime : Sat Jul 16 05:57:02 EDT 2022

% Result   : Theorem 10.63s 10.88s
% Output   : Refutation 10.64s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : GEO576+1 : TPTP v8.1.0. Released v7.5.0.
% 0.12/0.12  % Command  : tptp2X_and_run_prover9 %d %s
% 0.12/0.33  % Computer : n019.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Fri Jun 17 17:12:39 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.84/1.08  ============================== Prover9 ===============================
% 0.84/1.08  Prover9 (32) version 2009-11A, November 2009.
% 0.84/1.08  Process 9656 was started by sandbox on n019.cluster.edu,
% 0.84/1.08  Fri Jun 17 17:12:40 2022
% 0.84/1.08  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_9503_n019.cluster.edu".
% 0.84/1.08  ============================== end of head ===========================
% 0.84/1.08  
% 0.84/1.08  ============================== INPUT =================================
% 0.84/1.08  
% 0.84/1.08  % Reading from file /tmp/Prover9_9503_n019.cluster.edu
% 0.84/1.08  
% 0.84/1.08  set(prolog_style_variables).
% 0.84/1.08  set(auto2).
% 0.84/1.08      % set(auto2) -> set(auto).
% 0.84/1.08      % set(auto) -> set(auto_inference).
% 0.84/1.08      % set(auto) -> set(auto_setup).
% 0.84/1.08      % set(auto_setup) -> set(predicate_elim).
% 0.84/1.08      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.84/1.08      % set(auto) -> set(auto_limits).
% 0.84/1.08      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.84/1.08      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.84/1.08      % set(auto) -> set(auto_denials).
% 0.84/1.08      % set(auto) -> set(auto_process).
% 0.84/1.08      % set(auto2) -> assign(new_constants, 1).
% 0.84/1.08      % set(auto2) -> assign(fold_denial_max, 3).
% 0.84/1.08      % set(auto2) -> assign(max_weight, "200.000").
% 0.84/1.08      % set(auto2) -> assign(max_hours, 1).
% 0.84/1.08      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.84/1.08      % set(auto2) -> assign(max_seconds, 0).
% 0.84/1.08      % set(auto2) -> assign(max_minutes, 5).
% 0.84/1.08      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.84/1.08      % set(auto2) -> set(sort_initial_sos).
% 0.84/1.08      % set(auto2) -> assign(sos_limit, -1).
% 0.84/1.08      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.84/1.08      % set(auto2) -> assign(max_megs, 400).
% 0.84/1.08      % set(auto2) -> assign(stats, some).
% 0.84/1.08      % set(auto2) -> clear(echo_input).
% 0.84/1.08      % set(auto2) -> set(quiet).
% 0.84/1.08      % set(auto2) -> clear(print_initial_clauses).
% 0.84/1.08      % set(auto2) -> clear(print_given).
% 0.84/1.08  assign(lrs_ticks,-1).
% 0.84/1.08  assign(sos_limit,10000).
% 0.84/1.08  assign(order,kbo).
% 0.84/1.08  set(lex_order_vars).
% 0.84/1.08  clear(print_given).
% 0.84/1.08  
% 0.84/1.08  % formulas(sos).  % not echoed (95 formulas)
% 0.84/1.08  
% 0.84/1.08  ============================== end of input ==========================
% 0.84/1.08  
% 0.84/1.08  % From the command line: assign(max_seconds, 300).
% 0.84/1.08  
% 0.84/1.08  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.84/1.08  
% 0.84/1.08  % Formulas that are not ordinary clauses:
% 0.84/1.08  1 (all A all B all C (coll(A,B,C) -> coll(A,C,B))) # label(ruleD1) # label(axiom) # label(non_clause).  [assumption].
% 0.84/1.08  2 (all A all B all C (coll(A,B,C) -> coll(B,A,C))) # label(ruleD2) # label(axiom) # label(non_clause).  [assumption].
% 0.84/1.08  3 (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.84/1.08  4 (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.84/1.08  5 (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.84/1.08  6 (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.84/1.08  7 (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.84/1.08  8 (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.84/1.08  9 (all A all B all C all D all E all F (perp(A,B,C,D) & perp(C,D,E,F) -> para(A,B,E,F))) # label(ruleD9) # label(axiom) # label(non_clause).  [assumption].
% 0.84/1.08  10 (all A all B all C all D all E all F (para(A,B,C,D) & perp(C,D,E,F) -> perp(A,B,E,F))) # label(ruleD10) # label(axiom) # label(non_clause).  [assumption].
% 0.84/1.08  11 (all A all B all M (midp(M,B,A) -> midp(M,A,B))) # label(ruleD11) # label(axiom) # label(non_clause).  [assumption].
% 0.84/1.08  12 (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.84/1.08  13 (all A all B all C all D all O (cong(O,A,O,B) & cong(O,A,O,C) & cong(O,A,O,D) -> cyclic(A,B,C,D))) # label(ruleD13) # label(axiom) # label(non_clause).  [assumption].
% 0.84/1.08  14 (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.84/1.08  15 (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.84/1.08  16 (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.84/1.08  17 (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.84/1.08  18 (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.84/1.08  19 (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.84/1.08  20 (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.84/1.08  21 (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.84/1.08  22 (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.84/1.08  23 (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.84/1.08  24 (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.84/1.08  25 (all A all B all C all D all E all F (cong(A,B,C,D) & cong(C,D,E,F) -> cong(A,B,E,F))) # label(ruleD25) # label(axiom) # label(non_clause).  [assumption].
% 0.84/1.08  26 (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.84/1.08  27 (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.84/1.08  28 (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.84/1.08  29 (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.84/1.08  30 (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(A,B,C,D,P,Q,U,V) & eqratio(P,Q,U,V,E,F,G,H) -> eqratio(A,B,C,D,E,F,G,H))) # label(ruleD30) # label(axiom) # label(non_clause).  [assumption].
% 0.84/1.08  31 (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.84/1.08  32 (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.84/1.08  33 (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.84/1.09  34 (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.84/1.09  35 (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.84/1.09  36 (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.84/1.09  37 (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.84/1.09  38 (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.84/1.09  39 (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.84/1.09  40 (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.84/1.09  41 (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.84/1.09  42 (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.84/1.09  43 (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.84/1.09  44 (all A all B all C all P all Q all R (cyclic(A,B,C,P) & cyclic(A,B,C,Q) & cyclic(A,B,C,R) & eqangle(C,A,C,B,R,P,R,Q) -> cong(A,B,P,Q))) # label(ruleD43) # label(axiom) # label(non_clause).  [assumption].
% 0.84/1.09  45 (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.84/1.09  46 (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.84/1.09  47 (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.84/1.09  48 (all A all B all O (eqangle(O,A,A,B,A,B,O,B) & -coll(O,A,B) -> cong(O,A,O,B))) # label(ruleD47) # label(axiom) # label(non_clause).  [assumption].
% 0.84/1.09  49 (all A all B all C all O all X (circle(O,A,B,C) & perp(O,A,A,X) -> eqangle(A,X,A,B,C,A,C,B))) # label(ruleD48) # label(axiom) # label(non_clause).  [assumption].
% 0.84/1.09  50 (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.84/1.09  51 (all A all B all C all O all M (circle(O,A,B,C) & midp(M,B,C) -> eqangle(A,B,A,C,O,B,O,M))) # label(ruleD50) # label(axiom) # label(non_clause).  [assumption].
% 0.84/1.09  52 (all A all B all C all O all M (circle(O,A,B,C) & coll(M,B,C) & eqangle(A,B,A,C,O,B,O,M) -> midp(M,B,C))) # label(ruleD51) # label(axiom) # label(non_clause).  [assumption].
% 0.84/1.09  53 (all A all B all C all M (perp(A,B,B,C) & midp(M,A,C) -> cong(A,M,B,M))) # label(ruleD52) # label(axiom) # label(non_clause).  [assumption].
% 0.84/1.09  54 (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.84/1.09  55 (all A all B all C all D (cyclic(A,B,C,D) & para(A,B,C,D) -> eqangle(A,D,C,D,C,D,C,B))) # label(ruleD54) # label(axiom) # label(non_clause).  [assumption].
% 0.84/1.09  56 (all A all B all M all O (midp(M,A,B) & perp(O,M,A,B) -> cong(O,A,O,B))) # label(ruleD55) # label(axiom) # label(non_clause).  [assumption].
% 0.84/1.09  57 (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.84/1.09  58 (all A all B all P all Q (cong(A,P,B,P) & cong(A,Q,B,Q) & cyclic(A,B,P,Q) -> perp(P,A,A,Q))) # label(ruleD57) # label(axiom) # label(non_clause).  [assumption].
% 0.84/1.09  59 (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.84/1.09  60 (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.84/1.09  61 (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.84/1.09  62 (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.84/1.09  63 (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.84/1.09  64 (all A all B all C all D all M (midp(M,A,B) & midp(M,C,D) -> para(A,C,B,D))) # label(ruleD63) # label(axiom) # label(non_clause).  [assumption].
% 0.84/1.09  65 (all A all B all C all D all M (midp(M,A,B) & para(A,C,B,D) & para(A,D,B,C) -> midp(M,C,D))) # label(ruleD64) # label(axiom) # label(non_clause).  [assumption].
% 0.84/1.09  66 (all A all B all C all D all O (para(A,B,C,D) & coll(O,A,C) & coll(O,B,D) -> eqratio(O,A,A,C,O,B,B,D))) # label(ruleD65) # label(axiom) # label(non_clause).  [assumption].
% 0.84/1.09  67 (all A all B all C (para(A,B,A,C) -> coll(A,B,C))) # label(ruleD66) # label(axiom) # label(non_clause).  [assumption].
% 0.84/1.09  68 (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.84/1.09  69 (all A all B all C (midp(A,B,C) -> cong(A,B,A,C))) # label(ruleD68) # label(axiom) # label(non_clause).  [assumption].
% 0.84/1.09  70 (all A all B all C (midp(A,B,C) -> coll(A,B,C))) # label(ruleD69) # label(axiom) # label(non_clause).  [assumption].
% 0.84/1.09  71 (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.84/1.09  72 (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.84/1.09  73 (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.84/1.09  74 (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) & para(P,Q,U,V) -> para(A,B,C,D))) # label(ruleD73) # label(axiom) # label(non_clause).  [assumption].
% 0.84/1.09  75 (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.84/1.09  76 (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) & cong(P,Q,U,V) -> cong(A,B,C,D))) # label(ruleD75) # label(axiom) # label(non_clause).  [assumption].
% 0.84/1.09  77 (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,A,M) & coll(B,O,X))) # label(ruleX1) # label(axiom) # label(non_clause).  [assumption].
% 0.84/1.09  78 (all A all B all O all X exists M (cong(O,A,O,B) & eqangle(A,O,O,X,O,X,O,B) -> coll(B,A,M) & coll(M,O,X))) # label(ruleX2) # label(axiom) # label(non_clause).  [assumption].
% 0.84/1.09  79 (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.84/1.09  80 (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.84/1.09  81 (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.84/1.09  82 (all A all B all C all D all M all N exists P (midp(M,A,B) & midp(N,C,D) -> midp(P,A,D) & para(P,M,B,D) & para(P,N,A,C))) # label(ruleX6) # label(axiom) # label(non_clause).  [assumption].
% 0.84/1.09  83 (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(C,A,B) & coll(D,A,B) -> midp(P,A,Q))) # label(ruleX7) # label(axiom) # label(non_clause).  [assumption].
% 0.84/1.09  84 (all A all B all M all P all Q all R all M exists X (midp(M,A,B) & para(A,P,R,M) & para(A,P,B,Q) & coll(P,Q,R) -> coll(X,A,Q) & coll(X,M,R))) # label(ruleX8) # label(axiom) # label(non_clause).  [assumption].
% 0.84/1.09  85 (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) & para(P,C,A,B) & cong(B,C,B,P))) # label(ruleX9) # label(axiom) # label(non_clause).  [assumption].
% 0.84/1.09  86 (all A all B all C all H exists P exists Q (perp(A,H,B,C) & perp(B,H,A,C) -> coll(P,C,B) & perp(A,P,C,B) & coll(Q,C,A) & perp(B,Q,C,A))) # label(ruleX10) # label(axiom) # label(non_clause).  [assumption].
% 0.84/1.09  87 (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.84/1.09  88 (all A all B all C all D all M all N exists P exists Q (circle(M,A,B,C) & cong(M,A,M,D) & cong(N,A,N,B) & M != N -> 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.84/1.09  89 (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.84/1.09  90 (all A all B all C all D exists O (perp(A,C,C,B) & cyclic(A,B,C,D) -> circle(O,A,B,C))) # label(ruleX14) # label(axiom) # label(non_clause).  [assumption].
% 0.84/1.09  91 (all A all B all C all E all F exists P (perp(A,C,C,B) & coll(B,E,F) -> coll(P,E,F) & perp(P,A,E,F))) # label(ruleX15) # label(axiom) # label(non_clause).  [assumption].
% 0.84/1.09  92 (all A all B all C all D all M exists P (perp(A,B,A,C) & perp(C,A,C,D) & midp(M,B,D) -> midp(P,A,C))) # label(ruleX16) # label(axiom) # label(non_clause).  [assumption].
% 0.84/1.09  93 (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.84/1.09  94 (all A all B all C all D all P all Q exists R (para(A,B,C,D) & coll(P,A,C) & coll(P,B,D) & coll(Q,A,B) -> coll(P,Q,R) & coll(R,C,D))) # label(ruleX18) # label(axiom) # label(non_clause).  [assumption].
% 0.84/1.09  95 -(all A all B all C all D all O all D1 all P all NWPNT1 (perp(D,A,B,C) & coll(D,B,C) & circle(O,A,B,C) & circle(O,A,D1,NWPNT1) & coll(D1,A,D) & perp(A,C,D1,P) & coll(P,B,C) -> eqangle(O,A,A,D,C,A,A,P))) # label(exemplo6GDDFULL214038) # label(negated_conjecture) # label(non_clause).  [assumption].
% 0.84/1.09  
% 0.84/1.09  ============================== end of process non-clausal formulas ===
% 0.84/1.09  
% 0.84/1.09  ============================== PROCESS INITIAL CLAUSES ===============
% 0.84/1.09  
% 0.84/1.09  ============================== PREDICATE ELIMINATION =================
% 0.84/1.09  96 -circle(A,B,C,D) | -perp(A,B,B,E) | eqangle(B,E,B,C,D,B,D,C) # label(ruleD48) # label(axiom).  [clausify(49)].
% 0.84/1.09  97 -cong(A,B,A,C) | -cong(A,B,A,D) | circle(A,B,C,D) # label(ruleD12) # label(axiom).  [clausify(12)].
% 0.84/1.09  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(96,a,97,c)].
% 0.84/1.09  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(50)].
% 0.84/1.09  Derived: -eqangle(A,B,A,C,D,A,D,C) | perp(E,A,A,B) | -cong(E,A,E,C) | -cong(E,A,E,D).  [resolve(98,a,97,c)].
% 0.84/1.09  99 -circle(A,B,C,D) | -midp(E,C,D) | eqangle(B,C,B,D,A,C,A,E) # label(ruleD50) # label(axiom).  [clausify(51)].
% 0.84/1.09  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(99,a,97,c)].
% 0.84/1.09  100 -circle(A,B,C,D) | -coll(E,C,D) | -eqangle(B,C,B,D,A,C,A,E) | midp(E,C,D) # label(ruleD51) # label(axiom).  [clausify(52)].
% 0.84/1.09  Derived: -coll(A,B,C) | -eqangle(D,B,D,C,E,B,E,A) | midp(A,B,C) | -cong(E,D,E,B) | -cong(E,D,E,C).  [resolve(100,a,97,c)].
% 0.84/1.09  101 -circle(A,B,C,D) | -coll(A,B,D) | perp(B,C,C,D) # label(ruleD53) # label(axiom).  [clausify(54)].
% 0.84/1.09  Derived: -coll(A,B,C) | perp(B,D,D,C) | -cong(A,B,A,D) | -cong(A,B,A,C).  [resolve(101,a,97,c)].
% 0.84/1.09  102 -circle(A,B,C,D) | perp(f12(B,C,D,A),B,B,A) # label(ruleX11) # label(axiom).  [clausify(87)].
% 0.84/1.09  Derived: perp(f12(A,B,C,D),A,A,D) | -cong(D,A,D,B) | -cong(D,A,D,C).  [resolve(102,a,97,c)].
% 0.84/1.09  103 -circle(A,B,C,D) | -cong(A,B,A,E) | -cong(F,B,F,C) | F = A | coll(f13(B,C,D,E,A,F),B,D) # label(ruleX12) # label(axiom).  [clausify(88)].
% 0.84/1.09  Derived: -cong(A,B,A,C) | -cong(D,B,D,E) | D = A | coll(f13(B,E,F,C,A,D),B,F) | -cong(A,B,A,E) | -cong(A,B,A,F).  [resolve(103,a,97,c)].
% 0.84/1.09  104 -circle(A,B,C,D) | -cong(A,B,A,E) | -cong(F,B,F,C) | F = A | cong(f13(B,C,D,E,A,F),F,F,B) # label(ruleX12) # label(axiom).  [clausify(88)].
% 0.84/1.09  Derived: -cong(A,B,A,C) | -cong(D,B,D,E) | D = A | cong(f13(B,E,F,C,A,D),D,D,B) | -cong(A,B,A,E) | -cong(A,B,A,F).  [resolve(104,a,97,c)].
% 0.84/1.09  105 -circle(A,B,C,D) | -cong(A,B,A,E) | -cong(F,B,F,C) | F = A | coll(f14(B,C,D,E,A,F),C,E) # label(ruleX12) # label(axiom).  [clausify(88)].
% 0.84/1.09  Derived: -cong(A,B,A,C) | -cong(D,B,D,E) | D = A | coll(f14(B,E,F,C,A,D),E,C) | -cong(A,B,A,E) | -cong(A,B,A,F).  [resolve(105,a,97,c)].
% 0.84/1.09  106 -circle(A,B,C,D) | -cong(A,B,A,E) | -cong(F,B,F,C) | F = A | cong(f14(B,C,D,E,A,F),F,F,B) # label(ruleX12) # label(axiom).  [clausify(88)].
% 0.84/1.09  Derived: -cong(A,B,A,C) | -cong(D,B,D,E) | D = A | cong(f14(B,E,F,C,A,D),D,D,B) | -cong(A,B,A,E) | -cong(A,B,A,F).  [resolve(106,a,97,c)].
% 0.84/1.09  107 -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | circle(f15(A,B,C,D,E),A,B,C) # label(ruleX13) # label(axiom).  [clausify(89)].
% 0.84/1.09  Derived: -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | -perp(f15(A,B,C,D,E),A,A,F) | eqangle(A,F,A,B,C,A,C,B).  [resolve(107,d,96,a)].
% 0.84/1.09  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(f15(A,B,C,D,E),A,A,F).  [resolve(107,d,98,a)].
% 0.84/1.09  Derived: -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | -midp(F,B,C) | eqangle(A,B,A,C,f15(A,B,C,D,E),B,f15(A,B,C,D,E),F).  [resolve(107,d,99,a)].
% 0.84/1.09  Derived: -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | -coll(F,B,C) | -eqangle(A,B,A,C,f15(A,B,C,D,E),B,f15(A,B,C,D,E),F) | midp(F,B,C).  [resolve(107,d,100,a)].
% 0.84/1.09  Derived: -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | -coll(f15(A,B,C,D,E),A,C) | perp(A,B,B,C).  [resolve(107,d,101,a)].
% 0.84/1.09  Derived: -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | perp(f12(A,B,C,f15(A,B,C,D,E)),A,A,f15(A,B,C,D,E)).  [resolve(107,d,102,a)].
% 0.84/1.09  Derived: -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | -cong(f15(A,B,C,D,E),A,f15(A,B,C,D,E),F) | -cong(V6,A,V6,B) | V6 = f15(A,B,C,D,E) | coll(f13(A,B,C,F,f15(A,B,C,D,E),V6),A,C).  [resolve(107,d,103,a)].
% 0.84/1.09  Derived: -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | -cong(f15(A,B,C,D,E),A,f15(A,B,C,D,E),F) | -cong(V6,A,V6,B) | V6 = f15(A,B,C,D,E) | cong(f13(A,B,C,F,f15(A,B,C,D,E),V6),V6,V6,A).  [resolve(107,d,104,a)].
% 0.84/1.09  Derived: -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | -cong(f15(A,B,C,D,E),A,f15(A,B,C,D,E),F) | -cong(V6,A,V6,B) | V6 = f15(A,B,C,D,E) | coll(f14(A,B,C,F,f15(A,B,C,D,E),V6),B,F).  [resolve(107,d,105,a)].
% 0.84/1.09  Derived: -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | -cong(f15(A,B,C,D,E),A,f15(A,B,C,D,E),F) | -cong(V6,A,V6,B) | V6 = f15(A,B,C,D,E) | cong(f14(A,B,C,F,f15(A,B,C,D,E),V6),V6,V6,A).  [resolve(107,d,106,a)].
% 0.84/1.09  108 -perp(A,B,B,C) | -cyclic(A,C,B,D) | circle(f16(A,C,B,D),A,C,B) # label(ruleX14) # label(axiom).  [clausify(90)].
% 0.84/1.09  Derived: -perp(A,B,B,C) | -cyclic(A,C,B,D) | -perp(f16(A,C,B,D),A,A,E) | eqangle(A,E,A,C,B,A,B,C).  [resolve(108,c,96,a)].
% 0.84/1.09  Derived: -perp(A,B,B,C) | -cyclic(A,C,B,D) | -eqangle(A,E,A,C,B,A,B,C) | perp(f16(A,C,B,D),A,A,E).  [resolve(108,c,98,a)].
% 0.84/1.09  Derived: -perp(A,B,B,C) | -cyclic(A,C,B,D) | -midp(E,C,B) | eqangle(A,C,A,B,f16(A,C,B,D),C,f16(A,C,B,D),E).  [resolve(108,c,99,a)].
% 0.84/1.09  Derived: -perp(A,B,B,C) | -cyclic(A,C,B,D) | -coll(E,C,B) | -eqangle(A,C,A,B,f16(A,C,B,D),C,f16(A,C,B,D),E) | midp(E,C,B).  [resolve(108,c,100,a)].
% 0.84/1.09  Derived: -perp(A,B,B,C) | -cyclic(A,C,B,D) | -coll(f16(A,C,B,D),A,B) | perp(A,C,C,B).  [resolve(108,c,101,a)].
% 0.84/1.09  Derived: -perp(A,B,B,C) | -cyclic(A,C,B,D) | perp(f12(A,C,B,f16(A,C,B,D)),A,A,f16(A,C,B,D)).  [resolve(108,c,102,a)].
% 0.84/1.09  Derived: -perp(A,B,B,C) | -cyclic(A,C,B,D) | -cong(f16(A,C,B,D),A,f16(A,C,B,D),E) | -cong(F,A,F,C) | F = f16(A,C,B,D) | coll(f13(A,C,B,E,f16(A,C,B,D),F),A,B).  [resolve(108,c,103,a)].
% 0.84/1.09  Derived: -perp(A,B,B,C) | -cyclic(A,C,B,D) | -cong(f16(A,C,B,D),A,f16(A,C,B,D),E) | -cong(F,A,F,C) | F = f16(A,C,B,D) | cong(f13(A,C,B,E,f16(A,C,B,D),F),F,F,A).  [resolve(108,c,104,a)].
% 0.84/1.09  Derived: -perp(A,B,B,C) | -cyclic(A,C,B,D) | -cong(f16(A,C,B,D),A,f16(A,C,B,D),E) | -cong(F,A,F,C) | F = f16(A,C,B,D) | coll(f14(A,C,B,E,f16(A,C,B,D),F),C,E).  [resolve(108,c,105,a)].
% 0.84/1.09  Derived: -perp(A,B,B,C) | -cyclic(A,C,B,D) | -cong(f16(A,C,B,D),A,f16(A,C,B,D),E) | -cong(F,A,F,C) | F = f16(A,C,B,D) | cong(f14(A,C,B,E,f16(A,C,B,D),F),F,F,A).  [resolve(108,c,106,a)].
% 0.84/1.09  109 circle(c5,c1,c2,c3) # label(exemplo6GDDFULL214038) # label(negated_conjecture).  [clausify(95)].
% 0.84/1.09  Derived: -perp(c5,c1,c1,A) | eqangle(c1,A,c1,c2,c3,c1,c3,c2).  [resolve(109,a,96,a)].
% 0.84/1.09  Derived: -eqangle(c1,A,c1,c2,c3,c1,c3,c2) | perp(c5,c1,c1,A).  [resolve(109,a,98,a)].
% 0.84/1.09  Derived: -midp(A,c2,c3) | eqangle(c1,c2,c1,c3,c5,c2,c5,A).  [resolve(109,a,99,a)].
% 0.84/1.09  Derived: -coll(A,c2,c3) | -eqangle(c1,c2,c1,c3,c5,c2,c5,A) | midp(A,c2,c3).  [resolve(109,a,100,a)].
% 0.84/1.09  Derived: -coll(c5,c1,c3) | perp(c1,c2,c2,c3).  [resolve(109,a,101,a)].
% 0.84/1.09  Derived: perp(f12(c1,c2,c3,c5),c1,c1,c5).  [resolve(109,a,102,a)].
% 0.84/1.09  Derived: -cong(c5,c1,c5,A) | -cong(B,c1,B,c2) | B = c5 | coll(f13(c1,c2,c3,A,c5,B),c1,c3).  [resolve(109,a,103,a)].
% 10.63/10.88  Derived: -cong(c5,c1,c5,A) | -cong(B,c1,B,c2) | B = c5 | cong(f13(c1,c2,c3,A,c5,B),B,B,c1).  [resolve(109,a,104,a)].
% 10.63/10.88  Derived: -cong(c5,c1,c5,A) | -cong(B,c1,B,c2) | B = c5 | coll(f14(c1,c2,c3,A,c5,B),c2,A).  [resolve(109,a,105,a)].
% 10.63/10.88  Derived: -cong(c5,c1,c5,A) | -cong(B,c1,B,c2) | B = c5 | cong(f14(c1,c2,c3,A,c5,B),B,B,c1).  [resolve(109,a,106,a)].
% 10.63/10.88  110 circle(c5,c1,c6,c8) # label(exemplo6GDDFULL214038) # label(negated_conjecture).  [clausify(95)].
% 10.63/10.88  Derived: -perp(c5,c1,c1,A) | eqangle(c1,A,c1,c6,c8,c1,c8,c6).  [resolve(110,a,96,a)].
% 10.63/10.88  Derived: -eqangle(c1,A,c1,c6,c8,c1,c8,c6) | perp(c5,c1,c1,A).  [resolve(110,a,98,a)].
% 10.63/10.88  Derived: -midp(A,c6,c8) | eqangle(c1,c6,c1,c8,c5,c6,c5,A).  [resolve(110,a,99,a)].
% 10.63/10.88  Derived: -coll(A,c6,c8) | -eqangle(c1,c6,c1,c8,c5,c6,c5,A) | midp(A,c6,c8).  [resolve(110,a,100,a)].
% 10.63/10.88  Derived: -coll(c5,c1,c8) | perp(c1,c6,c6,c8).  [resolve(110,a,101,a)].
% 10.63/10.88  Derived: perp(f12(c1,c6,c8,c5),c1,c1,c5).  [resolve(110,a,102,a)].
% 10.63/10.88  Derived: -cong(c5,c1,c5,A) | -cong(B,c1,B,c6) | B = c5 | coll(f13(c1,c6,c8,A,c5,B),c1,c8).  [resolve(110,a,103,a)].
% 10.63/10.88  Derived: -cong(c5,c1,c5,A) | -cong(B,c1,B,c6) | B = c5 | cong(f13(c1,c6,c8,A,c5,B),B,B,c1).  [resolve(110,a,104,a)].
% 10.63/10.88  Derived: -cong(c5,c1,c5,A) | -cong(B,c1,B,c6) | B = c5 | coll(f14(c1,c6,c8,A,c5,B),c6,A).  [resolve(110,a,105,a)].
% 10.63/10.88  Derived: -cong(c5,c1,c5,A) | -cong(B,c1,B,c6) | B = c5 | cong(f14(c1,c6,c8,A,c5,B),B,B,c1).  [resolve(110,a,106,a)].
% 10.63/10.88  
% 10.63/10.88  ============================== end predicate elimination =============
% 10.63/10.88  
% 10.63/10.88  Auto_denials:  (non-Horn, no changes).
% 10.63/10.88  
% 10.63/10.88  Term ordering decisions:
% 10.63/10.88  Function symbol KB weights:  c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. f19=1. f1=1. f2=1. f3=1. f4=1. f10=1. f11=1. f12=1. f16=1. f5=1. f9=1. f15=1. f17=1. f18=1. f6=1. f13=1. f14=1. f20=1. f7=1. f8=1.
% 10.63/10.88  
% 10.63/10.88  ============================== end of process initial clauses ========
% 10.63/10.88  
% 10.63/10.88  ============================== CLAUSES FOR SEARCH ====================
% 10.63/10.88  
% 10.63/10.88  ============================== end of clauses for search =============
% 10.63/10.88  
% 10.63/10.88  ============================== SEARCH ================================
% 10.63/10.88  
% 10.63/10.88  % Starting search at 0.04 seconds.
% 10.63/10.88  
% 10.63/10.88  NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 2147483647 (0.00 of 0.15 sec).
% 10.63/10.88  
% 10.63/10.88  Low Water (keep): wt=30.000, iters=3346
% 10.63/10.88  
% 10.63/10.88  Low Water (keep): wt=26.000, iters=3338
% 10.63/10.88  
% 10.63/10.88  Low Water (keep): wt=23.000, iters=3343
% 10.63/10.88  
% 10.63/10.88  Low Water (keep): wt=22.000, iters=3351
% 10.63/10.88  
% 10.63/10.88  Low Water (keep): wt=21.000, iters=3346
% 10.63/10.88  
% 10.63/10.88  Low Water (keep): wt=19.000, iters=3333
% 10.63/10.88  
% 10.63/10.88  Low Water (keep): wt=18.000, iters=3380
% 10.63/10.88  
% 10.63/10.88  Low Water (keep): wt=17.000, iters=3354
% 10.63/10.88  
% 10.63/10.88  Low Water (keep): wt=16.000, iters=3341
% 10.63/10.88  
% 10.63/10.88  Low Water (keep): wt=15.000, iters=3335
% 10.63/10.88  
% 10.63/10.88  Low Water (keep): wt=14.000, iters=3333
% 10.63/10.88  
% 10.63/10.88  Low Water (keep): wt=13.000, iters=3333
% 10.63/10.88  
% 10.63/10.88  Low Water (displace): id=8466, wt=57.000
% 10.63/10.88  
% 10.63/10.88  Low Water (displace): id=8463, wt=49.000
% 10.63/10.88  
% 10.63/10.88  Low Water (displace): id=8464, wt=48.000
% 10.63/10.88  
% 10.63/10.88  Low Water (displace): id=8528, wt=46.000
% 10.63/10.88  
% 10.63/10.88  Low Water (displace): id=8364, wt=45.000
% 10.63/10.88  
% 10.63/10.88  Low Water (displace): id=8467, wt=44.000
% 10.63/10.88  
% 10.63/10.88  Low Water (displace): id=7918, wt=42.000
% 10.63/10.88  
% 10.63/10.88  Low Water (displace): id=7919, wt=41.000
% 10.63/10.88  
% 10.63/10.88  Low Water (displace): id=8363, wt=40.000
% 10.63/10.88  
% 10.63/10.88  Low Water (displace): id=8607, wt=39.000
% 10.63/10.88  
% 10.63/10.88  Low Water (displace): id=7920, wt=37.000
% 10.63/10.88  
% 10.63/10.88  Low Water (displace): id=8641, wt=36.000
% 10.63/10.88  
% 10.63/10.88  Low Water (displace): id=8645, wt=34.000
% 10.63/10.88  
% 10.63/10.88  Low Water (displace): id=7922, wt=33.000
% 10.63/10.88  
% 10.63/10.88  Low Water (displace): id=8625, wt=32.000
% 10.63/10.88  
% 10.63/10.88  Low Water (displace): id=8468, wt=31.000
% 10.63/10.88  
% 10.63/10.88  Low Water (displace): id=8499, wt=28.000
% 10.63/10.88  
% 10.63/10.88  Low Water (displace): id=8731, wt=27.000
% 10.63/10.88  
% 10.63/10.88  Low Water (displace): id=8712, wt=26.000
% 10.63/10.88  
% 10.63/10.88  Low Water (keep): wt=12.000, iters=3480
% 10.63/10.88  
% 10.63/10.88  Low Water (displace): id=15010, wt=10.000
% 10.63/10.88  
% 10.63/10.88  Low Water (displace): id=15087, wt=9.000
% 10.63/10.88  
% 10.63/10.88  Low Water (displace): id=15132, wt=8.000
% 10.63/10.88  
% 10.63/10.88  Low Water (displace): id=15383, wt=5.000
% 10.63/10.88  
% 10.63/10.88  Low Water (keep): wt=11.000, iters=3351
% 10.63/10.88  
% 10.63/10.88  Low Water (keep): wt=10.000, iters=3383
% 10.63/10.88  
% 10.63/10.88  ============================== PROOF =================================
% 10.63/10.88  % SZS status Theorem
% 10.63/10.88  % SZS output start Refutation
% 10.63/10.88  
% 10.63/10.88  % Proof 1 at 9.73 (+ 0.09) seconds.
% 10.63/10.88  % Length of proof is 162.
% 10.63/10.88  % Level of proof is 39.
% 10.63/10.88  % Maximum clause weight is 29.000.
% 10.63/10.88  % Given clauses 14701.
% 10.63/10.88  
% 10.63/10.88  1 (all A all B all C (coll(A,B,C) -> coll(A,C,B))) # label(ruleD1) # label(axiom) # label(non_clause).  [assumption].
% 10.63/10.88  2 (all A all B all C (coll(A,B,C) -> coll(B,A,C))) # label(ruleD2) # label(axiom) # label(non_clause).  [assumption].
% 10.63/10.88  3 (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].
% 10.63/10.88  4 (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].
% 10.63/10.88  7 (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].
% 10.63/10.88  8 (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].
% 10.63/10.88  9 (all A all B all C all D all E all F (perp(A,B,C,D) & perp(C,D,E,F) -> para(A,B,E,F))) # label(ruleD9) # label(axiom) # label(non_clause).  [assumption].
% 10.63/10.88  12 (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].
% 10.63/10.88  14 (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].
% 10.63/10.88  15 (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].
% 10.63/10.88  16 (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].
% 10.63/10.88  17 (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].
% 10.63/10.88  19 (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].
% 10.63/10.88  20 (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].
% 10.63/10.88  21 (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].
% 10.63/10.88  22 (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].
% 10.63/10.88  23 (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].
% 10.63/10.88  24 (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].
% 10.63/10.88  39 (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].
% 10.63/10.88  40 (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].
% 10.63/10.88  43 (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].
% 10.63/10.88  44 (all A all B all C all P all Q all R (cyclic(A,B,C,P) & cyclic(A,B,C,Q) & cyclic(A,B,C,R) & eqangle(C,A,C,B,R,P,R,Q) -> cong(A,B,P,Q))) # label(ruleD43) # label(axiom) # label(non_clause).  [assumption].
% 10.63/10.88  52 (all A all B all C all O all M (circle(O,A,B,C) & coll(M,B,C) & eqangle(A,B,A,C,O,B,O,M) -> midp(M,B,C))) # label(ruleD51) # label(axiom) # label(non_clause).  [assumption].
% 10.63/10.88  57 (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].
% 10.63/10.88  65 (all A all B all C all D all M (midp(M,A,B) & para(A,C,B,D) & para(A,D,B,C) -> midp(M,C,D))) # label(ruleD64) # label(axiom) # label(non_clause).  [assumption].
% 10.63/10.88  66 (all A all B all C all D all O (para(A,B,C,D) & coll(O,A,C) & coll(O,B,D) -> eqratio(O,A,A,C,O,B,B,D))) # label(ruleD65) # label(axiom) # label(non_clause).  [assumption].
% 10.63/10.88  67 (all A all B all C (para(A,B,A,C) -> coll(A,B,C))) # label(ruleD66) # label(axiom) # label(non_clause).  [assumption].
% 10.63/10.88  69 (all A all B all C (midp(A,B,C) -> cong(A,B,A,C))) # label(ruleD68) # label(axiom) # label(non_clause).  [assumption].
% 10.63/10.88  76 (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) & cong(P,Q,U,V) -> cong(A,B,C,D))) # label(ruleD75) # label(axiom) # label(non_clause).  [assumption].
% 10.63/10.88  95 -(all A all B all C all D all O all D1 all P all NWPNT1 (perp(D,A,B,C) & coll(D,B,C) & circle(O,A,B,C) & circle(O,A,D1,NWPNT1) & coll(D1,A,D) & perp(A,C,D1,P) & coll(P,B,C) -> eqangle(O,A,A,D,C,A,A,P))) # label(exemplo6GDDFULL214038) # label(negated_conjecture) # label(non_clause).  [assumption].
% 10.63/10.88  97 -cong(A,B,A,C) | -cong(A,B,A,D) | circle(A,B,C,D) # label(ruleD12) # label(axiom).  [clausify(12)].
% 10.63/10.88  100 -circle(A,B,C,D) | -coll(E,C,D) | -eqangle(B,C,B,D,A,C,A,E) | midp(E,C,D) # label(ruleD51) # label(axiom).  [clausify(52)].
% 10.63/10.88  111 -coll(A,B,C) | coll(A,C,B) # label(ruleD1) # label(axiom).  [clausify(1)].
% 10.63/10.88  112 -coll(A,B,C) | coll(B,A,C) # label(ruleD2) # label(axiom).  [clausify(2)].
% 10.63/10.88  113 -coll(A,B,C) | -coll(A,B,D) | coll(C,D,A) # label(ruleD3) # label(axiom).  [clausify(3)].
% 10.63/10.88  114 -para(A,B,C,D) | para(A,B,D,C) # label(ruleD4) # label(axiom).  [clausify(4)].
% 10.63/10.88  117 -perp(A,B,C,D) | perp(A,B,D,C) # label(ruleD7) # label(axiom).  [clausify(7)].
% 10.63/10.88  118 -perp(A,B,C,D) | perp(C,D,A,B) # label(ruleD8) # label(axiom).  [clausify(8)].
% 10.63/10.88  119 -perp(A,B,C,D) | -perp(C,D,E,F) | para(A,B,E,F) # label(ruleD9) # label(axiom).  [clausify(9)].
% 10.63/10.88  123 -cyclic(A,B,C,D) | cyclic(A,B,D,C) # label(ruleD14) # label(axiom).  [clausify(14)].
% 10.63/10.88  124 -cyclic(A,B,C,D) | cyclic(A,C,B,D) # label(ruleD15) # label(axiom).  [clausify(15)].
% 10.63/10.88  125 -cyclic(A,B,C,D) | cyclic(B,A,C,D) # label(ruleD16) # label(axiom).  [clausify(16)].
% 10.63/10.88  126 -cyclic(A,B,C,D) | -cyclic(A,B,C,E) | cyclic(B,C,D,E) # label(ruleD17) # label(axiom).  [clausify(17)].
% 10.63/10.88  128 -eqangle(A,B,C,D,E,F,V6,V7) | eqangle(C,D,A,B,V6,V7,E,F) # label(ruleD19) # label(axiom).  [clausify(19)].
% 10.63/10.88  129 -eqangle(A,B,C,D,E,F,V6,V7) | eqangle(E,F,V6,V7,A,B,C,D) # label(ruleD20) # label(axiom).  [clausify(20)].
% 10.63/10.88  130 -eqangle(A,B,C,D,E,F,V6,V7) | eqangle(A,B,E,F,C,D,V6,V7) # label(ruleD21) # label(axiom).  [clausify(21)].
% 10.63/10.88  131 -eqangle(A,B,C,D,E,F,V6,V7) | -eqangle(E,F,V6,V7,V8,V9,V10,V11) | eqangle(A,B,C,D,V8,V9,V10,V11) # label(ruleD22) # label(axiom).  [clausify(22)].
% 10.63/10.88  132 -cong(A,B,C,D) | cong(A,B,D,C) # label(ruleD23) # label(axiom).  [clausify(23)].
% 10.63/10.88  133 -cong(A,B,C,D) | cong(C,D,A,B) # label(ruleD24) # label(axiom).  [clausify(24)].
% 10.63/10.88  148 -eqangle(A,B,C,D,E,F,C,D) | para(A,B,E,F) # label(ruleD39) # label(axiom).  [clausify(39)].
% 10.63/10.88  149 -para(A,B,C,D) | eqangle(A,B,E,F,C,D,E,F) # label(ruleD40) # label(axiom).  [clausify(40)].
% 10.63/10.88  152 -eqangle(A,B,A,C,D,B,D,C) | -coll(A,D,C) | cyclic(B,C,A,D) # label(ruleD42b) # label(axiom).  [clausify(43)].
% 10.63/10.88  153 -cyclic(A,B,C,D) | -cyclic(A,B,C,E) | -cyclic(A,B,C,F) | -eqangle(C,A,C,B,F,D,F,E) | cong(A,B,D,E) # label(ruleD43) # label(axiom).  [clausify(44)].
% 10.63/10.88  161 -cong(A,B,C,B) | -cong(A,D,C,D) | perp(A,C,B,D) # label(ruleD56) # label(axiom).  [clausify(57)].
% 10.63/10.88  169 -midp(A,B,C) | -para(B,D,C,E) | -para(B,E,C,D) | midp(A,D,E) # label(ruleD64) # label(axiom).  [clausify(65)].
% 10.63/10.88  170 -para(A,B,C,D) | -coll(E,A,C) | -coll(E,B,D) | eqratio(E,A,A,C,E,B,B,D) # label(ruleD65) # label(axiom).  [clausify(66)].
% 10.63/10.88  171 -para(A,B,A,C) | coll(A,B,C) # label(ruleD66) # label(axiom).  [clausify(67)].
% 10.63/10.88  173 -midp(A,B,C) | cong(A,B,A,C) # label(ruleD68) # label(axiom).  [clausify(69)].
% 10.63/10.88  179 -eqratio(A,B,C,D,E,F,V6,V7) | -cong(E,F,V6,V7) | cong(A,B,C,D) # label(ruleD75) # label(axiom).  [clausify(76)].
% 10.63/10.88  210 perp(c4,c1,c2,c3) # label(exemplo6GDDFULL214038) # label(negated_conjecture).  [clausify(95)].
% 10.63/10.88  211 coll(c4,c2,c3) # label(exemplo6GDDFULL214038) # label(negated_conjecture).  [clausify(95)].
% 10.63/10.88  212 coll(c6,c1,c4) # label(exemplo6GDDFULL214038) # label(negated_conjecture).  [clausify(95)].
% 10.63/10.88  213 perp(c1,c3,c6,c7) # label(exemplo6GDDFULL214038) # label(negated_conjecture).  [clausify(95)].
% 10.63/10.88  214 coll(c7,c2,c3) # label(exemplo6GDDFULL214038) # label(negated_conjecture).  [clausify(95)].
% 10.63/10.88  215 -eqangle(c5,c1,c1,c4,c3,c1,c1,c7) # label(exemplo6GDDFULL214038) # label(negated_conjecture).  [clausify(95)].
% 10.64/10.88  219 -coll(A,B,C) | -eqangle(D,B,D,C,E,B,E,A) | midp(A,B,C) | -cong(E,D,E,B) | -cong(E,D,E,C).  [resolve(100,a,97,c)].
% 10.64/10.88  282 -coll(A,B,C) | coll(C,C,A).  [factor(113,a,b)].
% 10.64/10.88  287 -cyclic(A,B,C,D) | cyclic(B,C,D,D).  [factor(126,a,b)].
% 10.64/10.88  288 -cyclic(A,B,C,D) | -cyclic(A,B,C,E) | -eqangle(C,A,C,B,E,D,E,D) | cong(A,B,D,D).  [factor(153,a,b)].
% 10.64/10.88  296 -midp(A,B,C) | -para(B,D,C,D) | midp(A,D,D).  [factor(169,b,c)].
% 10.64/10.88  320 -coll(A,B,B) | -eqangle(C,B,C,B,D,B,D,A) | midp(A,B,B) | -cong(D,C,D,B).  [factor(219,d,e)].
% 10.64/10.88  357 -perp(c2,c3,A,B) | para(c4,c1,A,B).  [resolve(210,a,119,a)].
% 10.64/10.88  358 perp(c2,c3,c4,c1).  [resolve(210,a,118,a)].
% 10.64/10.88  366 coll(c1,c6,c4).  [resolve(212,a,112,a)].
% 10.64/10.88  379 -perp(A,B,c1,c3) | para(A,B,c6,c7).  [resolve(213,a,119,b)].
% 10.64/10.88  381 perp(c6,c7,c1,c3).  [resolve(213,a,118,a)].
% 10.64/10.88  382 perp(c1,c3,c7,c6).  [resolve(213,a,117,a)].
% 10.64/10.88  437 coll(c3,c3,c7).  [resolve(282,a,214,a)].
% 10.64/10.88  439 coll(c3,c3,c4).  [resolve(282,a,211,a)].
% 10.64/10.88  448 coll(c4,c4,c1).  [resolve(366,a,282,a)].
% 10.64/10.88  463 coll(c7,c7,c3).  [resolve(437,a,282,a)].
% 10.64/10.88  464 -coll(c3,c3,A) | coll(A,c7,c3).  [resolve(437,a,113,b)].
% 10.64/10.88  488 coll(c1,c1,c4).  [resolve(448,a,282,a)].
% 10.64/10.88  512 coll(c7,c3,c7).  [resolve(463,a,111,a)].
% 10.64/10.88  546 -coll(c1,c1,A) | coll(c4,A,c1).  [resolve(488,a,113,a)].
% 10.64/10.88  568 coll(c7,c7,c7).  [resolve(512,a,282,a)].
% 10.64/10.88  598 para(c4,c1,c4,c1).  [resolve(358,a,357,a)].
% 10.64/10.88  689 perp(c7,c6,c1,c3).  [resolve(382,a,118,a)].
% 10.64/10.88  701 eqangle(c4,c1,A,B,c4,c1,A,B).  [resolve(598,a,149,a)].
% 10.64/10.88  940 coll(c4,c7,c3).  [resolve(464,a,439,a)].
% 10.64/10.88  943 coll(c7,c4,c3).  [resolve(940,a,112,a)].
% 10.64/10.88  947 coll(c7,c3,c4).  [resolve(943,a,111,a)].
% 10.64/10.88  956 coll(c4,c4,c7).  [resolve(947,a,282,a)].
% 10.64/10.88  990 para(c7,c6,c6,c7).  [resolve(379,a,689,a)].
% 10.64/10.88  991 para(c6,c7,c6,c7).  [resolve(379,a,381,a)].
% 10.64/10.88  1012 para(c7,c6,c7,c6).  [resolve(990,a,114,a)].
% 10.64/10.88  1022 coll(c6,c7,c7).  [resolve(991,a,171,a)].
% 10.64/10.88  1023 -coll(A,c6,c6) | -coll(A,c7,c7) | eqratio(A,c6,c6,c6,A,c7,c7,c7).  [resolve(991,a,170,a)].
% 10.64/10.88  1025 eqangle(c6,c7,A,B,c6,c7,A,B).  [resolve(991,a,149,a)].
% 10.64/10.88  1028 coll(c7,c7,c6).  [resolve(1022,a,282,a)].
% 10.64/10.88  1034 coll(c6,c6,c7).  [resolve(1028,a,282,a)].
% 10.64/10.88  1041 coll(c6,c7,c6).  [resolve(1034,a,111,a)].
% 10.64/10.88  1046 coll(c7,c6,c6).  [resolve(1041,a,112,a)].
% 10.64/10.88  1066 -midp(A,c7,c7) | midp(A,c6,c6).  [resolve(1012,a,296,b)].
% 10.64/10.88  2531 -coll(c4,c4,A) | cyclic(c1,A,c4,c4).  [resolve(701,a,152,a)].
% 10.64/10.88  2532 eqangle(c4,c1,c4,c1,A,B,A,B).  [resolve(701,a,130,a)].
% 10.64/10.88  2533 eqangle(A,B,c4,c1,A,B,c4,c1).  [resolve(701,a,128,a)].
% 10.64/10.88  5824 eqratio(c7,c6,c6,c6,c7,c7,c7,c7).  [resolve(1023,b,568,a),unit_del(a,1046)].
% 10.64/10.88  5848 midp(c7,c7,c7) | -cong(c6,c6,c6,c7).  [resolve(1025,a,320,b),unit_del(a,568)].
% 10.64/10.88  5850 -cyclic(c7,c7,c6,c7) | -cyclic(c7,c7,c6,c6) | cong(c7,c7,c7,c7).  [resolve(1025,a,288,c)].
% 10.64/10.88  5859 -coll(c6,c6,A) | cyclic(c7,A,c6,c6).  [resolve(1025,a,152,a)].
% 10.64/10.88  9705 cyclic(c1,c7,c4,c4).  [resolve(2531,a,956,a)].
% 10.64/10.88  9730 cyclic(c7,c1,c4,c4).  [resolve(9705,a,125,a)].
% 10.64/10.88  9731 cyclic(c1,c4,c7,c4).  [resolve(9705,a,124,a)].
% 10.64/10.88  9800 cyclic(c7,c4,c1,c4).  [resolve(9730,a,124,a)].
% 10.64/10.88  9808 cyclic(c4,c1,c7,c4).  [resolve(9731,a,125,a)].
% 10.64/10.88  9809 cyclic(c1,c4,c4,c7).  [resolve(9731,a,123,a)].
% 10.64/10.88  9932 cyclic(c4,c7,c1,c4).  [resolve(9800,a,125,a)].
% 10.64/10.88  9940 cyclic(c4,c1,c4,c7).  [resolve(9808,a,123,a)].
% 10.64/10.88  9944 cyclic(c4,c4,c7,c7).  [resolve(9809,a,287,a)].
% 10.64/10.88  10596 cyclic(c4,c7,c4,c1).  [resolve(9932,a,123,a)].
% 10.64/10.88  10602 cyclic(c1,c4,c7,c7).  [resolve(9940,a,287,a)].
% 10.64/10.88  10610 cyclic(c4,c7,c7,c7).  [resolve(9944,a,287,a)].
% 10.64/10.88  12476 cyclic(c7,c4,c1,c1).  [resolve(10596,a,287,a)].
% 10.64/10.88  12486 -cyclic(c1,c4,c7,A) | cyclic(c4,c7,c7,A).  [resolve(10602,a,126,a)].
% 10.64/10.88  12496 -cyclic(c4,c7,c7,A) | cyclic(c7,c7,A,c7).  [resolve(10610,a,126,b)].
% 10.64/10.88  14036 cyclic(c4,c7,c1,c1).  [resolve(12476,a,125,a)].
% 10.64/10.88  15282 cyclic(c4,c1,c7,c1).  [resolve(14036,a,124,a)].
% 10.64/10.88  16865 cyclic(c4,c1,c1,c7).  [resolve(15282,a,123,a)].
% 10.64/10.88  17850 cyclic(c1,c4,c1,c7).  [resolve(16865,a,125,a)].
% 10.64/10.88  18752 cyclic(c1,c1,c4,c7).  [resolve(17850,a,124,a)].
% 10.64/10.88  19372 -cyclic(c1,c1,c4,A) | cyclic(c1,c4,c7,A).  [resolve(18752,a,126,a)].
% 10.64/10.88  20984 -coll(c4,A,c1) | cyclic(c1,c1,c4,A).  [resolve(2532,a,152,a)].
% 10.64/10.88  21013 para(A,B,A,B).  [resolve(2533,a,148,a)].
% 10.64/10.88  21092 -midp(A,B,B) | midp(A,C,C).  [resolve(21013,a,296,b)].
% 10.64/10.88  21093 coll(A,B,B).  [resolve(21013,a,171,a)].
% 10.64/10.88  21116 coll(A,A,B).  [resolve(21093,a,282,a)].
% 10.64/10.88  21199 cyclic(c7,A,c6,c6).  [back_unit_del(5859),unit_del(a,21116)].
% 10.64/10.88  21321 coll(c4,A,c1).  [back_unit_del(546),unit_del(a,21116)].
% 10.64/10.88  21370 -cyclic(c7,c7,c6,c7) | cong(c7,c7,c7,c7).  [back_unit_del(5850),unit_del(b,21199)].
% 10.64/10.88  21406 cyclic(c1,c1,c4,A).  [back_unit_del(20984),unit_del(a,21321)].
% 10.64/10.88  21438 cyclic(c1,c4,c7,A).  [back_unit_del(19372),unit_del(a,21406)].
% 10.64/10.88  21454 cyclic(c4,c7,c7,A).  [back_unit_del(12486),unit_del(a,21438)].
% 10.64/10.88  21504 cyclic(c7,c7,A,c7).  [back_unit_del(12496),unit_del(a,21454)].
% 10.64/10.88  21558 cong(c7,c7,c7,c7).  [back_unit_del(21370),unit_del(a,21504)].
% 10.64/10.88  22683 cong(c7,c6,c6,c6).  [resolve(5824,a,179,a),unit_del(a,21558)].
% 10.64/10.88  22692 cong(c6,c6,c7,c6).  [resolve(22683,a,133,a)].
% 10.64/10.88  22698 cong(c6,c6,c6,c7).  [resolve(22692,a,132,a)].
% 10.64/10.88  22699 midp(c7,c7,c7).  [back_unit_del(5848),unit_del(b,22698)].
% 10.64/10.88  22700 midp(c7,c6,c6).  [resolve(22699,a,1066,a)].
% 10.64/10.88  23322 midp(c7,A,A).  [resolve(21092,a,22700,a)].
% 10.64/10.88  23339 cong(c7,A,c7,A).  [resolve(23322,a,173,a)].
% 10.64/10.89  23576 perp(c7,c7,A,B).  [resolve(23339,a,161,b),unit_del(a,23339)].
% 10.64/10.89  24123 -perp(A,B,c7,c7) | para(A,B,C,D).  [resolve(23576,a,119,b)].
% 10.64/10.89  24124 perp(A,B,c7,c7).  [resolve(23576,a,118,a)].
% 10.64/10.89  24125 para(A,B,C,D).  [back_unit_del(24123),unit_del(a,24124)].
% 10.64/10.89  24136 eqangle(A,B,C,D,E,F,C,D).  [back_unit_del(149),unit_del(a,24125)].
% 10.64/10.89  29933 eqangle(A,B,C,D,E,F,E,F).  [resolve(24136,a,130,a)].
% 10.64/10.89  33373 -eqangle(A,B,A,B,C,D,E,F) | eqangle(V6,V7,V8,V9,C,D,E,F).  [resolve(29933,a,131,a)].
% 10.64/10.89  33374 eqangle(A,B,A,B,C,D,E,F).  [resolve(29933,a,129,a)].
% 10.64/10.89  33375 eqangle(A,B,C,D,E,F,V6,V7).  [back_unit_del(33373),unit_del(a,33374)].
% 10.64/10.89  33376 $F.  [resolve(33375,a,215,a)].
% 10.64/10.89  
% 10.64/10.89  % SZS output end Refutation
% 10.64/10.89  ============================== end of proof ==========================
% 10.64/10.89  
% 10.64/10.89  ============================== STATISTICS ============================
% 10.64/10.89  
% 10.64/10.89  Given=14701. Generated=175457. Kept=33249. proofs=1.
% 10.64/10.89  Usable=13027. Sos=5330. Demods=0. Limbo=1, Disabled=15061. Hints=0.
% 10.64/10.89  Megabytes=16.61.
% 10.64/10.89  User_CPU=9.73, System_CPU=0.09, Wall_clock=10.
% 10.64/10.89  
% 10.64/10.89  ============================== end of statistics =====================
% 10.64/10.89  
% 10.64/10.89  ============================== end of search =========================
% 10.64/10.89  
% 10.64/10.89  THEOREM PROVED
% 10.64/10.89  % SZS status Theorem
% 10.64/10.89  
% 10.64/10.89  Exiting with 1 proof.
% 10.64/10.89  
% 10.64/10.89  Process 9656 exit (max_proofs) Fri Jun 17 17:12:50 2022
% 10.64/10.89  Prover9 interrupted
%------------------------------------------------------------------------------