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

View Problem - Process Solution

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

% Computer : n009.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:11 EDT 2022

% Result   : Theorem 149.11s 149.48s
% Output   : Refutation 149.11s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.17  % Problem  : GEO604+1 : TPTP v8.1.0. Released v7.5.0.
% 0.11/0.17  % Command  : tptp2X_and_run_prover9 %d %s
% 0.12/0.38  % Computer : n009.cluster.edu
% 0.12/0.38  % Model    : x86_64 x86_64
% 0.12/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38  % Memory   : 8042.1875MB
% 0.12/0.38  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.38  % CPULimit : 300
% 0.12/0.38  % WCLimit  : 600
% 0.12/0.38  % DateTime : Sat Jun 18 01:42:38 EDT 2022
% 0.12/0.38  % CPUTime  : 
% 0.76/1.12  ============================== Prover9 ===============================
% 0.76/1.12  Prover9 (32) version 2009-11A, November 2009.
% 0.76/1.12  Process 4807 was started by sandbox on n009.cluster.edu,
% 0.76/1.12  Sat Jun 18 01:42:38 2022
% 0.76/1.12  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_4654_n009.cluster.edu".
% 0.76/1.12  ============================== end of head ===========================
% 0.76/1.12  
% 0.76/1.12  ============================== INPUT =================================
% 0.76/1.12  
% 0.76/1.12  % Reading from file /tmp/Prover9_4654_n009.cluster.edu
% 0.76/1.12  
% 0.76/1.12  set(prolog_style_variables).
% 0.76/1.12  set(auto2).
% 0.76/1.12      % set(auto2) -> set(auto).
% 0.76/1.12      % set(auto) -> set(auto_inference).
% 0.76/1.12      % set(auto) -> set(auto_setup).
% 0.76/1.12      % set(auto_setup) -> set(predicate_elim).
% 0.76/1.12      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.76/1.12      % set(auto) -> set(auto_limits).
% 0.76/1.12      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.76/1.12      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.76/1.12      % set(auto) -> set(auto_denials).
% 0.76/1.12      % set(auto) -> set(auto_process).
% 0.76/1.12      % set(auto2) -> assign(new_constants, 1).
% 0.76/1.12      % set(auto2) -> assign(fold_denial_max, 3).
% 0.76/1.12      % set(auto2) -> assign(max_weight, "200.000").
% 0.76/1.12      % set(auto2) -> assign(max_hours, 1).
% 0.76/1.12      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.76/1.12      % set(auto2) -> assign(max_seconds, 0).
% 0.76/1.12      % set(auto2) -> assign(max_minutes, 5).
% 0.76/1.12      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.76/1.12      % set(auto2) -> set(sort_initial_sos).
% 0.76/1.12      % set(auto2) -> assign(sos_limit, -1).
% 0.76/1.12      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.76/1.12      % set(auto2) -> assign(max_megs, 400).
% 0.76/1.12      % set(auto2) -> assign(stats, some).
% 0.76/1.12      % set(auto2) -> clear(echo_input).
% 0.76/1.12      % set(auto2) -> set(quiet).
% 0.76/1.12      % set(auto2) -> clear(print_initial_clauses).
% 0.76/1.12      % set(auto2) -> clear(print_given).
% 0.76/1.12  assign(lrs_ticks,-1).
% 0.76/1.12  assign(sos_limit,10000).
% 0.76/1.12  assign(order,kbo).
% 0.76/1.12  set(lex_order_vars).
% 0.76/1.12  clear(print_given).
% 0.76/1.12  
% 0.76/1.12  % formulas(sos).  % not echoed (95 formulas)
% 0.76/1.12  
% 0.76/1.12  ============================== end of input ==========================
% 0.76/1.12  
% 0.76/1.12  % From the command line: assign(max_seconds, 300).
% 0.76/1.12  
% 0.76/1.12  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.76/1.12  
% 0.76/1.12  % Formulas that are not ordinary clauses:
% 0.76/1.12  1 (all A all B all C (coll(A,B,C) -> coll(A,C,B))) # label(ruleD1) # label(axiom) # label(non_clause).  [assumption].
% 0.76/1.12  2 (all A all B all C (coll(A,B,C) -> coll(B,A,C))) # label(ruleD2) # label(axiom) # label(non_clause).  [assumption].
% 0.76/1.12  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.76/1.12  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.76/1.12  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.76/1.12  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.76/1.12  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.76/1.12  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.76/1.12  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.76/1.12  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.76/1.12  11 (all A all B all M (midp(M,B,A) -> midp(M,A,B))) # label(ruleD11) # label(axiom) # label(non_clause).  [assumption].
% 0.76/1.12  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.76/1.12  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.76/1.12  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.76/1.12  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  70 (all A all B all C (midp(A,B,C) -> coll(A,B,C))) # label(ruleD69) # label(axiom) # label(non_clause).  [assumption].
% 0.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  95 -(all A all B all C all D all E all F all G (perp(D,C,A,B) & coll(D,A,B) & perp(B,C,A,E) & coll(E,C,D) & midp(F,A,E) & midp(G,C,B) -> perp(D,G,D,F))) # label(exemplo6GDDFULL618066) # label(negated_conjecture) # label(non_clause).  [assumption].
% 0.76/1.13  
% 0.76/1.13  ============================== end of process non-clausal formulas ===
% 0.76/1.13  
% 0.76/1.13  ============================== PROCESS INITIAL CLAUSES ===============
% 0.76/1.13  
% 0.76/1.13  ============================== PREDICATE ELIMINATION =================
% 0.76/1.13  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.76/1.13  97 -cong(A,B,A,C) | -cong(A,B,A,D) | circle(A,B,C,D) # label(ruleD12) # label(axiom).  [clausify(12)].
% 0.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  101 -circle(A,B,C,D) | -coll(A,B,D) | perp(B,C,C,D) # label(ruleD53) # label(axiom).  [clausify(54)].
% 0.76/1.13  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.76/1.13  102 -circle(A,B,C,D) | perp(f12(B,C,D,A),B,B,A) # label(ruleX11) # label(axiom).  [clausify(87)].
% 0.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.76/1.13  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.80/1.35  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.80/1.35  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.80/1.35  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.80/1.35  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.80/1.35  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.80/1.35  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.80/1.35  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.80/1.35  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.80/1.35  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.80/1.35  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.80/1.35  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.80/1.35  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.80/1.35  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.80/1.35  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.80/1.35  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.80/1.35  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.80/1.35  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.80/1.35  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.80/1.35  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.80/1.35  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.80/1.35  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.80/1.35  
% 0.80/1.35  ============================== end predicate elimination =============
% 0.80/1.35  
% 0.80/1.35  Auto_denials:  (non-Horn, no changes).
% 0.80/1.35  
% 0.80/1.35  Term ordering decisions:
% 0.80/1.35  Function symbol KB weights:  c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=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.
% 0.80/1.35  
% 0.80/1.35  ============================== end of process initial clauses ========
% 0.80/1.35  
% 0.80/1.35  ============================== CLAUSES FOR SEARCH ====================
% 0.80/1.35  
% 0.80/1.35  ============================== end of clauses for search =============
% 0.80/1.35  
% 0.80/1.35  ============================== SEARCH ================================
% 0.80/1.35  
% 0.80/1.35  % Starting search at 0.04 seconds.
% 0.80/1.35  
% 0.80/1.35  NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 1022 (0.00 of 0.23 sec).
% 149.11/149.48  
% 149.11/149.48  Low Water (keep): wt=29.000, iters=3344
% 149.11/149.48  
% 149.11/149.48  Low Water (keep): wt=24.000, iters=3391
% 149.11/149.48  
% 149.11/149.48  Low Water (keep): wt=23.000, iters=3360
% 149.11/149.48  
% 149.11/149.48  Low Water (keep): wt=22.000, iters=3350
% 149.11/149.48  
% 149.11/149.48  Low Water (keep): wt=21.000, iters=3380
% 149.11/149.48  
% 149.11/149.48  Low Water (keep): wt=19.000, iters=3341
% 149.11/149.48  
% 149.11/149.48  Low Water (keep): wt=18.000, iters=3338
% 149.11/149.48  
% 149.11/149.48  Low Water (keep): wt=17.000, iters=3454
% 149.11/149.48  
% 149.11/149.48  Low Water (keep): wt=16.000, iters=3334
% 149.11/149.48  
% 149.11/149.48  Low Water (keep): wt=15.000, iters=3333
% 149.11/149.48  
% 149.11/149.48  Low Water (keep): wt=14.000, iters=3333
% 149.11/149.48  
% 149.11/149.48  Low Water (keep): wt=13.000, iters=3420
% 149.11/149.48  
% 149.11/149.48  Low Water (displace): id=7346, wt=48.000
% 149.11/149.48  
% 149.11/149.48  Low Water (displace): id=13765, wt=12.000
% 149.11/149.48  
% 149.11/149.48  Low Water (keep): wt=12.000, iters=3340
% 149.11/149.48  
% 149.11/149.48  Low Water (displace): id=13994, wt=8.000
% 149.11/149.48  
% 149.11/149.48  Low Water (keep): wt=11.000, iters=3371
% 149.11/149.48  
% 149.11/149.48  Low Water (displace): id=18552, wt=5.000
% 149.11/149.48  
% 149.11/149.48  Low Water (keep): wt=10.000, iters=3333
% 149.11/149.48  
% 149.11/149.48  Low Water (keep): wt=9.000, iters=3333
% 149.11/149.48  
% 149.11/149.48  Low Water (keep): wt=8.000, iters=3676
% 149.11/149.48  
% 149.11/149.48  ============================== PROOF =================================
% 149.11/149.48  % SZS status Theorem
% 149.11/149.48  % SZS output start Refutation
% 149.11/149.48  
% 149.11/149.48  % Proof 1 at 147.61 (+ 0.74) seconds.
% 149.11/149.48  % Length of proof is 265.
% 149.11/149.48  % Level of proof is 36.
% 149.11/149.48  % Maximum clause weight is 29.000.
% 149.11/149.48  % Given clauses 58999.
% 149.11/149.48  
% 149.11/149.48  1 (all A all B all C (coll(A,B,C) -> coll(A,C,B))) # label(ruleD1) # label(axiom) # label(non_clause).  [assumption].
% 149.11/149.48  2 (all A all B all C (coll(A,B,C) -> coll(B,A,C))) # label(ruleD2) # label(axiom) # label(non_clause).  [assumption].
% 149.11/149.48  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].
% 149.11/149.48  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].
% 149.11/149.48  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].
% 149.11/149.48  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].
% 149.11/149.48  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].
% 149.11/149.48  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].
% 149.11/149.48  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].
% 149.11/149.48  11 (all A all B all M (midp(M,B,A) -> midp(M,A,B))) # label(ruleD11) # label(axiom) # label(non_clause).  [assumption].
% 149.11/149.48  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].
% 149.11/149.48  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].
% 149.11/149.48  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].
% 149.11/149.48  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].
% 149.11/149.48  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].
% 149.11/149.48  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].
% 149.11/149.48  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].
% 149.11/149.48  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].
% 149.11/149.48  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].
% 149.11/149.48  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].
% 149.11/149.48  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].
% 149.11/149.48  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].
% 149.11/149.48  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].
% 149.11/149.48  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].
% 149.11/149.48  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].
% 149.11/149.48  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].
% 149.11/149.48  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].
% 149.11/149.48  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].
% 149.11/149.48  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].
% 149.11/149.48  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].
% 149.11/149.48  69 (all A all B all C (midp(A,B,C) -> cong(A,B,A,C))) # label(ruleD68) # label(axiom) # label(non_clause).  [assumption].
% 149.11/149.48  70 (all A all B all C (midp(A,B,C) -> coll(A,B,C))) # label(ruleD69) # label(axiom) # label(non_clause).  [assumption].
% 149.11/149.48  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].
% 149.11/149.48  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].
% 149.11/149.48  95 -(all A all B all C all D all E all F all G (perp(D,C,A,B) & coll(D,A,B) & perp(B,C,A,E) & coll(E,C,D) & midp(F,A,E) & midp(G,C,B) -> perp(D,G,D,F))) # label(exemplo6GDDFULL618066) # label(negated_conjecture) # label(non_clause).  [assumption].
% 149.11/149.48  97 -cong(A,B,A,C) | -cong(A,B,A,D) | circle(A,B,C,D) # label(ruleD12) # label(axiom).  [clausify(12)].
% 149.11/149.48  101 -circle(A,B,C,D) | -coll(A,B,D) | perp(B,C,C,D) # label(ruleD53) # label(axiom).  [clausify(54)].
% 149.11/149.48  109 -coll(A,B,C) | coll(A,C,B) # label(ruleD1) # label(axiom).  [clausify(1)].
% 149.11/149.48  110 -coll(A,B,C) | coll(B,A,C) # label(ruleD2) # label(axiom).  [clausify(2)].
% 149.11/149.48  111 -coll(A,B,C) | -coll(A,B,D) | coll(C,D,A) # label(ruleD3) # label(axiom).  [clausify(3)].
% 149.11/149.48  112 -para(A,B,C,D) | para(A,B,D,C) # label(ruleD4) # label(axiom).  [clausify(4)].
% 149.11/149.48  113 -para(A,B,C,D) | para(C,D,A,B) # label(ruleD5) # label(axiom).  [clausify(5)].
% 149.11/149.48  115 -perp(A,B,C,D) | perp(A,B,D,C) # label(ruleD7) # label(axiom).  [clausify(7)].
% 149.11/149.48  116 -perp(A,B,C,D) | perp(C,D,A,B) # label(ruleD8) # label(axiom).  [clausify(8)].
% 149.11/149.48  117 -perp(A,B,C,D) | -perp(C,D,E,F) | para(A,B,E,F) # label(ruleD9) # label(axiom).  [clausify(9)].
% 149.11/149.48  118 -para(A,B,C,D) | -perp(C,D,E,F) | perp(A,B,E,F) # label(ruleD10) # label(axiom).  [clausify(10)].
% 149.11/149.48  119 -midp(A,B,C) | midp(A,C,B) # label(ruleD11) # label(axiom).  [clausify(11)].
% 149.11/149.48  120 -cong(A,B,A,C) | -cong(A,B,A,D) | -cong(A,B,A,E) | cyclic(B,C,D,E) # label(ruleD13) # label(axiom).  [clausify(13)].
% 149.11/149.48  121 -cyclic(A,B,C,D) | cyclic(A,B,D,C) # label(ruleD14) # label(axiom).  [clausify(14)].
% 149.11/149.48  122 -cyclic(A,B,C,D) | cyclic(A,C,B,D) # label(ruleD15) # label(axiom).  [clausify(15)].
% 149.11/149.48  123 -cyclic(A,B,C,D) | cyclic(B,A,C,D) # label(ruleD16) # label(axiom).  [clausify(16)].
% 149.11/149.48  124 -cyclic(A,B,C,D) | -cyclic(A,B,C,E) | cyclic(B,C,D,E) # label(ruleD17) # label(axiom).  [clausify(17)].
% 149.11/149.48  130 -cong(A,B,C,D) | cong(A,B,D,C) # label(ruleD23) # label(axiom).  [clausify(23)].
% 149.11/149.48  131 -cong(A,B,C,D) | cong(C,D,A,B) # label(ruleD24) # label(axiom).  [clausify(24)].
% 149.11/149.48  132 -cong(A,B,C,D) | -cong(C,D,E,F) | cong(A,B,E,F) # label(ruleD25) # label(axiom).  [clausify(25)].
% 149.11/149.48  147 -para(A,B,C,D) | eqangle(A,B,E,F,C,D,E,F) # label(ruleD40) # label(axiom).  [clausify(40)].
% 149.11/149.48  151 -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)].
% 149.11/149.48  152 -midp(A,B,C) | -midp(D,B,E) | para(A,D,C,E) # label(ruleD44) # label(axiom).  [clausify(45)].
% 149.11/149.48  153 -midp(A,B,C) | -para(A,D,C,E) | -coll(D,B,E) | midp(D,B,E) # label(ruleD45) # label(axiom).  [clausify(46)].
% 149.11/149.48  154 -cong(A,B,A,C) | eqangle(A,B,B,C,B,C,A,C) # label(ruleD46) # label(axiom).  [clausify(47)].
% 149.11/149.48  156 -perp(A,B,B,C) | -midp(D,A,C) | cong(A,D,B,D) # label(ruleD52) # label(axiom).  [clausify(53)].
% 149.11/149.48  159 -cong(A,B,C,B) | -cong(A,D,C,D) | perp(A,C,B,D) # label(ruleD56) # label(axiom).  [clausify(57)].
% 149.11/149.48  166 -midp(A,B,C) | -midp(A,D,E) | para(B,D,C,E) # label(ruleD63) # label(axiom).  [clausify(64)].
% 149.11/149.48  167 -midp(A,B,C) | -para(B,D,C,E) | -para(B,E,C,D) | midp(A,D,E) # label(ruleD64) # label(axiom).  [clausify(65)].
% 149.11/149.48  170 -cong(A,B,A,C) | -coll(A,B,C) | midp(A,B,C) # label(ruleD67) # label(axiom).  [clausify(68)].
% 149.11/149.48  171 -midp(A,B,C) | cong(A,B,A,C) # label(ruleD68) # label(axiom).  [clausify(69)].
% 149.11/149.48  172 -midp(A,B,C) | coll(A,B,C) # label(ruleD69) # label(axiom).  [clausify(70)].
% 149.11/149.48  176 -eqangle(A,B,C,D,E,F,V6,V7) | -perp(E,F,V6,V7) | perp(A,B,C,D) # label(ruleD74) # label(axiom).  [clausify(75)].
% 149.11/149.48  191 -midp(A,B,C) | -midp(D,E,F) | -coll(E,B,C) | -coll(F,B,C) | midp(f7(B,C,E,F,A,D,V6),B,V6) # label(ruleX7) # label(axiom).  [clausify(83)].
% 149.11/149.48  208 perp(c4,c3,c1,c2) # label(exemplo6GDDFULL618066) # label(negated_conjecture).  [clausify(95)].
% 149.11/149.48  209 coll(c4,c1,c2) # label(exemplo6GDDFULL618066) # label(negated_conjecture).  [clausify(95)].
% 149.11/149.48  210 perp(c2,c3,c1,c5) # label(exemplo6GDDFULL618066) # label(negated_conjecture).  [clausify(95)].
% 149.11/149.48  211 coll(c5,c3,c4) # label(exemplo6GDDFULL618066) # label(negated_conjecture).  [clausify(95)].
% 149.11/149.48  212 midp(c6,c1,c5) # label(exemplo6GDDFULL618066) # label(negated_conjecture).  [clausify(95)].
% 149.11/149.48  213 midp(c7,c3,c2) # label(exemplo6GDDFULL618066) # label(negated_conjecture).  [clausify(95)].
% 149.11/149.48  214 -perp(c4,c7,c4,c6) # label(exemplo6GDDFULL618066) # label(negated_conjecture).  [clausify(95)].
% 149.11/149.48  219 -coll(A,B,C) | perp(B,D,D,C) | -cong(A,B,A,D) | -cong(A,B,A,C).  [resolve(101,a,97,c)].
% 149.11/149.48  253 -coll(A,B,C) | coll(C,C,A).  [factor(111,a,b)].
% 149.11/149.48  255 -cong(A,B,A,C) | -cong(A,B,A,D) | cyclic(B,C,C,D).  [factor(120,a,b)].
% 149.11/149.48  258 -cyclic(A,B,C,D) | cyclic(B,C,D,D).  [factor(124,a,b)].
% 149.11/149.48  261 -cyclic(A,B,C,D) | -cyclic(A,B,C,E) | -eqangle(C,A,C,B,E,D,E,E) | cong(A,B,D,E).  [factor(151,b,c)].
% 149.11/149.48  262 -midp(A,B,C) | para(A,A,C,C).  [factor(152,a,b)].
% 149.11/149.48  266 -midp(A,B,C) | para(B,B,C,C).  [factor(166,a,b)].
% 149.11/149.48  267 -midp(A,B,C) | -para(B,D,C,D) | midp(A,D,D).  [factor(167,b,c)].
% 149.11/149.48  273 -midp(A,B,C) | -coll(B,B,C) | -coll(C,B,C) | midp(f7(B,C,B,C,A,A,D),B,D).  [factor(191,a,b)].
% 149.11/149.48  292 -coll(A,B,C) | perp(B,C,C,C) | -cong(A,B,A,C).  [factor(219,c,d)].
% 149.11/149.48  307 -cong(A,B,A,C) | cyclic(B,C,C,C).  [factor(255,a,b)].
% 149.11/149.48  327 -perp(A,B,c4,c3) | para(A,B,c1,c2).  [resolve(208,a,117,b)].
% 149.11/149.48  328 -perp(c1,c2,A,B) | para(c4,c3,A,B).  [resolve(208,a,117,a)].
% 149.11/149.48  329 perp(c1,c2,c4,c3).  [resolve(208,a,116,a)].
% 149.11/149.48  330 perp(c4,c3,c2,c1).  [resolve(208,a,115,a)].
% 149.11/149.48  334 coll(c4,c2,c1).  [resolve(209,a,109,a)].
% 149.11/149.48  346 -perp(A,B,c2,c3) | para(A,B,c1,c5).  [resolve(210,a,117,b)].
% 149.11/149.48  347 -perp(c1,c5,A,B) | para(c2,c3,A,B).  [resolve(210,a,117,a)].
% 149.11/149.48  348 perp(c1,c5,c2,c3).  [resolve(210,a,116,a)].
% 149.11/149.48  349 perp(c2,c3,c5,c1).  [resolve(210,a,115,a)].
% 149.11/149.48  352 coll(c3,c5,c4).  [resolve(211,a,110,a)].
% 149.11/149.48  364 coll(c6,c1,c5).  [resolve(212,a,172,a)].
% 149.11/149.48  365 cong(c6,c1,c6,c5).  [resolve(212,a,171,a)].
% 149.11/149.48  366 -midp(c6,A,B) | para(A,c1,B,c5).  [resolve(212,a,166,b)].
% 149.11/149.48  369 -midp(A,c1,B) | para(c6,A,c5,B).  [resolve(212,a,152,a)].
% 149.11/149.48  370 midp(c6,c5,c1).  [resolve(212,a,119,a)].
% 149.11/149.48  382 coll(c7,c3,c2).  [resolve(213,a,172,a)].
% 149.11/149.48  383 cong(c7,c3,c7,c2).  [resolve(213,a,171,a)].
% 149.11/149.48  384 -midp(c7,A,B) | para(A,c3,B,c2).  [resolve(213,a,166,b)].
% 149.11/149.48  388 midp(c7,c2,c3).  [resolve(213,a,119,a)].
% 149.11/149.48  390 coll(c4,c4,c5).  [resolve(253,a,211,a)].
% 149.11/149.48  391 coll(c2,c2,c4).  [resolve(253,a,209,a)].
% 149.11/149.48  405 -coll(c1,c1,c5) | -coll(c5,c1,c5) | midp(f7(c1,c5,c1,c5,c6,c6,A),c1,A).  [resolve(273,a,212,a)].
% 149.11/149.48  410 coll(c1,c1,c4).  [resolve(334,a,253,a)].
% 149.11/149.48  414 coll(c4,c4,c3).  [resolve(352,a,253,a)].
% 149.11/149.48  422 coll(c5,c5,c6).  [resolve(364,a,253,a)].
% 149.11/149.48  425 coll(c1,c6,c5).  [resolve(364,a,110,a)].
% 149.11/149.48  426 coll(c6,c5,c1).  [resolve(364,a,109,a)].
% 149.11/149.48  445 cong(c6,c5,c6,c1).  [resolve(370,a,171,a)].
% 149.11/149.48  446 -midp(c6,A,B) | para(A,c5,B,c1).  [resolve(370,a,166,b)].
% 149.11/149.48  448 -midp(A,c5,B) | para(A,c6,B,c1).  [resolve(370,a,152,b)].
% 149.11/149.48  450 coll(c2,c2,c7).  [resolve(382,a,253,a)].
% 149.11/149.48  454 coll(c7,c2,c3).  [resolve(382,a,109,a)].
% 149.11/149.48  462 para(c7,c7,c3,c3).  [resolve(388,a,262,a)].
% 149.11/149.48  473 cong(c7,c2,c7,c3).  [resolve(388,a,171,a)].
% 149.11/149.48  474 -midp(c7,A,B) | para(A,c2,B,c3).  [resolve(388,a,166,b)].
% 149.11/149.48  475 -midp(c7,A,B) | para(c2,A,c3,B).  [resolve(388,a,166,a)].
% 149.11/149.48  477 -midp(A,c2,B) | para(c7,A,c3,B).  [resolve(388,a,152,a)].
% 149.11/149.48  478 coll(c5,c5,c4).  [resolve(390,a,253,a)].
% 149.11/149.48  485 coll(c2,c4,c2).  [resolve(391,a,109,a)].
% 149.11/149.48  496 coll(c1,c4,c1).  [resolve(410,a,109,a)].
% 149.11/149.48  499 coll(c3,c3,c4).  [resolve(414,a,253,a)].
% 149.11/149.48  515 coll(c5,c6,c5).  [resolve(422,a,109,a)].
% 149.11/149.48  516 coll(c5,c5,c1).  [resolve(425,a,253,a)].
% 149.11/149.48  528 coll(c2,c7,c2).  [resolve(450,a,109,a)].
% 149.11/149.48  540 coll(c5,c4,c5).  [resolve(478,a,109,a)].
% 149.11/149.48  569 coll(c3,c4,c3).  [resolve(499,a,109,a)].
% 149.11/149.48  588 coll(c6,c5,c5).  [resolve(515,a,110,a)].
% 149.11/149.48  589 coll(c1,c1,c5).  [resolve(516,a,253,a)].
% 149.11/149.48  592 coll(c5,c1,c5).  [resolve(516,a,109,a)].
% 149.11/149.48  593 midp(f7(c1,c5,c1,c5,c6,c6,A),c1,A).  [back_unit_del(405),unit_del(a,589),unit_del(b,592)].
% 149.11/149.48  608 coll(c7,c2,c2).  [resolve(528,a,110,a)].
% 149.11/149.48  625 coll(c4,c5,c5).  [resolve(540,a,110,a)].
% 149.11/149.48  627 para(c4,c3,c4,c3).  [resolve(329,a,328,a)].
% 149.11/149.48  628 para(c1,c2,c1,c2).  [resolve(329,a,327,a)].
% 149.11/149.48  664 perp(c2,c1,c4,c3).  [resolve(330,a,116,a)].
% 149.11/149.48  696 coll(c1,c5,c1).  [resolve(589,a,109,a)].
% 149.11/149.48  747 coll(c5,c1,c1).  [resolve(696,a,110,a)].
% 149.11/149.48  789 perp(c1,c5,c3,c2).  [resolve(348,a,115,a)].
% 149.11/149.48  803 perp(c5,c1,c2,c3).  [resolve(349,a,116,a)].
% 149.11/149.48  812 cyclic(c1,c5,c5,c5).  [resolve(365,a,307,a)].
% 149.11/149.48  850 perp(c1,c5,c5,c5).  [resolve(365,a,292,c),unit_del(a,364)].
% 149.11/149.48  881 -cong(A,B,c6,c1) | cong(A,B,c6,c5).  [resolve(365,a,132,b)].
% 149.11/149.48  964 -cong(A,B,c7,c3) | cong(A,B,c7,c2).  [resolve(383,a,132,b)].
% 149.11/149.48  1037 para(c1,c5,c1,c5).  [resolve(346,a,348,a)].
% 149.11/149.48  1060 cyclic(c5,c1,c1,c1).  [resolve(445,a,307,a)].
% 149.11/149.48  1098 perp(c5,c1,c1,c1).  [resolve(445,a,292,c),unit_del(a,426)].
% 149.11/149.48  1131 cong(c6,c5,c1,c6).  [resolve(445,a,130,a)].
% 149.11/149.48  1158 -perp(c3,c3,A,B) | perp(c7,c7,A,B).  [resolve(462,a,118,a)].
% 149.11/149.48  1162 para(c2,c3,c2,c3).  [resolve(347,a,348,a)].
% 149.11/149.48  1209 perp(c2,c3,c3,c3).  [resolve(473,a,292,c),unit_del(a,454)].
% 149.11/149.48  1256 -midp(c4,A,c4) | -coll(c3,A,c3) | midp(c3,A,c3).  [resolve(627,a,153,b)].
% 149.11/149.48  1258 para(c4,c3,c3,c4).  [resolve(627,a,112,a)].
% 149.11/149.48  1261 -midp(A,c1,c1) | midp(A,c2,c2).  [resolve(628,a,267,b)].
% 149.11/149.48  1286 para(c2,c1,c1,c2).  [resolve(664,a,327,a)].
% 149.11/149.48  1301 para(c2,c3,c3,c2).  [resolve(789,a,347,a)].
% 149.11/149.48  1316 para(c5,c1,c1,c5).  [resolve(803,a,346,a)].
% 149.11/149.48  1350 cyclic(c5,c1,c5,c5).  [resolve(812,a,123,a)].
% 149.11/149.48  1371 -midp(A,c1,c5) | cong(c1,A,c5,A).  [resolve(850,a,156,a)].
% 149.11/149.48  1471 -midp(A,c1,c1) | midp(A,c5,c5).  [resolve(1037,a,267,b)].
% 149.11/149.48  1479 -midp(c1,A,c1) | -coll(c5,A,c5) | midp(c5,A,c5).  [resolve(1037,a,153,b)].
% 149.11/149.48  1480 eqangle(c1,c5,A,B,c1,c5,A,B).  [resolve(1037,a,147,a)].
% 149.11/149.48  1539 perp(c1,c1,c5,c1).  [resolve(1098,a,116,a)].
% 149.11/149.48  1550 cong(c1,c6,c6,c5).  [resolve(1131,a,131,a)].
% 149.11/149.48  1569 -midp(A,c2,c2) | midp(A,c3,c3).  [resolve(1162,a,267,b)].
% 149.11/149.48  1621 perp(c3,c3,c2,c3).  [resolve(1209,a,116,a)].
% 149.11/149.48  1651 para(c3,c4,c4,c3).  [resolve(1258,a,113,a)].
% 149.11/149.48  1699 para(c2,c1,c2,c1).  [resolve(1286,a,112,a)].
% 149.11/149.48  1728 para(c3,c2,c2,c3).  [resolve(1301,a,113,a)].
% 149.11/149.48  1761 para(c5,c1,c5,c1).  [resolve(1316,a,112,a)].
% 149.11/149.48  1812 cyclic(c5,c5,c1,c5).  [resolve(1350,a,122,a)].
% 149.11/149.48  1966 perp(c1,c1,c1,c5).  [resolve(1539,a,115,a)].
% 149.11/149.48  1977 cong(c1,c6,c5,c6).  [resolve(1550,a,130,a)].
% 149.11/149.48  2019 para(c3,c3,c1,c5).  [resolve(1621,a,346,a)].
% 149.11/149.48  2051 para(c3,c4,c3,c4).  [resolve(1651,a,112,a)].
% 149.11/149.48  2067 -midp(A,c2,c2) | midp(A,c1,c1).  [resolve(1699,a,267,b)].
% 149.11/149.48  2075 -midp(c2,A,c2) | -coll(c1,A,c1) | midp(c1,A,c1).  [resolve(1699,a,153,b)].
% 149.11/149.48  2092 para(c3,c2,c3,c2).  [resolve(1728,a,112,a)].
% 149.11/149.48  2108 -midp(A,c5,c5) | midp(A,c1,c1).  [resolve(1761,a,267,b)].
% 149.11/149.48  2134 cyclic(c5,c5,c5,c1).  [resolve(1812,a,121,a)].
% 149.11/149.48  2259 perp(c1,c5,c1,c1).  [resolve(1966,a,116,a)].
% 149.11/149.48  2261 -cong(c1,A,c5,A) | perp(c1,c5,A,c6).  [resolve(1977,a,159,b)].
% 149.11/149.48  2295 -perp(c1,c5,A,B) | perp(c3,c3,A,B).  [resolve(2019,a,118,a)].
% 149.11/149.48  2330 -midp(A,c3,c3) | midp(A,c4,c4).  [resolve(2051,a,267,b)].
% 149.11/149.48  2350 -midp(c3,A,c3) | -coll(c2,A,c2) | midp(c2,A,c2).  [resolve(2092,a,153,b)].
% 149.11/149.48  2353 cyclic(c5,c5,c1,c1).  [resolve(2134,a,258,a)].
% 149.11/149.48  2504 para(c2,c3,c1,c1).  [resolve(2259,a,347,a)].
% 149.11/149.48  2632 cyclic(c5,c1,c5,c1).  [resolve(2353,a,122,a)].
% 149.11/149.48  2765 para(c1,c1,c2,c3).  [resolve(2504,a,113,a)].
% 149.11/149.48  2866 cyclic(c5,c1,c1,c5).  [resolve(2632,a,121,a)].
% 149.11/149.48  2959 para(c1,c1,c3,c2).  [resolve(2765,a,112,a)].
% 149.11/149.48  3117 para(c3,c2,c1,c1).  [resolve(2959,a,113,a)].
% 149.11/149.48  3164 -perp(c1,c1,A,B) | perp(c3,c2,A,B).  [resolve(3117,a,118,a)].
% 149.11/149.48  4418 para(c1,c1,A,A).  [resolve(593,a,266,a)].
% 149.11/149.48  4458 -perp(A,A,B,C) | perp(c1,c1,B,C).  [resolve(4418,a,118,a)].
% 149.11/149.48  5095 cong(c6,c5,c6,c5).  [resolve(881,a,445,a)].
% 149.11/149.48  5177 midp(c6,c5,c5).  [resolve(5095,a,170,a),unit_del(a,588)].
% 149.11/149.48  5198 midp(c6,c1,c1).  [resolve(5177,a,2108,a)].
% 149.11/149.48  5213 para(c5,c5,c5,c1).  [resolve(5177,a,446,a)].
% 149.11/149.48  5236 para(c5,c1,c5,c5).  [resolve(5177,a,366,a)].
% 149.11/149.48  5297 midp(c6,c2,c2).  [resolve(5198,a,1261,a)].
% 149.11/149.48  5397 para(c7,c6,c3,c2).  [resolve(5297,a,477,a)].
% 149.11/149.48  5838 -midp(A,c5,c5) | midp(A,c1,c5).  [resolve(5213,a,167,c),unit_del(b,5236)].
% 149.11/149.48  6124 -perp(c3,c2,A,B) | perp(c7,c6,A,B).  [resolve(5397,a,118,a)].
% 149.11/149.48  8881 cong(c7,c2,c7,c2).  [resolve(964,a,473,a)].
% 149.11/149.48  8928 midp(c7,c2,c2).  [resolve(8881,a,170,a),unit_del(a,608)].
% 149.11/149.48  8935 midp(c7,c1,c1).  [resolve(8928,a,2067,a)].
% 149.11/149.48  8936 midp(c7,c3,c3).  [resolve(8928,a,1569,a)].
% 149.11/149.48  9015 midp(c7,c5,c5).  [resolve(8935,a,1471,a)].
% 149.11/149.48  9017 para(c1,c2,c1,c3).  [resolve(8935,a,474,a)].
% 149.11/149.48  9040 para(c1,c3,c1,c2).  [resolve(8935,a,384,a)].
% 149.11/149.48  9102 midp(c7,c4,c4).  [resolve(8936,a,2330,a)].
% 149.11/149.48  9180 para(c5,c2,c5,c3).  [resolve(9015,a,474,a)].
% 149.11/149.48  9205 para(c5,c3,c5,c2).  [resolve(9015,a,384,a)].
% 149.11/149.48  9245 para(c2,c4,c3,c4).  [resolve(9102,a,475,a)].
% 149.11/149.48  9511 -midp(A,c1,c1) | midp(A,c2,c3).  [resolve(9017,a,167,b),unit_del(b,9040)].
% 149.11/149.48  9794 -midp(A,c5,c5) | midp(A,c2,c3).  [resolve(9180,a,167,b),unit_del(b,9205)].
% 149.11/149.48  9887 -midp(A,c2,c3) | midp(A,c4,c4).  [resolve(9245,a,267,b)].
% 149.11/149.48  11083 midp(c7,c1,c5).  [resolve(5838,a,9015,a)].
% 149.11/149.48  11149 midp(c7,c5,c1).  [resolve(11083,a,119,a)].
% 149.11/149.48  17912 cong(c5,c1,c5,c1).  [resolve(1480,a,261,c),unit_del(a,2866),unit_del(b,1060)].
% 149.11/149.48  17941 midp(c5,c1,c1).  [resolve(17912,a,170,a),unit_del(a,747)].
% 149.11/149.48  17953 midp(c5,c2,c3).  [resolve(17941,a,9511,a)].
% 149.11/149.48  18011 midp(c5,c4,c4).  [resolve(17953,a,9887,a)].
% 149.11/149.48  18196 cong(c5,c4,c5,c4).  [resolve(18011,a,171,a)].
% 149.11/149.48  18938 cong(c5,c4,c4,c5).  [resolve(18196,a,130,a)].
% 149.11/149.48  19408 cong(c4,c5,c5,c4).  [resolve(18938,a,131,a)].
% 149.11/149.48  19698 cong(c4,c5,c4,c5).  [resolve(19408,a,130,a)].
% 149.11/149.48  20344 midp(c4,c5,c5).  [resolve(19698,a,170,a),unit_del(a,625)].
% 149.11/149.48  20346 midp(c4,c2,c3).  [resolve(20344,a,9794,a)].
% 149.11/149.48  20349 midp(c4,c1,c5).  [resolve(20344,a,5838,a)].
% 149.11/149.48  20367 midp(c4,c4,c4).  [resolve(20346,a,9887,a)].
% 149.11/149.48  20417 cong(c1,c4,c5,c4).  [resolve(20349,a,1371,a)].
% 149.11/149.48  20449 midp(c3,c4,c3).  [resolve(20367,a,1256,a),unit_del(a,569)].
% 149.11/149.48  24359 perp(c1,c5,c4,c6).  [resolve(2261,a,20417,a)].
% 149.11/149.48  24938 midp(c2,c4,c2).  [resolve(2350,a,20449,a),unit_del(a,485)].
% 149.11/149.48  24939 midp(c1,c4,c1).  [resolve(24938,a,2075,a),unit_del(a,496)].
% 149.11/149.48  24955 midp(c5,c4,c5).  [resolve(24939,a,1479,a),unit_del(a,540)].
% 149.11/149.48  24970 midp(c1,c1,c4).  [resolve(24939,a,119,a)].
% 149.11/149.48  25001 midp(c5,c5,c4).  [resolve(24955,a,119,a)].
% 149.11/149.48  25013 para(c6,c1,c5,c4).  [resolve(24970,a,369,a)].
% 149.11/149.48  25026 para(c5,c6,c4,c1).  [resolve(25001,a,448,a)].
% 149.11/149.48  25159 perp(c3,c3,c4,c6).  [resolve(24359,a,2295,a)].
% 149.11/149.48  25714 para(c5,c4,c6,c1).  [resolve(25013,a,113,a)].
% 149.11/149.48  25728 para(c5,c6,c1,c4).  [resolve(25026,a,112,a)].
% 149.11/149.48  25788 perp(c7,c7,c4,c6).  [resolve(25159,a,1158,a)].
% 149.11/149.48  26173 para(c5,c4,c1,c6).  [resolve(25714,a,112,a)].
% 149.11/149.48  26187 -midp(A,c5,c1) | midp(A,c4,c6).  [resolve(25728,a,167,c),unit_del(b,26173)].
% 149.11/149.48  28449 perp(c1,c1,c4,c6).  [resolve(4458,a,25788,a)].
% 149.11/149.48  28544 perp(c3,c2,c4,c6).  [resolve(28449,a,3164,a)].
% 149.11/149.48  32396 perp(c7,c6,c4,c6).  [resolve(6124,a,28544,a)].
% 149.11/149.48  32432 perp(c4,c6,c7,c6).  [resolve(32396,a,116,a)].
% 149.11/149.48  53787 midp(c7,c4,c6).  [resolve(26187,a,11149,a)].
% 149.11/149.48  53873 cong(c7,c4,c7,c6).  [resolve(53787,a,171,a)].
% 149.11/149.48  54012 eqangle(c7,c4,c4,c6,c4,c6,c7,c6).  [resolve(53873,a,154,a)].
% 149.11/149.48  84448 perp(c7,c4,c4,c6).  [resolve(54012,a,176,a),unit_del(a,32432)].
% 149.11/149.48  84450 perp(c4,c6,c7,c4).  [resolve(84448,a,116,a)].
% 149.11/149.48  84452 perp(c4,c6,c4,c7).  [resolve(84450,a,115,a)].
% 149.11/149.48  84454 $F.  [resolve(84452,a,116,a),unit_del(a,214)].
% 149.11/149.48  
% 149.11/149.48  % SZS output end Refutation
% 149.11/149.48  ============================== end of proof ==========================
% 149.11/149.48  
% 149.11/149.48  ============================== STATISTICS ============================
% 149.11/149.48  
% 149.11/149.48  Given=58999. Generated=1369726. Kept=84337. proofs=1.
% 149.11/149.48  Usable=57702. Sos=6843. Demods=0. Limbo=0, Disabled=19942. Hints=0.
% 149.11/149.48  Megabytes=37.98.
% 149.11/149.48  User_CPU=147.61, System_CPU=0.74, Wall_clock=149.
% 149.11/149.48  
% 149.11/149.48  ============================== end of statistics =====================
% 149.11/149.48  
% 149.11/149.48  ============================== end of search =========================
% 149.11/149.48  
% 149.11/149.48  THEOREM PROVED
% 149.11/149.48  % SZS status Theorem
% 149.11/149.48  
% 149.11/149.48  Exiting with 1 proof.
% 149.11/149.48  
% 149.11/149.48  Process 4807 exit (max_proofs) Sat Jun 18 01:45:07 2022
% 149.11/149.48  Prover9 interrupted
%------------------------------------------------------------------------------