TSTP Solution File: GEO658+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GEO658+1 : TPTP v8.1.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n024.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:27 EDT 2022
% Result : Theorem 1.82s 2.09s
% Output : Refutation 1.82s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO658+1 : TPTP v8.1.0. Released v7.5.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n024.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat Jun 18 07:57:47 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.83/1.09 ============================== Prover9 ===============================
% 0.83/1.09 Prover9 (32) version 2009-11A, November 2009.
% 0.83/1.09 Process 9108 was started by sandbox on n024.cluster.edu,
% 0.83/1.09 Sat Jun 18 07:57:48 2022
% 0.83/1.09 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_8954_n024.cluster.edu".
% 0.83/1.09 ============================== end of head ===========================
% 0.83/1.09
% 0.83/1.09 ============================== INPUT =================================
% 0.83/1.09
% 0.83/1.09 % Reading from file /tmp/Prover9_8954_n024.cluster.edu
% 0.83/1.09
% 0.83/1.09 set(prolog_style_variables).
% 0.83/1.09 set(auto2).
% 0.83/1.09 % set(auto2) -> set(auto).
% 0.83/1.09 % set(auto) -> set(auto_inference).
% 0.83/1.09 % set(auto) -> set(auto_setup).
% 0.83/1.09 % set(auto_setup) -> set(predicate_elim).
% 0.83/1.09 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.83/1.09 % set(auto) -> set(auto_limits).
% 0.83/1.09 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.83/1.09 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.83/1.09 % set(auto) -> set(auto_denials).
% 0.83/1.09 % set(auto) -> set(auto_process).
% 0.83/1.09 % set(auto2) -> assign(new_constants, 1).
% 0.83/1.09 % set(auto2) -> assign(fold_denial_max, 3).
% 0.83/1.09 % set(auto2) -> assign(max_weight, "200.000").
% 0.83/1.09 % set(auto2) -> assign(max_hours, 1).
% 0.83/1.09 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.83/1.09 % set(auto2) -> assign(max_seconds, 0).
% 0.83/1.09 % set(auto2) -> assign(max_minutes, 5).
% 0.83/1.09 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.83/1.09 % set(auto2) -> set(sort_initial_sos).
% 0.83/1.09 % set(auto2) -> assign(sos_limit, -1).
% 0.83/1.09 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.83/1.09 % set(auto2) -> assign(max_megs, 400).
% 0.83/1.09 % set(auto2) -> assign(stats, some).
% 0.83/1.09 % set(auto2) -> clear(echo_input).
% 0.83/1.09 % set(auto2) -> set(quiet).
% 0.83/1.09 % set(auto2) -> clear(print_initial_clauses).
% 0.83/1.09 % set(auto2) -> clear(print_given).
% 0.83/1.09 assign(lrs_ticks,-1).
% 0.83/1.09 assign(sos_limit,10000).
% 0.83/1.09 assign(order,kbo).
% 0.83/1.09 set(lex_order_vars).
% 0.83/1.09 clear(print_given).
% 0.83/1.09
% 0.83/1.09 % formulas(sos). % not echoed (95 formulas)
% 0.83/1.09
% 0.83/1.09 ============================== end of input ==========================
% 0.83/1.09
% 0.83/1.09 % From the command line: assign(max_seconds, 300).
% 0.83/1.09
% 0.83/1.09 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.83/1.09
% 0.83/1.09 % Formulas that are not ordinary clauses:
% 0.83/1.09 1 (all A all B all C (coll(A,B,C) -> coll(A,C,B))) # label(ruleD1) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 2 (all A all B all C (coll(A,B,C) -> coll(B,A,C))) # label(ruleD2) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 11 (all A all B all M (midp(M,B,A) -> midp(M,A,B))) # label(ruleD11) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 70 (all A all B all C (midp(A,B,C) -> coll(A,B,C))) # label(ruleD69) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 95 -(all A all B all C all D all E all F all G all H all I (para(A,B,C,D) & para(A,C,B,D) & coll(E,A,C) & perp(F,E,C,D) & coll(F,C,D) & perp(G,E,B,C) & coll(G,B,C) & coll(H,E,G) & coll(H,A,D) & coll(I,E,F) & coll(I,A,B) -> para(G,F,H,I))) # label(exemplo6GDDFULLmoreE02316) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.83/1.09
% 0.83/1.09 ============================== end of process non-clausal formulas ===
% 0.83/1.09
% 0.83/1.09 ============================== PROCESS INITIAL CLAUSES ===============
% 0.83/1.09
% 0.83/1.09 ============================== PREDICATE ELIMINATION =================
% 0.83/1.09 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.83/1.09 97 -cong(A,B,A,C) | -cong(A,B,A,D) | circle(A,B,C,D) # label(ruleD12) # label(axiom). [clausify(12)].
% 0.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 101 -circle(A,B,C,D) | -coll(A,B,D) | perp(B,C,C,D) # label(ruleD53) # label(axiom). [clausify(54)].
% 0.83/1.09 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.83/1.09 102 -circle(A,B,C,D) | perp(f12(B,C,D,A),B,B,A) # label(ruleX11) # label(axiom). [clausify(87)].
% 0.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.09 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.83/1.11 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.83/1.11 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.83/1.11 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.83/1.11 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.83/1.11 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.83/1.11 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.83/1.11 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.83/1.11 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.83/1.11 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.83/1.11 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.83/1.11 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.83/1.11 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.83/1.11 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.83/1.11 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.83/1.11 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.83/1.11 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.83/1.11 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.83/1.11 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.83/1.11 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.83/1.11 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.83/1.11 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.83/1.11 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.83/1.11
% 0.83/1.11 ============================== end predicate elimination =============
% 0.83/1.11
% 0.83/1.11 Auto_denials: (non-Horn, no changes).
% 0.83/1.11
% 0.83/1.11 Term ordering decisions:
% 0.83/1.11 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. c9=1. f19=1. f1=1. f2=1. f3=1. f4=1. f10=1. f11=1. f12=1. f16=1. f5=1. f9=1. f15=1. f17=1. f18=1. f6=1. f13=1. f14=1. f20=1. f7=1. f8=1.
% 0.83/1.11
% 0.83/1.11 ============================== end of process initial clauses ========
% 0.83/1.11
% 0.83/1.11 ============================== CLAUSES FOR SEARCH ====================
% 0.83/1.11
% 0.83/1.11 ============================== end of clauses for search =============
% 0.83/1.11
% 0.83/1.11 ============================== SEARCH ================================
% 1.82/2.09
% 1.82/2.09 % Starting search at 0.02 seconds.
% 1.82/2.09
% 1.82/2.09 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 2147483647 (0.00 of 0.09 sec).
% 1.82/2.09
% 1.82/2.09 ============================== PROOF =================================
% 1.82/2.09 % SZS status Theorem
% 1.82/2.09 % SZS output start Refutation
% 1.82/2.09
% 1.82/2.09 % Proof 1 at 0.98 (+ 0.03) seconds.
% 1.82/2.09 % Length of proof is 95.
% 1.82/2.09 % Level of proof is 18.
% 1.82/2.09 % Maximum clause weight is 29.000.
% 1.82/2.09 % Given clauses 3619.
% 1.82/2.09
% 1.82/2.09 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].
% 1.82/2.09 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].
% 1.82/2.09 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].
% 1.82/2.09 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].
% 1.82/2.09 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].
% 1.82/2.09 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].
% 1.82/2.09 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].
% 1.82/2.09 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].
% 1.82/2.09 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].
% 1.82/2.09 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].
% 1.82/2.09 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].
% 1.82/2.09 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].
% 1.82/2.09 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].
% 1.82/2.09 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].
% 1.82/2.09 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].
% 1.82/2.09 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].
% 1.82/2.09 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].
% 1.82/2.09 67 (all A all B all C (para(A,B,A,C) -> coll(A,B,C))) # label(ruleD66) # label(axiom) # label(non_clause). [assumption].
% 1.82/2.09 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].
% 1.82/2.09 95 -(all A all B all C all D all E all F all G all H all I (para(A,B,C,D) & para(A,C,B,D) & coll(E,A,C) & perp(F,E,C,D) & coll(F,C,D) & perp(G,E,B,C) & coll(G,B,C) & coll(H,E,G) & coll(H,A,D) & coll(I,E,F) & coll(I,A,B) -> para(G,F,H,I))) # label(exemplo6GDDFULLmoreE02316) # label(negated_conjecture) # label(non_clause). [assumption].
% 1.82/2.09 111 -coll(A,B,C) | -coll(A,B,D) | coll(C,D,A) # label(ruleD3) # label(axiom). [clausify(3)].
% 1.82/2.09 112 -para(A,B,C,D) | para(A,B,D,C) # label(ruleD4) # label(axiom). [clausify(4)].
% 1.82/2.09 113 -para(A,B,C,D) | para(C,D,A,B) # label(ruleD5) # label(axiom). [clausify(5)].
% 1.82/2.09 115 -perp(A,B,C,D) | perp(A,B,D,C) # label(ruleD7) # label(axiom). [clausify(7)].
% 1.82/2.09 116 -perp(A,B,C,D) | perp(C,D,A,B) # label(ruleD8) # label(axiom). [clausify(8)].
% 1.82/2.09 117 -perp(A,B,C,D) | -perp(C,D,E,F) | para(A,B,E,F) # label(ruleD9) # label(axiom). [clausify(9)].
% 1.82/2.09 121 -cyclic(A,B,C,D) | cyclic(A,B,D,C) # label(ruleD14) # label(axiom). [clausify(14)].
% 1.82/2.09 122 -cyclic(A,B,C,D) | cyclic(A,C,B,D) # label(ruleD15) # label(axiom). [clausify(15)].
% 1.82/2.09 123 -cyclic(A,B,C,D) | cyclic(B,A,C,D) # label(ruleD16) # label(axiom). [clausify(16)].
% 1.82/2.09 124 -cyclic(A,B,C,D) | -cyclic(A,B,C,E) | cyclic(B,C,D,E) # label(ruleD17) # label(axiom). [clausify(17)].
% 1.82/2.09 127 -eqangle(A,B,C,D,E,F,V6,V7) | eqangle(E,F,V6,V7,A,B,C,D) # label(ruleD20) # label(axiom). [clausify(20)].
% 1.82/2.09 128 -eqangle(A,B,C,D,E,F,V6,V7) | eqangle(A,B,E,F,C,D,V6,V7) # label(ruleD21) # label(axiom). [clausify(21)].
% 1.82/2.09 147 -para(A,B,C,D) | eqangle(A,B,E,F,C,D,E,F) # label(ruleD40) # label(axiom). [clausify(40)].
% 1.82/2.09 150 -eqangle(A,B,A,C,D,B,D,C) | -coll(A,D,C) | cyclic(B,C,A,D) # label(ruleD42b) # label(axiom). [clausify(43)].
% 1.82/2.09 151 -cyclic(A,B,C,D) | -cyclic(A,B,C,E) | -cyclic(A,B,C,F) | -eqangle(C,A,C,B,F,D,F,E) | cong(A,B,D,E) # label(ruleD43) # label(axiom). [clausify(44)].
% 1.82/2.09 159 -cong(A,B,C,B) | -cong(A,D,C,D) | perp(A,C,B,D) # label(ruleD56) # label(axiom). [clausify(57)].
% 1.82/2.09 160 -cong(A,B,C,B) | -cong(A,D,C,D) | -cyclic(A,C,B,D) | perp(B,A,A,D) # label(ruleD57) # label(axiom). [clausify(58)].
% 1.82/2.09 169 -para(A,B,A,C) | coll(A,B,C) # label(ruleD66) # label(axiom). [clausify(67)].
% 1.82/2.09 175 -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)].
% 1.82/2.09 208 para(c1,c2,c3,c4) # label(exemplo6GDDFULLmoreE02316) # label(negated_conjecture). [clausify(95)].
% 1.82/2.09 211 perp(c6,c5,c3,c4) # label(exemplo6GDDFULLmoreE02316) # label(negated_conjecture). [clausify(95)].
% 1.82/2.09 213 perp(c7,c5,c2,c3) # label(exemplo6GDDFULLmoreE02316) # label(negated_conjecture). [clausify(95)].
% 1.82/2.09 219 -para(c7,c6,c8,c9) # label(exemplo6GDDFULLmoreE02316) # label(negated_conjecture). [clausify(95)].
% 1.82/2.09 258 -coll(A,B,C) | coll(C,C,A). [factor(111,a,b)].
% 1.82/2.09 263 -cyclic(A,B,C,D) | cyclic(B,C,D,D). [factor(124,a,b)].
% 1.82/2.09 331 eqangle(c1,c2,A,B,c3,c4,A,B). [resolve(208,a,147,a)].
% 1.82/2.09 369 -perp(c3,c4,A,B) | para(c6,c5,A,B). [resolve(211,a,117,a)].
% 1.82/2.09 370 perp(c3,c4,c6,c5). [resolve(211,a,116,a)].
% 1.82/2.09 388 -perp(c2,c3,A,B) | para(c7,c5,A,B). [resolve(213,a,117,a)].
% 1.82/2.09 389 perp(c2,c3,c7,c5). [resolve(213,a,116,a)].
% 1.82/2.09 573 eqangle(c1,c2,c3,c4,A,B,A,B). [resolve(331,a,128,a)].
% 1.82/2.09 1029 perp(c3,c4,c5,c6). [resolve(370,a,115,a)].
% 1.82/2.09 1057 perp(c2,c3,c5,c7). [resolve(389,a,115,a)].
% 1.82/2.09 1190 para(c6,c5,c6,c5). [resolve(369,a,370,a)].
% 1.82/2.09 1246 para(c6,c5,c5,c6). [resolve(1029,a,369,a)].
% 1.82/2.09 1430 eqangle(c6,c5,A,B,c6,c5,A,B). [resolve(1190,a,147,a)].
% 1.82/2.09 1520 para(c5,c6,c6,c5). [resolve(1246,a,113,a)].
% 1.82/2.09 1706 para(c5,c6,c5,c6). [resolve(1520,a,112,a)].
% 1.82/2.09 1795 eqangle(c5,c6,A,B,c5,c6,A,B). [resolve(1706,a,147,a)].
% 1.82/2.09 1867 para(c7,c5,c5,c7). [resolve(388,a,1057,a)].
% 1.82/2.09 1884 para(c5,c7,c7,c5). [resolve(1867,a,113,a)].
% 1.82/2.09 1912 para(c5,c7,c5,c7). [resolve(1884,a,112,a)].
% 1.82/2.09 1924 eqangle(c5,c7,A,B,c5,c7,A,B). [resolve(1912,a,147,a)].
% 1.82/2.09 2838 eqangle(A,B,A,B,c1,c2,c3,c4). [resolve(573,a,127,a)].
% 1.82/2.09 4910 -coll(c6,c6,A) | cyclic(c5,A,c6,c6). [resolve(1430,a,150,a)].
% 1.82/2.09 5044 -cyclic(c6,A,c5,c6) | -cyclic(c6,A,c5,A) | -cyclic(c6,A,c5,c5) | cong(c6,A,c6,A). [resolve(1795,a,151,d)].
% 1.82/2.09 5045 -coll(c5,c5,A) | cyclic(c6,A,c5,c5). [resolve(1795,a,150,a)].
% 1.82/2.09 5129 -coll(c5,c5,A) | cyclic(c7,A,c5,c5). [resolve(1924,a,150,a)].
% 1.82/2.09 5265 para(A,B,A,B). [resolve(2838,a,175,a),unit_del(a,208)].
% 1.82/2.09 5284 coll(A,B,B). [resolve(5265,a,169,a)].
% 1.82/2.09 5398 coll(A,A,B). [resolve(5284,a,258,a)].
% 1.82/2.09 5406 cyclic(c7,A,c5,c5). [back_unit_del(5129),unit_del(a,5398)].
% 1.82/2.09 5410 cyclic(c6,A,c5,c5). [back_unit_del(5045),unit_del(a,5398)].
% 1.82/2.09 5415 cyclic(c5,A,c6,c6). [back_unit_del(4910),unit_del(a,5398)].
% 1.82/2.09 5606 -cyclic(c6,A,c5,c6) | -cyclic(c6,A,c5,A) | cong(c6,A,c6,A). [back_unit_del(5044),unit_del(c,5410)].
% 1.82/2.09 5980 cyclic(c7,c5,A,c5). [resolve(5406,a,122,a)].
% 1.82/2.09 6047 cyclic(c6,c5,A,c5). [resolve(5410,a,122,a)].
% 1.82/2.09 6114 cyclic(A,c6,c6,c6). [resolve(5415,a,263,a)].
% 1.82/2.09 6128 cyclic(A,c5,c6,c6). [resolve(5415,a,123,a)].
% 1.82/2.09 6240 cyclic(c7,c5,c5,A). [resolve(5980,a,121,a)].
% 1.82/2.09 6411 cyclic(c5,c6,A,c5). [resolve(6047,a,123,a)].
% 1.82/2.09 6573 cyclic(c6,A,c6,c6). [resolve(6114,a,123,a)].
% 1.82/2.09 6587 cyclic(A,c6,c5,c6). [resolve(6128,a,122,a)].
% 1.82/2.09 6847 cyclic(c5,c5,A,B). [resolve(6240,a,124,b),unit_del(a,6240)].
% 1.82/2.09 7387 -cyclic(c5,c6,A,B) | cyclic(c6,A,c5,B). [resolve(6411,a,124,a)].
% 1.82/2.09 8121 cyclic(c6,c6,A,c6). [resolve(6573,a,122,a)].
% 1.82/2.09 8135 cyclic(c6,A,c5,c6). [resolve(6587,a,123,a)].
% 1.82/2.09 8137 -cyclic(c6,A,c5,A) | cong(c6,A,c6,A). [back_unit_del(5606),unit_del(a,8135)].
% 1.82/2.09 8604 cyclic(c5,A,B,C). [resolve(6847,a,124,b),unit_del(a,6847)].
% 1.82/2.09 8652 cyclic(c6,A,c5,B). [back_unit_del(7387),unit_del(a,8604)].
% 1.82/2.09 8662 cong(c6,A,c6,A). [back_unit_del(8137),unit_del(a,8652)].
% 1.82/2.09 9683 perp(A,c6,c6,c6). [resolve(8121,a,160,c),unit_del(a,8662),unit_del(b,8662)].
% 1.82/2.09 10576 perp(c6,c6,A,B). [resolve(8662,a,159,b),unit_del(a,8662)].
% 1.82/2.09 11716 para(A,c6,B,C). [resolve(9683,a,117,a),unit_del(a,10576)].
% 1.82/2.09 11717 $F. [resolve(11716,a,219,a)].
% 1.82/2.09
% 1.82/2.09 % SZS output end Refutation
% 1.82/2.09 ============================== end of proof ==========================
% 1.82/2.09
% 1.82/2.09 ============================== STATISTICS ============================
% 1.82/2.09
% 1.82/2.09 Given=3619. Generated=38405. Kept=11600. proofs=1.
% 1.82/2.09 Usable=1885. Sos=5089. Demods=0. Limbo=6, Disabled=4774. Hints=0.
% 1.82/2.09 Megabytes=8.71.
% 1.82/2.09 User_CPU=0.98, System_CPU=0.03, Wall_clock=1.
% 1.82/2.09
% 1.82/2.09 ============================== end of statistics =====================
% 1.82/2.09
% 1.82/2.09 ============================== end of search =========================
% 1.82/2.09
% 1.82/2.09 THEOREM PROVED
% 1.82/2.09 % SZS status Theorem
% 1.82/2.09
% 1.82/2.09 Exiting with 1 proof.
% 1.82/2.09
% 1.82/2.09 Process 9108 exit (max_proofs) Sat Jun 18 07:57:49 2022
% 1.82/2.09 Prover9 interrupted
%------------------------------------------------------------------------------