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

View Problem - Process Solution

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

% Computer : n004.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:20 EDT 2022

% Result   : Theorem 4.32s 4.57s
% Output   : Refutation 4.32s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.15  % Problem  : GEO635+1 : TPTP v8.1.0. Released v7.5.0.
% 0.09/0.15  % Command  : tptp2X_and_run_prover9 %d %s
% 0.15/0.37  % Computer : n004.cluster.edu
% 0.15/0.37  % Model    : x86_64 x86_64
% 0.15/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37  % Memory   : 8042.1875MB
% 0.15/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37  % CPULimit : 300
% 0.15/0.37  % WCLimit  : 600
% 0.15/0.37  % DateTime : Fri Jun 17 19:58:38 EDT 2022
% 0.15/0.37  % CPUTime  : 
% 0.93/1.18  ============================== Prover9 ===============================
% 0.93/1.18  Prover9 (32) version 2009-11A, November 2009.
% 0.93/1.18  Process 17849 was started by sandbox on n004.cluster.edu,
% 0.93/1.18  Fri Jun 17 19:58:39 2022
% 0.93/1.18  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_17696_n004.cluster.edu".
% 0.93/1.18  ============================== end of head ===========================
% 0.93/1.18  
% 0.93/1.18  ============================== INPUT =================================
% 0.93/1.18  
% 0.93/1.18  % Reading from file /tmp/Prover9_17696_n004.cluster.edu
% 0.93/1.18  
% 0.93/1.18  set(prolog_style_variables).
% 0.93/1.18  set(auto2).
% 0.93/1.18      % set(auto2) -> set(auto).
% 0.93/1.18      % set(auto) -> set(auto_inference).
% 0.93/1.18      % set(auto) -> set(auto_setup).
% 0.93/1.18      % set(auto_setup) -> set(predicate_elim).
% 0.93/1.18      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.93/1.18      % set(auto) -> set(auto_limits).
% 0.93/1.18      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.93/1.18      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.93/1.18      % set(auto) -> set(auto_denials).
% 0.93/1.18      % set(auto) -> set(auto_process).
% 0.93/1.18      % set(auto2) -> assign(new_constants, 1).
% 0.93/1.18      % set(auto2) -> assign(fold_denial_max, 3).
% 0.93/1.18      % set(auto2) -> assign(max_weight, "200.000").
% 0.93/1.18      % set(auto2) -> assign(max_hours, 1).
% 0.93/1.18      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.93/1.18      % set(auto2) -> assign(max_seconds, 0).
% 0.93/1.18      % set(auto2) -> assign(max_minutes, 5).
% 0.93/1.18      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.93/1.18      % set(auto2) -> set(sort_initial_sos).
% 0.93/1.18      % set(auto2) -> assign(sos_limit, -1).
% 0.93/1.18      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.93/1.18      % set(auto2) -> assign(max_megs, 400).
% 0.93/1.18      % set(auto2) -> assign(stats, some).
% 0.93/1.18      % set(auto2) -> clear(echo_input).
% 0.93/1.18      % set(auto2) -> set(quiet).
% 0.93/1.18      % set(auto2) -> clear(print_initial_clauses).
% 0.93/1.18      % set(auto2) -> clear(print_given).
% 0.93/1.18  assign(lrs_ticks,-1).
% 0.93/1.18  assign(sos_limit,10000).
% 0.93/1.18  assign(order,kbo).
% 0.93/1.18  set(lex_order_vars).
% 0.93/1.18  clear(print_given).
% 0.93/1.18  
% 0.93/1.18  % formulas(sos).  % not echoed (95 formulas)
% 0.93/1.18  
% 0.93/1.18  ============================== end of input ==========================
% 0.93/1.18  
% 0.93/1.18  % From the command line: assign(max_seconds, 300).
% 0.93/1.18  
% 0.93/1.18  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.93/1.18  
% 0.93/1.18  % Formulas that are not ordinary clauses:
% 0.93/1.18  1 (all A all B all C (coll(A,B,C) -> coll(A,C,B))) # label(ruleD1) # label(axiom) # label(non_clause).  [assumption].
% 0.93/1.18  2 (all A all B all C (coll(A,B,C) -> coll(B,A,C))) # label(ruleD2) # label(axiom) # label(non_clause).  [assumption].
% 0.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  11 (all A all B all M (midp(M,B,A) -> midp(M,A,B))) # label(ruleD11) # label(axiom) # label(non_clause).  [assumption].
% 0.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.18  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  70 (all A all B all C (midp(A,B,C) -> coll(A,B,C))) # label(ruleD69) # label(axiom) # label(non_clause).  [assumption].
% 0.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  95 -(all A all B all C all D all E all F all G all NWPNT1 all NWPNT2 (circle(D,A,B,C) & coll(E,A,B) & circle(D,A,F,NWPNT1) & eqangle(A,C,C,E,F,C,C,B) & circle(D,C,G,NWPNT2) & coll(G,C,E) -> para(A,B,G,F))) # label(exemplo6GDDFULL8110998) # label(negated_conjecture) # label(non_clause).  [assumption].
% 0.93/1.19  
% 0.93/1.19  ============================== end of process non-clausal formulas ===
% 0.93/1.19  
% 0.93/1.19  ============================== PROCESS INITIAL CLAUSES ===============
% 0.93/1.19  
% 0.93/1.19  ============================== PREDICATE ELIMINATION =================
% 0.93/1.19  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.93/1.19  97 -cong(A,B,A,C) | -cong(A,B,A,D) | circle(A,B,C,D) # label(ruleD12) # label(axiom).  [clausify(12)].
% 0.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  101 -circle(A,B,C,D) | -coll(A,B,D) | perp(B,C,C,D) # label(ruleD53) # label(axiom).  [clausify(54)].
% 0.93/1.19  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.93/1.19  102 -circle(A,B,C,D) | perp(f12(B,C,D,A),B,B,A) # label(ruleX11) # label(axiom).  [clausify(87)].
% 0.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  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.93/1.19  109 circle(c4,c1,c2,c3) # label(exemplo6GDDFULL8110998) # label(negated_conjecture).  [clausify(95)].
% 0.93/1.19  Derived: -perp(c4,c1,c1,A) | eqangle(c1,A,c1,c2,c3,c1,c3,c2).  [resolve(109,a,96,a)].
% 0.93/1.19  Derived: -eqangle(c1,A,c1,c2,c3,c1,c3,c2) | perp(c4,c1,c1,A).  [resolve(109,a,98,a)].
% 0.93/1.19  Derived: -midp(A,c2,c3) | eqangle(c1,c2,c1,c3,c4,c2,c4,A).  [resolve(109,a,99,a)].
% 0.93/1.19  Derived: -coll(A,c2,c3) | -eqangle(c1,c2,c1,c3,c4,c2,c4,A) | midp(A,c2,c3).  [resolve(109,a,100,a)].
% 0.93/1.19  Derived: -coll(c4,c1,c3) | perp(c1,c2,c2,c3).  [resolve(109,a,101,a)].
% 0.93/1.19  Derived: perp(f12(c1,c2,c3,c4),c1,c1,c4).  [resolve(109,a,102,a)].
% 0.93/1.19  Derived: -cong(c4,c1,c4,A) | -cong(B,c1,B,c2) | B = c4 | coll(f13(c1,c2,c3,A,c4,B),c1,c3).  [resolve(109,a,103,a)].
% 2.37/2.63  Derived: -cong(c4,c1,c4,A) | -cong(B,c1,B,c2) | B = c4 | cong(f13(c1,c2,c3,A,c4,B),B,B,c1).  [resolve(109,a,104,a)].
% 2.37/2.63  Derived: -cong(c4,c1,c4,A) | -cong(B,c1,B,c2) | B = c4 | coll(f14(c1,c2,c3,A,c4,B),c2,A).  [resolve(109,a,105,a)].
% 2.37/2.63  Derived: -cong(c4,c1,c4,A) | -cong(B,c1,B,c2) | B = c4 | cong(f14(c1,c2,c3,A,c4,B),B,B,c1).  [resolve(109,a,106,a)].
% 2.37/2.63  110 circle(c4,c1,c6,c8) # label(exemplo6GDDFULL8110998) # label(negated_conjecture).  [clausify(95)].
% 2.37/2.63  Derived: -perp(c4,c1,c1,A) | eqangle(c1,A,c1,c6,c8,c1,c8,c6).  [resolve(110,a,96,a)].
% 2.37/2.63  Derived: -eqangle(c1,A,c1,c6,c8,c1,c8,c6) | perp(c4,c1,c1,A).  [resolve(110,a,98,a)].
% 2.37/2.63  Derived: -midp(A,c6,c8) | eqangle(c1,c6,c1,c8,c4,c6,c4,A).  [resolve(110,a,99,a)].
% 2.37/2.63  Derived: -coll(A,c6,c8) | -eqangle(c1,c6,c1,c8,c4,c6,c4,A) | midp(A,c6,c8).  [resolve(110,a,100,a)].
% 2.37/2.63  Derived: -coll(c4,c1,c8) | perp(c1,c6,c6,c8).  [resolve(110,a,101,a)].
% 2.37/2.63  Derived: perp(f12(c1,c6,c8,c4),c1,c1,c4).  [resolve(110,a,102,a)].
% 2.37/2.63  Derived: -cong(c4,c1,c4,A) | -cong(B,c1,B,c6) | B = c4 | coll(f13(c1,c6,c8,A,c4,B),c1,c8).  [resolve(110,a,103,a)].
% 2.37/2.63  Derived: -cong(c4,c1,c4,A) | -cong(B,c1,B,c6) | B = c4 | cong(f13(c1,c6,c8,A,c4,B),B,B,c1).  [resolve(110,a,104,a)].
% 2.37/2.63  Derived: -cong(c4,c1,c4,A) | -cong(B,c1,B,c6) | B = c4 | coll(f14(c1,c6,c8,A,c4,B),c6,A).  [resolve(110,a,105,a)].
% 2.37/2.63  Derived: -cong(c4,c1,c4,A) | -cong(B,c1,B,c6) | B = c4 | cong(f14(c1,c6,c8,A,c4,B),B,B,c1).  [resolve(110,a,106,a)].
% 2.37/2.63  111 circle(c4,c3,c7,c9) # label(exemplo6GDDFULL8110998) # label(negated_conjecture).  [clausify(95)].
% 2.37/2.63  Derived: -perp(c4,c3,c3,A) | eqangle(c3,A,c3,c7,c9,c3,c9,c7).  [resolve(111,a,96,a)].
% 2.37/2.63  Derived: -eqangle(c3,A,c3,c7,c9,c3,c9,c7) | perp(c4,c3,c3,A).  [resolve(111,a,98,a)].
% 2.37/2.63  Derived: -midp(A,c7,c9) | eqangle(c3,c7,c3,c9,c4,c7,c4,A).  [resolve(111,a,99,a)].
% 2.37/2.63  Derived: -coll(A,c7,c9) | -eqangle(c3,c7,c3,c9,c4,c7,c4,A) | midp(A,c7,c9).  [resolve(111,a,100,a)].
% 2.37/2.63  Derived: -coll(c4,c3,c9) | perp(c3,c7,c7,c9).  [resolve(111,a,101,a)].
% 2.37/2.63  Derived: perp(f12(c3,c7,c9,c4),c3,c3,c4).  [resolve(111,a,102,a)].
% 2.37/2.63  Derived: -cong(c4,c3,c4,A) | -cong(B,c3,B,c7) | B = c4 | coll(f13(c3,c7,c9,A,c4,B),c3,c9).  [resolve(111,a,103,a)].
% 2.37/2.63  Derived: -cong(c4,c3,c4,A) | -cong(B,c3,B,c7) | B = c4 | cong(f13(c3,c7,c9,A,c4,B),B,B,c3).  [resolve(111,a,104,a)].
% 2.37/2.63  Derived: -cong(c4,c3,c4,A) | -cong(B,c3,B,c7) | B = c4 | coll(f14(c3,c7,c9,A,c4,B),c7,A).  [resolve(111,a,105,a)].
% 2.37/2.63  Derived: -cong(c4,c3,c4,A) | -cong(B,c3,B,c7) | B = c4 | cong(f14(c3,c7,c9,A,c4,B),B,B,c3).  [resolve(111,a,106,a)].
% 2.37/2.63  
% 2.37/2.63  ============================== end predicate elimination =============
% 2.37/2.63  
% 2.37/2.63  Auto_denials:  (non-Horn, no changes).
% 2.37/2.63  
% 2.37/2.63  Term ordering decisions:
% 2.37/2.63  Function symbol KB weights:  c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. c9=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.
% 2.37/2.63  
% 2.37/2.63  ============================== end of process initial clauses ========
% 2.37/2.63  
% 2.37/2.63  ============================== CLAUSES FOR SEARCH ====================
% 2.37/2.63  
% 2.37/2.63  ============================== end of clauses for search =============
% 2.37/2.63  
% 2.37/2.63  ============================== SEARCH ================================
% 2.37/2.63  
% 2.37/2.63  % Starting search at 0.05 seconds.
% 2.37/2.63  
% 2.37/2.63  NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 1114 (0.00 of 0.13 sec).
% 2.37/2.63  
% 2.37/2.63  Low Water (keep): wt=57.000, iters=3336
% 2.37/2.63  
% 2.37/2.63  Low Water (keep): wt=45.000, iters=3496
% 2.37/2.63  
% 2.37/2.63  Low Water (keep): wt=40.000, iters=3424
% 2.37/2.63  
% 2.37/2.63  Low Water (keep): wt=37.000, iters=3390
% 2.37/2.63  
% 2.37/2.63  Low Water (keep): wt=33.000, iters=3348
% 2.37/2.63  
% 2.37/2.63  Low Water (keep): wt=31.000, iters=3383
% 2.37/2.63  
% 2.37/2.63  Low Water (keep): wt=26.000, iters=3333
% 2.37/2.63  
% 2.37/2.63  Low Water (keep): wt=24.000, iters=3368
% 2.37/2.63  
% 2.37/2.63  Low Water (keep): wt=23.000, iters=3335
% 2.37/2.63  
% 2.37/2.63  Low Water (keep): wt=22.000, iters=3335
% 2.37/2.63  
% 2.37/2.63  Low Water (keep): wt=21.000, iters=3410
% 2.37/2.63  
% 2.37/2.63  Low Water (keep): wt=19.000, iters=3361
% 2.37/2.63  
% 2.37/2.63  Low Water (keep): wt=18.000, iters=3371
% 2.37/2.63  
% 2.37/2.63  Low Water (keep): wt=17.000, iters=3368
% 2.37/2.63  
% 2.37/2.63  Low Water (keep): wt=16.000, iters=3753
% 2.37/2.63  
% 2.37/2.63  Low Water (displace): id=7886, wt=57.000
% 2.37/2.63  
% 2.37/2.63  Low Water (displace): id=14102, wt=15.000
% 2.37/2.63  
% 2.37/2.63  Low Water (displace): id=14104, wt=14.000
% 2.37/2.63  
% 2.37/2.63  Low Water (keep): wt=15.000, iters=3340
% 2.37/2.63  
% 2.37/2.63  Low Water (displace): id=14752, wt=11.000
% 4.32/4.57  
% 4.32/4.57  Low Water (displace): id=14979, wt=10.000
% 4.32/4.57  
% 4.32/4.57  Low Water (keep): wt=14.000, iters=3336
% 4.32/4.57  
% 4.32/4.57  Low Water (displace): id=15415, wt=7.000
% 4.32/4.57  
% 4.32/4.57  Low Water (keep): wt=13.000, iters=3334
% 4.32/4.57  
% 4.32/4.57  Low Water (keep): wt=12.000, iters=3344
% 4.32/4.57  
% 4.32/4.57  Low Water (displace): id=19524, wt=5.000
% 4.32/4.57  
% 4.32/4.57  ============================== PROOF =================================
% 4.32/4.57  % SZS status Theorem
% 4.32/4.57  % SZS output start Refutation
% 4.32/4.57  
% 4.32/4.57  % Proof 1 at 3.35 (+ 0.06) seconds.
% 4.32/4.57  % Length of proof is 216.
% 4.32/4.57  % Level of proof is 39.
% 4.32/4.57  % Maximum clause weight is 29.000.
% 4.32/4.57  % Given clauses 7045.
% 4.32/4.57  
% 4.32/4.57  1 (all A all B all C (coll(A,B,C) -> coll(A,C,B))) # label(ruleD1) # label(axiom) # label(non_clause).  [assumption].
% 4.32/4.57  2 (all A all B all C (coll(A,B,C) -> coll(B,A,C))) # label(ruleD2) # label(axiom) # label(non_clause).  [assumption].
% 4.32/4.57  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].
% 4.32/4.57  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].
% 4.32/4.57  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].
% 4.32/4.57  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].
% 4.32/4.57  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].
% 4.32/4.57  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].
% 4.32/4.57  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].
% 4.32/4.57  11 (all A all B all M (midp(M,B,A) -> midp(M,A,B))) # label(ruleD11) # label(axiom) # label(non_clause).  [assumption].
% 4.32/4.57  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].
% 4.32/4.57  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].
% 4.32/4.57  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].
% 4.32/4.57  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].
% 4.32/4.57  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].
% 4.32/4.57  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].
% 4.32/4.57  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].
% 4.32/4.57  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].
% 4.32/4.57  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].
% 4.32/4.57  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].
% 4.32/4.57  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].
% 4.32/4.57  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].
% 4.32/4.57  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].
% 4.32/4.57  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].
% 4.32/4.57  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].
% 4.32/4.57  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].
% 4.32/4.57  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].
% 4.32/4.57  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].
% 4.32/4.57  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].
% 4.32/4.57  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].
% 4.32/4.57  67 (all A all B all C (para(A,B,A,C) -> coll(A,B,C))) # label(ruleD66) # label(axiom) # label(non_clause).  [assumption].
% 4.32/4.57  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].
% 4.32/4.57  69 (all A all B all C (midp(A,B,C) -> cong(A,B,A,C))) # label(ruleD68) # label(axiom) # label(non_clause).  [assumption].
% 4.32/4.57  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].
% 4.32/4.57  95 -(all A all B all C all D all E all F all G all NWPNT1 all NWPNT2 (circle(D,A,B,C) & coll(E,A,B) & circle(D,A,F,NWPNT1) & eqangle(A,C,C,E,F,C,C,B) & circle(D,C,G,NWPNT2) & coll(G,C,E) -> para(A,B,G,F))) # label(exemplo6GDDFULL8110998) # label(negated_conjecture) # label(non_clause).  [assumption].
% 4.32/4.57  97 -cong(A,B,A,C) | -cong(A,B,A,D) | circle(A,B,C,D) # label(ruleD12) # label(axiom).  [clausify(12)].
% 4.32/4.57  101 -circle(A,B,C,D) | -coll(A,B,D) | perp(B,C,C,D) # label(ruleD53) # label(axiom).  [clausify(54)].
% 4.32/4.57  102 -circle(A,B,C,D) | perp(f12(B,C,D,A),B,B,A) # label(ruleX11) # label(axiom).  [clausify(87)].
% 4.32/4.57  109 circle(c4,c1,c2,c3) # label(exemplo6GDDFULL8110998) # label(negated_conjecture).  [clausify(95)].
% 4.32/4.57  111 circle(c4,c3,c7,c9) # label(exemplo6GDDFULL8110998) # label(negated_conjecture).  [clausify(95)].
% 4.32/4.57  112 -coll(A,B,C) | coll(A,C,B) # label(ruleD1) # label(axiom).  [clausify(1)].
% 4.32/4.57  113 -coll(A,B,C) | coll(B,A,C) # label(ruleD2) # label(axiom).  [clausify(2)].
% 4.32/4.57  114 -coll(A,B,C) | -coll(A,B,D) | coll(C,D,A) # label(ruleD3) # label(axiom).  [clausify(3)].
% 4.32/4.57  115 -para(A,B,C,D) | para(A,B,D,C) # label(ruleD4) # label(axiom).  [clausify(4)].
% 4.32/4.57  116 -para(A,B,C,D) | para(C,D,A,B) # label(ruleD5) # label(axiom).  [clausify(5)].
% 4.32/4.57  117 -para(A,B,C,D) | -para(C,D,E,F) | para(A,B,E,F) # label(ruleD6) # label(axiom).  [clausify(6)].
% 4.32/4.57  118 -perp(A,B,C,D) | perp(A,B,D,C) # label(ruleD7) # label(axiom).  [clausify(7)].
% 4.32/4.57  119 -perp(A,B,C,D) | perp(C,D,A,B) # label(ruleD8) # label(axiom).  [clausify(8)].
% 4.32/4.57  120 -perp(A,B,C,D) | -perp(C,D,E,F) | para(A,B,E,F) # label(ruleD9) # label(axiom).  [clausify(9)].
% 4.32/4.57  122 -midp(A,B,C) | midp(A,C,B) # label(ruleD11) # label(axiom).  [clausify(11)].
% 4.32/4.57  124 -cyclic(A,B,C,D) | cyclic(A,B,D,C) # label(ruleD14) # label(axiom).  [clausify(14)].
% 4.32/4.57  125 -cyclic(A,B,C,D) | cyclic(A,C,B,D) # label(ruleD15) # label(axiom).  [clausify(15)].
% 4.32/4.57  126 -cyclic(A,B,C,D) | cyclic(B,A,C,D) # label(ruleD16) # label(axiom).  [clausify(16)].
% 4.32/4.57  127 -cyclic(A,B,C,D) | -cyclic(A,B,C,E) | cyclic(B,C,D,E) # label(ruleD17) # label(axiom).  [clausify(17)].
% 4.32/4.57  129 -eqangle(A,B,C,D,E,F,V6,V7) | eqangle(C,D,A,B,V6,V7,E,F) # label(ruleD19) # label(axiom).  [clausify(19)].
% 4.32/4.57  130 -eqangle(A,B,C,D,E,F,V6,V7) | eqangle(E,F,V6,V7,A,B,C,D) # label(ruleD20) # label(axiom).  [clausify(20)].
% 4.32/4.57  131 -eqangle(A,B,C,D,E,F,V6,V7) | eqangle(A,B,E,F,C,D,V6,V7) # label(ruleD21) # label(axiom).  [clausify(21)].
% 4.32/4.57  132 -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)].
% 4.32/4.57  133 -cong(A,B,C,D) | cong(A,B,D,C) # label(ruleD23) # label(axiom).  [clausify(23)].
% 4.32/4.57  134 -cong(A,B,C,D) | cong(C,D,A,B) # label(ruleD24) # label(axiom).  [clausify(24)].
% 4.32/4.57  149 -eqangle(A,B,C,D,E,F,C,D) | para(A,B,E,F) # label(ruleD39) # label(axiom).  [clausify(39)].
% 4.32/4.57  150 -para(A,B,C,D) | eqangle(A,B,E,F,C,D,E,F) # label(ruleD40) # label(axiom).  [clausify(40)].
% 4.32/4.57  153 -eqangle(A,B,A,C,D,B,D,C) | -coll(A,D,C) | cyclic(B,C,A,D) # label(ruleD42b) # label(axiom).  [clausify(43)].
% 4.32/4.57  154 -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)].
% 4.32/4.57  156 -midp(A,B,C) | -para(A,D,C,E) | -coll(D,B,E) | midp(D,B,E) # label(ruleD45) # label(axiom).  [clausify(46)].
% 4.32/4.57  159 -perp(A,B,B,C) | -midp(D,A,C) | cong(A,D,B,D) # label(ruleD52) # label(axiom).  [clausify(53)].
% 4.32/4.57  162 -cong(A,B,C,B) | -cong(A,D,C,D) | perp(A,C,B,D) # label(ruleD56) # label(axiom).  [clausify(57)].
% 4.32/4.57  170 -midp(A,B,C) | -para(B,D,C,E) | -para(B,E,C,D) | midp(A,D,E) # label(ruleD64) # label(axiom).  [clausify(65)].
% 4.32/4.57  172 -para(A,B,A,C) | coll(A,B,C) # label(ruleD66) # label(axiom).  [clausify(67)].
% 4.32/4.57  173 -cong(A,B,A,C) | -coll(A,B,C) | midp(A,B,C) # label(ruleD67) # label(axiom).  [clausify(68)].
% 4.32/4.57  174 -midp(A,B,C) | cong(A,B,A,C) # label(ruleD68) # label(axiom).  [clausify(69)].
% 4.32/4.57  211 coll(c5,c1,c2) # label(exemplo6GDDFULL8110998) # label(negated_conjecture).  [clausify(95)].
% 4.32/4.57  212 eqangle(c1,c3,c3,c5,c6,c3,c3,c2) # label(exemplo6GDDFULL8110998) # label(negated_conjecture).  [clausify(95)].
% 4.32/4.57  213 coll(c7,c3,c5) # label(exemplo6GDDFULL8110998) # label(negated_conjecture).  [clausify(95)].
% 4.32/4.57  214 -para(c1,c2,c7,c6) # label(exemplo6GDDFULL8110998) # label(negated_conjecture).  [clausify(95)].
% 4.32/4.57  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)].
% 4.32/4.57  257 -coll(c4,c1,c3) | perp(c1,c2,c2,c3).  [resolve(109,a,101,a)].
% 4.32/4.57  258 perp(f12(c1,c2,c3,c4),c1,c1,c4).  [resolve(109,a,102,a)].
% 4.32/4.57  286 perp(f12(c3,c7,c9,c4),c3,c3,c4).  [resolve(111,a,102,a)].
% 4.32/4.57  295 -coll(A,B,C) | coll(C,C,A).  [factor(114,a,b)].
% 4.32/4.57  300 -cyclic(A,B,C,D) | cyclic(B,C,D,D).  [factor(127,a,b)].
% 4.32/4.57  309 -midp(A,B,C) | -para(B,D,C,D) | midp(A,D,D).  [factor(170,b,c)].
% 4.32/4.57  334 -coll(A,B,C) | perp(B,C,C,C) | -cong(A,B,A,C).  [factor(219,c,d)].
% 4.32/4.57  360 coll(c1,c5,c2).  [resolve(211,a,113,a)].
% 4.32/4.57  361 coll(c5,c2,c1).  [resolve(211,a,112,a)].
% 4.32/4.57  366 -eqangle(c6,c3,c3,c2,A,B,C,D) | eqangle(c1,c3,c3,c5,A,B,C,D).  [resolve(212,a,132,a)].
% 4.32/4.57  367 eqangle(c1,c3,c6,c3,c3,c5,c3,c2).  [resolve(212,a,131,a)].
% 4.32/4.57  368 eqangle(c6,c3,c3,c2,c1,c3,c3,c5).  [resolve(212,a,130,a)].
% 4.32/4.57  373 coll(c3,c7,c5).  [resolve(213,a,113,a)].
% 4.32/4.57  374 coll(c7,c5,c3).  [resolve(213,a,112,a)].
% 4.32/4.57  395 -perp(A,B,f12(c1,c2,c3,c4),c1) | para(A,B,c1,c4).  [resolve(258,a,120,b)].
% 4.32/4.57  397 perp(c1,c4,f12(c1,c2,c3,c4),c1).  [resolve(258,a,119,a)].
% 4.32/4.57  445 -perp(A,B,f12(c3,c7,c9,c4),c3) | para(A,B,c3,c4).  [resolve(286,a,120,b)].
% 4.32/4.57  447 perp(c3,c4,f12(c3,c7,c9,c4),c3).  [resolve(286,a,119,a)].
% 4.32/4.57  450 coll(c5,c5,c7).  [resolve(295,a,213,a)].
% 4.32/4.57  451 coll(c2,c2,c5).  [resolve(295,a,211,a)].
% 4.32/4.57  452 coll(c2,c2,c1).  [resolve(360,a,295,a)].
% 4.32/4.57  455 coll(c1,c2,c5).  [resolve(360,a,112,a)].
% 4.32/4.57  456 coll(c1,c1,c5).  [resolve(361,a,295,a)].
% 4.32/4.57  460 coll(c5,c5,c3).  [resolve(373,a,295,a)].
% 4.32/4.57  465 -coll(c7,c5,A) | coll(A,c3,c7).  [resolve(374,a,114,b)].
% 4.32/4.57  466 -coll(c7,c5,A) | coll(c3,A,c7).  [resolve(374,a,114,a)].
% 4.32/4.57  469 -coll(c5,c5,A) | coll(A,c7,c5).  [resolve(450,a,114,b)].
% 4.32/4.57  470 -coll(c5,c5,A) | coll(c7,A,c5).  [resolve(450,a,114,a)].
% 4.32/4.57  472 coll(c5,c5,c2).  [resolve(451,a,295,a)].
% 4.32/4.57  475 coll(c2,c5,c2).  [resolve(451,a,112,a)].
% 4.32/4.57  476 coll(c1,c1,c2).  [resolve(452,a,295,a)].
% 4.32/4.57  480 coll(c5,c5,c1).  [resolve(455,a,295,a)].
% 4.32/4.57  484 -coll(c1,c1,A) | coll(A,c5,c1).  [resolve(456,a,114,b)].
% 4.32/4.57  492 coll(c5,c3,c5).  [resolve(460,a,112,a)].
% 4.32/4.57  511 coll(c5,c2,c5).  [resolve(472,a,112,a)].
% 4.32/4.57  515 coll(c5,c2,c2).  [resolve(475,a,113,a)].
% 4.32/4.57  536 coll(c3,c5,c5).  [resolve(492,a,113,a)].
% 4.32/4.57  548 -eqangle(A,B,C,D,c1,c3,c6,c3) | eqangle(A,B,C,D,c3,c5,c3,c2).  [resolve(367,a,132,b)].
% 4.32/4.57  550 eqangle(c3,c5,c3,c2,c1,c3,c6,c3).  [resolve(367,a,130,a)].
% 4.32/4.57  562 coll(c2,c5,c5).  [resolve(511,a,113,a)].
% 4.32/4.57  563 eqangle(c1,c3,c3,c5,c1,c3,c3,c5).  [resolve(368,a,366,a)].
% 4.32/4.57  621 coll(c1,c7,c5).  [resolve(469,a,480,a)].
% 4.32/4.57  622 coll(c2,c7,c5).  [resolve(469,a,472,a)].
% 4.32/4.57  625 coll(c7,c1,c5).  [resolve(621,a,113,a)].
% 4.32/4.57  629 coll(c7,c2,c5).  [resolve(622,a,113,a)].
% 4.32/4.57  633 coll(c7,c5,c1).  [resolve(625,a,112,a)].
% 4.32/4.57  642 coll(c7,c5,c2).  [resolve(629,a,112,a)].
% 4.32/4.57  647 coll(c3,c1,c7).  [resolve(633,a,466,a)].
% 4.32/4.57  665 coll(c2,c3,c7).  [resolve(642,a,465,a)].
% 4.32/4.57  677 coll(c3,c7,c1).  [resolve(647,a,112,a)].
% 4.32/4.57  700 coll(c2,c7,c3).  [resolve(665,a,112,a)].
% 4.32/4.57  711 coll(c1,c1,c3).  [resolve(677,a,295,a)].
% 4.32/4.57  712 -coll(c3,c7,A) | coll(A,c1,c3).  [resolve(677,a,114,b)].
% 4.32/4.57  734 coll(c3,c3,c2).  [resolve(700,a,295,a)].
% 4.32/4.57  755 coll(c1,c3,c1).  [resolve(711,a,112,a)].
% 4.32/4.57  838 para(c1,c4,c1,c4).  [resolve(397,a,395,a)].
% 4.32/4.57  862 coll(c1,c4,c4).  [resolve(838,a,172,a)].
% 4.32/4.57  865 eqangle(c1,c4,A,B,c1,c4,A,B).  [resolve(838,a,150,a)].
% 4.32/4.57  867 coll(c4,c4,c1).  [resolve(862,a,295,a)].
% 4.32/4.57  875 coll(c1,c1,c4).  [resolve(867,a,295,a)].
% 4.32/4.57  905 coll(c4,c5,c1).  [resolve(875,a,484,a)].
% 4.32/4.57  917 coll(c4,c1,c5).  [resolve(905,a,112,a)].
% 4.32/4.57  926 coll(c5,c5,c4).  [resolve(917,a,295,a)].
% 4.32/4.57  940 coll(c7,c4,c5).  [resolve(926,a,470,a)].
% 4.32/4.57  966 coll(c7,c5,c4).  [resolve(940,a,112,a)].
% 4.32/4.58  1010 coll(c3,c4,c7).  [resolve(966,a,466,a)].
% 4.32/4.58  1070 coll(c3,c7,c4).  [resolve(1010,a,112,a)].
% 4.32/4.58  1402 para(c3,c4,c3,c4).  [resolve(447,a,445,a)].
% 4.32/4.58  1419 -midp(A,c3,c3) | midp(A,c4,c4).  [resolve(1402,a,309,b)].
% 4.32/4.58  1496 coll(c4,c1,c3).  [resolve(712,a,1070,a)].
% 4.32/4.58  1497 perp(c1,c2,c2,c3).  [back_unit_del(257),unit_del(a,1496)].
% 4.32/4.58  1547 -midp(A,c1,c3) | cong(c1,A,c2,A).  [resolve(1497,a,159,a)].
% 4.32/4.58  1548 -perp(A,B,c1,c2) | para(A,B,c2,c3).  [resolve(1497,a,120,b)].
% 4.32/4.58  1549 -perp(c2,c3,A,B) | para(c1,c2,A,B).  [resolve(1497,a,120,a)].
% 4.32/4.58  1550 perp(c2,c3,c1,c2).  [resolve(1497,a,119,a)].
% 4.32/4.58  1565 perp(c2,c3,c2,c1).  [resolve(1550,a,118,a)].
% 4.32/4.58  1567 eqangle(c3,c5,c3,c2,c3,c5,c3,c2).  [resolve(550,a,548,a)].
% 4.32/4.58  1673 para(c1,c3,c1,c3).  [resolve(563,a,149,a)].
% 4.32/4.58  1689 para(c1,c3,c3,c1).  [resolve(1673,a,115,a)].
% 4.32/4.58  1705 para(c3,c1,c1,c3).  [resolve(1689,a,116,a)].
% 4.32/4.58  1721 para(c3,c1,c3,c1).  [resolve(1705,a,115,a)].
% 4.32/4.58  1732 -midp(c3,A,c3) | -coll(c1,A,c1) | midp(c1,A,c1).  [resolve(1721,a,156,b)].
% 4.32/4.58  2362 eqangle(A,B,c1,c4,A,B,c1,c4).  [resolve(865,a,129,a)].
% 4.32/4.58  10292 para(c2,c3,c2,c3).  [resolve(1548,a,1550,a)].
% 4.32/4.58  10315 -midp(A,c2,c2) | midp(A,c3,c3).  [resolve(10292,a,309,b)].
% 4.32/4.58  10352 para(c1,c2,c2,c1).  [resolve(1549,a,1565,a)].
% 4.32/4.58  10368 -para(c2,c1,A,B) | para(c1,c2,A,B).  [resolve(10352,a,117,a)].
% 4.32/4.58  10584 -cyclic(c5,c2,c3,c5) | -cyclic(c5,c2,c3,c2) | -cyclic(c5,c2,c3,c3) | cong(c5,c2,c5,c2).  [resolve(1567,a,154,d)].
% 4.32/4.58  10585 cyclic(c5,c2,c3,c3).  [resolve(1567,a,153,a),unit_del(a,734)].
% 4.32/4.58  10586 para(c3,c5,c3,c5).  [resolve(1567,a,149,a)].
% 4.32/4.58  10589 -cyclic(c5,c2,c3,c5) | -cyclic(c5,c2,c3,c2) | cong(c5,c2,c5,c2).  [back_unit_del(10584),unit_del(c,10585)].
% 4.32/4.58  10599 cyclic(c2,c5,c3,c3).  [resolve(10585,a,126,a)].
% 4.32/4.58  10600 cyclic(c5,c3,c2,c3).  [resolve(10585,a,125,a)].
% 4.32/4.58  10609 para(c3,c5,c5,c3).  [resolve(10586,a,115,a)].
% 4.32/4.58  10627 cyclic(c2,c3,c5,c3).  [resolve(10599,a,125,a)].
% 4.32/4.58  10634 cyclic(c3,c5,c2,c3).  [resolve(10600,a,126,a)].
% 4.32/4.58  10647 para(c5,c3,c3,c5).  [resolve(10609,a,116,a)].
% 4.32/4.58  10668 cyclic(c3,c2,c5,c3).  [resolve(10627,a,126,a)].
% 4.32/4.58  10677 cyclic(c3,c5,c3,c2).  [resolve(10634,a,124,a)].
% 4.32/4.58  10696 para(c5,c3,c5,c3).  [resolve(10647,a,115,a)].
% 4.32/4.58  10717 cyclic(c3,c2,c3,c5).  [resolve(10668,a,124,a)].
% 4.32/4.58  10725 cyclic(c5,c3,c2,c2).  [resolve(10677,a,300,a)].
% 4.32/4.58  10744 -midp(A,c5,c5) | midp(A,c3,c3).  [resolve(10696,a,309,b)].
% 4.32/4.58  10766 cyclic(c2,c3,c5,c5).  [resolve(10717,a,300,a)].
% 4.32/4.58  10797 cyclic(c5,c2,c3,c2).  [resolve(10725,a,125,a)].
% 4.32/4.58  10798 -cyclic(c5,c2,c3,c5) | cong(c5,c2,c5,c2).  [back_unit_del(10589),unit_del(b,10797)].
% 4.32/4.58  10834 cyclic(c2,c5,c3,c5).  [resolve(10766,a,125,a)].
% 4.32/4.58  10913 cyclic(c5,c2,c3,c5).  [resolve(10834,a,126,a)].
% 4.32/4.58  10915 cong(c5,c2,c5,c2).  [back_unit_del(10798),unit_del(a,10913)].
% 4.32/4.58  11059 midp(c5,c2,c2).  [resolve(10915,a,173,a),unit_del(a,515)].
% 4.32/4.58  11063 cong(c5,c2,c2,c5).  [resolve(10915,a,133,a)].
% 4.32/4.58  11234 cong(c2,c5,c5,c2).  [resolve(11063,a,134,a)].
% 4.32/4.58  11332 cong(c2,c5,c2,c5).  [resolve(11234,a,133,a)].
% 4.32/4.58  11432 midp(c2,c5,c5).  [resolve(11332,a,173,a),unit_del(a,562)].
% 4.32/4.58  13133 midp(c5,c3,c3).  [resolve(10315,a,11059,a)].
% 4.32/4.58  13153 cong(c5,c3,c5,c3).  [resolve(13133,a,174,a)].
% 4.32/4.58  13268 cong(c5,c3,c3,c5).  [resolve(13153,a,133,a)].
% 4.32/4.58  13494 cong(c3,c5,c5,c3).  [resolve(13268,a,134,a)].
% 4.32/4.58  13712 cong(c3,c5,c3,c5).  [resolve(13494,a,133,a)].
% 4.32/4.58  13869 midp(c3,c5,c5).  [resolve(13712,a,173,a),unit_del(a,536)].
% 4.32/4.58  15698 midp(c3,c3,c3).  [resolve(10744,a,13869,a)].
% 4.32/4.58  15699 midp(c2,c3,c3).  [resolve(10744,a,11432,a)].
% 4.32/4.58  15798 midp(c1,c3,c1).  [resolve(15698,a,1732,a),unit_del(a,755)].
% 4.32/4.58  15840 midp(c2,c4,c4).  [resolve(15699,a,1419,a)].
% 4.32/4.58  16164 midp(c1,c1,c3).  [resolve(15798,a,122,a)].
% 4.32/4.58  16375 cong(c1,c1,c2,c1).  [resolve(16164,a,1547,a)].
% 4.32/4.58  17404 cong(c1,c1,c1,c2).  [resolve(16375,a,133,a)].
% 4.32/4.58  18261 perp(c1,c2,c2,c2).  [resolve(17404,a,334,c),unit_del(a,476)].
% 4.32/4.58  19194 perp(c2,c2,c1,c2).  [resolve(18261,a,119,a)].
% 4.32/4.58  19984 para(A,B,A,B).  [resolve(2362,a,149,a)].
% 4.32/4.58  20055 perp(c2,c2,c2,c1).  [resolve(19194,a,118,a)].
% 4.32/4.58  20412 -midp(A,B,B) | midp(A,C,C).  [resolve(19984,a,309,b)].
% 4.32/4.58  21041 perp(c2,c1,c2,c2).  [resolve(20055,a,119,a)].
% 4.32/4.58  21351 -perp(c2,c2,A,B) | para(c2,c1,A,B).  [resolve(21041,a,120,a)].
% 4.32/4.58  24290 midp(c2,A,A).  [resolve(20412,a,15840,a)].
% 4.32/4.58  24301 cong(c2,A,c2,A).  [resolve(24290,a,174,a)].
% 4.32/4.58  24521 perp(c2,c2,A,B).  [resolve(24301,a,162,b),unit_del(a,24301)].
% 4.32/4.58  24530 para(c2,c1,A,B).  [back_unit_del(21351),unit_del(a,24521)].
% 4.32/4.58  24560 para(c1,c2,A,B).  [back_unit_del(10368),unit_del(a,24530)].
% 4.32/4.58  24561 $F.  [resolve(24560,a,214,a)].
% 4.32/4.58  
% 4.32/4.58  % SZS output end Refutation
% 4.32/4.58  ============================== end of proof ==========================
% 4.32/4.58  
% 4.32/4.58  ============================== STATISTICS ============================
% 4.32/4.58  
% 4.32/4.58  Given=7045. Generated=90069. Kept=24429. proofs=1.
% 4.32/4.58  Usable=5959. Sos=7010. Demods=0. Limbo=30, Disabled=11609. Hints=0.
% 4.32/4.58  Megabytes=16.06.
% 4.32/4.58  User_CPU=3.35, System_CPU=0.06, Wall_clock=4.
% 4.32/4.58  
% 4.32/4.58  ============================== end of statistics =====================
% 4.32/4.58  
% 4.32/4.58  ============================== end of search =========================
% 4.32/4.58  
% 4.32/4.58  THEOREM PROVED
% 4.32/4.58  % SZS status Theorem
% 4.32/4.58  
% 4.32/4.58  Exiting with 1 proof.
% 4.32/4.58  
% 4.32/4.58  Process 17849 exit (max_proofs) Fri Jun 17 19:58:43 2022
% 4.32/4.58  Prover9 interrupted
%------------------------------------------------------------------------------