TSTP Solution File: GEO652+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GEO652+1 : TPTP v8.1.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n029.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:25 EDT 2022
% Result : Theorem 7.62s 7.94s
% Output : Refutation 7.62s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : GEO652+1 : TPTP v8.1.0. Released v7.5.0.
% 0.08/0.15 % Command : tptp2X_and_run_prover9 %d %s
% 0.15/0.36 % Computer : n029.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Sat Jun 18 02:52:13 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.50/1.12 ============================== Prover9 ===============================
% 0.50/1.12 Prover9 (32) version 2009-11A, November 2009.
% 0.50/1.12 Process 9815 was started by sandbox2 on n029.cluster.edu,
% 0.50/1.12 Sat Jun 18 02:52:14 2022
% 0.50/1.12 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_9662_n029.cluster.edu".
% 0.50/1.12 ============================== end of head ===========================
% 0.50/1.12
% 0.50/1.12 ============================== INPUT =================================
% 0.50/1.12
% 0.50/1.12 % Reading from file /tmp/Prover9_9662_n029.cluster.edu
% 0.50/1.12
% 0.50/1.12 set(prolog_style_variables).
% 0.50/1.12 set(auto2).
% 0.50/1.12 % set(auto2) -> set(auto).
% 0.50/1.12 % set(auto) -> set(auto_inference).
% 0.50/1.12 % set(auto) -> set(auto_setup).
% 0.50/1.12 % set(auto_setup) -> set(predicate_elim).
% 0.50/1.12 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.50/1.12 % set(auto) -> set(auto_limits).
% 0.50/1.12 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.50/1.12 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.50/1.12 % set(auto) -> set(auto_denials).
% 0.50/1.12 % set(auto) -> set(auto_process).
% 0.50/1.12 % set(auto2) -> assign(new_constants, 1).
% 0.50/1.12 % set(auto2) -> assign(fold_denial_max, 3).
% 0.50/1.12 % set(auto2) -> assign(max_weight, "200.000").
% 0.50/1.12 % set(auto2) -> assign(max_hours, 1).
% 0.50/1.12 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.50/1.12 % set(auto2) -> assign(max_seconds, 0).
% 0.50/1.12 % set(auto2) -> assign(max_minutes, 5).
% 0.50/1.12 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.50/1.12 % set(auto2) -> set(sort_initial_sos).
% 0.50/1.12 % set(auto2) -> assign(sos_limit, -1).
% 0.50/1.12 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.50/1.12 % set(auto2) -> assign(max_megs, 400).
% 0.50/1.12 % set(auto2) -> assign(stats, some).
% 0.50/1.12 % set(auto2) -> clear(echo_input).
% 0.50/1.12 % set(auto2) -> set(quiet).
% 0.50/1.12 % set(auto2) -> clear(print_initial_clauses).
% 0.50/1.12 % set(auto2) -> clear(print_given).
% 0.50/1.12 assign(lrs_ticks,-1).
% 0.50/1.12 assign(sos_limit,10000).
% 0.50/1.12 assign(order,kbo).
% 0.50/1.12 set(lex_order_vars).
% 0.50/1.12 clear(print_given).
% 0.50/1.12
% 0.50/1.12 % formulas(sos). % not echoed (95 formulas)
% 0.50/1.12
% 0.50/1.12 ============================== end of input ==========================
% 0.50/1.12
% 0.50/1.12 % From the command line: assign(max_seconds, 300).
% 0.50/1.12
% 0.50/1.12 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.50/1.12
% 0.50/1.12 % Formulas that are not ordinary clauses:
% 0.50/1.12 1 (all A all B all C (coll(A,B,C) -> coll(A,C,B))) # label(ruleD1) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.12 2 (all A all B all C (coll(A,B,C) -> coll(B,A,C))) # label(ruleD2) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.12 3 (all A all B all C all D (coll(A,B,C) & coll(A,B,D) -> coll(C,D,A))) # label(ruleD3) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.12 4 (all A all B all C all D (para(A,B,C,D) -> para(A,B,D,C))) # label(ruleD4) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.12 5 (all A all B all C all D (para(A,B,C,D) -> para(C,D,A,B))) # label(ruleD5) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.12 6 (all A all B all C all D all E all F (para(A,B,C,D) & para(C,D,E,F) -> para(A,B,E,F))) # label(ruleD6) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.12 7 (all A all B all C all D (perp(A,B,C,D) -> perp(A,B,D,C))) # label(ruleD7) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.12 8 (all A all B all C all D (perp(A,B,C,D) -> perp(C,D,A,B))) # label(ruleD8) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.12 9 (all A all B all C all D all E all F (perp(A,B,C,D) & perp(C,D,E,F) -> para(A,B,E,F))) # label(ruleD9) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.12 10 (all A all B all C all D all E all F (para(A,B,C,D) & perp(C,D,E,F) -> perp(A,B,E,F))) # label(ruleD10) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.12 11 (all A all B all M (midp(M,B,A) -> midp(M,A,B))) # label(ruleD11) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.12 12 (all A all B all C all O (cong(O,A,O,B) & cong(O,A,O,C) -> circle(O,A,B,C))) # label(ruleD12) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.12 13 (all A all B all C all D all O (cong(O,A,O,B) & cong(O,A,O,C) & cong(O,A,O,D) -> cyclic(A,B,C,D))) # label(ruleD13) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.12 14 (all A all B all C all D (cyclic(A,B,C,D) -> cyclic(A,B,D,C))) # label(ruleD14) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.12 15 (all A all B all C all D (cyclic(A,B,C,D) -> cyclic(A,C,B,D))) # label(ruleD15) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.12 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.50/1.12 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.50/1.12 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.50/1.12 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.50/1.12 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.50/1.12 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.50/1.12 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.50/1.12 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.50/1.12 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.50/1.12 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.50/1.12 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.50/1.12 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.50/1.12 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.50/1.12 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.50/1.12 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.50/1.12 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.50/1.12 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.50/1.12 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.50/1.12 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.50/1.12 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.50/1.12 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.50/1.12 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.50/1.12 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.50/1.12 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.50/1.12 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.50/1.12 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.50/1.12 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.50/1.12 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.50/1.12 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.50/1.12 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.50/1.12 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.50/1.12 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.50/1.12 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.50/1.12 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.50/1.12 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.50/1.12 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.50/1.12 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.50/1.12 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.50/1.12 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.50/1.12 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.50/1.12 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.50/1.12 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.50/1.12 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.50/1.12 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.50/1.12 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.50/1.12 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.50/1.12 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.50/1.12 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.50/1.12 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.50/1.12 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.50/1.13 66 (all A all B all C all D all O (para(A,B,C,D) & coll(O,A,C) & coll(O,B,D) -> eqratio(O,A,A,C,O,B,B,D))) # label(ruleD65) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.13 67 (all A all B all C (para(A,B,A,C) -> coll(A,B,C))) # label(ruleD66) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.13 68 (all A all B all C (cong(A,B,A,C) & coll(A,B,C) -> midp(A,B,C))) # label(ruleD67) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.13 69 (all A all B all C (midp(A,B,C) -> cong(A,B,A,C))) # label(ruleD68) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.13 70 (all A all B all C (midp(A,B,C) -> coll(A,B,C))) # label(ruleD69) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.13 71 (all A all B all C all D all M all N (midp(M,A,B) & midp(N,C,D) -> eqratio(M,A,A,B,N,C,C,D))) # label(ruleD70) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.13 72 (all A all B all C all D (eqangle(A,B,C,D,C,D,A,B) & -para(A,B,C,D) -> perp(A,B,C,D))) # label(ruleD71) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.13 73 (all A all B all C all D (eqangle(A,B,C,D,C,D,A,B) & -perp(A,B,C,D) -> para(A,B,C,D))) # label(ruleD72) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.13 74 (all A all B all C all D all P all Q all U all V (eqangle(A,B,C,D,P,Q,U,V) & para(P,Q,U,V) -> para(A,B,C,D))) # label(ruleD73) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.13 75 (all A all B all C all D all P all Q all U all V (eqangle(A,B,C,D,P,Q,U,V) & perp(P,Q,U,V) -> perp(A,B,C,D))) # label(ruleD74) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.13 76 (all A all B all C all D all P all Q all U all V (eqratio(A,B,C,D,P,Q,U,V) & cong(P,Q,U,V) -> cong(A,B,C,D))) # label(ruleD75) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.13 77 (all A all M all O all X exists B (perp(O,M,M,A) & eqangle(X,O,M,O,M,O,A,O) -> coll(B,A,M) & coll(B,O,X))) # label(ruleX1) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.13 78 (all A all B all O all X exists M (cong(O,A,O,B) & eqangle(A,O,O,X,O,X,O,B) -> coll(B,A,M) & coll(M,O,X))) # label(ruleX2) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.13 79 (all A all B all O all X exists M (perp(O,X,A,B) & eqangle(A,O,O,X,O,X,O,B) -> coll(B,A,M) & coll(M,O,X))) # label(ruleX3) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.13 80 (all A all B all O all X exists M (perp(O,X,A,B) & cong(O,A,O,B) -> coll(B,A,M) & coll(M,O,X))) # label(ruleX4) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.13 81 (all A all B all P all X all Y exists Q (eqangle(A,P,B,P,A,X,B,Y) & -coll(A,B,P) -> eqangle(A,P,B,P,A,Q,B,Q) & cyclic(X,B,P,Q))) # label(ruleX5) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.13 82 (all A all B all C all D all M all N exists P (midp(M,A,B) & midp(N,C,D) -> midp(P,A,D) & para(P,M,B,D) & para(P,N,A,C))) # label(ruleX6) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.13 83 (all A all B all C all D all M all N all Q exists P (midp(M,A,B) & midp(N,C,D) & coll(C,A,B) & coll(D,A,B) -> midp(P,A,Q))) # label(ruleX7) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.13 84 (all A all B all M all P all Q all R all M exists X (midp(M,A,B) & para(A,P,R,M) & para(A,P,B,Q) & coll(P,Q,R) -> coll(X,A,Q) & coll(X,M,R))) # label(ruleX8) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.13 85 (all A all B all C all D all O exists P (cong(O,C,O,D) & perp(A,B,B,O) -> cong(O,C,O,P) & para(P,C,A,B) & cong(B,C,B,P))) # label(ruleX9) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.13 86 (all A all B all C all H exists P exists Q (perp(A,H,B,C) & perp(B,H,A,C) -> coll(P,C,B) & perp(A,P,C,B) & coll(Q,C,A) & perp(B,Q,C,A))) # label(ruleX10) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.13 87 (all A all B all C all O exists P (circle(O,A,B,C) -> perp(P,A,A,O))) # label(ruleX11) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.13 88 (all A all B all C all D all M all N exists P exists Q (circle(M,A,B,C) & cong(M,A,M,D) & cong(N,A,N,B) & M != N -> coll(P,A,C) & cong(P,N,N,A) & coll(Q,B,D) & cong(Q,N,N,A))) # label(ruleX12) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.13 89 (all A all B all C all D all M exists O (cyclic(A,B,C,D) & para(A,B,C,D) & midp(M,A,B) -> circle(O,A,B,C))) # label(ruleX13) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.13 90 (all A all B all C all D exists O (perp(A,C,C,B) & cyclic(A,B,C,D) -> circle(O,A,B,C))) # label(ruleX14) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.13 91 (all A all B all C all E all F exists P (perp(A,C,C,B) & coll(B,E,F) -> coll(P,E,F) & perp(P,A,E,F))) # label(ruleX15) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.13 92 (all A all B all C all D all M exists P (perp(A,B,A,C) & perp(C,A,C,D) & midp(M,B,D) -> midp(P,A,C))) # label(ruleX16) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.13 93 (all A all B all O exists C (cong(O,A,O,B) & perp(A,O,O,B) -> coll(A,O,C) & cong(O,A,O,C))) # label(ruleX17) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.13 94 (all A all B all C all D all P all Q exists R (para(A,B,C,D) & coll(P,A,C) & coll(P,B,D) & coll(Q,A,B) -> coll(P,Q,R) & coll(R,C,D))) # label(ruleX18) # label(axiom) # label(non_clause). [assumption].
% 0.50/1.13 95 -(all A all B all C all D all E all F all G all H all I all J all NWPNT1 all NWPNT2 all NWPNT3 all NWPNT4 all NWPNT5 all NWPNT6 all NWPNT7 all NWPNT8 all NWPNT9 all NWPNT01 all NWPNT11 all NWPNT21 (circle(A,B,NWPNT1,NWPNT2) & circle(C,B,NWPNT3,NWPNT4) & circle(A,B,D,NWPNT5) & circle(C,B,D,NWPNT6) & circle(C,B,E,NWPNT7) & circle(C,B,F,NWPNT8) & coll(D,E,G) & circle(A,D,G,NWPNT9) & coll(B,F,H) & circle(A,B,H,NWPNT01) & coll(D,H,I) & circle(C,D,I,NWPNT11) & coll(B,G,J) & circle(C,B,J,NWPNT21) -> para(E,F,I,J))) # label(exemplo6GDDFULLmoreE02213) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.50/1.13
% 0.50/1.13 ============================== end of process non-clausal formulas ===
% 0.50/1.13
% 0.50/1.13 ============================== PROCESS INITIAL CLAUSES ===============
% 0.50/1.13
% 0.50/1.13 ============================== PREDICATE ELIMINATION =================
% 0.50/1.13 96 -circle(A,B,C,D) | -perp(A,B,B,E) | eqangle(B,E,B,C,D,B,D,C) # label(ruleD48) # label(axiom). [clausify(49)].
% 0.50/1.13 97 -cong(A,B,A,C) | -cong(A,B,A,D) | circle(A,B,C,D) # label(ruleD12) # label(axiom). [clausify(12)].
% 0.50/1.13 Derived: -perp(A,B,B,C) | eqangle(B,C,B,D,E,B,E,D) | -cong(A,B,A,D) | -cong(A,B,A,E). [resolve(96,a,97,c)].
% 0.50/1.13 98 -circle(A,B,C,D) | -eqangle(B,E,B,C,D,B,D,C) | perp(A,B,B,E) # label(ruleD49) # label(axiom). [clausify(50)].
% 0.50/1.13 Derived: -eqangle(A,B,A,C,D,A,D,C) | perp(E,A,A,B) | -cong(E,A,E,C) | -cong(E,A,E,D). [resolve(98,a,97,c)].
% 0.50/1.13 99 -circle(A,B,C,D) | -midp(E,C,D) | eqangle(B,C,B,D,A,C,A,E) # label(ruleD50) # label(axiom). [clausify(51)].
% 0.50/1.13 Derived: -midp(A,B,C) | eqangle(D,B,D,C,E,B,E,A) | -cong(E,D,E,B) | -cong(E,D,E,C). [resolve(99,a,97,c)].
% 0.50/1.13 100 -circle(A,B,C,D) | -coll(E,C,D) | -eqangle(B,C,B,D,A,C,A,E) | midp(E,C,D) # label(ruleD51) # label(axiom). [clausify(52)].
% 0.50/1.13 Derived: -coll(A,B,C) | -eqangle(D,B,D,C,E,B,E,A) | midp(A,B,C) | -cong(E,D,E,B) | -cong(E,D,E,C). [resolve(100,a,97,c)].
% 0.50/1.13 101 -circle(A,B,C,D) | -coll(A,B,D) | perp(B,C,C,D) # label(ruleD53) # label(axiom). [clausify(54)].
% 0.50/1.13 Derived: -coll(A,B,C) | perp(B,D,D,C) | -cong(A,B,A,D) | -cong(A,B,A,C). [resolve(101,a,97,c)].
% 0.50/1.13 102 -circle(A,B,C,D) | perp(f12(B,C,D,A),B,B,A) # label(ruleX11) # label(axiom). [clausify(87)].
% 0.50/1.13 Derived: perp(f12(A,B,C,D),A,A,D) | -cong(D,A,D,B) | -cong(D,A,D,C). [resolve(102,a,97,c)].
% 0.50/1.13 103 -circle(A,B,C,D) | -cong(A,B,A,E) | -cong(F,B,F,C) | F = A | coll(f13(B,C,D,E,A,F),B,D) # label(ruleX12) # label(axiom). [clausify(88)].
% 0.50/1.13 Derived: -cong(A,B,A,C) | -cong(D,B,D,E) | D = A | coll(f13(B,E,F,C,A,D),B,F) | -cong(A,B,A,E) | -cong(A,B,A,F). [resolve(103,a,97,c)].
% 0.50/1.13 104 -circle(A,B,C,D) | -cong(A,B,A,E) | -cong(F,B,F,C) | F = A | cong(f13(B,C,D,E,A,F),F,F,B) # label(ruleX12) # label(axiom). [clausify(88)].
% 0.50/1.13 Derived: -cong(A,B,A,C) | -cong(D,B,D,E) | D = A | cong(f13(B,E,F,C,A,D),D,D,B) | -cong(A,B,A,E) | -cong(A,B,A,F). [resolve(104,a,97,c)].
% 0.50/1.13 105 -circle(A,B,C,D) | -cong(A,B,A,E) | -cong(F,B,F,C) | F = A | coll(f14(B,C,D,E,A,F),C,E) # label(ruleX12) # label(axiom). [clausify(88)].
% 0.50/1.13 Derived: -cong(A,B,A,C) | -cong(D,B,D,E) | D = A | coll(f14(B,E,F,C,A,D),E,C) | -cong(A,B,A,E) | -cong(A,B,A,F). [resolve(105,a,97,c)].
% 0.50/1.13 106 -circle(A,B,C,D) | -cong(A,B,A,E) | -cong(F,B,F,C) | F = A | cong(f14(B,C,D,E,A,F),F,F,B) # label(ruleX12) # label(axiom). [clausify(88)].
% 0.50/1.13 Derived: -cong(A,B,A,C) | -cong(D,B,D,E) | D = A | cong(f14(B,E,F,C,A,D),D,D,B) | -cong(A,B,A,E) | -cong(A,B,A,F). [resolve(106,a,97,c)].
% 0.50/1.13 107 -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | circle(f15(A,B,C,D,E),A,B,C) # label(ruleX13) # label(axiom). [clausify(89)].
% 0.50/1.13 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.50/1.13 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.50/1.13 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.50/1.13 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.50/1.13 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.50/1.13 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.50/1.13 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.50/1.13 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.50/1.13 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.50/1.13 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.50/1.13 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.50/1.13 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.50/1.13 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.50/1.13 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.50/1.13 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.50/1.13 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.50/1.13 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.50/1.13 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.50/1.13 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.50/1.13 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.50/1.13 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.50/1.13 109 circle(c1,c2,c11,c12) # label(exemplo6GDDFULLmoreE02213) # label(negated_conjecture). [clausify(95)].
% 0.50/1.13 Derived: -perp(c1,c2,c2,A) | eqangle(c2,A,c2,c11,c12,c2,c12,c11). [resolve(109,a,96,a)].
% 0.50/1.13 Derived: -eqangle(c2,A,c2,c11,c12,c2,c12,c11) | perp(c1,c2,c2,A). [resolve(109,a,98,a)].
% 0.50/1.13 Derived: -midp(A,c11,c12) | eqangle(c2,c11,c2,c12,c1,c11,c1,A). [resolve(109,a,99,a)].
% 0.50/1.13 Derived: -coll(A,c11,c12) | -eqangle(c2,c11,c2,c12,c1,c11,c1,A) | midp(A,c11,c12). [resolve(109,a,100,a)].
% 0.50/1.13 Derived: -coll(c1,c2,c12) | perp(c2,c11,c11,c12). [resolve(109,a,101,a)].
% 0.50/1.13 Derived: perp(f12(c2,c11,c12,c1),c2,c2,c1). [resolve(109,a,102,a)].
% 0.50/1.13 Derived: -cong(c1,c2,c1,A) | -cong(B,c2,B,c11) | B = c1 | coll(f13(c2,c11,c12,A,c1,B),c2,c12). [resolve(109,a,103,a)].
% 0.50/1.13 Derived: -cong(c1,c2,c1,A) | -cong(B,c2,B,c11) | B = c1 | cong(f13(c2,c11,c12,A,c1,B),B,B,c2). [resolve(109,a,104,a)].
% 0.50/1.13 Derived: -cong(c1,c2,c1,A) | -cong(B,c2,B,c11) | B = c1 | coll(f14(c2,c11,c12,A,c1,B),c11,A). [resolve(109,a,105,a)].
% 0.50/1.13 Derived: -cong(c1,c2,c1,A) | -cong(B,c2,B,c11) | B = c1 | cong(f14(c2,c11,c12,A,c1,B),B,B,c2). [resolve(109,a,106,a)].
% 0.50/1.13 110 circle(c3,c2,c13,c14) # label(exemplo6GDDFULLmoreE02213) # label(negated_conjecture). [clausify(95)].
% 0.50/1.13 Derived: -perp(c3,c2,c2,A) | eqangle(c2,A,c2,c13,c14,c2,c14,c13). [resolve(110,a,96,a)].
% 0.50/1.13 Derived: -eqangle(c2,A,c2,c13,c14,c2,c14,c13) | perp(c3,c2,c2,A). [resolve(110,a,98,a)].
% 0.50/1.13 Derived: -midp(A,c13,c14) | eqangle(c2,c13,c2,c14,c3,c13,c3,A). [resolve(110,a,99,a)].
% 0.50/1.13 Derived: -coll(A,c13,c14) | -eqangle(c2,c13,c2,c14,c3,c13,c3,A) | midp(A,c13,c14). [resolve(110,a,100,a)].
% 0.50/1.13 Derived: -coll(c3,c2,c14) | perp(c2,c13,c13,c14). [resolve(110,a,101,a)].
% 0.50/1.13 Derived: perp(f12(c2,c13,c14,c3),c2,c2,c3). [resolve(110,a,102,a)].
% 0.50/1.13 Derived: -cong(c3,c2,c3,A) | -cong(B,c2,B,c13) | B = c3 | coll(f13(c2,c13,c14,A,c3,B),c2,c14). [resolve(110,a,103,a)].
% 0.50/1.13 Derived: -cong(c3,c2,c3,A) | -cong(B,c2,B,c13) | B = c3 | cong(f13(c2,c13,c14,A,c3,B),B,B,c2). [resolve(110,a,104,a)].
% 0.50/1.13 Derived: -cong(c3,c2,c3,A) | -cong(B,c2,B,c13) | B = c3 | coll(f14(c2,c13,c14,A,c3,B),c13,A). [resolve(110,a,105,a)].
% 0.50/1.13 Derived: -cong(c3,c2,c3,A) | -cong(B,c2,B,c13) | B = c3 | cong(f14(c2,c13,c14,A,c3,B),B,B,c2). [resolve(110,a,106,a)].
% 0.50/1.13 111 circle(c1,c2,c4,c15) # label(exemplo6GDDFULLmoreE02213) # label(negated_conjecture). [clausify(95)].
% 0.50/1.13 Derived: -perp(c1,c2,c2,A) | eqangle(c2,A,c2,c4,c15,c2,c15,c4). [resolve(111,a,96,a)].
% 0.50/1.13 Derived: -eqangle(c2,A,c2,c4,c15,c2,c15,c4) | perp(c1,c2,c2,A). [resolve(111,a,98,a)].
% 0.50/1.13 Derived: -midp(A,c4,c15) | eqangle(c2,c4,c2,c15,c1,c4,c1,A). [resolve(111,a,99,a)].
% 0.50/1.13 Derived: -coll(A,c4,c15) | -eqangle(c2,c4,c2,c15,c1,c4,c1,A) | midp(A,c4,c15). [resolve(111,a,100,a)].
% 0.50/1.13 Derived: -coll(c1,c2,c15) | perp(c2,c4,c4,c15). [resolve(111,a,101,a)].
% 0.50/1.13 Derived: perp(f12(c2,c4,c15,c1),c2,c2,c1). [resolve(111,a,102,a)].
% 0.50/1.13 Derived: -cong(c1,c2,c1,A) | -cong(B,c2,B,c4) | B = c1 | coll(f13(c2,c4,c15,A,c1,B),c2,c15). [resolve(111,a,103,a)].
% 0.50/1.13 Derived: -cong(c1,c2,c1,A) | -cong(B,c2,B,c4) | B = c1 | cong(f13(c2,c4,c15,A,c1,B),B,B,c2). [resolve(111,a,104,a)].
% 0.50/1.13 Derived: -cong(c1,c2,c1,A) | -cong(B,c2,B,c4) | B = c1 | coll(f14(c2,c4,c15,A,c1,B),c4,A). [resolve(111,a,105,a)].
% 0.50/1.13 Derived: -cong(c1,c2,c1,A) | -cong(B,c2,B,c4) | B = c1 | cong(f14(c2,c4,c15,A,c1,B),B,B,c2). [resolve(111,a,106,a)].
% 0.50/1.13 112 circle(c3,c2,c4,c16) # label(exemplo6GDDFULLmoreE02213) # label(negated_conjecture). [clausify(95)].
% 0.50/1.13 Derived: -perp(c3,c2,c2,A) | eqangle(c2,A,c2,c4,c16,c2,c16,c4). [resolve(112,a,96,a)].
% 0.50/1.13 Derived: -eqangle(c2,A,c2,c4,c16,c2,c16,c4) | perp(c3,c2,c2,A). [resolve(112,a,98,a)].
% 0.50/1.13 Derived: -midp(A,c4,c16) | eqangle(c2,c4,c2,c16,c3,c4,c3,A). [resolve(112,a,99,a)].
% 0.50/1.13 Derived: -coll(A,c4,c16) | -eqangle(c2,c4,c2,c16,c3,c4,c3,A) | midp(A,c4,c16). [resolve(112,a,100,a)].
% 0.50/1.13 Derived: -coll(c3,c2,c16) | perp(c2,c4,c4,c16). [resolve(112,a,101,a)].
% 0.50/1.13 Derived: perp(f12(c2,c4,c16,c3),c2,c2,c3). [resolve(112,a,102,a)].
% 0.50/1.13 Derived: -cong(c3,c2,c3,A) | -cong(B,c2,B,c4) | B = c3 | coll(f13(c2,c4,c16,A,c3,B),c2,c16). [resolve(112,a,103,a)].
% 0.50/1.13 Derived: -cong(c3,c2,c3,A) | -cong(B,c2,B,c4) | B = c3 | cong(f13(c2,c4,c16,A,c3,B),B,B,c2). [resolve(112,a,104,a)].
% 0.50/1.13 Derived: -cong(c3,c2,c3,A) | -cong(B,c2,B,c4) | B = c3 | coll(f14(c2,c4,c16,A,c3,B),c4,A). [resolve(112,a,105,a)].
% 0.50/1.13 Derived: -cong(c3,c2,c3,A) | -cong(B,c2,B,c4) | B = c3 | cong(f14(c2,c4,c16,A,c3,B),B,B,c2). [resolve(112,a,106,a)].
% 0.50/1.13 113 circle(c3,c2,c5,c17) # label(exemplo6GDDFULLmoreE02213) # label(negated_conjecture). [clausify(95)].
% 0.50/1.13 Derived: -perp(c3,c2,c2,A) | eqangle(c2,A,c2,c5,c17,c2,c17,c5). [resolve(113,a,96,a)].
% 0.50/1.13 Derived: -eqangle(c2,A,c2,c5,c17,c2,c17,c5) | perp(c3,c2,c2,A). [resolve(113,a,98,a)].
% 0.50/1.13 Derived: -midp(A,c5,c17) | eqangle(c2,c5,c2,c17,c3,c5,c3,A). [resolve(113,a,99,a)].
% 0.50/1.13 Derived: -coll(A,c5,c17) | -eqangle(c2,c5,c2,c17,c3,c5,c3,A) | midp(A,c5,c17). [resolve(113,a,100,a)].
% 0.50/1.13 Derived: -coll(c3,c2,c17) | perp(c2,c5,c5,c17). [resolve(113,a,101,a)].
% 0.50/1.13 Derived: perp(f12(c2,c5,c17,c3),c2,c2,c3). [resolve(113,a,102,a)].
% 0.50/1.13 Derived: -cong(c3,c2,c3,A) | -cong(B,c2,B,c5) | B = c3 | coll(f13(c2,c5,c17,A,c3,B),c2,c17). [resolve(113,a,103,a)].
% 0.50/1.13 Derived: -cong(c3,c2,c3,A) | -cong(B,c2,B,c5) | B = c3 | cong(f13(c2,c5,c17,A,c3,B),B,B,c2). [resolve(113,a,104,a)].
% 0.50/1.13 Derived: -cong(c3,c2,c3,A) | -cong(B,c2,B,c5) | B = c3 | coll(f14(c2,c5,c17,A,c3,B),c5,A). [resolve(113,a,105,a)].
% 0.50/1.13 Derived: -cong(c3,c2,c3,A) | -cong(B,c2,B,c5) | B = c3 | cong(f14(c2,c5,c17,A,c3,B),B,B,c2). [resolve(113,a,106,a)].
% 0.50/1.13 114 circle(c3,c2,c6,c18) # label(exemplo6GDDFULLmoreE02213) # label(negated_conjecture). [clausify(95)].
% 0.50/1.13 Derived: -perp(c3,c2,c2,A) | eqangle(c2,A,c2,c6,c18,c2,c18,c6). [resolve(114,a,96,a)].
% 0.50/1.13 Derived: -eqangle(c2,A,c2,c6,c18,c2,c18,c6) | perp(c3,c2,c2,A). [resolve(114,a,98,a)].
% 0.50/1.13 Derived: -midp(A,c6,c18) | eqangle(c2,c6,c2,c18,c3,c6,c3,A). [resolve(114,a,99,a)].
% 0.50/1.13 Derived: -coll(A,c6,c18) | -eqangle(c2,c6,c2,c18,c3,c6,c3,A) | midp(A,c6,c18). [resolve(114,a,100,a)].
% 0.50/1.13 Derived: -coll(c3,c2,c18) | perp(c2,c6,c6,c18). [resolve(114,a,101,a)].
% 0.50/1.13 Derived: perp(f12(c2,c6,c18,c3),c2,c2,c3). [resolve(114,a,102,a)].
% 0.50/1.13 Derived: -cong(c3,c2,c3,A) | -cong(B,c2,B,c6) | B = c3 | coll(f13(c2,c6,c18,A,c3,B),c2,c18). [resolve(114,a,103,a)].
% 0.50/1.13 Derived: -cong(c3,c2,c3,A) | -cong(B,c2,B,c6) | B = c3 | cong(f13(c2,c6,c18,A,c3,B),B,B,c2). [resolve(114,a,104,a)].
% 0.50/1.13 Derived: -cong(c3,c2,c3,A) | -cong(B,c2,B,c6) | B = c3 | coll(f14(c2,c6,c18,A,c3,B),c6,A). [resolve(114,a,105,a)].
% 0.50/1.13 Derived: -cong(c3,c2,c3,A) | -cong(B,c2,B,c6) | B = c3 | cong(f14(c2,c6,c18,A,c3,B),B,B,c2). [resolve(114,a,106,a)].
% 0.50/1.13 115 circle(c1,c4,c7,c19) # label(exemplo6GDDFULLmoreE02213) # label(negated_conjecture). [clausify(95)].
% 0.50/1.13 Derived: -perp(c1,c4,c4,A) | eqangle(c4,A,c4,c7,c19,c4,c19,c7). [resolve(115,a,96,a)].
% 0.50/1.13 Derived: -eqangle(c4,A,c4,c7,c19,c4,c19,c7) | perp(c1,c4,c4,A). [resolve(115,a,98,a)].
% 0.50/1.13 Derived: -midp(A,c7,c19) | eqangle(c4,c7,c4,c19,c1,c7,c1,A). [resolve(115,a,99,a)].
% 0.50/1.13 Derived: -coll(A,c7,c19) | -eqangle(c4,c7,c4,c19,c1,c7,c1,A) | midp(A,c7,c19). [resolve(115,a,100,a)].
% 0.50/1.13 Derived: -coll(c1,c4,c19) | perp(c4,c7,c7,c19). [resolve(115,a,101,a)].
% 0.50/1.13 Derived: perp(f12(c4,c7,c19,c1),c4,c4,c1). [resolve(115,a,102,a)].
% 0.50/1.13 Derived: -cong(c1,c4,c1,A) | -cong(B,c4,B,c7) | B = c1 | coll(f13(c4,c7,c19,A,c1,B),c4,c19). [resolve(115,a,103,a)].
% 0.50/1.13 Derived: -cong(c1,c4,c1,A) | -cong(B,c4,B,c7) | B = c1 | cong(f13(c4,c7,c19,A,c1,B),B,B,c4). [resolve(115,a,104,a)].
% 0.50/1.13 Derived: -cong(c1,c4,c1,A) | -cong(B,c4,B,c7) | B = c1 | coll(f14(c4,c7,c19,A,c1,B),c7,A). [resolve(115,a,105,a)].
% 0.50/1.13 Derived: -cong(c1,c4,c1,A) | -cong(B,c4,B,c7) | B = c1 | cong(f14(c4,c7,c19,A,c1,B),B,B,c4). [resolve(115,a,106,a)].
% 0.50/1.13 116 circle(c1,c2,c8,c20) # label(exemplo6GDDFULLmoreE02213) # label(negated_conjecture). [clausify(95)].
% 0.50/1.13 Derived: -perp(c1,c2,c2,A) | eqangle(c2,A,c2,c8,c20,c2,c20,c8). [resolve(116,a,96,a)].
% 0.50/1.13 Derived: -eqangle(c2,A,c2,c8,c20,c2,c20,c8) | perp(c1,c2,c2,A). [resolve(116,a,98,a)].
% 0.50/1.13 Derived: -midp(A,c8,c20) | eqangle(c2,c8,c2,c20,c1,c8,c1,A). [resolve(116,a,99,a)].
% 0.50/1.13 Derived: -coll(A,c8,c20) | -eqangle(c2,c8,c2,c20,c1,c8,c1,A) | midp(A,c8,c20). [resolve(116,a,100,a)].
% 0.50/1.13 Derived: -coll(c1,c2,c20) | perp(c2,c8,c8,c20). [resolve(116,a,101,a)].
% 0.50/1.13 Derived: perp(f12(c2,c8,c20,c1),c2,c2,c1). [resolve(116,a,102,a)].
% 0.50/1.13 Derived: -cong(c1,c2,c1,A) | -cong(B,c2,B,c8) | B = c1 | coll(f13(c2,c8,c20,A,c1,B),c2,c20). [resolve(116,a,103,a)].
% 0.50/1.13 Derived: -cong(c1,c2,c1,A) | -cong(B,c2,B,c8) | B = c1 | cong(f13(c2,c8,c20,A,c1,B),B,B,c2). [resolve(116,a,104,a)].
% 0.50/1.13 Derived: -cong(c1,c2,c1,A) | -cong(B,c2,B,c8) | B = c1 | coll(f14(c2,c8,c20,A,c1,B),c8,A). [resolve(116,a,105,a)].
% 4.39/4.68 Derived: -cong(c1,c2,c1,A) | -cong(B,c2,B,c8) | B = c1 | cong(f14(c2,c8,c20,A,c1,B),B,B,c2). [resolve(116,a,106,a)].
% 4.39/4.68 117 circle(c3,c4,c9,c21) # label(exemplo6GDDFULLmoreE02213) # label(negated_conjecture). [clausify(95)].
% 4.39/4.68 Derived: -perp(c3,c4,c4,A) | eqangle(c4,A,c4,c9,c21,c4,c21,c9). [resolve(117,a,96,a)].
% 4.39/4.68 Derived: -eqangle(c4,A,c4,c9,c21,c4,c21,c9) | perp(c3,c4,c4,A). [resolve(117,a,98,a)].
% 4.39/4.68 Derived: -midp(A,c9,c21) | eqangle(c4,c9,c4,c21,c3,c9,c3,A). [resolve(117,a,99,a)].
% 4.39/4.68 Derived: -coll(A,c9,c21) | -eqangle(c4,c9,c4,c21,c3,c9,c3,A) | midp(A,c9,c21). [resolve(117,a,100,a)].
% 4.39/4.68 Derived: -coll(c3,c4,c21) | perp(c4,c9,c9,c21). [resolve(117,a,101,a)].
% 4.39/4.68 Derived: perp(f12(c4,c9,c21,c3),c4,c4,c3). [resolve(117,a,102,a)].
% 4.39/4.68 Derived: -cong(c3,c4,c3,A) | -cong(B,c4,B,c9) | B = c3 | coll(f13(c4,c9,c21,A,c3,B),c4,c21). [resolve(117,a,103,a)].
% 4.39/4.68 Derived: -cong(c3,c4,c3,A) | -cong(B,c4,B,c9) | B = c3 | cong(f13(c4,c9,c21,A,c3,B),B,B,c4). [resolve(117,a,104,a)].
% 4.39/4.68 Derived: -cong(c3,c4,c3,A) | -cong(B,c4,B,c9) | B = c3 | coll(f14(c4,c9,c21,A,c3,B),c9,A). [resolve(117,a,105,a)].
% 4.39/4.68 Derived: -cong(c3,c4,c3,A) | -cong(B,c4,B,c9) | B = c3 | cong(f14(c4,c9,c21,A,c3,B),B,B,c4). [resolve(117,a,106,a)].
% 4.39/4.68 118 circle(c3,c2,c10,c22) # label(exemplo6GDDFULLmoreE02213) # label(negated_conjecture). [clausify(95)].
% 4.39/4.68 Derived: -perp(c3,c2,c2,A) | eqangle(c2,A,c2,c10,c22,c2,c22,c10). [resolve(118,a,96,a)].
% 4.39/4.68 Derived: -eqangle(c2,A,c2,c10,c22,c2,c22,c10) | perp(c3,c2,c2,A). [resolve(118,a,98,a)].
% 4.39/4.68 Derived: -midp(A,c10,c22) | eqangle(c2,c10,c2,c22,c3,c10,c3,A). [resolve(118,a,99,a)].
% 4.39/4.68 Derived: -coll(A,c10,c22) | -eqangle(c2,c10,c2,c22,c3,c10,c3,A) | midp(A,c10,c22). [resolve(118,a,100,a)].
% 4.39/4.68 Derived: -coll(c3,c2,c22) | perp(c2,c10,c10,c22). [resolve(118,a,101,a)].
% 4.39/4.68 Derived: perp(f12(c2,c10,c22,c3),c2,c2,c3). [resolve(118,a,102,a)].
% 4.39/4.68 Derived: -cong(c3,c2,c3,A) | -cong(B,c2,B,c10) | B = c3 | coll(f13(c2,c10,c22,A,c3,B),c2,c22). [resolve(118,a,103,a)].
% 4.39/4.68 Derived: -cong(c3,c2,c3,A) | -cong(B,c2,B,c10) | B = c3 | cong(f13(c2,c10,c22,A,c3,B),B,B,c2). [resolve(118,a,104,a)].
% 4.39/4.68 Derived: -cong(c3,c2,c3,A) | -cong(B,c2,B,c10) | B = c3 | coll(f14(c2,c10,c22,A,c3,B),c10,A). [resolve(118,a,105,a)].
% 4.39/4.68 Derived: -cong(c3,c2,c3,A) | -cong(B,c2,B,c10) | B = c3 | cong(f14(c2,c10,c22,A,c3,B),B,B,c2). [resolve(118,a,106,a)].
% 4.39/4.68
% 4.39/4.68 ============================== end predicate elimination =============
% 4.39/4.68
% 4.39/4.68 Auto_denials: (non-Horn, no changes).
% 4.39/4.68
% 4.39/4.68 Term ordering decisions:
% 4.39/4.68 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. c9=1. c10=1. c11=1. c12=1. c13=1. c14=1. c15=1. c16=1. c17=1. c18=1. c19=1. c20=1. c21=1. c22=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.
% 4.39/4.68
% 4.39/4.68 ============================== end of process initial clauses ========
% 4.39/4.68
% 4.39/4.68 ============================== CLAUSES FOR SEARCH ====================
% 4.39/4.68
% 4.39/4.68 ============================== end of clauses for search =============
% 4.39/4.68
% 4.39/4.68 ============================== SEARCH ================================
% 4.39/4.68
% 4.39/4.68 % Starting search at 0.06 seconds.
% 4.39/4.68
% 4.39/4.68 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 2147483647 (0.00 of 0.16 sec).
% 4.39/4.68
% 4.39/4.68 Low Water (keep): wt=57.000, iters=3336
% 4.39/4.68
% 4.39/4.68 Low Water (keep): wt=49.000, iters=3344
% 4.39/4.68
% 4.39/4.68 Low Water (keep): wt=48.000, iters=3452
% 4.39/4.68
% 4.39/4.68 Low Water (keep): wt=44.000, iters=3365
% 4.39/4.68
% 4.39/4.68 Low Water (keep): wt=39.000, iters=3339
% 4.39/4.68
% 4.39/4.68 Low Water (keep): wt=31.000, iters=3345
% 4.39/4.68
% 4.39/4.68 Low Water (keep): wt=26.000, iters=3354
% 4.39/4.68
% 4.39/4.68 Low Water (keep): wt=23.000, iters=3346
% 4.39/4.68
% 4.39/4.68 Low Water (keep): wt=22.000, iters=3341
% 4.39/4.68
% 4.39/4.68 Low Water (keep): wt=21.000, iters=3335
% 4.39/4.68
% 4.39/4.68 Low Water (keep): wt=18.000, iters=3338
% 4.39/4.68
% 4.39/4.68 Low Water (keep): wt=17.000, iters=3333
% 4.39/4.68
% 4.39/4.68 Low Water (keep): wt=16.000, iters=3340
% 4.39/4.68
% 4.39/4.68 Low Water (displace): id=8955, wt=57.000
% 4.39/4.68
% 4.39/4.68 Low Water (displace): id=9147, wt=49.000
% 4.39/4.68
% 4.39/4.68 Low Water (displace): id=17329, wt=13.000
% 4.39/4.68
% 4.39/4.68 Low Water (keep): wt=15.000, iters=3335
% 4.39/4.68
% 4.39/4.68 Low Water (keep): wt=14.000, iters=3333
% 4.39/4.68
% 4.39/4.68 Low Water (keep): wt=13.000, iters=3335
% 4.39/4.68
% 4.39/4.68 Low Water (displace): id=19017, wt=10.000
% 4.39/4.68
% 4.39/4.68 Low Water (displace): id=19679, wt=9.000
% 4.39/4.68
% 4.39/4.68 Low Water (displace): id=19741, wt=8.000
% 7.62/7.94
% 7.62/7.94 Low Water (displace): id=20106, wt=7.000
% 7.62/7.94
% 7.62/7.94 Low Water (displace): id=20114, wt=5.000
% 7.62/7.94
% 7.62/7.94 Low Water (keep): wt=12.000, iters=3356
% 7.62/7.94
% 7.62/7.94 Low Water (keep): wt=11.000, iters=3333
% 7.62/7.94
% 7.62/7.94 Low Water (keep): wt=10.000, iters=3333
% 7.62/7.94
% 7.62/7.94 ============================== PROOF =================================
% 7.62/7.94 % SZS status Theorem
% 7.62/7.94 % SZS output start Refutation
% 7.62/7.94
% 7.62/7.94 % Proof 1 at 6.74 (+ 0.10) seconds.
% 7.62/7.94 % Length of proof is 115.
% 7.62/7.94 % Level of proof is 31.
% 7.62/7.94 % Maximum clause weight is 29.000.
% 7.62/7.94 % Given clauses 10525.
% 7.62/7.94
% 7.62/7.94 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].
% 7.62/7.94 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].
% 7.62/7.94 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].
% 7.62/7.94 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].
% 7.62/7.94 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].
% 7.62/7.94 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].
% 7.62/7.94 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].
% 7.62/7.94 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].
% 7.62/7.94 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].
% 7.62/7.94 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].
% 7.62/7.94 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].
% 7.62/7.94 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].
% 7.62/7.94 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].
% 7.62/7.94 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].
% 7.62/7.94 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].
% 7.62/7.94 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].
% 7.62/7.94 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].
% 7.62/7.94 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].
% 7.62/7.94 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].
% 7.62/7.94 67 (all A all B all C (para(A,B,A,C) -> coll(A,B,C))) # label(ruleD66) # label(axiom) # label(non_clause). [assumption].
% 7.62/7.94 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].
% 7.62/7.94 95 -(all A all B all C all D all E all F all G all H all I all J all NWPNT1 all NWPNT2 all NWPNT3 all NWPNT4 all NWPNT5 all NWPNT6 all NWPNT7 all NWPNT8 all NWPNT9 all NWPNT01 all NWPNT11 all NWPNT21 (circle(A,B,NWPNT1,NWPNT2) & circle(C,B,NWPNT3,NWPNT4) & circle(A,B,D,NWPNT5) & circle(C,B,D,NWPNT6) & circle(C,B,E,NWPNT7) & circle(C,B,F,NWPNT8) & coll(D,E,G) & circle(A,D,G,NWPNT9) & coll(B,F,H) & circle(A,B,H,NWPNT01) & coll(D,H,I) & circle(C,D,I,NWPNT11) & coll(B,G,J) & circle(C,B,J,NWPNT21) -> para(E,F,I,J))) # label(exemplo6GDDFULLmoreE02213) # label(negated_conjecture) # label(non_clause). [assumption].
% 7.62/7.94 102 -circle(A,B,C,D) | perp(f12(B,C,D,A),B,B,A) # label(ruleX11) # label(axiom). [clausify(87)].
% 7.62/7.94 109 circle(c1,c2,c11,c12) # label(exemplo6GDDFULLmoreE02213) # label(negated_conjecture). [clausify(95)].
% 7.62/7.94 121 -coll(A,B,C) | -coll(A,B,D) | coll(C,D,A) # label(ruleD3) # label(axiom). [clausify(3)].
% 7.62/7.94 122 -para(A,B,C,D) | para(A,B,D,C) # label(ruleD4) # label(axiom). [clausify(4)].
% 7.62/7.94 123 -para(A,B,C,D) | para(C,D,A,B) # label(ruleD5) # label(axiom). [clausify(5)].
% 7.62/7.94 124 -para(A,B,C,D) | -para(C,D,E,F) | para(A,B,E,F) # label(ruleD6) # label(axiom). [clausify(6)].
% 7.62/7.94 126 -perp(A,B,C,D) | perp(C,D,A,B) # label(ruleD8) # label(axiom). [clausify(8)].
% 7.62/7.94 127 -perp(A,B,C,D) | -perp(C,D,E,F) | para(A,B,E,F) # label(ruleD9) # label(axiom). [clausify(9)].
% 7.62/7.94 131 -cyclic(A,B,C,D) | cyclic(A,B,D,C) # label(ruleD14) # label(axiom). [clausify(14)].
% 7.62/7.94 132 -cyclic(A,B,C,D) | cyclic(A,C,B,D) # label(ruleD15) # label(axiom). [clausify(15)].
% 7.62/7.94 133 -cyclic(A,B,C,D) | cyclic(B,A,C,D) # label(ruleD16) # label(axiom). [clausify(16)].
% 7.62/7.94 134 -cyclic(A,B,C,D) | -cyclic(A,B,C,E) | cyclic(B,C,D,E) # label(ruleD17) # label(axiom). [clausify(17)].
% 7.62/7.94 136 -eqangle(A,B,C,D,E,F,V6,V7) | eqangle(C,D,A,B,V6,V7,E,F) # label(ruleD19) # label(axiom). [clausify(19)].
% 7.62/7.94 138 -eqangle(A,B,C,D,E,F,V6,V7) | eqangle(A,B,E,F,C,D,V6,V7) # label(ruleD21) # label(axiom). [clausify(21)].
% 7.62/7.94 140 -cong(A,B,C,D) | cong(A,B,D,C) # label(ruleD23) # label(axiom). [clausify(23)].
% 7.62/7.94 141 -cong(A,B,C,D) | cong(C,D,A,B) # label(ruleD24) # label(axiom). [clausify(24)].
% 7.62/7.94 156 -eqangle(A,B,C,D,E,F,C,D) | para(A,B,E,F) # label(ruleD39) # label(axiom). [clausify(39)].
% 7.62/7.94 157 -para(A,B,C,D) | eqangle(A,B,E,F,C,D,E,F) # label(ruleD40) # label(axiom). [clausify(40)].
% 7.62/7.94 160 -eqangle(A,B,A,C,D,B,D,C) | -coll(A,D,C) | cyclic(B,C,A,D) # label(ruleD42b) # label(axiom). [clausify(43)].
% 7.62/7.94 161 -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)].
% 7.62/7.94 169 -cong(A,B,C,B) | -cong(A,D,C,D) | perp(A,C,B,D) # label(ruleD56) # label(axiom). [clausify(57)].
% 7.62/7.94 179 -para(A,B,A,C) | coll(A,B,C) # label(ruleD66) # label(axiom). [clausify(67)].
% 7.62/7.94 221 coll(c2,c7,c10) # label(exemplo6GDDFULLmoreE02213) # label(negated_conjecture). [clausify(95)].
% 7.62/7.94 222 -para(c5,c6,c9,c10) # label(exemplo6GDDFULLmoreE02213) # label(negated_conjecture). [clausify(95)].
% 7.62/7.94 266 perp(f12(c2,c11,c12,c1),c2,c2,c1). [resolve(109,a,102,a)].
% 7.62/7.94 401 -coll(A,B,C) | coll(C,C,A). [factor(121,a,b)].
% 7.62/7.94 406 -cyclic(A,B,C,D) | cyclic(B,C,D,D). [factor(134,a,b)].
% 7.62/7.94 411 -cong(A,B,C,B) | perp(A,C,B,B). [factor(169,a,b)].
% 7.62/7.94 500 -perp(A,B,f12(c2,c11,c12,c1),c2) | para(A,B,c2,c1). [resolve(266,a,127,b)].
% 7.62/7.94 502 perp(c2,c1,f12(c2,c11,c12,c1),c2). [resolve(266,a,126,a)].
% 7.62/7.94 730 coll(c10,c10,c2). [resolve(401,a,221,a)].
% 7.62/7.94 766 coll(c2,c2,c10). [resolve(730,a,401,a)].
% 7.62/7.94 1015 para(c2,c1,c2,c1). [resolve(502,a,500,a)].
% 7.62/7.94 1039 coll(c2,c1,c1). [resolve(1015,a,179,a)].
% 7.62/7.94 1042 eqangle(c2,c1,A,B,c2,c1,A,B). [resolve(1015,a,157,a)].
% 7.62/7.94 1043 para(c2,c1,c1,c2). [resolve(1015,a,122,a)].
% 7.62/7.94 1044 coll(c1,c1,c2). [resolve(1039,a,401,a)].
% 7.62/7.94 1052 coll(c2,c2,c1). [resolve(1044,a,401,a)].
% 7.62/7.94 1054 -coll(c1,c1,A) | coll(c2,A,c1). [resolve(1044,a,121,a)].
% 7.62/7.94 1110 para(c1,c2,c2,c1). [resolve(1043,a,123,a)].
% 7.62/7.94 1126 para(c1,c2,c1,c2). [resolve(1110,a,122,a)].
% 7.62/7.94 1138 eqangle(c1,c2,A,B,c1,c2,A,B). [resolve(1126,a,157,a)].
% 7.62/7.94 5086 -coll(c2,c2,A) | cyclic(c1,A,c2,c2). [resolve(1042,a,160,a)].
% 7.62/7.94 5087 eqangle(c2,c1,c2,c1,A,B,A,B). [resolve(1042,a,138,a)].
% 7.62/7.94 5088 eqangle(A,B,c2,c1,A,B,c2,c1). [resolve(1042,a,136,a)].
% 7.62/7.94 5831 eqangle(A,B,c1,c2,A,B,c1,c2). [resolve(1138,a,136,a)].
% 7.62/7.94 17713 cyclic(c1,c1,c2,c2). [resolve(5086,a,1052,a)].
% 7.62/7.94 17718 cyclic(c1,c10,c2,c2). [resolve(5086,a,766,a)].
% 7.62/7.94 17755 -cyclic(c1,c1,c2,A) | cyclic(c1,c2,A,c2). [resolve(17713,a,134,b)].
% 7.62/7.94 17792 cyclic(c10,c1,c2,c2). [resolve(17718,a,133,a)].
% 7.62/7.94 17949 cyclic(c10,c2,c1,c2). [resolve(17792,a,132,a)].
% 7.62/7.94 18296 cyclic(c2,c10,c1,c2). [resolve(17949,a,133,a)].
% 7.62/7.94 18801 cyclic(c2,c10,c2,c1). [resolve(18296,a,131,a)].
% 7.62/7.95 19316 cyclic(c10,c2,c1,c1). [resolve(18801,a,406,a)].
% 7.62/7.95 20072 cyclic(c2,c10,c1,c1). [resolve(19316,a,133,a)].
% 7.62/7.95 20978 cyclic(c2,c1,c10,c1). [resolve(20072,a,132,a)].
% 7.62/7.95 21580 cyclic(c1,c2,c10,c1). [resolve(20978,a,133,a)].
% 7.62/7.95 22065 -cyclic(c1,c2,c10,A) | cyclic(c2,c10,A,c1). [resolve(21580,a,134,b)].
% 7.62/7.95 22067 cyclic(c1,c2,c1,c10). [resolve(21580,a,131,a)].
% 7.62/7.95 22539 cyclic(c1,c1,c2,c10). [resolve(22067,a,132,a)].
% 7.62/7.95 22943 -cyclic(c1,c1,c2,A) | cyclic(c1,c2,c10,A). [resolve(22539,a,134,a)].
% 7.62/7.95 28746 -coll(c2,A,c1) | cyclic(c1,c1,c2,A). [resolve(5087,a,160,a)].
% 7.62/7.95 28771 para(A,B,A,B). [resolve(5088,a,156,a)].
% 7.62/7.95 28779 coll(A,B,B). [resolve(28771,a,179,a)].
% 7.62/7.95 28783 coll(A,A,B). [resolve(28779,a,401,a)].
% 7.62/7.95 29145 coll(c2,A,c1). [back_unit_del(1054),unit_del(a,28783)].
% 7.62/7.95 29255 cyclic(c1,c1,c2,A). [back_unit_del(28746),unit_del(a,29145)].
% 7.62/7.95 29268 cyclic(c1,c2,c10,A). [back_unit_del(22943),unit_del(a,29255)].
% 7.62/7.95 29280 cyclic(c1,c2,A,c2). [back_unit_del(17755),unit_del(a,29255)].
% 7.62/7.95 29282 cyclic(c2,c10,A,c1). [back_unit_del(22065),unit_del(a,29268)].
% 7.62/7.95 29644 cyclic(c1,c2,A,B). [resolve(29255,a,134,b),unit_del(a,29255)].
% 7.62/7.95 29650 cyclic(c2,c10,A,B). [resolve(29268,a,134,b),unit_del(a,29644)].
% 7.62/7.95 29700 cyclic(c2,A,B,c2). [resolve(29280,a,134,b),unit_del(a,29644)].
% 7.62/7.95 29707 cyclic(c10,A,B,c1). [resolve(29282,a,134,b),unit_del(a,29650)].
% 7.62/7.95 30448 cyclic(c2,A,B,C). [resolve(29644,a,134,b),unit_del(a,29644)].
% 7.62/7.95 30457 cyclic(c10,A,B,C). [resolve(29650,a,134,b),unit_del(a,30448)].
% 7.62/7.95 30559 cyclic(A,B,C,c2). [resolve(29700,a,134,b),unit_del(a,30448)].
% 7.62/7.95 30579 cyclic(A,B,C,c1). [resolve(29707,a,134,b),unit_del(a,30457)].
% 7.62/7.95 30580 cyclic(A,B,c1,C). [resolve(29707,a,134,a),unit_del(a,30457)].
% 7.62/7.95 30667 cong(A,c2,A,c2). [resolve(5831,a,161,d),unit_del(a,30580),unit_del(b,30559),unit_del(c,30579)].
% 7.62/7.95 30945 perp(A,A,c2,c2). [resolve(30667,a,411,a)].
% 7.62/7.95 30949 cong(A,c2,c2,A). [resolve(30667,a,140,a)].
% 7.62/7.95 31170 -perp(c2,c2,A,B) | para(C,C,A,B). [resolve(30945,a,127,a)].
% 7.62/7.95 31171 perp(c2,c2,A,A). [resolve(30945,a,126,a)].
% 7.62/7.95 31173 cong(c2,A,A,c2). [resolve(30949,a,141,a)].
% 7.62/7.95 31368 -perp(A,B,c2,c2) | para(A,B,C,C). [resolve(31171,a,127,b)].
% 7.62/7.95 31371 cong(c2,A,c2,A). [resolve(31173,a,140,a)].
% 7.62/7.95 31465 perp(c2,c2,A,B). [resolve(31371,a,169,b),unit_del(a,31371)].
% 7.62/7.95 31467 para(A,A,B,C). [back_unit_del(31170),unit_del(a,31465)].
% 7.62/7.95 31571 perp(A,B,c2,c2). [resolve(31465,a,126,a)].
% 7.62/7.95 31572 para(A,B,C,C). [back_unit_del(31368),unit_del(a,31571)].
% 7.62/7.95 31579 para(A,B,C,D). [resolve(31467,a,124,b),unit_del(a,31572)].
% 7.62/7.95 31580 $F. [resolve(31579,a,222,a)].
% 7.62/7.95
% 7.62/7.95 % SZS output end Refutation
% 7.62/7.95 ============================== end of proof ==========================
% 7.62/7.95
% 7.62/7.95 ============================== STATISTICS ============================
% 7.62/7.95
% 7.62/7.95 Given=10525. Generated=136986. Kept=31413. proofs=1.
% 7.62/7.95 Usable=8078. Sos=6884. Demods=0. Limbo=2, Disabled=16706. Hints=0.
% 7.62/7.95 Megabytes=21.81.
% 7.62/7.95 User_CPU=6.74, System_CPU=0.10, Wall_clock=7.
% 7.62/7.95
% 7.62/7.95 ============================== end of statistics =====================
% 7.62/7.95
% 7.62/7.95 ============================== end of search =========================
% 7.62/7.95
% 7.62/7.95 THEOREM PROVED
% 7.62/7.95 % SZS status Theorem
% 7.62/7.95
% 7.62/7.95 Exiting with 1 proof.
% 7.62/7.95
% 7.62/7.95 Process 9815 exit (max_proofs) Sat Jun 18 02:52:21 2022
% 7.62/7.95 Prover9 interrupted
%------------------------------------------------------------------------------