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

View Problem - Process Solution

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

% Computer : n022.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:06 EDT 2022

% Result   : Theorem 99.59s 99.91s
% Output   : Refutation 99.59s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : GEO587+1 : TPTP v8.1.0. Released v7.5.0.
% 0.04/0.13  % Command  : tptp2X_and_run_prover9 %d %s
% 0.12/0.34  % Computer : n022.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Sat Jun 18 03:09:17 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.41/1.07  ============================== Prover9 ===============================
% 0.41/1.07  Prover9 (32) version 2009-11A, November 2009.
% 0.41/1.07  Process 3122 was started by sandbox2 on n022.cluster.edu,
% 0.41/1.07  Sat Jun 18 03:09:18 2022
% 0.41/1.07  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_2969_n022.cluster.edu".
% 0.41/1.07  ============================== end of head ===========================
% 0.41/1.07  
% 0.41/1.07  ============================== INPUT =================================
% 0.41/1.07  
% 0.41/1.07  % Reading from file /tmp/Prover9_2969_n022.cluster.edu
% 0.41/1.07  
% 0.41/1.07  set(prolog_style_variables).
% 0.41/1.07  set(auto2).
% 0.41/1.07      % set(auto2) -> set(auto).
% 0.41/1.07      % set(auto) -> set(auto_inference).
% 0.41/1.07      % set(auto) -> set(auto_setup).
% 0.41/1.07      % set(auto_setup) -> set(predicate_elim).
% 0.41/1.07      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.41/1.07      % set(auto) -> set(auto_limits).
% 0.41/1.07      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.41/1.07      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.41/1.07      % set(auto) -> set(auto_denials).
% 0.41/1.07      % set(auto) -> set(auto_process).
% 0.41/1.07      % set(auto2) -> assign(new_constants, 1).
% 0.41/1.07      % set(auto2) -> assign(fold_denial_max, 3).
% 0.41/1.07      % set(auto2) -> assign(max_weight, "200.000").
% 0.41/1.07      % set(auto2) -> assign(max_hours, 1).
% 0.41/1.07      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.41/1.07      % set(auto2) -> assign(max_seconds, 0).
% 0.41/1.07      % set(auto2) -> assign(max_minutes, 5).
% 0.41/1.07      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.41/1.07      % set(auto2) -> set(sort_initial_sos).
% 0.41/1.07      % set(auto2) -> assign(sos_limit, -1).
% 0.41/1.07      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.41/1.07      % set(auto2) -> assign(max_megs, 400).
% 0.41/1.07      % set(auto2) -> assign(stats, some).
% 0.41/1.07      % set(auto2) -> clear(echo_input).
% 0.41/1.07      % set(auto2) -> set(quiet).
% 0.41/1.07      % set(auto2) -> clear(print_initial_clauses).
% 0.41/1.07      % set(auto2) -> clear(print_given).
% 0.41/1.07  assign(lrs_ticks,-1).
% 0.41/1.07  assign(sos_limit,10000).
% 0.41/1.07  assign(order,kbo).
% 0.41/1.07  set(lex_order_vars).
% 0.41/1.07  clear(print_given).
% 0.41/1.07  
% 0.41/1.07  % formulas(sos).  % not echoed (95 formulas)
% 0.41/1.07  
% 0.41/1.07  ============================== end of input ==========================
% 0.41/1.07  
% 0.41/1.07  % From the command line: assign(max_seconds, 300).
% 0.41/1.07  
% 0.41/1.07  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.41/1.07  
% 0.41/1.07  % Formulas that are not ordinary clauses:
% 0.41/1.07  1 (all A all B all C (coll(A,B,C) -> coll(A,C,B))) # label(ruleD1) # label(axiom) # label(non_clause).  [assumption].
% 0.41/1.07  2 (all A all B all C (coll(A,B,C) -> coll(B,A,C))) # label(ruleD2) # label(axiom) # label(non_clause).  [assumption].
% 0.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  11 (all A all B all M (midp(M,B,A) -> midp(M,A,B))) # label(ruleD11) # label(axiom) # label(non_clause).  [assumption].
% 0.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  70 (all A all B all C (midp(A,B,C) -> coll(A,B,C))) # label(ruleD69) # label(axiom) # label(non_clause).  [assumption].
% 0.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  95 -(all A all C all B all D all P all Q all R all S all O (perp(A,C,B,D) & midp(P,B,A) & midp(Q,C,B) & midp(R,D,C) & midp(S,A,D) & coll(O,P,R) & coll(O,Q,S) -> cong(O,S,O,R))) # label(exemplo6GDDFULL416049) # label(negated_conjecture) # label(non_clause).  [assumption].
% 0.41/1.07  
% 0.41/1.07  ============================== end of process non-clausal formulas ===
% 0.41/1.07  
% 0.41/1.07  ============================== PROCESS INITIAL CLAUSES ===============
% 0.41/1.07  
% 0.41/1.07  ============================== PREDICATE ELIMINATION =================
% 0.41/1.07  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.41/1.07  97 -cong(A,B,A,C) | -cong(A,B,A,D) | circle(A,B,C,D) # label(ruleD12) # label(axiom).  [clausify(12)].
% 0.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  101 -circle(A,B,C,D) | -coll(A,B,D) | perp(B,C,C,D) # label(ruleD53) # label(axiom).  [clausify(54)].
% 0.41/1.07  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.41/1.07  102 -circle(A,B,C,D) | perp(f12(B,C,D,A),B,B,A) # label(ruleX11) # label(axiom).  [clausify(87)].
% 0.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.99/1.28  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.99/1.28  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.99/1.28  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.99/1.28  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.99/1.28  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.99/1.28  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.99/1.28  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.99/1.28  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.99/1.28  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.99/1.28  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.99/1.28  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.99/1.28  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.99/1.28  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.99/1.28  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.99/1.28  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.99/1.28  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.99/1.28  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.99/1.28  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.99/1.28  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.99/1.28  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.99/1.28  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.99/1.28  
% 0.99/1.28  ============================== end predicate elimination =============
% 0.99/1.28  
% 0.99/1.28  Auto_denials:  (non-Horn, no changes).
% 0.99/1.28  
% 0.99/1.28  Term ordering decisions:
% 0.99/1.28  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.
% 0.99/1.28  
% 0.99/1.28  ============================== end of process initial clauses ========
% 0.99/1.28  
% 0.99/1.28  ============================== CLAUSES FOR SEARCH ====================
% 0.99/1.28  
% 0.99/1.28  ============================== end of clauses for search =============
% 0.99/1.28  
% 0.99/1.28  ============================== SEARCH ================================
% 0.99/1.28  
% 0.99/1.28  % Starting search at 0.04 seconds.
% 0.99/1.28  
% 0.99/1.28  NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 2147483647 (0.00 of 0.22 sec).
% 99.59/99.91  
% 99.59/99.91  Low Water (keep): wt=48.000, iters=3455
% 99.59/99.91  
% 99.59/99.91  Low Water (keep): wt=25.000, iters=3373
% 99.59/99.91  
% 99.59/99.91  Low Water (keep): wt=24.000, iters=3348
% 99.59/99.91  
% 99.59/99.91  Low Water (keep): wt=23.000, iters=3368
% 99.59/99.91  
% 99.59/99.91  Low Water (keep): wt=22.000, iters=3338
% 99.59/99.91  
% 99.59/99.91  Low Water (keep): wt=21.000, iters=3376
% 99.59/99.91  
% 99.59/99.91  Low Water (keep): wt=20.000, iters=3380
% 99.59/99.91  
% 99.59/99.91  Low Water (keep): wt=19.000, iters=3354
% 99.59/99.91  
% 99.59/99.91  Low Water (keep): wt=17.000, iters=3346
% 99.59/99.91  
% 99.59/99.91  Low Water (keep): wt=16.000, iters=3351
% 99.59/99.91  
% 99.59/99.91  Low Water (keep): wt=15.000, iters=3338
% 99.59/99.91  
% 99.59/99.91  Low Water (displace): id=4736, wt=53.000
% 99.59/99.91  
% 99.59/99.91  Low Water (displace): id=13716, wt=14.000
% 99.59/99.91  
% 99.59/99.91  Low Water (displace): id=13726, wt=13.000
% 99.59/99.91  
% 99.59/99.91  Low Water (keep): wt=14.000, iters=3361
% 99.59/99.91  
% 99.59/99.91  Low Water (displace): id=14189, wt=11.000
% 99.59/99.91  
% 99.59/99.91  Low Water (displace): id=14299, wt=10.000
% 99.59/99.91  
% 99.59/99.91  Low Water (displace): id=14722, wt=9.000
% 99.59/99.91  
% 99.59/99.91  Low Water (keep): wt=13.000, iters=3343
% 99.59/99.91  
% 99.59/99.91  Low Water (displace): id=14934, wt=8.000
% 99.59/99.91  
% 99.59/99.91  Low Water (keep): wt=12.000, iters=3333
% 99.59/99.91  
% 99.59/99.91  Low Water (displace): id=20599, wt=5.000
% 99.59/99.91  
% 99.59/99.91  Low Water (keep): wt=11.000, iters=3338
% 99.59/99.91  
% 99.59/99.91  Low Water (keep): wt=10.000, iters=3356
% 99.59/99.91  
% 99.59/99.91  Low Water (keep): wt=9.000, iters=3340
% 99.59/99.91  
% 99.59/99.91  Low Water (keep): wt=8.000, iters=3333
% 99.59/99.91  
% 99.59/99.91  ============================== PROOF =================================
% 99.59/99.91  % SZS status Theorem
% 99.59/99.91  % SZS output start Refutation
% 99.59/99.91  
% 99.59/99.91  % Proof 1 at 98.31 (+ 0.55) seconds.
% 99.59/99.91  % Length of proof is 275.
% 99.59/99.91  % Level of proof is 29.
% 99.59/99.91  % Maximum clause weight is 29.000.
% 99.59/99.91  % Given clauses 48677.
% 99.59/99.91  
% 99.59/99.91  1 (all A all B all C (coll(A,B,C) -> coll(A,C,B))) # label(ruleD1) # label(axiom) # label(non_clause).  [assumption].
% 99.59/99.91  2 (all A all B all C (coll(A,B,C) -> coll(B,A,C))) # label(ruleD2) # label(axiom) # label(non_clause).  [assumption].
% 99.59/99.91  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].
% 99.59/99.91  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].
% 99.59/99.91  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].
% 99.59/99.91  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].
% 99.59/99.91  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].
% 99.59/99.91  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].
% 99.59/99.91  11 (all A all B all M (midp(M,B,A) -> midp(M,A,B))) # label(ruleD11) # label(axiom) # label(non_clause).  [assumption].
% 99.59/99.91  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].
% 99.59/99.91  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].
% 99.59/99.91  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].
% 99.59/99.91  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].
% 99.59/99.91  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].
% 99.59/99.91  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].
% 99.59/99.91  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].
% 99.59/99.91  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].
% 99.59/99.91  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].
% 99.59/99.91  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].
% 99.59/99.91  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].
% 99.59/99.91  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].
% 99.59/99.91  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].
% 99.59/99.91  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].
% 99.59/99.91  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].
% 99.59/99.91  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].
% 99.59/99.91  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].
% 99.59/99.91  67 (all A all B all C (para(A,B,A,C) -> coll(A,B,C))) # label(ruleD66) # label(axiom) # label(non_clause).  [assumption].
% 99.59/99.91  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].
% 99.59/99.91  69 (all A all B all C (midp(A,B,C) -> cong(A,B,A,C))) # label(ruleD68) # label(axiom) # label(non_clause).  [assumption].
% 99.59/99.91  70 (all A all B all C (midp(A,B,C) -> coll(A,B,C))) # label(ruleD69) # label(axiom) # label(non_clause).  [assumption].
% 99.59/99.91  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].
% 99.59/99.91  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].
% 99.59/99.91  95 -(all A all C all B all D all P all Q all R all S all O (perp(A,C,B,D) & midp(P,B,A) & midp(Q,C,B) & midp(R,D,C) & midp(S,A,D) & coll(O,P,R) & coll(O,Q,S) -> cong(O,S,O,R))) # label(exemplo6GDDFULL416049) # label(negated_conjecture) # label(non_clause).  [assumption].
% 99.59/99.91  109 -coll(A,B,C) | coll(A,C,B) # label(ruleD1) # label(axiom).  [clausify(1)].
% 99.59/99.91  110 -coll(A,B,C) | coll(B,A,C) # label(ruleD2) # label(axiom).  [clausify(2)].
% 99.59/99.91  111 -coll(A,B,C) | -coll(A,B,D) | coll(C,D,A) # label(ruleD3) # label(axiom).  [clausify(3)].
% 99.59/99.91  112 -para(A,B,C,D) | para(A,B,D,C) # label(ruleD4) # label(axiom).  [clausify(4)].
% 99.59/99.91  113 -para(A,B,C,D) | para(C,D,A,B) # label(ruleD5) # label(axiom).  [clausify(5)].
% 99.59/99.91  116 -perp(A,B,C,D) | perp(C,D,A,B) # label(ruleD8) # label(axiom).  [clausify(8)].
% 99.59/99.91  117 -perp(A,B,C,D) | -perp(C,D,E,F) | para(A,B,E,F) # label(ruleD9) # label(axiom).  [clausify(9)].
% 99.59/99.91  118 -para(A,B,C,D) | -perp(C,D,E,F) | perp(A,B,E,F) # label(ruleD10) # label(axiom).  [clausify(10)].
% 99.59/99.91  119 -midp(A,B,C) | midp(A,C,B) # label(ruleD11) # label(axiom).  [clausify(11)].
% 99.59/99.91  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)].
% 99.59/99.91  122 -cyclic(A,B,C,D) | cyclic(A,C,B,D) # label(ruleD15) # label(axiom).  [clausify(15)].
% 99.59/99.91  123 -cyclic(A,B,C,D) | cyclic(B,A,C,D) # label(ruleD16) # label(axiom).  [clausify(16)].
% 99.59/99.91  124 -cyclic(A,B,C,D) | -cyclic(A,B,C,E) | cyclic(B,C,D,E) # label(ruleD17) # label(axiom).  [clausify(17)].
% 99.59/99.91  130 -cong(A,B,C,D) | cong(A,B,D,C) # label(ruleD23) # label(axiom).  [clausify(23)].
% 99.59/99.91  131 -cong(A,B,C,D) | cong(C,D,A,B) # label(ruleD24) # label(axiom).  [clausify(24)].
% 99.59/99.91  132 -cong(A,B,C,D) | -cong(C,D,E,F) | cong(A,B,E,F) # label(ruleD25) # label(axiom).  [clausify(25)].
% 99.59/99.91  136 -eqratio(A,B,C,D,E,F,V6,V7) | eqratio(A,B,E,F,C,D,V6,V7) # label(ruleD29) # label(axiom).  [clausify(29)].
% 99.59/99.91  147 -para(A,B,C,D) | eqangle(A,B,E,F,C,D,E,F) # label(ruleD40) # label(axiom).  [clausify(40)].
% 99.59/99.91  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)].
% 99.59/99.91  152 -midp(A,B,C) | -midp(D,B,E) | para(A,D,C,E) # label(ruleD44) # label(axiom).  [clausify(45)].
% 99.59/99.91  153 -midp(A,B,C) | -para(A,D,C,E) | -coll(D,B,E) | midp(D,B,E) # label(ruleD45) # label(axiom).  [clausify(46)].
% 99.59/99.91  158 -midp(A,B,C) | -perp(D,A,B,C) | cong(D,B,D,C) # label(ruleD55) # label(axiom).  [clausify(56)].
% 99.59/99.91  159 -cong(A,B,C,B) | -cong(A,D,C,D) | perp(A,C,B,D) # label(ruleD56) # label(axiom).  [clausify(57)].
% 99.59/99.91  166 -midp(A,B,C) | -midp(A,D,E) | para(B,D,C,E) # label(ruleD63) # label(axiom).  [clausify(64)].
% 99.59/99.91  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)].
% 99.59/99.91  168 -para(A,B,C,D) | -coll(E,A,C) | -coll(E,B,D) | eqratio(E,A,A,C,E,B,B,D) # label(ruleD65) # label(axiom).  [clausify(66)].
% 99.59/99.91  169 -para(A,B,A,C) | coll(A,B,C) # label(ruleD66) # label(axiom).  [clausify(67)].
% 99.59/99.91  170 -cong(A,B,A,C) | -coll(A,B,C) | midp(A,B,C) # label(ruleD67) # label(axiom).  [clausify(68)].
% 99.59/99.91  171 -midp(A,B,C) | cong(A,B,A,C) # label(ruleD68) # label(axiom).  [clausify(69)].
% 99.59/99.91  172 -midp(A,B,C) | coll(A,B,C) # label(ruleD69) # label(axiom).  [clausify(70)].
% 99.59/99.91  177 -eqratio(A,B,C,D,E,F,V6,V7) | -cong(E,F,V6,V7) | cong(A,B,C,D) # label(ruleD75) # label(axiom).  [clausify(76)].
% 99.59/99.91  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)].
% 99.59/99.91  208 perp(c1,c2,c3,c4) # label(exemplo6GDDFULL416049) # label(negated_conjecture).  [clausify(95)].
% 99.59/99.91  209 midp(c5,c3,c1) # label(exemplo6GDDFULL416049) # label(negated_conjecture).  [clausify(95)].
% 99.59/99.91  210 midp(c6,c2,c3) # label(exemplo6GDDFULL416049) # label(negated_conjecture).  [clausify(95)].
% 99.59/99.91  211 midp(c7,c4,c2) # label(exemplo6GDDFULL416049) # label(negated_conjecture).  [clausify(95)].
% 99.59/99.91  212 midp(c8,c1,c4) # label(exemplo6GDDFULL416049) # label(negated_conjecture).  [clausify(95)].
% 99.59/99.91  213 coll(c9,c5,c7) # label(exemplo6GDDFULL416049) # label(negated_conjecture).  [clausify(95)].
% 99.59/99.91  214 coll(c9,c6,c8) # label(exemplo6GDDFULL416049) # label(negated_conjecture).  [clausify(95)].
% 99.59/99.91  215 -cong(c9,c8,c9,c7) # label(exemplo6GDDFULL416049) # label(negated_conjecture).  [clausify(95)].
% 99.59/99.91  254 -coll(A,B,C) | coll(C,C,A).  [factor(111,a,b)].
% 99.59/99.91  256 -cong(A,B,A,C) | -cong(A,B,A,D) | cyclic(B,C,C,D).  [factor(120,a,b)].
% 99.59/99.91  259 -cyclic(A,B,C,D) | cyclic(B,C,D,D).  [factor(124,a,b)].
% 99.59/99.91  262 -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)].
% 99.59/99.91  263 -midp(A,B,C) | para(A,A,C,C).  [factor(152,a,b)].
% 99.59/99.91  264 -cong(A,B,C,B) | perp(A,C,B,B).  [factor(159,a,b)].
% 99.59/99.91  267 -midp(A,B,C) | para(B,B,C,C).  [factor(166,a,b)].
% 99.59/99.91  268 -midp(A,B,C) | -para(B,D,C,D) | midp(A,D,D).  [factor(167,b,c)].
% 99.59/99.91  269 -para(A,A,B,B) | -coll(C,A,B) | eqratio(C,A,A,B,C,A,A,B).  [factor(168,b,c)].
% 99.59/99.91  274 -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)].
% 99.59/99.91  308 -cong(A,B,A,C) | cyclic(B,C,C,C).  [factor(256,a,b)].
% 99.59/99.91  328 -perp(A,B,c1,c2) | para(A,B,c3,c4).  [resolve(208,a,117,b)].
% 99.59/99.91  329 -perp(c3,c4,A,B) | para(c1,c2,A,B).  [resolve(208,a,117,a)].
% 99.59/99.91  330 perp(c3,c4,c1,c2).  [resolve(208,a,116,a)].
% 99.59/99.91  342 coll(c5,c3,c1).  [resolve(209,a,172,a)].
% 99.59/99.91  343 cong(c5,c3,c5,c1).  [resolve(209,a,171,a)].
% 99.59/99.91  344 -midp(c5,A,B) | para(A,c3,B,c1).  [resolve(209,a,166,b)].
% 99.59/99.91  345 -midp(c5,A,B) | para(c3,A,c1,B).  [resolve(209,a,166,a)].
% 99.59/99.91  348 midp(c5,c1,c3).  [resolve(209,a,119,a)].
% 99.59/99.91  360 coll(c6,c2,c3).  [resolve(210,a,172,a)].
% 99.59/99.91  361 cong(c6,c2,c6,c3).  [resolve(210,a,171,a)].
% 99.59/99.91  362 -midp(c6,A,B) | para(A,c2,B,c3).  [resolve(210,a,166,b)].
% 99.59/99.91  363 -midp(c6,A,B) | para(c2,A,c3,B).  [resolve(210,a,166,a)].
% 99.59/99.91  366 midp(c6,c3,c2).  [resolve(210,a,119,a)].
% 99.59/99.91  378 coll(c7,c4,c2).  [resolve(211,a,172,a)].
% 99.59/99.91  382 -midp(A,c4,B) | para(A,c7,B,c2).  [resolve(211,a,152,b)].
% 99.59/99.91  383 -midp(A,c4,B) | para(c7,A,c2,B).  [resolve(211,a,152,a)].
% 99.59/99.91  396 coll(c8,c1,c4).  [resolve(212,a,172,a)].
% 99.59/99.91  397 cong(c8,c1,c8,c4).  [resolve(212,a,171,a)].
% 99.59/99.91  402 midp(c8,c4,c1).  [resolve(212,a,119,a)].
% 99.59/99.91  404 -coll(c9,c5,A) | coll(A,c7,c9).  [resolve(213,a,111,b)].
% 99.59/99.91  410 coll(c6,c9,c8).  [resolve(214,a,110,a)].
% 99.59/99.91  411 coll(c9,c8,c6).  [resolve(214,a,109,a)].
% 99.59/99.91  412 coll(c8,c8,c9).  [resolve(254,a,214,a)].
% 99.59/99.91  414 para(c8,c8,c4,c4).  [resolve(263,a,212,a)].
% 99.59/99.91  438 -coll(c1,c1,c4) | -coll(c4,c1,c4) | midp(f7(c1,c4,c1,c4,c8,c8,A),c1,A).  [resolve(274,a,212,a)].
% 99.59/99.91  442 coll(c1,c1,c5).  [resolve(342,a,254,a)].
% 99.59/99.91  465 cong(c5,c1,c5,c3).  [resolve(348,a,171,a)].
% 99.59/99.91  466 -midp(c5,A,B) | para(A,c1,B,c3).  [resolve(348,a,166,b)].
% 99.59/99.91  467 -midp(c5,A,B) | para(c1,A,c3,B).  [resolve(348,a,166,a)].
% 99.59/99.91  470 coll(c3,c3,c6).  [resolve(360,a,254,a)].
% 99.59/99.91  493 cong(c6,c3,c6,c2).  [resolve(366,a,171,a)].
% 99.59/99.91  494 -midp(c6,A,B) | para(A,c3,B,c2).  [resolve(366,a,166,b)].
% 99.59/99.91  500 -coll(c7,c4,A) | coll(c2,A,c7).  [resolve(378,a,111,a)].
% 99.59/99.91  502 coll(c7,c2,c4).  [resolve(378,a,109,a)].
% 99.59/99.91  526 coll(c4,c4,c8).  [resolve(396,a,254,a)].
% 99.59/99.91  529 coll(c1,c8,c4).  [resolve(396,a,110,a)].
% 99.59/99.91  530 coll(c8,c4,c1).  [resolve(396,a,109,a)].
% 99.59/99.91  549 cong(c8,c4,c8,c1).  [resolve(402,a,171,a)].
% 99.59/99.91  563 -coll(c6,c9,A) | coll(A,c8,c6).  [resolve(410,a,111,b)].
% 99.59/99.91  568 -coll(c9,c8,A) | coll(c6,A,c9).  [resolve(411,a,111,a)].
% 99.59/99.91  571 -coll(c8,c8,A) | coll(A,c9,c8).  [resolve(412,a,111,b)].
% 99.59/99.91  572 -coll(c8,c8,A) | coll(c9,A,c8).  [resolve(412,a,111,a)].
% 99.59/99.91  579 -coll(c1,c1,A) | coll(A,c5,c1).  [resolve(442,a,111,b)].
% 99.59/99.91  581 coll(c1,c5,c1).  [resolve(442,a,109,a)].
% 99.59/99.91  594 coll(c3,c6,c3).  [resolve(470,a,109,a)].
% 99.59/99.91  613 coll(c4,c4,c7).  [resolve(502,a,254,a)].
% 99.59/99.91  617 coll(c8,c8,c4).  [resolve(526,a,254,a)].
% 99.59/99.91  618 -coll(c4,c4,A) | coll(A,c8,c4).  [resolve(526,a,111,b)].
% 99.59/99.91  621 coll(c4,c4,c1).  [resolve(529,a,254,a)].
% 99.59/99.91  624 coll(c1,c4,c8).  [resolve(529,a,109,a)].
% 99.59/99.91  626 coll(c1,c1,c8).  [resolve(530,a,254,a)].
% 99.59/99.91  676 coll(c5,c1,c1).  [resolve(581,a,110,a)].
% 99.59/99.91  697 coll(c6,c3,c3).  [resolve(594,a,110,a)].
% 99.59/99.91  719 para(c1,c2,c1,c2).  [resolve(330,a,329,a)].
% 99.59/99.91  720 para(c3,c4,c3,c4).  [resolve(330,a,328,a)].
% 99.59/99.91  765 coll(c8,c4,c8).  [resolve(617,a,109,a)].
% 99.59/99.91  770 coll(c1,c1,c4).  [resolve(621,a,254,a)].
% 99.59/99.91  773 coll(c4,c1,c4).  [resolve(621,a,109,a)].
% 99.59/99.91  774 midp(f7(c1,c4,c1,c4,c8,c8,A),c1,A).  [back_unit_del(438),unit_del(a,770),unit_del(b,773)].
% 99.59/99.91  775 coll(c8,c8,c1).  [resolve(624,a,254,a)].
% 99.59/99.91  1033 -cong(A,B,c5,c3) | cong(A,B,c5,c1).  [resolve(343,a,132,b)].
% 99.59/99.91  1046 coll(c4,c8,c8).  [resolve(765,a,110,a)].
% 99.59/99.91  1048 para(c1,c3,c3,c1).  [resolve(344,a,348,a)].
% 99.59/99.91  1061 coll(c8,c1,c8).  [resolve(775,a,109,a)].
% 99.59/99.91  1062 para(c3,c1,c1,c3).  [resolve(345,a,348,a)].
% 99.59/99.91  1172 coll(c1,c8,c8).  [resolve(1061,a,110,a)].
% 99.59/99.91  1294 -cong(A,B,c6,c2) | cong(A,B,c6,c3).  [resolve(361,a,132,b)].
% 99.59/99.91  1295 -cong(c6,c3,A,B) | cong(c6,c2,A,B).  [resolve(361,a,132,a)].
% 99.59/99.91  1296 cong(c6,c2,c3,c6).  [resolve(361,a,130,a)].
% 99.59/99.91  1466 -cong(A,B,c8,c1) | cong(A,B,c8,c4).  [resolve(397,a,132,b)].
% 99.59/99.91  1468 cong(c8,c1,c4,c8).  [resolve(397,a,130,a)].
% 99.59/99.91  1485 para(c4,c4,c8,c8).  [resolve(414,a,113,a)].
% 99.59/99.91  1777 -cong(c6,c3,c6,A) | cyclic(c3,A,A,c2).  [resolve(493,a,256,b)].
% 99.59/99.91  2026 cong(c8,c4,c1,c8).  [resolve(549,a,130,a)].
% 99.59/99.91  2032 -midp(A,c1,c1) | midp(A,c2,c2).  [resolve(719,a,268,b)].
% 99.59/99.91  2039 coll(c1,c2,c2).  [resolve(719,a,169,a)].
% 99.59/99.91  2042 eqangle(c1,c2,A,B,c1,c2,A,B).  [resolve(719,a,147,a)].
% 99.59/99.91  2044 coll(c2,c2,c1).  [resolve(2039,a,254,a)].
% 99.59/99.91  2050 coll(c1,c1,c2).  [resolve(2044,a,254,a)].
% 99.59/99.91  2057 coll(c1,c2,c1).  [resolve(2050,a,109,a)].
% 99.59/99.91  2060 coll(c2,c1,c1).  [resolve(2057,a,110,a)].
% 99.59/99.91  2070 -midp(A,c3,c3) | midp(A,c4,c4).  [resolve(720,a,268,b)].
% 99.59/99.91  2214 para(c1,c3,c1,c3).  [resolve(1048,a,112,a)].
% 99.59/99.91  2230 para(c3,c1,c3,c1).  [resolve(1062,a,112,a)].
% 99.59/99.91  2325 cong(c3,c6,c6,c2).  [resolve(1296,a,131,a)].
% 99.59/99.91  2443 cong(c4,c8,c8,c1).  [resolve(1468,a,131,a)].
% 99.59/99.91  2448 -coll(A,c4,c8) | eqratio(A,c4,c4,c8,A,c4,c4,c8).  [resolve(1485,a,269,a)].
% 99.59/99.91  2811 para(c8,c7,c1,c2).  [resolve(382,a,402,a)].
% 99.59/99.91  2845 cong(c1,c8,c8,c4).  [resolve(2026,a,131,a)].
% 99.59/99.91  2877 para(c7,c8,c2,c1).  [resolve(383,a,402,a)].
% 99.59/99.91  2977 -midp(A,c1,c1) | midp(A,c3,c3).  [resolve(2214,a,268,b)].
% 99.59/99.91  2993 -midp(A,c3,c3) | midp(A,c1,c1).  [resolve(2230,a,268,b)].
% 99.59/99.91  3130 cong(c3,c6,c2,c6).  [resolve(2325,a,130,a)].
% 99.59/99.91  3533 para(c1,c2,c8,c7).  [resolve(2811,a,113,a)].
% 99.59/99.91  3534 para(c8,c7,c2,c1).  [resolve(2811,a,112,a)].
% 99.59/99.91  3554 cong(c1,c8,c4,c8).  [resolve(2845,a,130,a)].
% 99.59/99.91  3588 para(c7,c8,c1,c2).  [resolve(2877,a,112,a)].
% 99.59/99.91  3732 -cong(c3,A,c2,A) | perp(c3,c2,c6,A).  [resolve(3130,a,159,a)].
% 99.59/99.91  4035 -midp(c1,A,c8) | -coll(c2,A,c7) | midp(c2,A,c7).  [resolve(3533,a,153,b)].
% 99.59/99.91  4054 -perp(c2,c1,A,B) | perp(c8,c7,A,B).  [resolve(3534,a,118,a)].
% 99.59/99.91  4079 perp(c1,c4,c8,c8).  [resolve(3554,a,264,a)].
% 99.59/99.91  4128 -perp(c1,c2,A,B) | perp(c7,c8,A,B).  [resolve(3588,a,118,a)].
% 99.59/99.91  4864 -midp(c4,c8,c8) | cong(c1,c8,c1,c8).  [resolve(4079,a,158,b)].
% 99.59/99.91  5779 coll(c4,c9,c8).  [resolve(571,a,617,a)].
% 99.59/99.91  5786 coll(c9,c4,c8).  [resolve(5779,a,110,a)].
% 99.59/99.91  6395 coll(c8,c5,c1).  [resolve(579,a,626,a)].
% 99.59/99.91  6426 coll(c5,c8,c1).  [resolve(6395,a,110,a)].
% 99.59/99.91  6468 coll(c5,c1,c8).  [resolve(6426,a,109,a)].
% 99.59/99.91  6553 coll(c8,c8,c5).  [resolve(6468,a,254,a)].
% 99.59/99.91  6705 coll(c9,c5,c8).  [resolve(6553,a,572,a)].
% 99.59/99.91  6761 coll(c8,c7,c9).  [resolve(6705,a,404,a)].
% 99.59/99.91  6814 coll(c8,c9,c7).  [resolve(6761,a,109,a)].
% 99.59/99.91  6846 coll(c9,c8,c7).  [resolve(6814,a,110,a)].
% 99.59/99.91  6879 coll(c6,c7,c9).  [resolve(6846,a,568,a)].
% 99.59/99.91  6908 coll(c6,c9,c7).  [resolve(6879,a,109,a)].
% 99.59/99.91  6948 coll(c7,c8,c6).  [resolve(6908,a,563,a)].
% 99.59/99.91  7085 coll(c7,c6,c8).  [resolve(6948,a,109,a)].
% 99.59/99.91  7120 coll(c6,c7,c8).  [resolve(7085,a,110,a)].
% 99.59/99.91  7647 coll(c7,c8,c4).  [resolve(618,a,613,a)].
% 99.59/99.91  7786 coll(c7,c4,c8).  [resolve(7647,a,109,a)].
% 99.59/99.91  7902 coll(c2,c8,c7).  [resolve(7786,a,500,a)].
% 99.59/99.91  8714 para(c1,c1,A,A).  [resolve(774,a,267,a)].
% 99.59/99.91  8741 -perp(A,A,B,C) | perp(c1,c1,B,C).  [resolve(8714,a,118,a)].
% 99.59/99.91  10858 cong(c5,c1,c5,c1).  [resolve(1033,a,465,a)].
% 99.59/99.91  10878 midp(c5,c1,c1).  [resolve(10858,a,170,a),unit_del(a,676)].
% 99.59/99.91  10887 midp(c5,c2,c2).  [resolve(10878,a,2032,a)].
% 99.59/99.91  10922 para(c1,c1,c1,c3).  [resolve(10878,a,466,a)].
% 99.59/99.91  10967 para(c1,c3,c1,c1).  [resolve(10878,a,344,a)].
% 99.59/99.91  11238 para(c1,c2,c3,c2).  [resolve(10887,a,467,a)].
% 99.59/99.91  11493 -midp(A,c1,c1) | midp(A,c3,c1).  [resolve(10922,a,167,c),unit_del(b,10967)].
% 99.59/99.91  11531 -perp(c1,c1,A,B) | perp(c1,c3,A,B).  [resolve(10967,a,118,a)].
% 99.59/99.91  11812 -perp(c3,c2,A,B) | perp(c1,c2,A,B).  [resolve(11238,a,118,a)].
% 99.59/99.91  12836 cong(c6,c3,c6,c3).  [resolve(1294,a,493,a)].
% 99.59/99.91  12867 midp(c6,c3,c3).  [resolve(12836,a,170,a),unit_del(a,697)].
% 99.59/99.91  12875 midp(c6,c1,c1).  [resolve(12867,a,2993,a)].
% 99.59/99.91  12876 midp(c6,c4,c4).  [resolve(12867,a,2070,a)].
% 99.59/99.91  12901 para(c3,c3,c3,c2).  [resolve(12867,a,494,a)].
% 99.59/99.91  12944 para(c3,c2,c3,c3).  [resolve(12867,a,362,a)].
% 99.59/99.91  13158 para(c2,c1,c3,c1).  [resolve(12875,a,363,a)].
% 99.59/99.91  13288 cong(c6,c4,c6,c4).  [resolve(12876,a,171,a)].
% 99.59/99.91  13443 -midp(A,c3,c3) | midp(A,c2,c3).  [resolve(12901,a,167,c),unit_del(b,12944)].
% 99.59/99.91  13615 para(c2,c1,c1,c3).  [resolve(13158,a,112,a)].
% 99.59/99.91  13723 cong(c6,c4,c4,c6).  [resolve(13288,a,130,a)].
% 99.59/99.91  13987 -perp(c1,c3,A,B) | perp(c2,c1,A,B).  [resolve(13615,a,118,a)].
% 99.59/99.91  14078 cong(c4,c6,c6,c4).  [resolve(13723,a,131,a)].
% 99.59/99.91  14129 cong(c4,c6,c4,c6).  [resolve(14078,a,130,a)].
% 99.59/99.91  14252 -cong(c4,A,c4,A) | perp(c4,c4,A,c6).  [resolve(14129,a,159,b)].
% 99.59/99.91  16280 cong(c4,c8,c8,c4).  [resolve(1466,a,2443,a)].
% 99.59/99.91  16284 cong(c4,c8,c4,c8).  [resolve(16280,a,130,a)].
% 99.59/99.91  16709 midp(c4,c8,c8).  [resolve(16284,a,170,a),unit_del(a,1046)].
% 99.59/99.91  16713 cong(c1,c8,c1,c8).  [back_unit_del(4864),unit_del(a,16709)].
% 99.59/99.91  17077 midp(c1,c8,c8).  [resolve(16713,a,170,a),unit_del(a,1172)].
% 99.59/99.91  19854 midp(c6,c3,c1).  [resolve(11493,a,12875,a)].
% 99.59/99.91  20151 cong(c6,c3,c6,c1).  [resolve(19854,a,171,a)].
% 99.59/99.91  20645 cong(c6,c3,c1,c6).  [resolve(20151,a,130,a)].
% 99.59/99.91  21145 cong(c6,c2,c1,c6).  [resolve(20645,a,1295,a)].
% 99.59/99.91  21430 cong(c6,c2,c6,c1).  [resolve(21145,a,130,a)].
% 99.59/99.91  21707 cyclic(c2,c1,c1,c1).  [resolve(21430,a,308,a)].
% 99.59/99.91  22256 cyclic(c3,c1,c1,c2).  [resolve(1777,a,20151,a)].
% 99.59/99.91  22452 cyclic(c1,c1,c2,c2).  [resolve(22256,a,259,a)].
% 99.59/99.91  22654 cyclic(c1,c2,c1,c2).  [resolve(22452,a,122,a)].
% 99.59/99.91  22775 cyclic(c2,c1,c1,c2).  [resolve(22654,a,123,a)].
% 99.59/99.91  24409 cong(c2,c1,c2,c1).  [resolve(2042,a,262,c),unit_del(a,22775),unit_del(b,21707)].
% 99.59/99.91  24626 midp(c2,c1,c1).  [resolve(24409,a,170,a),unit_del(a,2060)].
% 99.59/99.91  24641 midp(c2,c3,c3).  [resolve(24626,a,2977,a)].
% 99.59/99.91  24806 midp(c2,c2,c3).  [resolve(24641,a,13443,a)].
% 99.59/99.91  24892 cong(c2,c2,c2,c3).  [resolve(24806,a,171,a)].
% 99.59/99.91  26176 cong(c2,c2,c3,c2).  [resolve(24892,a,130,a)].
% 99.59/99.91  26722 cong(c3,c2,c2,c2).  [resolve(26176,a,131,a)].
% 99.59/99.91  28122 eqratio(c9,c4,c4,c8,c9,c4,c4,c8).  [resolve(2448,a,5786,a)].
% 99.59/99.91  32312 perp(c3,c2,c6,c2).  [resolve(3732,a,26722,a)].
% 99.59/99.91  32961 midp(c2,c8,c7).  [resolve(4035,a,17077,a),unit_del(a,7902)].
% 99.59/99.91  32963 midp(c2,c7,c8).  [resolve(32961,a,119,a)].
% 99.59/99.91  40868 perp(c1,c2,c6,c2).  [resolve(11812,a,32312,a)].
% 99.59/99.91  41014 perp(c7,c8,c6,c2).  [resolve(40868,a,4128,a)].
% 99.59/99.91  41122 perp(c6,c2,c7,c8).  [resolve(41014,a,116,a)].
% 99.59/99.91  41219 cong(c6,c7,c6,c8).  [resolve(41122,a,158,b),unit_del(a,32963)].
% 99.59/99.91  41384 midp(c6,c7,c8).  [resolve(41219,a,170,a),unit_del(a,7120)].
% 99.59/99.91  41390 midp(c6,c8,c7).  [resolve(41384,a,119,a)].
% 99.59/99.91  59461 eqratio(c9,c4,c9,c4,c4,c8,c4,c8).  [resolve(28122,a,136,a)].
% 99.59/99.91  72919 cong(c9,c4,c9,c4).  [resolve(59461,a,177,a),unit_del(a,16284)].
% 99.59/99.91  72920 cong(c9,c4,c4,c9).  [resolve(72919,a,130,a)].
% 99.59/99.91  72921 cong(c4,c9,c9,c4).  [resolve(72920,a,131,a)].
% 99.59/99.91  72922 cong(c4,c9,c4,c9).  [resolve(72921,a,130,a)].
% 99.59/99.91  72924 perp(c4,c4,c9,c6).  [resolve(72922,a,14252,a)].
% 99.59/99.91  72944 perp(c1,c1,c9,c6).  [resolve(72924,a,8741,a)].
% 99.59/99.91  73028 perp(c1,c3,c9,c6).  [resolve(72944,a,11531,a)].
% 99.59/99.91  73205 perp(c2,c1,c9,c6).  [resolve(73028,a,13987,a)].
% 99.59/99.91  73990 perp(c8,c7,c9,c6).  [resolve(73205,a,4054,a)].
% 99.59/99.91  75048 perp(c9,c6,c8,c7).  [resolve(73990,a,116,a)].
% 99.59/99.91  75374 $F.  [resolve(75048,a,158,b),unit_del(a,41390),unit_del(b,215)].
% 99.59/99.91  
% 99.59/99.91  % SZS output end Refutation
% 99.59/99.91  ============================== end of proof ==========================
% 99.59/99.91  
% 99.59/99.91  ============================== STATISTICS ============================
% 99.59/99.91  
% 99.59/99.91  Given=48677. Generated=1072381. Kept=75257. proofs=1.
% 99.59/99.91  Usable=46711. Sos=8242. Demods=0. Limbo=0, Disabled=20455. Hints=0.
% 99.59/99.91  Megabytes=33.49.
% 99.59/99.91  User_CPU=98.31, System_CPU=0.55, Wall_clock=98.
% 99.59/99.91  
% 99.59/99.91  ============================== end of statistics =====================
% 99.59/99.91  
% 99.59/99.91  ============================== end of search =========================
% 99.59/99.91  
% 99.59/99.91  THEOREM PROVED
% 99.59/99.91  % SZS status Theorem
% 99.59/99.91  
% 99.59/99.91  Exiting with 1 proof.
% 99.59/99.91  
% 99.59/99.91  Process 3122 exit (max_proofs) Sat Jun 18 03:10:56 2022
% 99.59/99.91  Prover9 interrupted
%------------------------------------------------------------------------------