TSTP Solution File: GEO578+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GEO578+1 : TPTP v8.1.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n006.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:03 EDT 2022
% Result : Theorem 1.51s 1.79s
% Output : Refutation 1.51s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO578+1 : TPTP v8.1.0. Released v7.5.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n006.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 : Fri Jun 17 16:54:56 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.79/1.13 ============================== Prover9 ===============================
% 0.79/1.13 Prover9 (32) version 2009-11A, November 2009.
% 0.79/1.13 Process 28009 was started by sandbox on n006.cluster.edu,
% 0.79/1.13 Fri Jun 17 16:54:56 2022
% 0.79/1.13 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_27855_n006.cluster.edu".
% 0.79/1.13 ============================== end of head ===========================
% 0.79/1.13
% 0.79/1.13 ============================== INPUT =================================
% 0.79/1.13
% 0.79/1.13 % Reading from file /tmp/Prover9_27855_n006.cluster.edu
% 0.79/1.13
% 0.79/1.13 set(prolog_style_variables).
% 0.79/1.13 set(auto2).
% 0.79/1.13 % set(auto2) -> set(auto).
% 0.79/1.13 % set(auto) -> set(auto_inference).
% 0.79/1.13 % set(auto) -> set(auto_setup).
% 0.79/1.13 % set(auto_setup) -> set(predicate_elim).
% 0.79/1.13 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.79/1.13 % set(auto) -> set(auto_limits).
% 0.79/1.13 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.79/1.13 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.79/1.13 % set(auto) -> set(auto_denials).
% 0.79/1.13 % set(auto) -> set(auto_process).
% 0.79/1.13 % set(auto2) -> assign(new_constants, 1).
% 0.79/1.13 % set(auto2) -> assign(fold_denial_max, 3).
% 0.79/1.13 % set(auto2) -> assign(max_weight, "200.000").
% 0.79/1.13 % set(auto2) -> assign(max_hours, 1).
% 0.79/1.13 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.79/1.13 % set(auto2) -> assign(max_seconds, 0).
% 0.79/1.13 % set(auto2) -> assign(max_minutes, 5).
% 0.79/1.13 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.79/1.13 % set(auto2) -> set(sort_initial_sos).
% 0.79/1.13 % set(auto2) -> assign(sos_limit, -1).
% 0.79/1.13 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.79/1.13 % set(auto2) -> assign(max_megs, 400).
% 0.79/1.13 % set(auto2) -> assign(stats, some).
% 0.79/1.13 % set(auto2) -> clear(echo_input).
% 0.79/1.13 % set(auto2) -> set(quiet).
% 0.79/1.13 % set(auto2) -> clear(print_initial_clauses).
% 0.79/1.13 % set(auto2) -> clear(print_given).
% 0.79/1.13 assign(lrs_ticks,-1).
% 0.79/1.13 assign(sos_limit,10000).
% 0.79/1.13 assign(order,kbo).
% 0.79/1.13 set(lex_order_vars).
% 0.79/1.13 clear(print_given).
% 0.79/1.13
% 0.79/1.13 % formulas(sos). % not echoed (95 formulas)
% 0.79/1.13
% 0.79/1.13 ============================== end of input ==========================
% 0.79/1.13
% 0.79/1.13 % From the command line: assign(max_seconds, 300).
% 0.79/1.13
% 0.79/1.13 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.79/1.13
% 0.79/1.13 % Formulas that are not ordinary clauses:
% 0.79/1.13 1 (all A all B all C (coll(A,B,C) -> coll(A,C,B))) # label(ruleD1) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.13 2 (all A all B all C (coll(A,B,C) -> coll(B,A,C))) # label(ruleD2) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 11 (all A all B all M (midp(M,B,A) -> midp(M,A,B))) # label(ruleD11) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.79/1.13 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.86/1.13 66 (all A all B all C all D all O (para(A,B,C,D) & coll(O,A,C) & coll(O,B,D) -> eqratio(O,A,A,C,O,B,B,D))) # label(ruleD65) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.13 67 (all A all B all C (para(A,B,A,C) -> coll(A,B,C))) # label(ruleD66) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.13 68 (all A all B all C (cong(A,B,A,C) & coll(A,B,C) -> midp(A,B,C))) # label(ruleD67) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.13 69 (all A all B all C (midp(A,B,C) -> cong(A,B,A,C))) # label(ruleD68) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.13 70 (all A all B all C (midp(A,B,C) -> coll(A,B,C))) # label(ruleD69) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.13 71 (all A all B all C all D all M all N (midp(M,A,B) & midp(N,C,D) -> eqratio(M,A,A,B,N,C,C,D))) # label(ruleD70) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.13 72 (all A all B all C all D (eqangle(A,B,C,D,C,D,A,B) & -para(A,B,C,D) -> perp(A,B,C,D))) # label(ruleD71) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.13 73 (all A all B all C all D (eqangle(A,B,C,D,C,D,A,B) & -perp(A,B,C,D) -> para(A,B,C,D))) # label(ruleD72) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.13 74 (all A all B all C all D all P all Q all U all V (eqangle(A,B,C,D,P,Q,U,V) & para(P,Q,U,V) -> para(A,B,C,D))) # label(ruleD73) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.13 75 (all A all B all C all D all P all Q all U all V (eqangle(A,B,C,D,P,Q,U,V) & perp(P,Q,U,V) -> perp(A,B,C,D))) # label(ruleD74) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.13 76 (all A all B all C all D all P all Q all U all V (eqratio(A,B,C,D,P,Q,U,V) & cong(P,Q,U,V) -> cong(A,B,C,D))) # label(ruleD75) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.13 77 (all A all M all O all X exists B (perp(O,M,M,A) & eqangle(X,O,M,O,M,O,A,O) -> coll(B,A,M) & coll(B,O,X))) # label(ruleX1) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.13 78 (all A all B all O all X exists M (cong(O,A,O,B) & eqangle(A,O,O,X,O,X,O,B) -> coll(B,A,M) & coll(M,O,X))) # label(ruleX2) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.13 79 (all A all B all O all X exists M (perp(O,X,A,B) & eqangle(A,O,O,X,O,X,O,B) -> coll(B,A,M) & coll(M,O,X))) # label(ruleX3) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.13 80 (all A all B all O all X exists M (perp(O,X,A,B) & cong(O,A,O,B) -> coll(B,A,M) & coll(M,O,X))) # label(ruleX4) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.13 81 (all A all B all P all X all Y exists Q (eqangle(A,P,B,P,A,X,B,Y) & -coll(A,B,P) -> eqangle(A,P,B,P,A,Q,B,Q) & cyclic(X,B,P,Q))) # label(ruleX5) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.13 82 (all A all B all C all D all M all N exists P (midp(M,A,B) & midp(N,C,D) -> midp(P,A,D) & para(P,M,B,D) & para(P,N,A,C))) # label(ruleX6) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.13 83 (all A all B all C all D all M all N all Q exists P (midp(M,A,B) & midp(N,C,D) & coll(C,A,B) & coll(D,A,B) -> midp(P,A,Q))) # label(ruleX7) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.13 84 (all A all B all M all P all Q all R all M exists X (midp(M,A,B) & para(A,P,R,M) & para(A,P,B,Q) & coll(P,Q,R) -> coll(X,A,Q) & coll(X,M,R))) # label(ruleX8) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.13 85 (all A all B all C all D all O exists P (cong(O,C,O,D) & perp(A,B,B,O) -> cong(O,C,O,P) & para(P,C,A,B) & cong(B,C,B,P))) # label(ruleX9) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.13 86 (all A all B all C all H exists P exists Q (perp(A,H,B,C) & perp(B,H,A,C) -> coll(P,C,B) & perp(A,P,C,B) & coll(Q,C,A) & perp(B,Q,C,A))) # label(ruleX10) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.13 87 (all A all B all C all O exists P (circle(O,A,B,C) -> perp(P,A,A,O))) # label(ruleX11) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.13 88 (all A all B all C all D all M all N exists P exists Q (circle(M,A,B,C) & cong(M,A,M,D) & cong(N,A,N,B) & M != N -> coll(P,A,C) & cong(P,N,N,A) & coll(Q,B,D) & cong(Q,N,N,A))) # label(ruleX12) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.13 89 (all A all B all C all D all M exists O (cyclic(A,B,C,D) & para(A,B,C,D) & midp(M,A,B) -> circle(O,A,B,C))) # label(ruleX13) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.13 90 (all A all B all C all D exists O (perp(A,C,C,B) & cyclic(A,B,C,D) -> circle(O,A,B,C))) # label(ruleX14) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.13 91 (all A all B all C all E all F exists P (perp(A,C,C,B) & coll(B,E,F) -> coll(P,E,F) & perp(P,A,E,F))) # label(ruleX15) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.13 92 (all A all B all C all D all M exists P (perp(A,B,A,C) & perp(C,A,C,D) & midp(M,B,D) -> midp(P,A,C))) # label(ruleX16) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.13 93 (all A all B all O exists C (cong(O,A,O,B) & perp(A,O,O,B) -> coll(A,O,C) & cong(O,A,O,C))) # label(ruleX17) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.13 94 (all A all B all C all D all P all Q exists R (para(A,B,C,D) & coll(P,A,C) & coll(P,B,D) & coll(Q,A,B) -> coll(P,Q,R) & coll(R,C,D))) # label(ruleX18) # label(axiom) # label(non_clause). [assumption].
% 0.86/1.13 95 -(all A all B all C all I all E (eqangle(I,A,A,B,I,A,A,C) & eqangle(I,B,B,C,I,B,B,A) & eqangle(I,C,C,A,I,C,C,B) & para(A,B,E,I) & coll(E,A,C) -> cong(E,I,E,A))) # label(exemplo6GDDFULL214040) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.86/1.13
% 0.86/1.13 ============================== end of process non-clausal formulas ===
% 0.86/1.13
% 0.86/1.13 ============================== PROCESS INITIAL CLAUSES ===============
% 0.86/1.13
% 0.86/1.13 ============================== PREDICATE ELIMINATION =================
% 0.86/1.13 96 -circle(A,B,C,D) | -perp(A,B,B,E) | eqangle(B,E,B,C,D,B,D,C) # label(ruleD48) # label(axiom). [clausify(49)].
% 0.86/1.13 97 -cong(A,B,A,C) | -cong(A,B,A,D) | circle(A,B,C,D) # label(ruleD12) # label(axiom). [clausify(12)].
% 0.86/1.13 Derived: -perp(A,B,B,C) | eqangle(B,C,B,D,E,B,E,D) | -cong(A,B,A,D) | -cong(A,B,A,E). [resolve(96,a,97,c)].
% 0.86/1.13 98 -circle(A,B,C,D) | -eqangle(B,E,B,C,D,B,D,C) | perp(A,B,B,E) # label(ruleD49) # label(axiom). [clausify(50)].
% 0.86/1.13 Derived: -eqangle(A,B,A,C,D,A,D,C) | perp(E,A,A,B) | -cong(E,A,E,C) | -cong(E,A,E,D). [resolve(98,a,97,c)].
% 0.86/1.13 99 -circle(A,B,C,D) | -midp(E,C,D) | eqangle(B,C,B,D,A,C,A,E) # label(ruleD50) # label(axiom). [clausify(51)].
% 0.86/1.13 Derived: -midp(A,B,C) | eqangle(D,B,D,C,E,B,E,A) | -cong(E,D,E,B) | -cong(E,D,E,C). [resolve(99,a,97,c)].
% 0.86/1.13 100 -circle(A,B,C,D) | -coll(E,C,D) | -eqangle(B,C,B,D,A,C,A,E) | midp(E,C,D) # label(ruleD51) # label(axiom). [clausify(52)].
% 0.86/1.13 Derived: -coll(A,B,C) | -eqangle(D,B,D,C,E,B,E,A) | midp(A,B,C) | -cong(E,D,E,B) | -cong(E,D,E,C). [resolve(100,a,97,c)].
% 0.86/1.13 101 -circle(A,B,C,D) | -coll(A,B,D) | perp(B,C,C,D) # label(ruleD53) # label(axiom). [clausify(54)].
% 0.86/1.13 Derived: -coll(A,B,C) | perp(B,D,D,C) | -cong(A,B,A,D) | -cong(A,B,A,C). [resolve(101,a,97,c)].
% 0.86/1.13 102 -circle(A,B,C,D) | perp(f12(B,C,D,A),B,B,A) # label(ruleX11) # label(axiom). [clausify(87)].
% 0.86/1.13 Derived: perp(f12(A,B,C,D),A,A,D) | -cong(D,A,D,B) | -cong(D,A,D,C). [resolve(102,a,97,c)].
% 0.86/1.13 103 -circle(A,B,C,D) | -cong(A,B,A,E) | -cong(F,B,F,C) | F = A | coll(f13(B,C,D,E,A,F),B,D) # label(ruleX12) # label(axiom). [clausify(88)].
% 0.86/1.13 Derived: -cong(A,B,A,C) | -cong(D,B,D,E) | D = A | coll(f13(B,E,F,C,A,D),B,F) | -cong(A,B,A,E) | -cong(A,B,A,F). [resolve(103,a,97,c)].
% 0.86/1.13 104 -circle(A,B,C,D) | -cong(A,B,A,E) | -cong(F,B,F,C) | F = A | cong(f13(B,C,D,E,A,F),F,F,B) # label(ruleX12) # label(axiom). [clausify(88)].
% 0.86/1.13 Derived: -cong(A,B,A,C) | -cong(D,B,D,E) | D = A | cong(f13(B,E,F,C,A,D),D,D,B) | -cong(A,B,A,E) | -cong(A,B,A,F). [resolve(104,a,97,c)].
% 0.86/1.13 105 -circle(A,B,C,D) | -cong(A,B,A,E) | -cong(F,B,F,C) | F = A | coll(f14(B,C,D,E,A,F),C,E) # label(ruleX12) # label(axiom). [clausify(88)].
% 0.86/1.13 Derived: -cong(A,B,A,C) | -cong(D,B,D,E) | D = A | coll(f14(B,E,F,C,A,D),E,C) | -cong(A,B,A,E) | -cong(A,B,A,F). [resolve(105,a,97,c)].
% 0.86/1.13 106 -circle(A,B,C,D) | -cong(A,B,A,E) | -cong(F,B,F,C) | F = A | cong(f14(B,C,D,E,A,F),F,F,B) # label(ruleX12) # label(axiom). [clausify(88)].
% 0.86/1.13 Derived: -cong(A,B,A,C) | -cong(D,B,D,E) | D = A | cong(f14(B,E,F,C,A,D),D,D,B) | -cong(A,B,A,E) | -cong(A,B,A,F). [resolve(106,a,97,c)].
% 0.86/1.13 107 -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | circle(f15(A,B,C,D,E),A,B,C) # label(ruleX13) # label(axiom). [clausify(89)].
% 0.86/1.28 Derived: -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | -perp(f15(A,B,C,D,E),A,A,F) | eqangle(A,F,A,B,C,A,C,B). [resolve(107,d,96,a)].
% 0.86/1.28 Derived: -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | -eqangle(A,F,A,B,C,A,C,B) | perp(f15(A,B,C,D,E),A,A,F). [resolve(107,d,98,a)].
% 0.86/1.28 Derived: -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | -midp(F,B,C) | eqangle(A,B,A,C,f15(A,B,C,D,E),B,f15(A,B,C,D,E),F). [resolve(107,d,99,a)].
% 0.86/1.28 Derived: -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | -coll(F,B,C) | -eqangle(A,B,A,C,f15(A,B,C,D,E),B,f15(A,B,C,D,E),F) | midp(F,B,C). [resolve(107,d,100,a)].
% 0.86/1.28 Derived: -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | -coll(f15(A,B,C,D,E),A,C) | perp(A,B,B,C). [resolve(107,d,101,a)].
% 0.86/1.28 Derived: -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | perp(f12(A,B,C,f15(A,B,C,D,E)),A,A,f15(A,B,C,D,E)). [resolve(107,d,102,a)].
% 0.86/1.28 Derived: -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | -cong(f15(A,B,C,D,E),A,f15(A,B,C,D,E),F) | -cong(V6,A,V6,B) | V6 = f15(A,B,C,D,E) | coll(f13(A,B,C,F,f15(A,B,C,D,E),V6),A,C). [resolve(107,d,103,a)].
% 0.86/1.28 Derived: -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | -cong(f15(A,B,C,D,E),A,f15(A,B,C,D,E),F) | -cong(V6,A,V6,B) | V6 = f15(A,B,C,D,E) | cong(f13(A,B,C,F,f15(A,B,C,D,E),V6),V6,V6,A). [resolve(107,d,104,a)].
% 0.86/1.28 Derived: -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | -cong(f15(A,B,C,D,E),A,f15(A,B,C,D,E),F) | -cong(V6,A,V6,B) | V6 = f15(A,B,C,D,E) | coll(f14(A,B,C,F,f15(A,B,C,D,E),V6),B,F). [resolve(107,d,105,a)].
% 0.86/1.28 Derived: -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | -cong(f15(A,B,C,D,E),A,f15(A,B,C,D,E),F) | -cong(V6,A,V6,B) | V6 = f15(A,B,C,D,E) | cong(f14(A,B,C,F,f15(A,B,C,D,E),V6),V6,V6,A). [resolve(107,d,106,a)].
% 0.86/1.28 108 -perp(A,B,B,C) | -cyclic(A,C,B,D) | circle(f16(A,C,B,D),A,C,B) # label(ruleX14) # label(axiom). [clausify(90)].
% 0.86/1.28 Derived: -perp(A,B,B,C) | -cyclic(A,C,B,D) | -perp(f16(A,C,B,D),A,A,E) | eqangle(A,E,A,C,B,A,B,C). [resolve(108,c,96,a)].
% 0.86/1.28 Derived: -perp(A,B,B,C) | -cyclic(A,C,B,D) | -eqangle(A,E,A,C,B,A,B,C) | perp(f16(A,C,B,D),A,A,E). [resolve(108,c,98,a)].
% 0.86/1.28 Derived: -perp(A,B,B,C) | -cyclic(A,C,B,D) | -midp(E,C,B) | eqangle(A,C,A,B,f16(A,C,B,D),C,f16(A,C,B,D),E). [resolve(108,c,99,a)].
% 0.86/1.28 Derived: -perp(A,B,B,C) | -cyclic(A,C,B,D) | -coll(E,C,B) | -eqangle(A,C,A,B,f16(A,C,B,D),C,f16(A,C,B,D),E) | midp(E,C,B). [resolve(108,c,100,a)].
% 0.86/1.28 Derived: -perp(A,B,B,C) | -cyclic(A,C,B,D) | -coll(f16(A,C,B,D),A,B) | perp(A,C,C,B). [resolve(108,c,101,a)].
% 0.86/1.28 Derived: -perp(A,B,B,C) | -cyclic(A,C,B,D) | perp(f12(A,C,B,f16(A,C,B,D)),A,A,f16(A,C,B,D)). [resolve(108,c,102,a)].
% 0.86/1.28 Derived: -perp(A,B,B,C) | -cyclic(A,C,B,D) | -cong(f16(A,C,B,D),A,f16(A,C,B,D),E) | -cong(F,A,F,C) | F = f16(A,C,B,D) | coll(f13(A,C,B,E,f16(A,C,B,D),F),A,B). [resolve(108,c,103,a)].
% 0.86/1.28 Derived: -perp(A,B,B,C) | -cyclic(A,C,B,D) | -cong(f16(A,C,B,D),A,f16(A,C,B,D),E) | -cong(F,A,F,C) | F = f16(A,C,B,D) | cong(f13(A,C,B,E,f16(A,C,B,D),F),F,F,A). [resolve(108,c,104,a)].
% 0.86/1.28 Derived: -perp(A,B,B,C) | -cyclic(A,C,B,D) | -cong(f16(A,C,B,D),A,f16(A,C,B,D),E) | -cong(F,A,F,C) | F = f16(A,C,B,D) | coll(f14(A,C,B,E,f16(A,C,B,D),F),C,E). [resolve(108,c,105,a)].
% 0.86/1.28 Derived: -perp(A,B,B,C) | -cyclic(A,C,B,D) | -cong(f16(A,C,B,D),A,f16(A,C,B,D),E) | -cong(F,A,F,C) | F = f16(A,C,B,D) | cong(f14(A,C,B,E,f16(A,C,B,D),F),F,F,A). [resolve(108,c,106,a)].
% 0.86/1.28
% 0.86/1.28 ============================== end predicate elimination =============
% 0.86/1.28
% 0.86/1.28 Auto_denials: (non-Horn, no changes).
% 0.86/1.28
% 0.86/1.28 Term ordering decisions:
% 0.86/1.28 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. c5=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.86/1.28
% 0.86/1.28 ============================== end of process initial clauses ========
% 0.86/1.28
% 0.86/1.28 ============================== CLAUSES FOR SEARCH ====================
% 0.86/1.28
% 0.86/1.28 ============================== end of clauses for search =============
% 0.86/1.28
% 0.86/1.28 ============================== SEARCH ================================
% 0.86/1.28
% 0.86/1.28 % Starting search at 0.04 seconds.
% 0.86/1.28
% 0.86/1.28 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 56 (0.00 of 0.17 sec).
% 1.51/1.79
% 1.51/1.79 Low Water (keep): wt=29.000, iters=3368
% 1.51/1.79
% 1.51/1.79 Low Water (keep): wt=28.000, iters=3352
% 1.51/1.79
% 1.51/1.79 Low Water (keep): wt=24.000, iters=3370
% 1.51/1.79
% 1.51/1.79 Low Water (keep): wt=23.000, iters=3348
% 1.51/1.79
% 1.51/1.79 Low Water (keep): wt=19.000, iters=3349
% 1.51/1.79
% 1.51/1.79 Low Water (keep): wt=18.000, iters=3345
% 1.51/1.79
% 1.51/1.79 Low Water (keep): wt=15.000, iters=3375
% 1.51/1.79
% 1.51/1.79 Low Water (keep): wt=14.000, iters=3339
% 1.51/1.79
% 1.51/1.79 Low Water (displace): id=6274, wt=53.000
% 1.51/1.79
% 1.51/1.79 Low Water (displace): id=6275, wt=52.000
% 1.51/1.79
% 1.51/1.79 Low Water (displace): id=6340, wt=48.000
% 1.51/1.79
% 1.51/1.79 ============================== PROOF =================================
% 1.51/1.79 % SZS status Theorem
% 1.51/1.79 % SZS output start Refutation
% 1.51/1.79
% 1.51/1.79 % Proof 1 at 0.66 (+ 0.02) seconds.
% 1.51/1.79 % Length of proof is 136.
% 1.51/1.79 % Level of proof is 23.
% 1.51/1.79 % Maximum clause weight is 29.000.
% 1.51/1.79 % Given clauses 1575.
% 1.51/1.79
% 1.51/1.79 1 (all A all B all C (coll(A,B,C) -> coll(A,C,B))) # label(ruleD1) # label(axiom) # label(non_clause). [assumption].
% 1.51/1.79 2 (all A all B all C (coll(A,B,C) -> coll(B,A,C))) # label(ruleD2) # label(axiom) # label(non_clause). [assumption].
% 1.51/1.79 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.51/1.79 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.51/1.79 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.51/1.79 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].
% 1.51/1.79 11 (all A all B all M (midp(M,B,A) -> midp(M,A,B))) # label(ruleD11) # label(axiom) # label(non_clause). [assumption].
% 1.51/1.79 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.51/1.79 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.51/1.79 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.51/1.79 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.51/1.79 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].
% 1.51/1.79 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.51/1.79 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].
% 1.51/1.79 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.51/1.79 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.51/1.79 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.51/1.79 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].
% 1.51/1.79 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].
% 1.51/1.79 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.51/1.79 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].
% 1.51/1.79 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.51/1.79 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].
% 1.51/1.79 69 (all A all B all C (midp(A,B,C) -> cong(A,B,A,C))) # label(ruleD68) # label(axiom) # label(non_clause). [assumption].
% 1.51/1.79 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.51/1.79 95 -(all A all B all C all I all E (eqangle(I,A,A,B,I,A,A,C) & eqangle(I,B,B,C,I,B,B,A) & eqangle(I,C,C,A,I,C,C,B) & para(A,B,E,I) & coll(E,A,C) -> cong(E,I,E,A))) # label(exemplo6GDDFULL214040) # label(negated_conjecture) # label(non_clause). [assumption].
% 1.51/1.79 109 -coll(A,B,C) | coll(A,C,B) # label(ruleD1) # label(axiom). [clausify(1)].
% 1.51/1.79 110 -coll(A,B,C) | coll(B,A,C) # label(ruleD2) # label(axiom). [clausify(2)].
% 1.51/1.79 111 -coll(A,B,C) | -coll(A,B,D) | coll(C,D,A) # label(ruleD3) # label(axiom). [clausify(3)].
% 1.51/1.79 112 -para(A,B,C,D) | para(A,B,D,C) # label(ruleD4) # label(axiom). [clausify(4)].
% 1.51/1.79 113 -para(A,B,C,D) | para(C,D,A,B) # label(ruleD5) # label(axiom). [clausify(5)].
% 1.51/1.79 114 -para(A,B,C,D) | -para(C,D,E,F) | para(A,B,E,F) # label(ruleD6) # label(axiom). [clausify(6)].
% 1.51/1.79 119 -midp(A,B,C) | midp(A,C,B) # label(ruleD11) # label(axiom). [clausify(11)].
% 1.51/1.79 121 -cyclic(A,B,C,D) | cyclic(A,B,D,C) # label(ruleD14) # label(axiom). [clausify(14)].
% 1.51/1.79 122 -cyclic(A,B,C,D) | cyclic(A,C,B,D) # label(ruleD15) # label(axiom). [clausify(15)].
% 1.51/1.79 123 -cyclic(A,B,C,D) | cyclic(B,A,C,D) # label(ruleD16) # label(axiom). [clausify(16)].
% 1.51/1.79 124 -cyclic(A,B,C,D) | -cyclic(A,B,C,E) | cyclic(B,C,D,E) # label(ruleD17) # label(axiom). [clausify(17)].
% 1.51/1.79 126 -eqangle(A,B,C,D,E,F,V6,V7) | eqangle(C,D,A,B,V6,V7,E,F) # label(ruleD19) # label(axiom). [clausify(19)].
% 1.51/1.79 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.51/1.79 146 -eqangle(A,B,C,D,E,F,C,D) | para(A,B,E,F) # label(ruleD39) # label(axiom). [clausify(39)].
% 1.51/1.79 147 -para(A,B,C,D) | eqangle(A,B,E,F,C,D,E,F) # label(ruleD40) # label(axiom). [clausify(40)].
% 1.51/1.79 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.51/1.79 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.51/1.79 153 -midp(A,B,C) | -para(A,D,C,E) | -coll(D,B,E) | midp(D,B,E) # label(ruleD45) # label(axiom). [clausify(46)].
% 1.51/1.79 158 -midp(A,B,C) | -perp(D,A,B,C) | cong(D,B,D,C) # label(ruleD55) # label(axiom). [clausify(56)].
% 1.51/1.79 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.51/1.79 167 -midp(A,B,C) | -para(B,D,C,E) | -para(B,E,C,D) | midp(A,D,E) # label(ruleD64) # label(axiom). [clausify(65)].
% 1.51/1.79 169 -para(A,B,A,C) | coll(A,B,C) # label(ruleD66) # label(axiom). [clausify(67)].
% 1.51/1.79 170 -cong(A,B,A,C) | -coll(A,B,C) | midp(A,B,C) # label(ruleD67) # label(axiom). [clausify(68)].
% 1.51/1.79 171 -midp(A,B,C) | cong(A,B,A,C) # label(ruleD68) # label(axiom). [clausify(69)].
% 1.51/1.79 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.51/1.79 208 eqangle(c4,c1,c1,c2,c4,c1,c1,c3) # label(exemplo6GDDFULL214040) # label(negated_conjecture). [clausify(95)].
% 1.51/1.79 210 eqangle(c4,c3,c3,c1,c4,c3,c3,c2) # label(exemplo6GDDFULL214040) # label(negated_conjecture). [clausify(95)].
% 1.51/1.79 211 para(c1,c2,c5,c4) # label(exemplo6GDDFULL214040) # label(negated_conjecture). [clausify(95)].
% 1.51/1.79 212 coll(c5,c1,c3) # label(exemplo6GDDFULL214040) # label(negated_conjecture). [clausify(95)].
% 1.51/1.79 213 -cong(c5,c4,c5,c1) # label(exemplo6GDDFULL214040) # label(negated_conjecture). [clausify(95)].
% 1.51/1.79 252 -coll(A,B,C) | coll(C,C,A). [factor(111,a,b)].
% 1.51/1.79 257 -cyclic(A,B,C,D) | cyclic(B,C,D,D). [factor(124,a,b)].
% 1.51/1.79 258 -cyclic(A,B,C,D) | -cyclic(A,B,C,E) | -eqangle(C,A,C,B,E,D,E,D) | cong(A,B,D,D). [factor(151,a,b)].
% 1.51/1.79 260 -cyclic(A,B,C,D) | -cyclic(A,B,C,E) | -eqangle(C,A,C,B,E,D,E,E) | cong(A,B,D,E). [factor(151,b,c)].
% 1.51/1.79 263 -cong(A,B,C,B) | -cyclic(A,C,B,B) | perp(B,A,A,B). [factor(160,a,b)].
% 1.51/1.79 266 -midp(A,B,C) | -para(B,D,C,D) | midp(A,D,D). [factor(167,b,c)].
% 1.51/1.79 320 eqangle(c4,c1,c4,c1,c1,c2,c1,c3). [resolve(208,a,128,a)].
% 1.51/1.79 322 eqangle(c1,c2,c4,c1,c1,c3,c4,c1). [resolve(208,a,126,a)].
% 1.51/1.79 338 eqangle(c4,c3,c4,c3,c3,c1,c3,c2). [resolve(210,a,128,a)].
% 1.51/1.79 340 eqangle(c3,c1,c4,c3,c3,c2,c4,c3). [resolve(210,a,126,a)].
% 1.51/1.79 354 -para(A,B,c1,c2) | para(A,B,c5,c4). [resolve(211,a,114,b)].
% 1.51/1.79 356 para(c5,c4,c1,c2). [resolve(211,a,113,a)].
% 1.51/1.79 357 para(c1,c2,c4,c5). [resolve(211,a,112,a)].
% 1.51/1.79 362 coll(c3,c3,c5). [resolve(252,a,212,a)].
% 1.51/1.79 374 -coll(c3,c3,A) | coll(A,c5,c3). [resolve(362,a,111,b)].
% 1.51/1.79 428 -para(c1,c2,c1,c3) | para(c4,c1,c4,c1). [resolve(320,a,175,a)].
% 1.51/1.79 487 para(c4,c5,c1,c2). [resolve(357,a,113,a)].
% 1.51/1.79 490 para(c1,c2,c1,c3). [resolve(322,a,146,a)].
% 1.51/1.79 494 para(c4,c1,c4,c1). [back_unit_del(428),unit_del(a,490)].
% 1.51/1.79 615 -midp(A,c4,c4) | midp(A,c1,c1). [resolve(494,a,266,b)].
% 1.51/1.79 622 coll(c4,c1,c1). [resolve(494,a,169,a)].
% 1.51/1.79 624 -midp(c4,A,c4) | -coll(c1,A,c1) | midp(c1,A,c1). [resolve(494,a,153,b)].
% 1.51/1.79 625 eqangle(c4,c1,A,B,c4,c1,A,B). [resolve(494,a,147,a)].
% 1.51/1.79 627 coll(c1,c1,c4). [resolve(622,a,252,a)].
% 1.51/1.79 630 coll(c1,c4,c1). [resolve(622,a,110,a)].
% 1.51/1.79 633 coll(c4,c4,c1). [resolve(627,a,252,a)].
% 1.51/1.79 640 coll(c4,c1,c4). [resolve(633,a,109,a)].
% 1.51/1.79 641 coll(c4,c4,c4). [resolve(640,a,252,a)].
% 1.51/1.79 1103 -para(c3,c1,c3,c2) | para(c4,c3,c4,c3). [resolve(338,a,175,a)].
% 1.51/1.79 1139 para(c3,c1,c3,c2). [resolve(340,a,146,a)].
% 1.51/1.79 1143 para(c4,c3,c4,c3). [back_unit_del(1103),unit_del(a,1139)].
% 1.51/1.79 1231 coll(c4,c3,c3). [resolve(1143,a,169,a)].
% 1.51/1.79 1241 coll(c3,c3,c4). [resolve(1231,a,252,a)].
% 1.51/1.79 1247 coll(c4,c5,c3). [resolve(1241,a,374,a)].
% 1.51/1.79 1255 coll(c5,c4,c3). [resolve(1247,a,110,a)].
% 1.51/1.79 1267 coll(c5,c3,c4). [resolve(1255,a,109,a)].
% 1.51/1.79 1282 coll(c4,c4,c5). [resolve(1267,a,252,a)].
% 1.51/1.79 1524 para(c4,c5,c5,c4). [resolve(354,a,487,a)].
% 1.51/1.79 1525 para(c5,c4,c5,c4). [resolve(354,a,356,a)].
% 1.51/1.79 1616 para(c4,c5,c4,c5). [resolve(1524,a,112,a)].
% 1.51/1.79 1628 eqangle(c5,c4,A,B,c5,c4,A,B). [resolve(1525,a,147,a)].
% 1.51/1.79 1814 -midp(A,c4,c4) | midp(A,c5,c5). [resolve(1616,a,266,b)].
% 1.51/1.79 2276 -cyclic(c1,c4,c4,c1) | -cyclic(c1,c4,c4,c4) | cong(c1,c4,c1,c4). [resolve(625,a,260,c)].
% 1.51/1.79 2286 -coll(c4,c4,A) | cyclic(c1,A,c4,c4). [resolve(625,a,150,a)].
% 1.51/1.79 2741 -cyclic(c4,c4,c5,c4) | -cyclic(c4,c4,c5,c5) | cong(c4,c4,c4,c4). [resolve(1628,a,258,c)].
% 1.51/1.79 3217 cyclic(c1,c5,c4,c4). [resolve(2286,a,1282,a)].
% 1.51/1.79 3220 cyclic(c1,c4,c4,c4). [resolve(2286,a,641,a)].
% 1.51/1.79 3221 cyclic(c1,c1,c4,c4). [resolve(2286,a,633,a)].
% 1.51/1.79 3222 -cyclic(c1,c4,c4,c1) | cong(c1,c4,c1,c4). [back_unit_del(2276),unit_del(b,3220)].
% 1.51/1.79 3225 cyclic(c5,c4,c4,c4). [resolve(3217,a,257,a)].
% 1.51/1.79 3245 cyclic(c5,c1,c4,c4). [resolve(3217,a,123,a)].
% 1.51/1.79 3246 cyclic(c1,c4,c5,c4). [resolve(3217,a,122,a)].
% 1.51/1.79 3316 -cong(c1,c4,c1,c4) | perp(c4,c1,c1,c4). [resolve(3221,a,263,b)].
% 1.51/1.79 3336 cyclic(c1,c4,c1,c4). [resolve(3221,a,122,a)].
% 1.51/1.79 3355 cyclic(c4,c5,c4,c4). [resolve(3225,a,123,a)].
% 1.51/1.79 3376 cyclic(c5,c4,c1,c4). [resolve(3245,a,122,a)].
% 1.51/1.79 3398 cyclic(c1,c4,c4,c5). [resolve(3246,a,121,a)].
% 1.51/1.79 3591 cyclic(c1,c4,c4,c1). [resolve(3336,a,121,a)].
% 1.51/1.79 3593 cong(c1,c4,c1,c4). [back_unit_del(3222),unit_del(a,3591)].
% 1.51/1.79 3594 perp(c4,c1,c1,c4). [back_unit_del(3316),unit_del(a,3593)].
% 1.51/1.79 3616 cyclic(c4,c4,c5,c4). [resolve(3355,a,122,a)].
% 1.51/1.79 3617 -cyclic(c4,c4,c5,c5) | cong(c4,c4,c4,c4). [back_unit_del(2741),unit_del(a,3616)].
% 1.51/1.79 3638 cyclic(c4,c5,c1,c4). [resolve(3376,a,123,a)].
% 1.51/1.79 3672 cyclic(c4,c4,c5,c5). [resolve(3398,a,257,a)].
% 1.51/1.79 3693 cong(c4,c4,c4,c4). [back_unit_del(3617),unit_del(a,3672)].
% 1.51/1.79 5033 -midp(c1,c1,c4) | cong(c4,c1,c4,c4). [resolve(3594,a,158,b)].
% 1.51/1.79 5100 cyclic(c4,c5,c4,c1). [resolve(3638,a,121,a)].
% 1.51/1.79 5249 midp(c4,c4,c4). [resolve(3693,a,170,a),unit_del(a,641)].
% 1.51/1.79 5256 midp(c4,c5,c5). [resolve(5249,a,1814,a)].
% 1.51/1.79 5259 midp(c1,c4,c1). [resolve(5249,a,624,a),unit_del(a,630)].
% 1.51/1.79 5260 midp(c4,c1,c1). [resolve(5249,a,615,a)].
% 1.51/1.79 5317 cong(c4,c5,c4,c5). [resolve(5256,a,171,a)].
% 1.51/1.79 5435 midp(c1,c1,c4). [resolve(5259,a,119,a)].
% 1.51/1.79 5442 cong(c4,c1,c4,c4). [back_unit_del(5033),unit_del(a,5435)].
% 1.51/1.79 5469 cong(c4,c1,c4,c1). [resolve(5260,a,171,a)].
% 1.51/1.79 8912 cyclic(c4,c4,c5,c1). [resolve(5100,a,122,a)].
% 1.51/1.79 9204 midp(c4,c1,c4). [resolve(5442,a,170,a),unit_del(a,640)].
% 1.51/1.79 9233 midp(c4,c4,c1). [resolve(9204,a,119,a)].
% 1.51/1.79 11400 perp(c5,c4,c4,c1). [resolve(8912,a,160,c),unit_del(a,5317),unit_del(b,5469)].
% 1.51/1.79 12893 $F. [resolve(11400,a,158,b),unit_del(a,9233),unit_del(b,213)].
% 1.51/1.79
% 1.51/1.79 % SZS output end Refutation
% 1.51/1.79 ============================== end of proof ==========================
% 1.51/1.79
% 1.51/1.79 ============================== STATISTICS ============================
% 1.51/1.79
% 1.51/1.79 Given=1575. Generated=26025. Kept=12776. proofs=1.
% 1.51/1.79 Usable=1552. Sos=9999. Demods=0. Limbo=9, Disabled=1365. Hints=0.
% 1.51/1.79 Megabytes=10.25.
% 1.51/1.79 User_CPU=0.67, System_CPU=0.02, Wall_clock=1.
% 1.51/1.79
% 1.51/1.79 ============================== end of statistics =====================
% 1.51/1.79
% 1.51/1.79 ============================== end of search =========================
% 1.51/1.79
% 1.51/1.79 THEOREM PROVED
% 1.51/1.79 % SZS status Theorem
% 1.51/1.79
% 1.51/1.79 Exiting with 1 proof.
% 1.51/1.79
% 1.51/1.79 Process 28009 exit (max_proofs) Fri Jun 17 16:54:57 2022
% 1.51/1.80 Prover9 interrupted
%------------------------------------------------------------------------------