TSTP Solution File: GEO595+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GEO595+1 : TPTP v8.1.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n027.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:08 EDT 2022
% Result : Theorem 4.33s 4.61s
% Output : Refutation 4.33s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GEO595+1 : TPTP v8.1.0. Released v7.5.0.
% 0.11/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n027.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Fri Jun 17 22:08:52 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.42/1.08 ============================== Prover9 ===============================
% 0.42/1.08 Prover9 (32) version 2009-11A, November 2009.
% 0.42/1.08 Process 30266 was started by sandbox on n027.cluster.edu,
% 0.42/1.08 Fri Jun 17 22:08:52 2022
% 0.42/1.08 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_30113_n027.cluster.edu".
% 0.42/1.08 ============================== end of head ===========================
% 0.42/1.08
% 0.42/1.08 ============================== INPUT =================================
% 0.42/1.08
% 0.42/1.08 % Reading from file /tmp/Prover9_30113_n027.cluster.edu
% 0.42/1.08
% 0.42/1.08 set(prolog_style_variables).
% 0.42/1.08 set(auto2).
% 0.42/1.08 % set(auto2) -> set(auto).
% 0.42/1.08 % set(auto) -> set(auto_inference).
% 0.42/1.08 % set(auto) -> set(auto_setup).
% 0.42/1.08 % set(auto_setup) -> set(predicate_elim).
% 0.42/1.08 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.42/1.08 % set(auto) -> set(auto_limits).
% 0.42/1.08 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.42/1.08 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.42/1.08 % set(auto) -> set(auto_denials).
% 0.42/1.08 % set(auto) -> set(auto_process).
% 0.42/1.08 % set(auto2) -> assign(new_constants, 1).
% 0.42/1.08 % set(auto2) -> assign(fold_denial_max, 3).
% 0.42/1.08 % set(auto2) -> assign(max_weight, "200.000").
% 0.42/1.08 % set(auto2) -> assign(max_hours, 1).
% 0.42/1.08 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.42/1.08 % set(auto2) -> assign(max_seconds, 0).
% 0.42/1.08 % set(auto2) -> assign(max_minutes, 5).
% 0.42/1.08 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.42/1.08 % set(auto2) -> set(sort_initial_sos).
% 0.42/1.08 % set(auto2) -> assign(sos_limit, -1).
% 0.42/1.08 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.42/1.08 % set(auto2) -> assign(max_megs, 400).
% 0.42/1.08 % set(auto2) -> assign(stats, some).
% 0.42/1.08 % set(auto2) -> clear(echo_input).
% 0.42/1.08 % set(auto2) -> set(quiet).
% 0.42/1.08 % set(auto2) -> clear(print_initial_clauses).
% 0.42/1.08 % set(auto2) -> clear(print_given).
% 0.42/1.08 assign(lrs_ticks,-1).
% 0.42/1.08 assign(sos_limit,10000).
% 0.42/1.08 assign(order,kbo).
% 0.42/1.08 set(lex_order_vars).
% 0.42/1.08 clear(print_given).
% 0.42/1.08
% 0.42/1.08 % formulas(sos). % not echoed (95 formulas)
% 0.42/1.08
% 0.42/1.08 ============================== end of input ==========================
% 0.42/1.08
% 0.42/1.08 % From the command line: assign(max_seconds, 300).
% 0.42/1.08
% 0.42/1.08 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.42/1.08
% 0.42/1.08 % Formulas that are not ordinary clauses:
% 0.42/1.08 1 (all A all B all C (coll(A,B,C) -> coll(A,C,B))) # label(ruleD1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.08 2 (all A all B all C (coll(A,B,C) -> coll(B,A,C))) # label(ruleD2) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 11 (all A all B all M (midp(M,B,A) -> midp(M,A,B))) # label(ruleD11) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 70 (all A all B all C (midp(A,B,C) -> coll(A,B,C))) # label(ruleD69) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 95 -(all A all B all C all D all O all E all F all NWPNT1 all NWPNT2 all NWPNT3 all NWPNT4 (perp(D,A,B,C) & coll(D,B,C) & midp(O,A,D) & circle(O,D,NWPNT1,NWPNT2) & coll(E,A,B) & circle(O,D,E,NWPNT3) & coll(F,A,C) & circle(O,D,F,NWPNT4) -> cyclic(B,C,E,F))) # label(exemplo6GDDFULL416057) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.42/1.08
% 0.42/1.08 ============================== end of process non-clausal formulas ===
% 0.42/1.08
% 0.42/1.08 ============================== PROCESS INITIAL CLAUSES ===============
% 0.42/1.08
% 0.42/1.08 ============================== PREDICATE ELIMINATION =================
% 0.42/1.08 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.42/1.08 97 -cong(A,B,A,C) | -cong(A,B,A,D) | circle(A,B,C,D) # label(ruleD12) # label(axiom). [clausify(12)].
% 0.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 101 -circle(A,B,C,D) | -coll(A,B,D) | perp(B,C,C,D) # label(ruleD53) # label(axiom). [clausify(54)].
% 0.42/1.08 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.42/1.08 102 -circle(A,B,C,D) | perp(f12(B,C,D,A),B,B,A) # label(ruleX11) # label(axiom). [clausify(87)].
% 0.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 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.42/1.08 109 circle(c5,c4,c8,c9) # label(exemplo6GDDFULL416057) # label(negated_conjecture). [clausify(95)].
% 0.42/1.08 Derived: -perp(c5,c4,c4,A) | eqangle(c4,A,c4,c8,c9,c4,c9,c8). [resolve(109,a,96,a)].
% 0.42/1.08 Derived: -eqangle(c4,A,c4,c8,c9,c4,c9,c8) | perp(c5,c4,c4,A). [resolve(109,a,98,a)].
% 0.42/1.08 Derived: -midp(A,c8,c9) | eqangle(c4,c8,c4,c9,c5,c8,c5,A). [resolve(109,a,99,a)].
% 0.42/1.08 Derived: -coll(A,c8,c9) | -eqangle(c4,c8,c4,c9,c5,c8,c5,A) | midp(A,c8,c9). [resolve(109,a,100,a)].
% 0.42/1.08 Derived: -coll(c5,c4,c9) | perp(c4,c8,c8,c9). [resolve(109,a,101,a)].
% 0.42/1.08 Derived: perp(f12(c4,c8,c9,c5),c4,c4,c5). [resolve(109,a,102,a)].
% 0.42/1.08 Derived: -cong(c5,c4,c5,A) | -cong(B,c4,B,c8) | B = c5 | coll(f13(c4,c8,c9,A,c5,B),c4,c9). [resolve(109,a,103,a)].
% 2.14/2.41 Derived: -cong(c5,c4,c5,A) | -cong(B,c4,B,c8) | B = c5 | cong(f13(c4,c8,c9,A,c5,B),B,B,c4). [resolve(109,a,104,a)].
% 2.14/2.41 Derived: -cong(c5,c4,c5,A) | -cong(B,c4,B,c8) | B = c5 | coll(f14(c4,c8,c9,A,c5,B),c8,A). [resolve(109,a,105,a)].
% 2.14/2.41 Derived: -cong(c5,c4,c5,A) | -cong(B,c4,B,c8) | B = c5 | cong(f14(c4,c8,c9,A,c5,B),B,B,c4). [resolve(109,a,106,a)].
% 2.14/2.41 110 circle(c5,c4,c6,c10) # label(exemplo6GDDFULL416057) # label(negated_conjecture). [clausify(95)].
% 2.14/2.41 Derived: -perp(c5,c4,c4,A) | eqangle(c4,A,c4,c6,c10,c4,c10,c6). [resolve(110,a,96,a)].
% 2.14/2.41 Derived: -eqangle(c4,A,c4,c6,c10,c4,c10,c6) | perp(c5,c4,c4,A). [resolve(110,a,98,a)].
% 2.14/2.41 Derived: -midp(A,c6,c10) | eqangle(c4,c6,c4,c10,c5,c6,c5,A). [resolve(110,a,99,a)].
% 2.14/2.41 Derived: -coll(A,c6,c10) | -eqangle(c4,c6,c4,c10,c5,c6,c5,A) | midp(A,c6,c10). [resolve(110,a,100,a)].
% 2.14/2.41 Derived: -coll(c5,c4,c10) | perp(c4,c6,c6,c10). [resolve(110,a,101,a)].
% 2.14/2.41 Derived: perp(f12(c4,c6,c10,c5),c4,c4,c5). [resolve(110,a,102,a)].
% 2.14/2.41 Derived: -cong(c5,c4,c5,A) | -cong(B,c4,B,c6) | B = c5 | coll(f13(c4,c6,c10,A,c5,B),c4,c10). [resolve(110,a,103,a)].
% 2.14/2.41 Derived: -cong(c5,c4,c5,A) | -cong(B,c4,B,c6) | B = c5 | cong(f13(c4,c6,c10,A,c5,B),B,B,c4). [resolve(110,a,104,a)].
% 2.14/2.41 Derived: -cong(c5,c4,c5,A) | -cong(B,c4,B,c6) | B = c5 | coll(f14(c4,c6,c10,A,c5,B),c6,A). [resolve(110,a,105,a)].
% 2.14/2.41 Derived: -cong(c5,c4,c5,A) | -cong(B,c4,B,c6) | B = c5 | cong(f14(c4,c6,c10,A,c5,B),B,B,c4). [resolve(110,a,106,a)].
% 2.14/2.41 111 circle(c5,c4,c7,c11) # label(exemplo6GDDFULL416057) # label(negated_conjecture). [clausify(95)].
% 2.14/2.41 Derived: -perp(c5,c4,c4,A) | eqangle(c4,A,c4,c7,c11,c4,c11,c7). [resolve(111,a,96,a)].
% 2.14/2.41 Derived: -eqangle(c4,A,c4,c7,c11,c4,c11,c7) | perp(c5,c4,c4,A). [resolve(111,a,98,a)].
% 2.14/2.41 Derived: -midp(A,c7,c11) | eqangle(c4,c7,c4,c11,c5,c7,c5,A). [resolve(111,a,99,a)].
% 2.14/2.41 Derived: -coll(A,c7,c11) | -eqangle(c4,c7,c4,c11,c5,c7,c5,A) | midp(A,c7,c11). [resolve(111,a,100,a)].
% 2.14/2.41 Derived: -coll(c5,c4,c11) | perp(c4,c7,c7,c11). [resolve(111,a,101,a)].
% 2.14/2.41 Derived: perp(f12(c4,c7,c11,c5),c4,c4,c5). [resolve(111,a,102,a)].
% 2.14/2.41 Derived: -cong(c5,c4,c5,A) | -cong(B,c4,B,c7) | B = c5 | coll(f13(c4,c7,c11,A,c5,B),c4,c11). [resolve(111,a,103,a)].
% 2.14/2.41 Derived: -cong(c5,c4,c5,A) | -cong(B,c4,B,c7) | B = c5 | cong(f13(c4,c7,c11,A,c5,B),B,B,c4). [resolve(111,a,104,a)].
% 2.14/2.41 Derived: -cong(c5,c4,c5,A) | -cong(B,c4,B,c7) | B = c5 | coll(f14(c4,c7,c11,A,c5,B),c7,A). [resolve(111,a,105,a)].
% 2.14/2.41 Derived: -cong(c5,c4,c5,A) | -cong(B,c4,B,c7) | B = c5 | cong(f14(c4,c7,c11,A,c5,B),B,B,c4). [resolve(111,a,106,a)].
% 2.14/2.41
% 2.14/2.41 ============================== end predicate elimination =============
% 2.14/2.41
% 2.14/2.41 Auto_denials: (non-Horn, no changes).
% 2.14/2.41
% 2.14/2.41 Term ordering decisions:
% 2.14/2.41 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. c9=1. c10=1. c11=1. 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.
% 2.14/2.41
% 2.14/2.41 ============================== end of process initial clauses ========
% 2.14/2.41
% 2.14/2.41 ============================== CLAUSES FOR SEARCH ====================
% 2.14/2.41
% 2.14/2.41 ============================== end of clauses for search =============
% 2.14/2.41
% 2.14/2.41 ============================== SEARCH ================================
% 2.14/2.41
% 2.14/2.41 % Starting search at 0.05 seconds.
% 2.14/2.41
% 2.14/2.41 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 2019 (0.00 of 0.19 sec).
% 2.14/2.41
% 2.14/2.41 Low Water (keep): wt=24.000, iters=3338
% 2.14/2.41
% 2.14/2.41 Low Water (keep): wt=23.000, iters=3381
% 2.14/2.41
% 2.14/2.41 Low Water (keep): wt=22.000, iters=3364
% 2.14/2.41
% 2.14/2.41 Low Water (keep): wt=21.000, iters=3401
% 2.14/2.41
% 2.14/2.41 Low Water (keep): wt=20.000, iters=3408
% 2.14/2.41
% 2.14/2.41 Low Water (keep): wt=19.000, iters=3555
% 2.14/2.41
% 2.14/2.41 Low Water (keep): wt=18.000, iters=3428
% 2.14/2.41
% 2.14/2.41 Low Water (keep): wt=17.000, iters=3361
% 2.14/2.41
% 2.14/2.41 Low Water (keep): wt=16.000, iters=3335
% 2.14/2.41
% 2.14/2.41 Low Water (keep): wt=15.000, iters=3341
% 2.14/2.41
% 2.14/2.41 Low Water (keep): wt=14.000, iters=3337
% 2.14/2.41
% 2.14/2.41 Low Water (keep): wt=13.000, iters=3360
% 2.14/2.41
% 2.14/2.41 Low Water (displace): id=5154, wt=48.000
% 2.14/2.41
% 2.14/2.41 Low Water (displace): id=14350, wt=11.000
% 2.14/2.41
% 2.14/2.41 Low Water (displace): id=14375, wt=10.000
% 2.14/2.41
% 2.14/2.41 Low Water (displace): id=14388, wt=9.000
% 2.14/2.41
% 2.14/2.41 Low Water (displace): id=15156, wt=8.000
% 2.14/2.41
% 2.14/2.41 Low Water (keep): wt=12.000, iters=3432
% 4.33/4.61
% 4.33/4.61 Low Water (keep): wt=11.000, iters=3575
% 4.33/4.61
% 4.33/4.61 Low Water (displace): id=16016, wt=7.000
% 4.33/4.61
% 4.33/4.61 ============================== PROOF =================================
% 4.33/4.61 % SZS status Theorem
% 4.33/4.61 % SZS output start Refutation
% 4.33/4.61
% 4.33/4.61 % Proof 1 at 3.50 (+ 0.06) seconds.
% 4.33/4.61 % Length of proof is 51.
% 4.33/4.61 % Level of proof is 20.
% 4.33/4.61 % Maximum clause weight is 27.000.
% 4.33/4.61 % Given clauses 7382.
% 4.33/4.61
% 4.33/4.61 1 (all A all B all C (coll(A,B,C) -> coll(A,C,B))) # label(ruleD1) # label(axiom) # label(non_clause). [assumption].
% 4.33/4.61 2 (all A all B all C (coll(A,B,C) -> coll(B,A,C))) # label(ruleD2) # label(axiom) # label(non_clause). [assumption].
% 4.33/4.61 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].
% 4.33/4.61 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].
% 4.33/4.61 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].
% 4.33/4.61 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].
% 4.33/4.61 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].
% 4.33/4.61 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].
% 4.33/4.61 69 (all A all B all C (midp(A,B,C) -> cong(A,B,A,C))) # label(ruleD68) # label(axiom) # label(non_clause). [assumption].
% 4.33/4.61 70 (all A all B all C (midp(A,B,C) -> coll(A,B,C))) # label(ruleD69) # label(axiom) # label(non_clause). [assumption].
% 4.33/4.61 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].
% 4.33/4.61 95 -(all A all B all C all D all O all E all F all NWPNT1 all NWPNT2 all NWPNT3 all NWPNT4 (perp(D,A,B,C) & coll(D,B,C) & midp(O,A,D) & circle(O,D,NWPNT1,NWPNT2) & coll(E,A,B) & circle(O,D,E,NWPNT3) & coll(F,A,C) & circle(O,D,F,NWPNT4) -> cyclic(B,C,E,F))) # label(exemplo6GDDFULL416057) # label(negated_conjecture) # label(non_clause). [assumption].
% 4.33/4.61 112 -coll(A,B,C) | coll(A,C,B) # label(ruleD1) # label(axiom). [clausify(1)].
% 4.33/4.61 113 -coll(A,B,C) | coll(B,A,C) # label(ruleD2) # label(axiom). [clausify(2)].
% 4.33/4.61 114 -coll(A,B,C) | -coll(A,B,D) | coll(C,D,A) # label(ruleD3) # label(axiom). [clausify(3)].
% 4.33/4.61 123 -cong(A,B,A,C) | -cong(A,B,A,D) | -cong(A,B,A,E) | cyclic(B,C,D,E) # label(ruleD13) # label(axiom). [clausify(13)].
% 4.33/4.61 124 -cyclic(A,B,C,D) | cyclic(A,B,D,C) # label(ruleD14) # label(axiom). [clausify(14)].
% 4.33/4.61 125 -cyclic(A,B,C,D) | cyclic(A,C,B,D) # label(ruleD15) # label(axiom). [clausify(15)].
% 4.33/4.61 126 -cyclic(A,B,C,D) | cyclic(B,A,C,D) # label(ruleD16) # label(axiom). [clausify(16)].
% 4.33/4.61 127 -cyclic(A,B,C,D) | -cyclic(A,B,C,E) | cyclic(B,C,D,E) # label(ruleD17) # label(axiom). [clausify(17)].
% 4.33/4.61 174 -midp(A,B,C) | cong(A,B,A,C) # label(ruleD68) # label(axiom). [clausify(69)].
% 4.33/4.61 175 -midp(A,B,C) | coll(A,B,C) # label(ruleD69) # label(axiom). [clausify(70)].
% 4.33/4.61 194 -midp(A,B,C) | -midp(D,E,F) | -coll(E,B,C) | -coll(F,B,C) | midp(f7(B,C,E,F,A,D,V6),B,V6) # label(ruleX7) # label(axiom). [clausify(83)].
% 4.33/4.61 213 midp(c5,c1,c4) # label(exemplo6GDDFULL416057) # label(negated_conjecture). [clausify(95)].
% 4.33/4.61 216 -cyclic(c2,c3,c6,c7) # label(exemplo6GDDFULL416057) # label(negated_conjecture). [clausify(95)].
% 4.33/4.61 297 -coll(A,B,C) | coll(C,C,A). [factor(114,a,b)].
% 4.33/4.61 299 -cong(A,B,A,C) | -cong(A,B,A,D) | cyclic(B,C,C,D). [factor(123,a,b)].
% 4.33/4.61 302 -cyclic(A,B,C,D) | cyclic(B,C,D,D). [factor(127,a,b)].
% 4.33/4.61 317 -midp(A,B,C) | -coll(B,B,C) | -coll(C,B,C) | midp(f7(B,C,B,C,A,A,D),B,D). [factor(194,a,b)].
% 4.33/4.61 351 -cong(A,B,A,C) | cyclic(B,C,C,C). [factor(299,a,b)].
% 4.33/4.61 389 coll(c5,c1,c4). [resolve(213,a,175,a)].
% 4.33/4.61 489 -coll(c1,c1,c4) | -coll(c4,c1,c4) | midp(f7(c1,c4,c1,c4,c5,c5,A),c1,A). [resolve(317,a,213,a)].
% 4.33/4.61 501 coll(c1,c5,c4). [resolve(389,a,113,a)].
% 4.33/4.61 571 coll(c4,c4,c1). [resolve(501,a,297,a)].
% 4.33/4.61 647 coll(c1,c1,c4). [resolve(571,a,297,a)].
% 4.33/4.61 650 coll(c4,c1,c4). [resolve(571,a,112,a)].
% 4.33/4.61 651 midp(f7(c1,c4,c1,c4,c5,c5,A),c1,A). [back_unit_del(489),unit_del(a,647),unit_del(b,650)].
% 4.33/4.61 3335 cong(f7(c1,c4,c1,c4,c5,c5,A),c1,f7(c1,c4,c1,c4,c5,c5,A),A). [resolve(651,a,174,a)].
% 4.33/4.61 20322 cyclic(c1,A,A,A). [resolve(3335,a,351,a)].
% 4.33/4.61 20329 cyclic(A,c1,A,A). [resolve(20322,a,126,a)].
% 4.33/4.61 20339 cyclic(A,A,c1,A). [resolve(20329,a,125,a)].
% 4.33/4.61 20353 cyclic(A,A,A,c1). [resolve(20339,a,124,a)].
% 4.33/4.61 20362 cyclic(A,A,c1,c1). [resolve(20353,a,302,a)].
% 4.33/4.61 20374 cyclic(A,c1,c1,c1). [resolve(20362,a,302,a)].
% 4.33/4.61 20384 cyclic(c1,A,c1,c1). [resolve(20374,a,126,a)].
% 4.33/4.61 20391 cyclic(c1,c1,A,c1). [resolve(20384,a,125,a)].
% 4.33/4.61 20403 cyclic(c1,c1,c1,A). [resolve(20391,a,124,a)].
% 4.33/4.61 20461 cyclic(c1,c1,A,B). [resolve(20403,a,127,b),unit_del(a,20403)].
% 4.33/4.61 20669 cyclic(c1,A,B,C). [resolve(20461,a,127,b),unit_del(a,20461)].
% 4.33/4.61 21030 cyclic(A,B,C,D). [resolve(20669,a,127,b),unit_del(a,20669)].
% 4.33/4.61 21031 $F. [resolve(21030,a,216,a)].
% 4.33/4.61
% 4.33/4.61 % SZS output end Refutation
% 4.33/4.61 ============================== end of proof ==========================
% 4.33/4.61
% 4.33/4.61 ============================== STATISTICS ============================
% 4.33/4.61
% 4.33/4.61 Given=7382. Generated=97915. Kept=20899. proofs=1.
% 4.33/4.61 Usable=7079. Sos=9343. Demods=0. Limbo=3, Disabled=4655. Hints=0.
% 4.33/4.61 Megabytes=14.17.
% 4.33/4.61 User_CPU=3.50, System_CPU=0.06, Wall_clock=4.
% 4.33/4.61
% 4.33/4.61 ============================== end of statistics =====================
% 4.33/4.61
% 4.33/4.61 ============================== end of search =========================
% 4.33/4.61
% 4.33/4.61 THEOREM PROVED
% 4.33/4.61 % SZS status Theorem
% 4.33/4.61
% 4.33/4.61 Exiting with 1 proof.
% 4.33/4.61
% 4.33/4.61 Process 30266 exit (max_proofs) Fri Jun 17 22:08:56 2022
% 4.33/4.61 Prover9 interrupted
%------------------------------------------------------------------------------