TSTP Solution File: GEO617+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GEO617+1 : TPTP v8.1.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n028.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:15 EDT 2022
% Result : Theorem 19.18s 19.50s
% Output : Refutation 19.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : GEO617+1 : TPTP v8.1.0. Released v7.5.0.
% 0.03/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.36 % Computer : n028.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Fri Jun 17 20:12:13 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.80/1.11 ============================== Prover9 ===============================
% 0.80/1.11 Prover9 (32) version 2009-11A, November 2009.
% 0.80/1.11 Process 26167 was started by sandbox on n028.cluster.edu,
% 0.80/1.11 Fri Jun 17 20:12:14 2022
% 0.80/1.11 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_26012_n028.cluster.edu".
% 0.80/1.11 ============================== end of head ===========================
% 0.80/1.11
% 0.80/1.11 ============================== INPUT =================================
% 0.80/1.11
% 0.80/1.11 % Reading from file /tmp/Prover9_26012_n028.cluster.edu
% 0.80/1.11
% 0.80/1.11 set(prolog_style_variables).
% 0.80/1.11 set(auto2).
% 0.80/1.11 % set(auto2) -> set(auto).
% 0.80/1.11 % set(auto) -> set(auto_inference).
% 0.80/1.11 % set(auto) -> set(auto_setup).
% 0.80/1.11 % set(auto_setup) -> set(predicate_elim).
% 0.80/1.11 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.80/1.11 % set(auto) -> set(auto_limits).
% 0.80/1.11 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.80/1.11 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.80/1.11 % set(auto) -> set(auto_denials).
% 0.80/1.11 % set(auto) -> set(auto_process).
% 0.80/1.11 % set(auto2) -> assign(new_constants, 1).
% 0.80/1.11 % set(auto2) -> assign(fold_denial_max, 3).
% 0.80/1.11 % set(auto2) -> assign(max_weight, "200.000").
% 0.80/1.11 % set(auto2) -> assign(max_hours, 1).
% 0.80/1.11 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.80/1.11 % set(auto2) -> assign(max_seconds, 0).
% 0.80/1.11 % set(auto2) -> assign(max_minutes, 5).
% 0.80/1.11 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.80/1.11 % set(auto2) -> set(sort_initial_sos).
% 0.80/1.11 % set(auto2) -> assign(sos_limit, -1).
% 0.80/1.11 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.80/1.11 % set(auto2) -> assign(max_megs, 400).
% 0.80/1.11 % set(auto2) -> assign(stats, some).
% 0.80/1.11 % set(auto2) -> clear(echo_input).
% 0.80/1.11 % set(auto2) -> set(quiet).
% 0.80/1.11 % set(auto2) -> clear(print_initial_clauses).
% 0.80/1.11 % set(auto2) -> clear(print_given).
% 0.80/1.11 assign(lrs_ticks,-1).
% 0.80/1.11 assign(sos_limit,10000).
% 0.80/1.11 assign(order,kbo).
% 0.80/1.11 set(lex_order_vars).
% 0.80/1.11 clear(print_given).
% 0.80/1.11
% 0.80/1.11 % formulas(sos). % not echoed (95 formulas)
% 0.80/1.11
% 0.80/1.11 ============================== end of input ==========================
% 0.80/1.11
% 0.80/1.11 % From the command line: assign(max_seconds, 300).
% 0.80/1.11
% 0.80/1.11 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.80/1.11
% 0.80/1.11 % Formulas that are not ordinary clauses:
% 0.80/1.11 1 (all A all B all C (coll(A,B,C) -> coll(A,C,B))) # label(ruleD1) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.11 2 (all A all B all C (coll(A,B,C) -> coll(B,A,C))) # label(ruleD2) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 11 (all A all B all M (midp(M,B,A) -> midp(M,A,B))) # label(ruleD11) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 70 (all A all B all C (midp(A,B,C) -> coll(A,B,C))) # label(ruleD69) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.11 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.80/1.12 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.80/1.12 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.80/1.12 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.80/1.12 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.80/1.12 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.80/1.12 95 -(all A all B all C all D all E all F (circle(D,A,B,C) & eqangle(E,C,C,B,E,C,C,A) & coll(E,A,B) & perp(F,C,A,B) & coll(F,A,B) -> eqangle(F,C,C,E,E,C,C,D))) # label(exemplo6GDDFULL618079) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.80/1.12
% 0.80/1.12 ============================== end of process non-clausal formulas ===
% 0.80/1.12
% 0.80/1.12 ============================== PROCESS INITIAL CLAUSES ===============
% 0.80/1.12
% 0.80/1.12 ============================== PREDICATE ELIMINATION =================
% 0.80/1.12 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.80/1.12 97 -cong(A,B,A,C) | -cong(A,B,A,D) | circle(A,B,C,D) # label(ruleD12) # label(axiom). [clausify(12)].
% 0.80/1.12 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.80/1.12 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.80/1.12 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.80/1.12 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.80/1.12 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.80/1.12 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.80/1.12 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.80/1.12 101 -circle(A,B,C,D) | -coll(A,B,D) | perp(B,C,C,D) # label(ruleD53) # label(axiom). [clausify(54)].
% 0.80/1.12 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.80/1.12 102 -circle(A,B,C,D) | perp(f12(B,C,D,A),B,B,A) # label(ruleX11) # label(axiom). [clausify(87)].
% 0.80/1.12 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.80/1.12 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.80/1.12 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.80/1.12 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.80/1.12 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.80/1.12 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.80/1.12 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.80/1.12 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.80/1.12 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.80/1.12 107 -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | circle(f15(A,B,C,D,E),A,B,C) # label(ruleX13) # label(axiom). [clausify(89)].
% 0.80/1.12 Derived: -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | -perp(f15(A,B,C,D,E),A,A,F) | eqangle(A,F,A,B,C,A,C,B). [resolve(107,d,96,a)].
% 0.80/1.12 Derived: -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | -eqangle(A,F,A,B,C,A,C,B) | perp(f15(A,B,C,D,E),A,A,F). [resolve(107,d,98,a)].
% 0.80/1.12 Derived: -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | -midp(F,B,C) | eqangle(A,B,A,C,f15(A,B,C,D,E),B,f15(A,B,C,D,E),F). [resolve(107,d,99,a)].
% 0.80/1.12 Derived: -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | -coll(F,B,C) | -eqangle(A,B,A,C,f15(A,B,C,D,E),B,f15(A,B,C,D,E),F) | midp(F,B,C). [resolve(107,d,100,a)].
% 0.80/1.12 Derived: -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | -coll(f15(A,B,C,D,E),A,C) | perp(A,B,B,C). [resolve(107,d,101,a)].
% 0.80/1.12 Derived: -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | perp(f12(A,B,C,f15(A,B,C,D,E)),A,A,f15(A,B,C,D,E)). [resolve(107,d,102,a)].
% 0.80/1.12 Derived: -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | -cong(f15(A,B,C,D,E),A,f15(A,B,C,D,E),F) | -cong(V6,A,V6,B) | V6 = f15(A,B,C,D,E) | coll(f13(A,B,C,F,f15(A,B,C,D,E),V6),A,C). [resolve(107,d,103,a)].
% 0.80/1.12 Derived: -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | -cong(f15(A,B,C,D,E),A,f15(A,B,C,D,E),F) | -cong(V6,A,V6,B) | V6 = f15(A,B,C,D,E) | cong(f13(A,B,C,F,f15(A,B,C,D,E),V6),V6,V6,A). [resolve(107,d,104,a)].
% 0.80/1.12 Derived: -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | -cong(f15(A,B,C,D,E),A,f15(A,B,C,D,E),F) | -cong(V6,A,V6,B) | V6 = f15(A,B,C,D,E) | coll(f14(A,B,C,F,f15(A,B,C,D,E),V6),B,F). [resolve(107,d,105,a)].
% 0.80/1.12 Derived: -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | -cong(f15(A,B,C,D,E),A,f15(A,B,C,D,E),F) | -cong(V6,A,V6,B) | V6 = f15(A,B,C,D,E) | cong(f14(A,B,C,F,f15(A,B,C,D,E),V6),V6,V6,A). [resolve(107,d,106,a)].
% 0.80/1.12 108 -perp(A,B,B,C) | -cyclic(A,C,B,D) | circle(f16(A,C,B,D),A,C,B) # label(ruleX14) # label(axiom). [clausify(90)].
% 0.80/1.12 Derived: -perp(A,B,B,C) | -cyclic(A,C,B,D) | -perp(f16(A,C,B,D),A,A,E) | eqangle(A,E,A,C,B,A,B,C). [resolve(108,c,96,a)].
% 0.80/1.12 Derived: -perp(A,B,B,C) | -cyclic(A,C,B,D) | -eqangle(A,E,A,C,B,A,B,C) | perp(f16(A,C,B,D),A,A,E). [resolve(108,c,98,a)].
% 0.80/1.12 Derived: -perp(A,B,B,C) | -cyclic(A,C,B,D) | -midp(E,C,B) | eqangle(A,C,A,B,f16(A,C,B,D),C,f16(A,C,B,D),E). [resolve(108,c,99,a)].
% 0.80/1.12 Derived: -perp(A,B,B,C) | -cyclic(A,C,B,D) | -coll(E,C,B) | -eqangle(A,C,A,B,f16(A,C,B,D),C,f16(A,C,B,D),E) | midp(E,C,B). [resolve(108,c,100,a)].
% 0.80/1.12 Derived: -perp(A,B,B,C) | -cyclic(A,C,B,D) | -coll(f16(A,C,B,D),A,B) | perp(A,C,C,B). [resolve(108,c,101,a)].
% 0.80/1.12 Derived: -perp(A,B,B,C) | -cyclic(A,C,B,D) | perp(f12(A,C,B,f16(A,C,B,D)),A,A,f16(A,C,B,D)). [resolve(108,c,102,a)].
% 0.80/1.12 Derived: -perp(A,B,B,C) | -cyclic(A,C,B,D) | -cong(f16(A,C,B,D),A,f16(A,C,B,D),E) | -cong(F,A,F,C) | F = f16(A,C,B,D) | coll(f13(A,C,B,E,f16(A,C,B,D),F),A,B). [resolve(108,c,103,a)].
% 0.80/1.12 Derived: -perp(A,B,B,C) | -cyclic(A,C,B,D) | -cong(f16(A,C,B,D),A,f16(A,C,B,D),E) | -cong(F,A,F,C) | F = f16(A,C,B,D) | cong(f13(A,C,B,E,f16(A,C,B,D),F),F,F,A). [resolve(108,c,104,a)].
% 0.80/1.12 Derived: -perp(A,B,B,C) | -cyclic(A,C,B,D) | -cong(f16(A,C,B,D),A,f16(A,C,B,D),E) | -cong(F,A,F,C) | F = f16(A,C,B,D) | coll(f14(A,C,B,E,f16(A,C,B,D),F),C,E). [resolve(108,c,105,a)].
% 0.80/1.12 Derived: -perp(A,B,B,C) | -cyclic(A,C,B,D) | -cong(f16(A,C,B,D),A,f16(A,C,B,D),E) | -cong(F,A,F,C) | F = f16(A,C,B,D) | cong(f14(A,C,B,E,f16(A,C,B,D),F),F,F,A). [resolve(108,c,106,a)].
% 0.80/1.12 109 circle(c4,c1,c2,c3) # label(exemplo6GDDFULL618079) # label(negated_conjecture). [clausify(95)].
% 0.80/1.12 Derived: -perp(c4,c1,c1,A) | eqangle(c1,A,c1,c2,c3,c1,c3,c2). [resolve(109,a,96,a)].
% 0.80/1.12 Derived: -eqangle(c1,A,c1,c2,c3,c1,c3,c2) | perp(c4,c1,c1,A). [resolve(109,a,98,a)].
% 0.80/1.12 Derived: -midp(A,c2,c3) | eqangle(c1,c2,c1,c3,c4,c2,c4,A). [resolve(109,a,99,a)].
% 0.80/1.12 Derived: -coll(A,c2,c3) | -eqangle(c1,c2,c1,c3,c4,c2,c4,A) | midp(A,c2,c3). [resolve(109,a,100,a)].
% 0.80/1.12 Derived: -coll(c4,c1,c3) | perp(c1,c2,c2,c3). [resolve(109,a,101,a)].
% 0.80/1.12 Derived: perp(f12(c1,c2,c3,c4),c1,c1,c4). [resolve(109,a,102,a)].
% 0.80/1.12 Derived: -cong(c4,c1,c4,A) | -cong(B,c1,B,c2) | B = c4 | coll(f13(c1,c2,c3,A,c4,B),c1,c3). [resolve(109,a,103,a)].
% 19.18/19.50 Derived: -cong(c4,c1,c4,A) | -cong(B,c1,B,c2) | B = c4 | cong(f13(c1,c2,c3,A,c4,B),B,B,c1). [resolve(109,a,104,a)].
% 19.18/19.50 Derived: -cong(c4,c1,c4,A) | -cong(B,c1,B,c2) | B = c4 | coll(f14(c1,c2,c3,A,c4,B),c2,A). [resolve(109,a,105,a)].
% 19.18/19.50 Derived: -cong(c4,c1,c4,A) | -cong(B,c1,B,c2) | B = c4 | cong(f14(c1,c2,c3,A,c4,B),B,B,c1). [resolve(109,a,106,a)].
% 19.18/19.50
% 19.18/19.50 ============================== end predicate elimination =============
% 19.18/19.50
% 19.18/19.50 Auto_denials: (non-Horn, no changes).
% 19.18/19.50
% 19.18/19.50 Term ordering decisions:
% 19.18/19.50 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. c5=1. c6=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.
% 19.18/19.50
% 19.18/19.50 ============================== end of process initial clauses ========
% 19.18/19.50
% 19.18/19.50 ============================== CLAUSES FOR SEARCH ====================
% 19.18/19.50
% 19.18/19.50 ============================== end of clauses for search =============
% 19.18/19.50
% 19.18/19.50 ============================== SEARCH ================================
% 19.18/19.50
% 19.18/19.50 % Starting search at 0.04 seconds.
% 19.18/19.50
% 19.18/19.50 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 116 (0.00 of 0.14 sec).
% 19.18/19.50
% 19.18/19.50 Low Water (keep): wt=26.000, iters=3337
% 19.18/19.50
% 19.18/19.50 Low Water (keep): wt=22.000, iters=3336
% 19.18/19.50
% 19.18/19.50 Low Water (keep): wt=21.000, iters=3340
% 19.18/19.50
% 19.18/19.50 Low Water (keep): wt=20.000, iters=3348
% 19.18/19.50
% 19.18/19.50 Low Water (keep): wt=18.000, iters=3335
% 19.18/19.50
% 19.18/19.50 Low Water (keep): wt=15.000, iters=3334
% 19.18/19.50
% 19.18/19.50 Low Water (keep): wt=14.000, iters=3340
% 19.18/19.50
% 19.18/19.50 Low Water (keep): wt=13.000, iters=3337
% 19.18/19.50
% 19.18/19.50 Low Water (displace): id=6431, wt=34.000
% 19.18/19.50
% 19.18/19.50 Low Water (displace): id=6434, wt=30.000
% 19.18/19.50
% 19.18/19.50 Low Water (displace): id=7731, wt=26.000
% 19.18/19.50
% 19.18/19.50 Low Water (displace): id=14382, wt=10.000
% 19.18/19.50
% 19.18/19.50 Low Water (displace): id=14453, wt=9.000
% 19.18/19.50
% 19.18/19.50 Low Water (keep): wt=12.000, iters=3681
% 19.18/19.50
% 19.18/19.50 Low Water (displace): id=14850, wt=8.000
% 19.18/19.50
% 19.18/19.50 Low Water (displace): id=15303, wt=7.000
% 19.18/19.50
% 19.18/19.50 Low Water (displace): id=15357, wt=5.000
% 19.18/19.50
% 19.18/19.50 Low Water (keep): wt=11.000, iters=3349
% 19.18/19.50
% 19.18/19.50 Low Water (keep): wt=10.000, iters=3336
% 19.18/19.50
% 19.18/19.50 Low Water (keep): wt=9.000, iters=3411
% 19.18/19.50
% 19.18/19.50 ============================== PROOF =================================
% 19.18/19.50 % SZS status Theorem
% 19.18/19.50 % SZS output start Refutation
% 19.18/19.50
% 19.18/19.50 % Proof 1 at 18.26 (+ 0.15) seconds.
% 19.18/19.50 % Length of proof is 209.
% 19.18/19.50 % Level of proof is 42.
% 19.18/19.50 % Maximum clause weight is 29.000.
% 19.18/19.50 % Given clauses 21511.
% 19.18/19.50
% 19.18/19.50 1 (all A all B all C (coll(A,B,C) -> coll(A,C,B))) # label(ruleD1) # label(axiom) # label(non_clause). [assumption].
% 19.18/19.50 2 (all A all B all C (coll(A,B,C) -> coll(B,A,C))) # label(ruleD2) # label(axiom) # label(non_clause). [assumption].
% 19.18/19.50 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].
% 19.18/19.50 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].
% 19.18/19.50 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].
% 19.18/19.50 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].
% 19.18/19.50 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].
% 19.18/19.50 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].
% 19.18/19.50 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].
% 19.18/19.50 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].
% 19.18/19.50 11 (all A all B all M (midp(M,B,A) -> midp(M,A,B))) # label(ruleD11) # label(axiom) # label(non_clause). [assumption].
% 19.18/19.50 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].
% 19.18/19.50 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].
% 19.18/19.50 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].
% 19.18/19.50 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].
% 19.18/19.50 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].
% 19.18/19.50 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].
% 19.18/19.50 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].
% 19.18/19.50 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].
% 19.18/19.50 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].
% 19.18/19.50 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].
% 19.18/19.50 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].
% 19.18/19.50 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].
% 19.18/19.50 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].
% 19.18/19.50 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].
% 19.18/19.50 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].
% 19.18/19.50 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].
% 19.18/19.50 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].
% 19.18/19.50 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].
% 19.18/19.50 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].
% 19.18/19.50 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].
% 19.18/19.50 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].
% 19.18/19.50 67 (all A all B all C (para(A,B,A,C) -> coll(A,B,C))) # label(ruleD66) # label(axiom) # label(non_clause). [assumption].
% 19.18/19.50 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].
% 19.18/19.50 69 (all A all B all C (midp(A,B,C) -> cong(A,B,A,C))) # label(ruleD68) # label(axiom) # label(non_clause). [assumption].
% 19.18/19.50 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].
% 19.18/19.50 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].
% 19.18/19.50 95 -(all A all B all C all D all E all F (circle(D,A,B,C) & eqangle(E,C,C,B,E,C,C,A) & coll(E,A,B) & perp(F,C,A,B) & coll(F,A,B) -> eqangle(F,C,C,E,E,C,C,D))) # label(exemplo6GDDFULL618079) # label(negated_conjecture) # label(non_clause). [assumption].
% 19.18/19.50 97 -cong(A,B,A,C) | -cong(A,B,A,D) | circle(A,B,C,D) # label(ruleD12) # label(axiom). [clausify(12)].
% 19.18/19.50 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)].
% 19.18/19.50 101 -circle(A,B,C,D) | -coll(A,B,D) | perp(B,C,C,D) # label(ruleD53) # label(axiom). [clausify(54)].
% 19.18/19.50 102 -circle(A,B,C,D) | perp(f12(B,C,D,A),B,B,A) # label(ruleX11) # label(axiom). [clausify(87)].
% 19.18/19.50 109 circle(c4,c1,c2,c3) # label(exemplo6GDDFULL618079) # label(negated_conjecture). [clausify(95)].
% 19.18/19.50 110 -coll(A,B,C) | coll(A,C,B) # label(ruleD1) # label(axiom). [clausify(1)].
% 19.18/19.50 111 -coll(A,B,C) | coll(B,A,C) # label(ruleD2) # label(axiom). [clausify(2)].
% 19.18/19.50 112 -coll(A,B,C) | -coll(A,B,D) | coll(C,D,A) # label(ruleD3) # label(axiom). [clausify(3)].
% 19.18/19.50 113 -para(A,B,C,D) | para(A,B,D,C) # label(ruleD4) # label(axiom). [clausify(4)].
% 19.18/19.50 114 -para(A,B,C,D) | para(C,D,A,B) # label(ruleD5) # label(axiom). [clausify(5)].
% 19.18/19.50 115 -para(A,B,C,D) | -para(C,D,E,F) | para(A,B,E,F) # label(ruleD6) # label(axiom). [clausify(6)].
% 19.18/19.50 116 -perp(A,B,C,D) | perp(A,B,D,C) # label(ruleD7) # label(axiom). [clausify(7)].
% 19.18/19.50 117 -perp(A,B,C,D) | perp(C,D,A,B) # label(ruleD8) # label(axiom). [clausify(8)].
% 19.18/19.50 118 -perp(A,B,C,D) | -perp(C,D,E,F) | para(A,B,E,F) # label(ruleD9) # label(axiom). [clausify(9)].
% 19.18/19.50 119 -para(A,B,C,D) | -perp(C,D,E,F) | perp(A,B,E,F) # label(ruleD10) # label(axiom). [clausify(10)].
% 19.18/19.50 120 -midp(A,B,C) | midp(A,C,B) # label(ruleD11) # label(axiom). [clausify(11)].
% 19.18/19.50 122 -cyclic(A,B,C,D) | cyclic(A,B,D,C) # label(ruleD14) # label(axiom). [clausify(14)].
% 19.18/19.50 123 -cyclic(A,B,C,D) | cyclic(A,C,B,D) # label(ruleD15) # label(axiom). [clausify(15)].
% 19.18/19.50 124 -cyclic(A,B,C,D) | cyclic(B,A,C,D) # label(ruleD16) # label(axiom). [clausify(16)].
% 19.18/19.50 125 -cyclic(A,B,C,D) | -cyclic(A,B,C,E) | cyclic(B,C,D,E) # label(ruleD17) # label(axiom). [clausify(17)].
% 19.18/19.50 127 -eqangle(A,B,C,D,E,F,V6,V7) | eqangle(C,D,A,B,V6,V7,E,F) # label(ruleD19) # label(axiom). [clausify(19)].
% 19.18/19.50 128 -eqangle(A,B,C,D,E,F,V6,V7) | eqangle(E,F,V6,V7,A,B,C,D) # label(ruleD20) # label(axiom). [clausify(20)].
% 19.18/19.50 129 -eqangle(A,B,C,D,E,F,V6,V7) | eqangle(A,B,E,F,C,D,V6,V7) # label(ruleD21) # label(axiom). [clausify(21)].
% 19.18/19.50 130 -eqangle(A,B,C,D,E,F,V6,V7) | -eqangle(E,F,V6,V7,V8,V9,V10,V11) | eqangle(A,B,C,D,V8,V9,V10,V11) # label(ruleD22) # label(axiom). [clausify(22)].
% 19.18/19.50 131 -cong(A,B,C,D) | cong(A,B,D,C) # label(ruleD23) # label(axiom). [clausify(23)].
% 19.18/19.50 132 -cong(A,B,C,D) | cong(C,D,A,B) # label(ruleD24) # label(axiom). [clausify(24)].
% 19.18/19.50 147 -eqangle(A,B,C,D,E,F,C,D) | para(A,B,E,F) # label(ruleD39) # label(axiom). [clausify(39)].
% 19.18/19.50 148 -para(A,B,C,D) | eqangle(A,B,E,F,C,D,E,F) # label(ruleD40) # label(axiom). [clausify(40)].
% 19.18/19.50 151 -eqangle(A,B,A,C,D,B,D,C) | -coll(A,D,C) | cyclic(B,C,A,D) # label(ruleD42b) # label(axiom). [clausify(43)].
% 19.18/19.50 152 -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)].
% 19.18/19.50 154 -midp(A,B,C) | -para(A,D,C,E) | -coll(D,B,E) | midp(D,B,E) # label(ruleD45) # label(axiom). [clausify(46)].
% 19.18/19.50 159 -midp(A,B,C) | -perp(D,A,B,C) | cong(D,B,D,C) # label(ruleD55) # label(axiom). [clausify(56)].
% 19.18/19.50 160 -cong(A,B,C,B) | -cong(A,D,C,D) | perp(A,C,B,D) # label(ruleD56) # label(axiom). [clausify(57)].
% 19.18/19.50 168 -midp(A,B,C) | -para(B,D,C,E) | -para(B,E,C,D) | midp(A,D,E) # label(ruleD64) # label(axiom). [clausify(65)].
% 19.18/19.50 170 -para(A,B,A,C) | coll(A,B,C) # label(ruleD66) # label(axiom). [clausify(67)].
% 19.18/19.50 171 -cong(A,B,A,C) | -coll(A,B,C) | midp(A,B,C) # label(ruleD67) # label(axiom). [clausify(68)].
% 19.18/19.50 172 -midp(A,B,C) | cong(A,B,A,C) # label(ruleD68) # label(axiom). [clausify(69)].
% 19.18/19.50 176 -eqangle(A,B,C,D,E,F,V6,V7) | -para(E,F,V6,V7) | para(A,B,C,D) # label(ruleD73) # label(axiom). [clausify(74)].
% 19.18/19.50 209 eqangle(c5,c3,c3,c2,c5,c3,c3,c1) # label(exemplo6GDDFULL618079) # label(negated_conjecture). [clausify(95)].
% 19.18/19.50 210 coll(c5,c1,c2) # label(exemplo6GDDFULL618079) # label(negated_conjecture). [clausify(95)].
% 19.18/19.50 211 perp(c6,c3,c1,c2) # label(exemplo6GDDFULL618079) # label(negated_conjecture). [clausify(95)].
% 19.18/19.50 213 -eqangle(c6,c3,c3,c5,c5,c3,c3,c4) # label(exemplo6GDDFULL618079) # label(negated_conjecture). [clausify(95)].
% 19.18/19.50 217 -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)].
% 19.18/19.50 218 -coll(A,B,C) | perp(B,D,D,C) | -cong(A,B,A,D) | -cong(A,B,A,C). [resolve(101,a,97,c)].
% 19.18/19.50 256 -coll(c4,c1,c3) | perp(c1,c2,c2,c3). [resolve(109,a,101,a)].
% 19.18/19.50 257 perp(f12(c1,c2,c3,c4),c1,c1,c4). [resolve(109,a,102,a)].
% 19.18/19.50 266 -coll(A,B,C) | coll(C,C,A). [factor(112,a,b)].
% 19.18/19.50 271 -cyclic(A,B,C,D) | cyclic(B,C,D,D). [factor(125,a,b)].
% 19.18/19.50 274 -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(152,b,c)].
% 19.18/19.50 276 -cong(A,B,C,B) | perp(A,C,B,B). [factor(160,a,b)].
% 19.18/19.50 280 -midp(A,B,C) | -para(B,D,C,D) | midp(A,D,D). [factor(168,b,c)].
% 19.18/19.50 304 -coll(A,B,B) | -eqangle(C,B,C,B,D,B,D,A) | midp(A,B,B) | -cong(D,C,D,B). [factor(217,d,e)].
% 19.18/19.50 305 -coll(A,B,C) | perp(B,C,C,C) | -cong(A,B,A,C). [factor(218,c,d)].
% 19.18/19.50 334 eqangle(c5,c3,c5,c3,c3,c2,c3,c1). [resolve(209,a,129,a)].
% 19.18/19.50 336 eqangle(c3,c2,c5,c3,c3,c1,c5,c3). [resolve(209,a,127,a)].
% 19.18/19.50 341 coll(c5,c2,c1). [resolve(210,a,110,a)].
% 19.18/19.50 353 -perp(A,B,c6,c3) | para(A,B,c1,c2). [resolve(211,a,118,b)].
% 19.18/19.50 354 -perp(c1,c2,A,B) | para(c6,c3,A,B). [resolve(211,a,118,a)].
% 19.18/19.50 355 perp(c1,c2,c6,c3). [resolve(211,a,117,a)].
% 19.18/19.50 356 perp(c6,c3,c2,c1). [resolve(211,a,116,a)].
% 19.18/19.50 381 -perp(A,B,f12(c1,c2,c3,c4),c1) | para(A,B,c1,c4). [resolve(257,a,118,b)].
% 19.18/19.50 383 perp(c1,c4,f12(c1,c2,c3,c4),c1). [resolve(257,a,117,a)].
% 19.18/19.50 392 coll(c1,c1,c5). [resolve(341,a,266,a)].
% 19.18/19.50 421 coll(c1,c5,c1). [resolve(392,a,110,a)].
% 19.18/19.50 456 -para(c3,c2,c3,c1) | para(c5,c3,c5,c3). [resolve(334,a,176,a)].
% 19.18/19.50 458 -eqangle(A,B,C,D,c5,c3,c5,c3) | eqangle(A,B,C,D,c3,c2,c3,c1). [resolve(334,a,130,b)].
% 19.18/19.50 460 eqangle(c3,c2,c3,c1,c5,c3,c5,c3). [resolve(334,a,128,a)].
% 19.18/19.50 465 coll(c1,c1,c1). [resolve(421,a,266,a)].
% 19.18/19.50 495 para(c3,c2,c3,c1). [resolve(336,a,147,a)].
% 19.18/19.50 499 para(c5,c3,c5,c3). [back_unit_del(456),unit_del(a,495)].
% 19.18/19.50 553 perp(c1,c2,c3,c6). [resolve(355,a,116,a)].
% 19.18/19.50 567 perp(c2,c1,c6,c3). [resolve(356,a,117,a)].
% 19.18/19.50 576 coll(c3,c2,c1). [resolve(495,a,170,a)].
% 19.18/19.50 581 eqangle(c3,c2,A,B,c3,c1,A,B). [resolve(495,a,148,a)].
% 19.18/19.50 583 -para(A,B,c3,c2) | para(A,B,c3,c1). [resolve(495,a,115,b)].
% 19.18/19.50 586 para(c3,c2,c1,c3). [resolve(495,a,113,a)].
% 19.18/19.50 589 coll(c1,c1,c3). [resolve(576,a,266,a)].
% 19.18/19.50 593 coll(c3,c1,c2). [resolve(576,a,110,a)].
% 19.18/19.50 594 coll(c3,c3,c1). [resolve(589,a,266,a)].
% 19.18/19.50 595 -coll(c1,c1,A) | coll(A,c3,c1). [resolve(589,a,112,b)].
% 19.18/19.50 658 eqangle(c5,c3,A,B,c5,c3,A,B). [resolve(499,a,148,a)].
% 19.18/19.50 659 para(c5,c3,c3,c5). [resolve(499,a,113,a)].
% 19.18/19.50 692 perp(c3,c6,c1,c2). [resolve(553,a,117,a)].
% 19.18/19.50 738 para(c1,c3,c3,c2). [resolve(586,a,114,a)].
% 19.18/19.50 754 para(c3,c5,c5,c3). [resolve(659,a,114,a)].
% 19.18/19.50 768 perp(c3,c6,c2,c1). [resolve(692,a,116,a)].
% 19.18/19.50 833 para(c3,c5,c3,c5). [resolve(754,a,113,a)].
% 19.18/19.50 846 -perp(c2,c1,A,B) | para(c3,c6,A,B). [resolve(768,a,118,a)].
% 19.18/19.50 883 -midp(A,c3,c3) | midp(A,c5,c5). [resolve(833,a,280,b)].
% 19.18/19.50 908 para(c2,c1,c1,c2). [resolve(353,a,567,a)].
% 19.18/19.50 926 para(c2,c1,c2,c1). [resolve(908,a,113,a)].
% 19.18/19.50 965 eqangle(c2,c1,A,B,c2,c1,A,B). [resolve(926,a,148,a)].
% 19.18/19.50 1173 para(c1,c4,c1,c4). [resolve(383,a,381,a)].
% 19.18/19.50 1197 coll(c1,c4,c4). [resolve(1173,a,170,a)].
% 19.18/19.50 1199 -midp(c1,A,c1) | -coll(c4,A,c4) | midp(c4,A,c4). [resolve(1173,a,154,b)].
% 19.18/19.50 1202 coll(c4,c4,c1). [resolve(1197,a,266,a)].
% 19.18/19.50 1205 coll(c4,c1,c4). [resolve(1197,a,111,a)].
% 19.18/19.50 1210 coll(c1,c1,c4). [resolve(1202,a,266,a)].
% 19.18/19.50 1248 coll(c1,c4,c1). [resolve(1210,a,110,a)].
% 19.18/19.50 1278 coll(c4,c1,c1). [resolve(1248,a,111,a)].
% 19.18/19.50 1350 eqangle(c3,c2,c3,c1,c3,c2,c3,c1). [resolve(460,a,458,a)].
% 19.18/19.50 1354 -eqangle(c5,c3,c5,c3,A,B,C,D) | eqangle(c3,c2,c3,c1,A,B,C,D). [resolve(460,a,130,a)].
% 19.18/19.50 1513 coll(c4,c3,c1). [resolve(595,a,1210,a)].
% 19.18/19.50 1519 coll(c4,c1,c3). [resolve(1513,a,110,a)].
% 19.18/19.50 1520 perp(c1,c2,c2,c3). [back_unit_del(256),unit_del(a,1519)].
% 19.18/19.50 1560 para(c6,c3,c2,c3). [resolve(1520,a,354,a)].
% 19.18/19.50 1584 perp(c2,c3,c1,c2). [resolve(1520,a,117,a)].
% 19.18/19.50 1601 para(c2,c3,c6,c3). [resolve(1560,a,114,a)].
% 19.18/19.50 1616 perp(c2,c3,c2,c1). [resolve(1584,a,116,a)].
% 19.18/19.50 1654 para(c2,c3,c3,c6). [resolve(1601,a,113,a)].
% 19.18/19.50 1682 -midp(c3,c2,c1) | cong(c2,c2,c2,c1). [resolve(1616,a,159,b)].
% 19.18/19.50 1707 -perp(c3,c6,A,B) | perp(c2,c3,A,B). [resolve(1654,a,119,a)].
% 19.18/19.50 1969 -cyclic(c2,c3,c3,c1) | -cyclic(c2,c3,c3,c3) | cong(c2,c3,c1,c3). [resolve(581,a,274,c)].
% 19.18/19.50 1982 para(c1,c3,c3,c1). [resolve(583,a,738,a)].
% 19.18/19.50 2040 para(c1,c3,c1,c3). [resolve(1982,a,113,a)].
% 19.18/19.50 2135 -midp(A,c1,c1) | midp(A,c3,c3). [resolve(2040,a,280,b)].
% 19.18/19.50 2288 eqangle(A,B,c5,c3,A,B,c5,c3). [resolve(658,a,127,a)].
% 19.18/19.50 7840 midp(c1,c1,c1) | -cong(c2,c2,c2,c1). [resolve(965,a,304,b),unit_del(a,465)].
% 19.18/19.50 9689 cyclic(c2,c1,c3,c3). [resolve(1350,a,151,a),unit_del(a,594)].
% 19.18/19.50 9698 cyclic(c1,c2,c3,c3). [resolve(9689,a,124,a)].
% 19.18/19.50 9699 cyclic(c2,c3,c1,c3). [resolve(9689,a,123,a)].
% 19.18/19.50 9708 cyclic(c2,c3,c3,c3). [resolve(9698,a,271,a)].
% 19.18/19.50 9713 -cyclic(c2,c3,c3,c1) | cong(c2,c3,c1,c3). [back_unit_del(1969),unit_del(b,9708)].
% 19.18/19.50 9720 cyclic(c2,c3,c3,c1). [resolve(9699,a,122,a)].
% 19.18/19.50 9721 cong(c2,c3,c1,c3). [back_unit_del(9713),unit_del(a,9720)].
% 19.18/19.50 9755 perp(c2,c1,c3,c3). [resolve(9721,a,276,a)].
% 19.18/19.50 9760 cong(c2,c3,c3,c1). [resolve(9721,a,131,a)].
% 19.18/19.50 9861 para(c3,c6,c3,c3). [resolve(9755,a,846,a)].
% 19.18/19.50 9879 cong(c3,c1,c2,c3). [resolve(9760,a,132,a)].
% 19.18/19.50 10057 -midp(A,c3,c3) | -para(c3,c3,c3,c6) | midp(A,c6,c3). [resolve(9861,a,168,b)].
% 19.18/19.50 10063 para(c3,c3,c3,c6). [resolve(9861,a,114,a)].
% 19.18/19.50 10064 -midp(A,c3,c3) | midp(A,c6,c3). [back_unit_del(10057),unit_del(b,10063)].
% 19.18/19.50 10097 cong(c3,c1,c3,c2). [resolve(9879,a,131,a)].
% 19.18/19.50 10339 midp(c3,c1,c2). [resolve(10097,a,171,a),unit_del(a,593)].
% 19.18/19.50 10390 midp(c3,c2,c1). [resolve(10339,a,120,a)].
% 19.18/19.50 10436 cong(c2,c2,c2,c1). [back_unit_del(1682),unit_del(a,10390)].
% 19.18/19.50 10453 midp(c1,c1,c1). [back_unit_del(7840),unit_del(b,10436)].
% 19.18/19.50 10680 midp(c4,c1,c4). [resolve(10453,a,1199,a),unit_del(a,1205)].
% 19.18/19.50 11233 midp(c4,c4,c1). [resolve(10680,a,120,a)].
% 19.18/19.50 11904 cong(c4,c4,c4,c1). [resolve(11233,a,172,a)].
% 19.18/19.50 13970 perp(c4,c1,c1,c1). [resolve(11904,a,305,c),unit_del(a,1202)].
% 19.18/19.50 15417 cong(c4,c1,c4,c1). [resolve(13970,a,159,b),unit_del(a,10453)].
% 19.18/19.50 16694 midp(c4,c1,c1). [resolve(15417,a,171,a),unit_del(a,1278)].
% 19.18/19.50 16700 midp(c4,c3,c3). [resolve(16694,a,2135,a)].
% 19.18/19.50 16721 midp(c4,c5,c5). [resolve(16700,a,883,a)].
% 19.18/19.50 23229 para(A,B,A,B). [resolve(2288,a,147,a)].
% 19.18/19.50 23254 -midp(A,B,B) | midp(A,C,C). [resolve(23229,a,280,b)].
% 19.18/19.50 24528 midp(c4,c6,c3). [resolve(10064,a,16700,a)].
% 19.18/19.50 24535 cong(c4,c6,c4,c3). [resolve(24528,a,172,a)].
% 19.18/19.50 24570 cong(c4,c6,c3,c4). [resolve(24535,a,131,a)].
% 19.18/19.50 24591 cong(c3,c4,c4,c6). [resolve(24570,a,132,a)].
% 19.18/19.50 24605 cong(c3,c4,c6,c4). [resolve(24591,a,131,a)].
% 19.18/19.50 24615 perp(c3,c6,c4,c4). [resolve(24605,a,276,a)].
% 19.18/19.50 24639 perp(c2,c3,c4,c4). [resolve(24615,a,1707,a)].
% 19.18/19.50 24678 -perp(c4,c4,A,B) | para(c2,c3,A,B). [resolve(24639,a,118,a)].
% 19.18/19.50 24679 perp(c4,c4,c2,c3). [resolve(24639,a,117,a)].
% 19.18/19.50 24734 -perp(A,B,c4,c4) | para(A,B,c2,c3). [resolve(24679,a,118,b)].
% 19.18/19.50 28243 midp(c4,A,A). [resolve(23254,a,16721,a)].
% 19.18/19.50 28252 cong(c4,A,c4,A). [resolve(28243,a,172,a)].
% 19.18/19.50 28356 perp(c4,c4,A,B). [resolve(28252,a,160,b),unit_del(a,28252)].
% 19.18/19.50 28361 para(c2,c3,A,B). [back_unit_del(24678),unit_del(a,28356)].
% 19.18/19.50 28887 perp(A,B,c4,c4). [resolve(28356,a,117,a)].
% 19.18/19.50 28888 para(A,B,c2,c3). [back_unit_del(24734),unit_del(a,28887)].
% 19.18/19.50 28924 para(A,B,C,D). [resolve(28361,a,115,b),unit_del(a,28888)].
% 19.18/19.50 28927 eqangle(A,B,C,D,E,F,C,D). [back_unit_del(148),unit_del(a,28924)].
% 19.18/19.50 35640 eqangle(A,B,C,D,E,F,E,F). [resolve(28927,a,129,a)].
% 19.18/19.50 35643 eqangle(A,B,C,D,c3,c2,c3,c1). [back_unit_del(458),unit_del(a,35640)].
% 19.18/19.50 41072 eqangle(A,B,A,B,C,D,E,F). [resolve(35640,a,128,a)].
% 19.18/19.50 41075 eqangle(c3,c2,c3,c1,A,B,C,D). [back_unit_del(1354),unit_del(a,41072)].
% 19.18/19.50 41083 eqangle(A,B,C,D,E,F,V6,V7). [resolve(35643,a,130,a),unit_del(a,41075)].
% 19.18/19.50 41084 $F. [resolve(41083,a,213,a)].
% 19.18/19.50
% 19.18/19.50 % SZS output end Refutation
% 19.18/19.50 ============================== end of proof ==========================
% 19.18/19.50
% 19.18/19.50 ============================== STATISTICS ============================
% 19.18/19.50
% 19.18/19.50 Given=21511. Generated=271681. Kept=40962. proofs=1.
% 19.18/19.50 Usable=19368. Sos=5435. Demods=0. Limbo=0, Disabled=16317. Hints=0.
% 19.18/19.50 Megabytes=19.00.
% 19.18/19.50 User_CPU=18.26, System_CPU=0.15, Wall_clock=18.
% 19.18/19.50
% 19.18/19.50 ============================== end of statistics =====================
% 19.18/19.50
% 19.18/19.50 ============================== end of search =========================
% 19.18/19.50
% 19.18/19.50 THEOREM PROVED
% 19.18/19.50 % SZS status Theorem
% 19.18/19.50
% 19.18/19.50 Exiting with 1 proof.
% 19.18/19.50
% 19.18/19.50 Process 26167 exit (max_proofs) Fri Jun 17 20:12:32 2022
% 19.18/19.50 Prover9 interrupted
%------------------------------------------------------------------------------