TSTP Solution File: GEO629+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GEO629+1 : TPTP v8.1.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n022.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:19 EDT 2022
% Result : Theorem 11.22s 11.51s
% Output : Refutation 11.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO629+1 : TPTP v8.1.0. Released v7.5.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.35 % Computer : n022.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sat Jun 18 15:49:02 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.82/1.11 ============================== Prover9 ===============================
% 0.82/1.11 Prover9 (32) version 2009-11A, November 2009.
% 0.82/1.11 Process 23000 was started by sandbox on n022.cluster.edu,
% 0.82/1.11 Sat Jun 18 15:49:02 2022
% 0.82/1.11 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_22847_n022.cluster.edu".
% 0.82/1.11 ============================== end of head ===========================
% 0.82/1.11
% 0.82/1.11 ============================== INPUT =================================
% 0.82/1.11
% 0.82/1.11 % Reading from file /tmp/Prover9_22847_n022.cluster.edu
% 0.82/1.11
% 0.82/1.11 set(prolog_style_variables).
% 0.82/1.11 set(auto2).
% 0.82/1.11 % set(auto2) -> set(auto).
% 0.82/1.11 % set(auto) -> set(auto_inference).
% 0.82/1.11 % set(auto) -> set(auto_setup).
% 0.82/1.11 % set(auto_setup) -> set(predicate_elim).
% 0.82/1.11 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.82/1.11 % set(auto) -> set(auto_limits).
% 0.82/1.11 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.82/1.11 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.82/1.11 % set(auto) -> set(auto_denials).
% 0.82/1.11 % set(auto) -> set(auto_process).
% 0.82/1.11 % set(auto2) -> assign(new_constants, 1).
% 0.82/1.11 % set(auto2) -> assign(fold_denial_max, 3).
% 0.82/1.11 % set(auto2) -> assign(max_weight, "200.000").
% 0.82/1.11 % set(auto2) -> assign(max_hours, 1).
% 0.82/1.11 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.82/1.11 % set(auto2) -> assign(max_seconds, 0).
% 0.82/1.11 % set(auto2) -> assign(max_minutes, 5).
% 0.82/1.11 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.82/1.11 % set(auto2) -> set(sort_initial_sos).
% 0.82/1.11 % set(auto2) -> assign(sos_limit, -1).
% 0.82/1.11 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.82/1.11 % set(auto2) -> assign(max_megs, 400).
% 0.82/1.11 % set(auto2) -> assign(stats, some).
% 0.82/1.11 % set(auto2) -> clear(echo_input).
% 0.82/1.11 % set(auto2) -> set(quiet).
% 0.82/1.11 % set(auto2) -> clear(print_initial_clauses).
% 0.82/1.11 % set(auto2) -> clear(print_given).
% 0.82/1.11 assign(lrs_ticks,-1).
% 0.82/1.11 assign(sos_limit,10000).
% 0.82/1.11 assign(order,kbo).
% 0.82/1.11 set(lex_order_vars).
% 0.82/1.11 clear(print_given).
% 0.82/1.11
% 0.82/1.11 % formulas(sos). % not echoed (95 formulas)
% 0.82/1.11
% 0.82/1.11 ============================== end of input ==========================
% 0.82/1.11
% 0.82/1.11 % From the command line: assign(max_seconds, 300).
% 0.82/1.11
% 0.82/1.11 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.82/1.11
% 0.82/1.11 % Formulas that are not ordinary clauses:
% 0.82/1.11 1 (all A all B all C (coll(A,B,C) -> coll(A,C,B))) # label(ruleD1) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 2 (all A all B all C (coll(A,B,C) -> coll(B,A,C))) # label(ruleD2) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 3 (all A all B all C all D (coll(A,B,C) & coll(A,B,D) -> coll(C,D,A))) # label(ruleD3) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 4 (all A all B all C all D (para(A,B,C,D) -> para(A,B,D,C))) # label(ruleD4) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 5 (all A all B all C all D (para(A,B,C,D) -> para(C,D,A,B))) # label(ruleD5) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 6 (all A all B all C all D all E all F (para(A,B,C,D) & para(C,D,E,F) -> para(A,B,E,F))) # label(ruleD6) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 7 (all A all B all C all D (perp(A,B,C,D) -> perp(A,B,D,C))) # label(ruleD7) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 8 (all A all B all C all D (perp(A,B,C,D) -> perp(C,D,A,B))) # label(ruleD8) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 9 (all A all B all C all D all E all F (perp(A,B,C,D) & perp(C,D,E,F) -> para(A,B,E,F))) # label(ruleD9) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 10 (all A all B all C all D all E all F (para(A,B,C,D) & perp(C,D,E,F) -> perp(A,B,E,F))) # label(ruleD10) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 11 (all A all B all M (midp(M,B,A) -> midp(M,A,B))) # label(ruleD11) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 12 (all A all B all C all O (cong(O,A,O,B) & cong(O,A,O,C) -> circle(O,A,B,C))) # label(ruleD12) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 13 (all A all B all C all D all O (cong(O,A,O,B) & cong(O,A,O,C) & cong(O,A,O,D) -> cyclic(A,B,C,D))) # label(ruleD13) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 14 (all A all B all C all D (cyclic(A,B,C,D) -> cyclic(A,B,D,C))) # label(ruleD14) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 15 (all A all B all C all D (cyclic(A,B,C,D) -> cyclic(A,C,B,D))) # label(ruleD15) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 16 (all A all B all C all D (cyclic(A,B,C,D) -> cyclic(B,A,C,D))) # label(ruleD16) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 17 (all A all B all C all D all E (cyclic(A,B,C,D) & cyclic(A,B,C,E) -> cyclic(B,C,D,E))) # label(ruleD17) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 18 (all A all B all C all D all P all Q all U all V (eqangle(A,B,C,D,P,Q,U,V) -> eqangle(B,A,C,D,P,Q,U,V))) # label(ruleD18) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 19 (all A all B all C all D all P all Q all U all V (eqangle(A,B,C,D,P,Q,U,V) -> eqangle(C,D,A,B,U,V,P,Q))) # label(ruleD19) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 20 (all A all B all C all D all P all Q all U all V (eqangle(A,B,C,D,P,Q,U,V) -> eqangle(P,Q,U,V,A,B,C,D))) # label(ruleD20) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 21 (all A all B all C all D all P all Q all U all V (eqangle(A,B,C,D,P,Q,U,V) -> eqangle(A,B,P,Q,C,D,U,V))) # label(ruleD21) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 22 (all A all B all C all D all P all Q all U all V all E all F all G all H (eqangle(A,B,C,D,P,Q,U,V) & eqangle(P,Q,U,V,E,F,G,H) -> eqangle(A,B,C,D,E,F,G,H))) # label(ruleD22) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 23 (all A all B all C all D (cong(A,B,C,D) -> cong(A,B,D,C))) # label(ruleD23) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 24 (all A all B all C all D (cong(A,B,C,D) -> cong(C,D,A,B))) # label(ruleD24) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 25 (all A all B all C all D all E all F (cong(A,B,C,D) & cong(C,D,E,F) -> cong(A,B,E,F))) # label(ruleD25) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 26 (all A all B all C all D all P all Q all U all V (eqratio(A,B,C,D,P,Q,U,V) -> eqratio(B,A,C,D,P,Q,U,V))) # label(ruleD26) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 27 (all A all B all C all D all P all Q all U all V (eqratio(A,B,C,D,P,Q,U,V) -> eqratio(C,D,A,B,U,V,P,Q))) # label(ruleD27) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 28 (all A all B all C all D all P all Q all U all V (eqratio(A,B,C,D,P,Q,U,V) -> eqratio(P,Q,U,V,A,B,C,D))) # label(ruleD28) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 29 (all A all B all C all D all P all Q all U all V (eqratio(A,B,C,D,P,Q,U,V) -> eqratio(A,B,P,Q,C,D,U,V))) # label(ruleD29) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 30 (all A all B all C all D all E all F all G all H all P all Q all U all V (eqratio(A,B,C,D,P,Q,U,V) & eqratio(P,Q,U,V,E,F,G,H) -> eqratio(A,B,C,D,E,F,G,H))) # label(ruleD30) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 31 (all A all B all C all P all Q all R (simtri(A,C,B,P,R,Q) -> simtri(A,B,C,P,Q,R))) # label(ruleD31) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 32 (all A all B all C all P all Q all R (simtri(B,A,C,Q,P,R) -> simtri(A,B,C,P,Q,R))) # label(ruleD32) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 33 (all A all B all C all P all Q all R (simtri(P,Q,R,A,B,C) -> simtri(A,B,C,P,Q,R))) # label(ruleD33) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 34 (all A all B all C all E all F all G all P all Q all R (simtri(A,B,C,E,F,G) & simtri(E,F,G,P,Q,R) -> simtri(A,B,C,P,Q,R))) # label(ruleD34) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 35 (all A all B all C all P all Q all R (contri(A,C,B,P,R,Q) -> contri(A,B,C,P,Q,R))) # label(ruleD35) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 36 (all A all B all C all P all Q all R (contri(B,A,C,Q,P,R) -> contri(A,B,C,P,Q,R))) # label(ruleD36) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 37 (all A all B all C all P all Q all R (contri(P,Q,R,A,B,C) -> contri(A,B,C,P,Q,R))) # label(ruleD37) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 38 (all A all B all C all E all F all G all P all Q all R (contri(A,B,C,E,F,G) & contri(E,F,G,P,Q,R) -> contri(A,B,C,P,Q,R))) # label(ruleD38) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 39 (all A all B all C all D all P all Q (eqangle(A,B,P,Q,C,D,P,Q) -> para(A,B,C,D))) # label(ruleD39) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 40 (all A all B all C all D all P all Q (para(A,B,C,D) -> eqangle(A,B,P,Q,C,D,P,Q))) # label(ruleD40) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 41 (all A all B all P all Q (cyclic(A,B,P,Q) -> eqangle(P,A,P,B,Q,A,Q,B))) # label(ruleD41) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 42 (all A all B all P all Q (eqangle(P,A,P,B,Q,A,Q,B) & -coll(P,Q,A) -> cyclic(A,B,P,Q))) # label(ruleD42a) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 43 (all A all B all P all Q (eqangle(P,A,P,B,Q,A,Q,B) & coll(P,Q,B) -> cyclic(A,B,P,Q))) # label(ruleD42b) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 44 (all A all B all C all P all Q all R (cyclic(A,B,C,P) & cyclic(A,B,C,Q) & cyclic(A,B,C,R) & eqangle(C,A,C,B,R,P,R,Q) -> cong(A,B,P,Q))) # label(ruleD43) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 45 (all A all B all C all E all F (midp(E,A,B) & midp(F,A,C) -> para(E,F,B,C))) # label(ruleD44) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 46 (all A all B all C all E all F (midp(E,A,B) & para(E,F,B,C) & coll(F,A,C) -> midp(F,A,C))) # label(ruleD45) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 47 (all A all B all O (cong(O,A,O,B) -> eqangle(O,A,A,B,A,B,O,B))) # label(ruleD46) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 48 (all A all B all O (eqangle(O,A,A,B,A,B,O,B) & -coll(O,A,B) -> cong(O,A,O,B))) # label(ruleD47) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 49 (all A all B all C all O all X (circle(O,A,B,C) & perp(O,A,A,X) -> eqangle(A,X,A,B,C,A,C,B))) # label(ruleD48) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 50 (all A all B all C all O all X (circle(O,A,B,C) & eqangle(A,X,A,B,C,A,C,B) -> perp(O,A,A,X))) # label(ruleD49) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 51 (all A all B all C all O all M (circle(O,A,B,C) & midp(M,B,C) -> eqangle(A,B,A,C,O,B,O,M))) # label(ruleD50) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 52 (all A all B all C all O all M (circle(O,A,B,C) & coll(M,B,C) & eqangle(A,B,A,C,O,B,O,M) -> midp(M,B,C))) # label(ruleD51) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 53 (all A all B all C all M (perp(A,B,B,C) & midp(M,A,C) -> cong(A,M,B,M))) # label(ruleD52) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 54 (all A all B all C all O (circle(O,A,B,C) & coll(O,A,C) -> perp(A,B,B,C))) # label(ruleD53) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 55 (all A all B all C all D (cyclic(A,B,C,D) & para(A,B,C,D) -> eqangle(A,D,C,D,C,D,C,B))) # label(ruleD54) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 56 (all A all B all M all O (midp(M,A,B) & perp(O,M,A,B) -> cong(O,A,O,B))) # label(ruleD55) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 57 (all A all B all P all Q (cong(A,P,B,P) & cong(A,Q,B,Q) -> perp(A,B,P,Q))) # label(ruleD56) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 58 (all A all B all P all Q (cong(A,P,B,P) & cong(A,Q,B,Q) & cyclic(A,B,P,Q) -> perp(P,A,A,Q))) # label(ruleD57) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 59 (all A all B all C all P all Q all R (eqangle(A,B,B,C,P,Q,Q,R) & eqangle(A,C,B,C,P,R,Q,R) & -coll(A,B,C) -> simtri(A,B,C,P,Q,R))) # label(ruleD58) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 60 (all A all B all C all P all Q all R (simtri(A,B,C,P,Q,R) -> eqratio(A,B,A,C,P,Q,P,R))) # label(ruleD59) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 61 (all A all B all C all P all Q all R (simtri(A,B,C,P,Q,R) -> eqangle(A,B,B,C,P,Q,Q,R))) # label(ruleD60) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 62 (all A all B all C all P all Q all R (simtri(A,B,C,P,Q,R) & cong(A,B,P,Q) -> contri(A,B,C,P,Q,R))) # label(ruleD61) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 63 (all A all B all C all P all Q all R (contri(A,B,C,P,Q,R) -> cong(A,B,P,Q))) # label(ruleD62) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 64 (all A all B all C all D all M (midp(M,A,B) & midp(M,C,D) -> para(A,C,B,D))) # label(ruleD63) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 65 (all A all B all C all D all M (midp(M,A,B) & para(A,C,B,D) & para(A,D,B,C) -> midp(M,C,D))) # label(ruleD64) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.12 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.82/1.12 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.82/1.12 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.82/1.12 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.82/1.12 70 (all A all B all C (midp(A,B,C) -> coll(A,B,C))) # label(ruleD69) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.12 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.82/1.12 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.82/1.12 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.82/1.12 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.82/1.12 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.82/1.12 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.82/1.12 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.82/1.12 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.82/1.12 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.82/1.12 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.82/1.12 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.82/1.12 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.82/1.12 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.82/1.12 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.82/1.12 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.82/1.12 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.82/1.12 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.82/1.12 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.82/1.12 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.82/1.12 90 (all A all B all C all D exists O (perp(A,C,C,B) & cyclic(A,B,C,D) -> circle(O,A,B,C))) # label(ruleX14) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.12 91 (all A all B all C all E all F exists P (perp(A,C,C,B) & coll(B,E,F) -> coll(P,E,F) & perp(P,A,E,F))) # label(ruleX15) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.12 92 (all A all B all C all D all M exists P (perp(A,B,A,C) & perp(C,A,C,D) & midp(M,B,D) -> midp(P,A,C))) # label(ruleX16) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.12 93 (all A all B all O exists C (cong(O,A,O,B) & perp(A,O,O,B) -> coll(A,O,C) & cong(O,A,O,C))) # label(ruleX17) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.12 94 (all A all B all C all D all P all Q exists R (para(A,B,C,D) & coll(P,A,C) & coll(P,B,D) & coll(Q,A,B) -> coll(P,Q,R) & coll(R,C,D))) # label(ruleX18) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.12 95 -(all A all B all C all O all P1 all F1 all G1 all P all F all G all K all NWPNT1 all NWPNT2 all NWPNT3 (circle(O,A,B,C) & circle(O,A,P1,NWPNT1) & perp(F1,P1,A,C) & coll(F1,A,C) & perp(G1,P1,A,B) & coll(G1,A,B) & circle(O,A,P,NWPNT2) & perp(F,P,A,C) & coll(F,A,C) & perp(G,P,A,B) & coll(G,A,B) & para(F1,G1,K,P) & circle(O,A,K,NWPNT3) -> para(K,P1,G,F))) # label(exemplo6GDDFULL8110992) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.82/1.12
% 0.82/1.12 ============================== end of process non-clausal formulas ===
% 0.82/1.12
% 0.82/1.12 ============================== PROCESS INITIAL CLAUSES ===============
% 0.82/1.12
% 0.82/1.12 ============================== PREDICATE ELIMINATION =================
% 0.82/1.12 96 -circle(A,B,C,D) | -perp(A,B,B,E) | eqangle(B,E,B,C,D,B,D,C) # label(ruleD48) # label(axiom). [clausify(49)].
% 0.82/1.12 97 -cong(A,B,A,C) | -cong(A,B,A,D) | circle(A,B,C,D) # label(ruleD12) # label(axiom). [clausify(12)].
% 0.82/1.12 Derived: -perp(A,B,B,C) | eqangle(B,C,B,D,E,B,E,D) | -cong(A,B,A,D) | -cong(A,B,A,E). [resolve(96,a,97,c)].
% 0.82/1.12 98 -circle(A,B,C,D) | -eqangle(B,E,B,C,D,B,D,C) | perp(A,B,B,E) # label(ruleD49) # label(axiom). [clausify(50)].
% 0.82/1.12 Derived: -eqangle(A,B,A,C,D,A,D,C) | perp(E,A,A,B) | -cong(E,A,E,C) | -cong(E,A,E,D). [resolve(98,a,97,c)].
% 0.82/1.12 99 -circle(A,B,C,D) | -midp(E,C,D) | eqangle(B,C,B,D,A,C,A,E) # label(ruleD50) # label(axiom). [clausify(51)].
% 0.82/1.12 Derived: -midp(A,B,C) | eqangle(D,B,D,C,E,B,E,A) | -cong(E,D,E,B) | -cong(E,D,E,C). [resolve(99,a,97,c)].
% 0.82/1.12 100 -circle(A,B,C,D) | -coll(E,C,D) | -eqangle(B,C,B,D,A,C,A,E) | midp(E,C,D) # label(ruleD51) # label(axiom). [clausify(52)].
% 0.82/1.12 Derived: -coll(A,B,C) | -eqangle(D,B,D,C,E,B,E,A) | midp(A,B,C) | -cong(E,D,E,B) | -cong(E,D,E,C). [resolve(100,a,97,c)].
% 0.82/1.12 101 -circle(A,B,C,D) | -coll(A,B,D) | perp(B,C,C,D) # label(ruleD53) # label(axiom). [clausify(54)].
% 0.82/1.12 Derived: -coll(A,B,C) | perp(B,D,D,C) | -cong(A,B,A,D) | -cong(A,B,A,C). [resolve(101,a,97,c)].
% 0.82/1.12 102 -circle(A,B,C,D) | perp(f12(B,C,D,A),B,B,A) # label(ruleX11) # label(axiom). [clausify(87)].
% 0.82/1.12 Derived: perp(f12(A,B,C,D),A,A,D) | -cong(D,A,D,B) | -cong(D,A,D,C). [resolve(102,a,97,c)].
% 0.82/1.12 103 -circle(A,B,C,D) | -cong(A,B,A,E) | -cong(F,B,F,C) | F = A | coll(f13(B,C,D,E,A,F),B,D) # label(ruleX12) # label(axiom). [clausify(88)].
% 0.82/1.12 Derived: -cong(A,B,A,C) | -cong(D,B,D,E) | D = A | coll(f13(B,E,F,C,A,D),B,F) | -cong(A,B,A,E) | -cong(A,B,A,F). [resolve(103,a,97,c)].
% 0.82/1.12 104 -circle(A,B,C,D) | -cong(A,B,A,E) | -cong(F,B,F,C) | F = A | cong(f13(B,C,D,E,A,F),F,F,B) # label(ruleX12) # label(axiom). [clausify(88)].
% 0.82/1.12 Derived: -cong(A,B,A,C) | -cong(D,B,D,E) | D = A | cong(f13(B,E,F,C,A,D),D,D,B) | -cong(A,B,A,E) | -cong(A,B,A,F). [resolve(104,a,97,c)].
% 0.82/1.12 105 -circle(A,B,C,D) | -cong(A,B,A,E) | -cong(F,B,F,C) | F = A | coll(f14(B,C,D,E,A,F),C,E) # label(ruleX12) # label(axiom). [clausify(88)].
% 0.82/1.12 Derived: -cong(A,B,A,C) | -cong(D,B,D,E) | D = A | coll(f14(B,E,F,C,A,D),E,C) | -cong(A,B,A,E) | -cong(A,B,A,F). [resolve(105,a,97,c)].
% 0.82/1.12 106 -circle(A,B,C,D) | -cong(A,B,A,E) | -cong(F,B,F,C) | F = A | cong(f14(B,C,D,E,A,F),F,F,B) # label(ruleX12) # label(axiom). [clausify(88)].
% 0.82/1.12 Derived: -cong(A,B,A,C) | -cong(D,B,D,E) | D = A | cong(f14(B,E,F,C,A,D),D,D,B) | -cong(A,B,A,E) | -cong(A,B,A,F). [resolve(106,a,97,c)].
% 0.82/1.12 107 -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | circle(f15(A,B,C,D,E),A,B,C) # label(ruleX13) # label(axiom). [clausify(89)].
% 0.82/1.12 Derived: -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | -perp(f15(A,B,C,D,E),A,A,F) | eqangle(A,F,A,B,C,A,C,B). [resolve(107,d,96,a)].
% 0.82/1.12 Derived: -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | -eqangle(A,F,A,B,C,A,C,B) | perp(f15(A,B,C,D,E),A,A,F). [resolve(107,d,98,a)].
% 0.82/1.12 Derived: -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | -midp(F,B,C) | eqangle(A,B,A,C,f15(A,B,C,D,E),B,f15(A,B,C,D,E),F). [resolve(107,d,99,a)].
% 0.82/1.12 Derived: -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | -coll(F,B,C) | -eqangle(A,B,A,C,f15(A,B,C,D,E),B,f15(A,B,C,D,E),F) | midp(F,B,C). [resolve(107,d,100,a)].
% 0.82/1.12 Derived: -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | -coll(f15(A,B,C,D,E),A,C) | perp(A,B,B,C). [resolve(107,d,101,a)].
% 0.82/1.12 Derived: -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | perp(f12(A,B,C,f15(A,B,C,D,E)),A,A,f15(A,B,C,D,E)). [resolve(107,d,102,a)].
% 0.82/1.12 Derived: -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | -cong(f15(A,B,C,D,E),A,f15(A,B,C,D,E),F) | -cong(V6,A,V6,B) | V6 = f15(A,B,C,D,E) | coll(f13(A,B,C,F,f15(A,B,C,D,E),V6),A,C). [resolve(107,d,103,a)].
% 0.82/1.12 Derived: -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | -cong(f15(A,B,C,D,E),A,f15(A,B,C,D,E),F) | -cong(V6,A,V6,B) | V6 = f15(A,B,C,D,E) | cong(f13(A,B,C,F,f15(A,B,C,D,E),V6),V6,V6,A). [resolve(107,d,104,a)].
% 0.82/1.12 Derived: -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | -cong(f15(A,B,C,D,E),A,f15(A,B,C,D,E),F) | -cong(V6,A,V6,B) | V6 = f15(A,B,C,D,E) | coll(f14(A,B,C,F,f15(A,B,C,D,E),V6),B,F). [resolve(107,d,105,a)].
% 0.82/1.12 Derived: -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | -cong(f15(A,B,C,D,E),A,f15(A,B,C,D,E),F) | -cong(V6,A,V6,B) | V6 = f15(A,B,C,D,E) | cong(f14(A,B,C,F,f15(A,B,C,D,E),V6),V6,V6,A). [resolve(107,d,106,a)].
% 0.82/1.12 108 -perp(A,B,B,C) | -cyclic(A,C,B,D) | circle(f16(A,C,B,D),A,C,B) # label(ruleX14) # label(axiom). [clausify(90)].
% 0.82/1.12 Derived: -perp(A,B,B,C) | -cyclic(A,C,B,D) | -perp(f16(A,C,B,D),A,A,E) | eqangle(A,E,A,C,B,A,B,C). [resolve(108,c,96,a)].
% 0.82/1.12 Derived: -perp(A,B,B,C) | -cyclic(A,C,B,D) | -eqangle(A,E,A,C,B,A,B,C) | perp(f16(A,C,B,D),A,A,E). [resolve(108,c,98,a)].
% 0.82/1.12 Derived: -perp(A,B,B,C) | -cyclic(A,C,B,D) | -midp(E,C,B) | eqangle(A,C,A,B,f16(A,C,B,D),C,f16(A,C,B,D),E). [resolve(108,c,99,a)].
% 0.82/1.12 Derived: -perp(A,B,B,C) | -cyclic(A,C,B,D) | -coll(E,C,B) | -eqangle(A,C,A,B,f16(A,C,B,D),C,f16(A,C,B,D),E) | midp(E,C,B). [resolve(108,c,100,a)].
% 0.82/1.12 Derived: -perp(A,B,B,C) | -cyclic(A,C,B,D) | -coll(f16(A,C,B,D),A,B) | perp(A,C,C,B). [resolve(108,c,101,a)].
% 0.82/1.12 Derived: -perp(A,B,B,C) | -cyclic(A,C,B,D) | perp(f12(A,C,B,f16(A,C,B,D)),A,A,f16(A,C,B,D)). [resolve(108,c,102,a)].
% 0.82/1.12 Derived: -perp(A,B,B,C) | -cyclic(A,C,B,D) | -cong(f16(A,C,B,D),A,f16(A,C,B,D),E) | -cong(F,A,F,C) | F = f16(A,C,B,D) | coll(f13(A,C,B,E,f16(A,C,B,D),F),A,B). [resolve(108,c,103,a)].
% 0.82/1.12 Derived: -perp(A,B,B,C) | -cyclic(A,C,B,D) | -cong(f16(A,C,B,D),A,f16(A,C,B,D),E) | -cong(F,A,F,C) | F = f16(A,C,B,D) | cong(f13(A,C,B,E,f16(A,C,B,D),F),F,F,A). [resolve(108,c,104,a)].
% 0.82/1.12 Derived: -perp(A,B,B,C) | -cyclic(A,C,B,D) | -cong(f16(A,C,B,D),A,f16(A,C,B,D),E) | -cong(F,A,F,C) | F = f16(A,C,B,D) | coll(f14(A,C,B,E,f16(A,C,B,D),F),C,E). [resolve(108,c,105,a)].
% 0.82/1.12 Derived: -perp(A,B,B,C) | -cyclic(A,C,B,D) | -cong(f16(A,C,B,D),A,f16(A,C,B,D),E) | -cong(F,A,F,C) | F = f16(A,C,B,D) | cong(f14(A,C,B,E,f16(A,C,B,D),F),F,F,A). [resolve(108,c,106,a)].
% 0.82/1.12 109 circle(c4,c1,c2,c3) # label(exemplo6GDDFULL8110992) # label(negated_conjecture). [clausify(95)].
% 0.82/1.12 Derived: -perp(c4,c1,c1,A) | eqangle(c1,A,c1,c2,c3,c1,c3,c2). [resolve(109,a,96,a)].
% 0.82/1.12 Derived: -eqangle(c1,A,c1,c2,c3,c1,c3,c2) | perp(c4,c1,c1,A). [resolve(109,a,98,a)].
% 0.82/1.12 Derived: -midp(A,c2,c3) | eqangle(c1,c2,c1,c3,c4,c2,c4,A). [resolve(109,a,99,a)].
% 0.82/1.12 Derived: -coll(A,c2,c3) | -eqangle(c1,c2,c1,c3,c4,c2,c4,A) | midp(A,c2,c3). [resolve(109,a,100,a)].
% 0.82/1.12 Derived: -coll(c4,c1,c3) | perp(c1,c2,c2,c3). [resolve(109,a,101,a)].
% 0.86/1.14 Derived: perp(f12(c1,c2,c3,c4),c1,c1,c4). [resolve(109,a,102,a)].
% 0.86/1.14 Derived: -cong(c4,c1,c4,A) | -cong(B,c1,B,c2) | B = c4 | coll(f13(c1,c2,c3,A,c4,B),c1,c3). [resolve(109,a,103,a)].
% 0.86/1.14 Derived: -cong(c4,c1,c4,A) | -cong(B,c1,B,c2) | B = c4 | cong(f13(c1,c2,c3,A,c4,B),B,B,c1). [resolve(109,a,104,a)].
% 0.86/1.14 Derived: -cong(c4,c1,c4,A) | -cong(B,c1,B,c2) | B = c4 | coll(f14(c1,c2,c3,A,c4,B),c2,A). [resolve(109,a,105,a)].
% 0.86/1.14 Derived: -cong(c4,c1,c4,A) | -cong(B,c1,B,c2) | B = c4 | cong(f14(c1,c2,c3,A,c4,B),B,B,c1). [resolve(109,a,106,a)].
% 0.86/1.14 110 circle(c4,c1,c5,c12) # label(exemplo6GDDFULL8110992) # label(negated_conjecture). [clausify(95)].
% 0.86/1.14 Derived: -perp(c4,c1,c1,A) | eqangle(c1,A,c1,c5,c12,c1,c12,c5). [resolve(110,a,96,a)].
% 0.86/1.14 Derived: -eqangle(c1,A,c1,c5,c12,c1,c12,c5) | perp(c4,c1,c1,A). [resolve(110,a,98,a)].
% 0.86/1.14 Derived: -midp(A,c5,c12) | eqangle(c1,c5,c1,c12,c4,c5,c4,A). [resolve(110,a,99,a)].
% 0.86/1.14 Derived: -coll(A,c5,c12) | -eqangle(c1,c5,c1,c12,c4,c5,c4,A) | midp(A,c5,c12). [resolve(110,a,100,a)].
% 0.86/1.14 Derived: -coll(c4,c1,c12) | perp(c1,c5,c5,c12). [resolve(110,a,101,a)].
% 0.86/1.14 Derived: perp(f12(c1,c5,c12,c4),c1,c1,c4). [resolve(110,a,102,a)].
% 0.86/1.14 Derived: -cong(c4,c1,c4,A) | -cong(B,c1,B,c5) | B = c4 | coll(f13(c1,c5,c12,A,c4,B),c1,c12). [resolve(110,a,103,a)].
% 0.86/1.14 Derived: -cong(c4,c1,c4,A) | -cong(B,c1,B,c5) | B = c4 | cong(f13(c1,c5,c12,A,c4,B),B,B,c1). [resolve(110,a,104,a)].
% 0.86/1.14 Derived: -cong(c4,c1,c4,A) | -cong(B,c1,B,c5) | B = c4 | coll(f14(c1,c5,c12,A,c4,B),c5,A). [resolve(110,a,105,a)].
% 0.86/1.14 Derived: -cong(c4,c1,c4,A) | -cong(B,c1,B,c5) | B = c4 | cong(f14(c1,c5,c12,A,c4,B),B,B,c1). [resolve(110,a,106,a)].
% 0.86/1.14 111 circle(c4,c1,c8,c13) # label(exemplo6GDDFULL8110992) # label(negated_conjecture). [clausify(95)].
% 0.86/1.14 Derived: -perp(c4,c1,c1,A) | eqangle(c1,A,c1,c8,c13,c1,c13,c8). [resolve(111,a,96,a)].
% 0.86/1.14 Derived: -eqangle(c1,A,c1,c8,c13,c1,c13,c8) | perp(c4,c1,c1,A). [resolve(111,a,98,a)].
% 0.86/1.14 Derived: -midp(A,c8,c13) | eqangle(c1,c8,c1,c13,c4,c8,c4,A). [resolve(111,a,99,a)].
% 0.86/1.14 Derived: -coll(A,c8,c13) | -eqangle(c1,c8,c1,c13,c4,c8,c4,A) | midp(A,c8,c13). [resolve(111,a,100,a)].
% 0.86/1.14 Derived: -coll(c4,c1,c13) | perp(c1,c8,c8,c13). [resolve(111,a,101,a)].
% 0.86/1.14 Derived: perp(f12(c1,c8,c13,c4),c1,c1,c4). [resolve(111,a,102,a)].
% 0.86/1.14 Derived: -cong(c4,c1,c4,A) | -cong(B,c1,B,c8) | B = c4 | coll(f13(c1,c8,c13,A,c4,B),c1,c13). [resolve(111,a,103,a)].
% 0.86/1.14 Derived: -cong(c4,c1,c4,A) | -cong(B,c1,B,c8) | B = c4 | cong(f13(c1,c8,c13,A,c4,B),B,B,c1). [resolve(111,a,104,a)].
% 0.86/1.14 Derived: -cong(c4,c1,c4,A) | -cong(B,c1,B,c8) | B = c4 | coll(f14(c1,c8,c13,A,c4,B),c8,A). [resolve(111,a,105,a)].
% 0.86/1.14 Derived: -cong(c4,c1,c4,A) | -cong(B,c1,B,c8) | B = c4 | cong(f14(c1,c8,c13,A,c4,B),B,B,c1). [resolve(111,a,106,a)].
% 0.86/1.14 112 circle(c4,c1,c11,c14) # label(exemplo6GDDFULL8110992) # label(negated_conjecture). [clausify(95)].
% 0.86/1.14 Derived: -perp(c4,c1,c1,A) | eqangle(c1,A,c1,c11,c14,c1,c14,c11). [resolve(112,a,96,a)].
% 0.86/1.14 Derived: -eqangle(c1,A,c1,c11,c14,c1,c14,c11) | perp(c4,c1,c1,A). [resolve(112,a,98,a)].
% 0.86/1.14 Derived: -midp(A,c11,c14) | eqangle(c1,c11,c1,c14,c4,c11,c4,A). [resolve(112,a,99,a)].
% 0.86/1.14 Derived: -coll(A,c11,c14) | -eqangle(c1,c11,c1,c14,c4,c11,c4,A) | midp(A,c11,c14). [resolve(112,a,100,a)].
% 0.86/1.14 Derived: -coll(c4,c1,c14) | perp(c1,c11,c11,c14). [resolve(112,a,101,a)].
% 0.86/1.14 Derived: perp(f12(c1,c11,c14,c4),c1,c1,c4). [resolve(112,a,102,a)].
% 0.86/1.14 Derived: -cong(c4,c1,c4,A) | -cong(B,c1,B,c11) | B = c4 | coll(f13(c1,c11,c14,A,c4,B),c1,c14). [resolve(112,a,103,a)].
% 0.86/1.14 Derived: -cong(c4,c1,c4,A) | -cong(B,c1,B,c11) | B = c4 | cong(f13(c1,c11,c14,A,c4,B),B,B,c1). [resolve(112,a,104,a)].
% 0.86/1.14 Derived: -cong(c4,c1,c4,A) | -cong(B,c1,B,c11) | B = c4 | coll(f14(c1,c11,c14,A,c4,B),c11,A). [resolve(112,a,105,a)].
% 0.86/1.14 Derived: -cong(c4,c1,c4,A) | -cong(B,c1,B,c11) | B = c4 | cong(f14(c1,c11,c14,A,c4,B),B,B,c1). [resolve(112,a,106,a)].
% 0.86/1.14
% 0.86/1.14 ============================== end predicate elimination =============
% 0.86/1.14
% 0.86/1.14 Auto_denials: (non-Horn, no changes).
% 0.86/1.14
% 0.86/1.14 Term ordering decisions:
% 0.86/1.14 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. c9=1. c10=1. c11=1. c12=1. c13=1. c14=1. 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.
% 11.22/11.51
% 11.22/11.51 ============================== end of process initial clauses ========
% 11.22/11.51
% 11.22/11.51 ============================== CLAUSES FOR SEARCH ====================
% 11.22/11.51
% 11.22/11.51 ============================== end of clauses for search =============
% 11.22/11.51
% 11.22/11.51 ============================== SEARCH ================================
% 11.22/11.51
% 11.22/11.51 % Starting search at 0.05 seconds.
% 11.22/11.51
% 11.22/11.51 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 2147483647 (0.00 of 0.17 sec).
% 11.22/11.51
% 11.22/11.51 Low Water (keep): wt=26.000, iters=3344
% 11.22/11.51
% 11.22/11.51 Low Water (keep): wt=25.000, iters=3373
% 11.22/11.51
% 11.22/11.51 Low Water (keep): wt=21.000, iters=3336
% 11.22/11.51
% 11.22/11.51 Low Water (keep): wt=18.000, iters=3355
% 11.22/11.51
% 11.22/11.51 Low Water (keep): wt=16.000, iters=3335
% 11.22/11.51
% 11.22/11.51 Low Water (keep): wt=15.000, iters=3429
% 11.22/11.51
% 11.22/11.51 Low Water (keep): wt=14.000, iters=3338
% 11.22/11.51
% 11.22/11.51 Low Water (keep): wt=13.000, iters=3334
% 11.22/11.51
% 11.22/11.51 Low Water (keep): wt=12.000, iters=3335
% 11.22/11.51
% 11.22/11.51 Low Water (displace): id=4350, wt=29.000
% 11.22/11.51
% 11.22/11.51 Low Water (displace): id=11155, wt=26.000
% 11.22/11.51
% 11.22/11.51 Low Water (displace): id=4351, wt=25.000
% 11.22/11.51
% 11.22/11.51 Low Water (displace): id=3673, wt=24.000
% 11.22/11.51
% 11.22/11.51 Low Water (displace): id=19541, wt=8.000
% 11.22/11.51
% 11.22/11.51 Low Water (displace): id=24322, wt=5.000
% 11.22/11.51
% 11.22/11.51 Low Water (keep): wt=11.000, iters=3347
% 11.22/11.51
% 11.22/11.51 Low Water (keep): wt=10.000, iters=3344
% 11.22/11.51
% 11.22/11.51 ============================== PROOF =================================
% 11.22/11.51 % SZS status Theorem
% 11.22/11.51 % SZS output start Refutation
% 11.22/11.51
% 11.22/11.51 % Proof 1 at 10.31 (+ 0.11) seconds.
% 11.22/11.51 % Length of proof is 206.
% 11.22/11.51 % Level of proof is 29.
% 11.22/11.51 % Maximum clause weight is 29.000.
% 11.22/11.51 % Given clauses 14435.
% 11.22/11.51
% 11.22/11.51 1 (all A all B all C (coll(A,B,C) -> coll(A,C,B))) # label(ruleD1) # label(axiom) # label(non_clause). [assumption].
% 11.22/11.51 2 (all A all B all C (coll(A,B,C) -> coll(B,A,C))) # label(ruleD2) # label(axiom) # label(non_clause). [assumption].
% 11.22/11.51 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].
% 11.22/11.51 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].
% 11.22/11.51 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].
% 11.22/11.51 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].
% 11.22/11.51 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].
% 11.22/11.51 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].
% 11.22/11.51 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].
% 11.22/11.51 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].
% 11.22/11.51 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].
% 11.22/11.51 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].
% 11.22/11.51 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].
% 11.22/11.51 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].
% 11.22/11.51 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].
% 11.22/11.51 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].
% 11.22/11.51 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].
% 11.22/11.51 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].
% 11.22/11.51 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].
% 11.22/11.51 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].
% 11.22/11.51 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].
% 11.22/11.51 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].
% 11.22/11.51 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].
% 11.22/11.51 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].
% 11.22/11.51 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].
% 11.22/11.51 67 (all A all B all C (para(A,B,A,C) -> coll(A,B,C))) # label(ruleD66) # label(axiom) # label(non_clause). [assumption].
% 11.22/11.51 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].
% 11.22/11.51 69 (all A all B all C (midp(A,B,C) -> cong(A,B,A,C))) # label(ruleD68) # label(axiom) # label(non_clause). [assumption].
% 11.22/11.51 95 -(all A all B all C all O all P1 all F1 all G1 all P all F all G all K all NWPNT1 all NWPNT2 all NWPNT3 (circle(O,A,B,C) & circle(O,A,P1,NWPNT1) & perp(F1,P1,A,C) & coll(F1,A,C) & perp(G1,P1,A,B) & coll(G1,A,B) & circle(O,A,P,NWPNT2) & perp(F,P,A,C) & coll(F,A,C) & perp(G,P,A,B) & coll(G,A,B) & para(F1,G1,K,P) & circle(O,A,K,NWPNT3) -> para(K,P1,G,F))) # label(exemplo6GDDFULL8110992) # label(negated_conjecture) # label(non_clause). [assumption].
% 11.22/11.51 113 -coll(A,B,C) | coll(A,C,B) # label(ruleD1) # label(axiom). [clausify(1)].
% 11.22/11.51 114 -coll(A,B,C) | coll(B,A,C) # label(ruleD2) # label(axiom). [clausify(2)].
% 11.22/11.51 115 -coll(A,B,C) | -coll(A,B,D) | coll(C,D,A) # label(ruleD3) # label(axiom). [clausify(3)].
% 11.22/11.51 116 -para(A,B,C,D) | para(A,B,D,C) # label(ruleD4) # label(axiom). [clausify(4)].
% 11.22/11.51 117 -para(A,B,C,D) | para(C,D,A,B) # label(ruleD5) # label(axiom). [clausify(5)].
% 11.22/11.51 118 -para(A,B,C,D) | -para(C,D,E,F) | para(A,B,E,F) # label(ruleD6) # label(axiom). [clausify(6)].
% 11.22/11.51 119 -perp(A,B,C,D) | perp(A,B,D,C) # label(ruleD7) # label(axiom). [clausify(7)].
% 11.22/11.51 120 -perp(A,B,C,D) | perp(C,D,A,B) # label(ruleD8) # label(axiom). [clausify(8)].
% 11.22/11.51 121 -perp(A,B,C,D) | -perp(C,D,E,F) | para(A,B,E,F) # label(ruleD9) # label(axiom). [clausify(9)].
% 11.22/11.51 122 -para(A,B,C,D) | -perp(C,D,E,F) | perp(A,B,E,F) # label(ruleD10) # label(axiom). [clausify(10)].
% 11.22/11.51 125 -cyclic(A,B,C,D) | cyclic(A,B,D,C) # label(ruleD14) # label(axiom). [clausify(14)].
% 11.22/11.51 126 -cyclic(A,B,C,D) | cyclic(A,C,B,D) # label(ruleD15) # label(axiom). [clausify(15)].
% 11.22/11.51 127 -cyclic(A,B,C,D) | cyclic(B,A,C,D) # label(ruleD16) # label(axiom). [clausify(16)].
% 11.22/11.51 128 -cyclic(A,B,C,D) | -cyclic(A,B,C,E) | cyclic(B,C,D,E) # label(ruleD17) # label(axiom). [clausify(17)].
% 11.22/11.51 130 -eqangle(A,B,C,D,E,F,V6,V7) | eqangle(C,D,A,B,V6,V7,E,F) # label(ruleD19) # label(axiom). [clausify(19)].
% 11.22/11.51 150 -eqangle(A,B,C,D,E,F,C,D) | para(A,B,E,F) # label(ruleD39) # label(axiom). [clausify(39)].
% 11.22/11.51 151 -para(A,B,C,D) | eqangle(A,B,E,F,C,D,E,F) # label(ruleD40) # label(axiom). [clausify(40)].
% 11.22/11.51 154 -eqangle(A,B,A,C,D,B,D,C) | -coll(A,D,C) | cyclic(B,C,A,D) # label(ruleD42b) # label(axiom). [clausify(43)].
% 11.22/11.51 155 -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)].
% 11.22/11.51 157 -midp(A,B,C) | -para(A,D,C,E) | -coll(D,B,E) | midp(D,B,E) # label(ruleD45) # label(axiom). [clausify(46)].
% 11.22/11.51 162 -midp(A,B,C) | -perp(D,A,B,C) | cong(D,B,D,C) # label(ruleD55) # label(axiom). [clausify(56)].
% 11.22/11.51 163 -cong(A,B,C,B) | -cong(A,D,C,D) | perp(A,C,B,D) # label(ruleD56) # label(axiom). [clausify(57)].
% 11.22/11.51 164 -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)].
% 11.22/11.51 170 -midp(A,B,C) | -midp(A,D,E) | para(B,D,C,E) # label(ruleD63) # label(axiom). [clausify(64)].
% 11.22/11.51 171 -midp(A,B,C) | -para(B,D,C,E) | -para(B,E,C,D) | midp(A,D,E) # label(ruleD64) # label(axiom). [clausify(65)].
% 11.22/11.51 173 -para(A,B,A,C) | coll(A,B,C) # label(ruleD66) # label(axiom). [clausify(67)].
% 11.22/11.51 174 -cong(A,B,A,C) | -coll(A,B,C) | midp(A,B,C) # label(ruleD67) # label(axiom). [clausify(68)].
% 11.22/11.51 175 -midp(A,B,C) | cong(A,B,A,C) # label(ruleD68) # label(axiom). [clausify(69)].
% 11.22/11.51 212 perp(c6,c5,c1,c3) # label(exemplo6GDDFULL8110992) # label(negated_conjecture). [clausify(95)].
% 11.22/11.51 213 coll(c6,c1,c3) # label(exemplo6GDDFULL8110992) # label(negated_conjecture). [clausify(95)].
% 11.22/11.51 215 coll(c7,c1,c2) # label(exemplo6GDDFULL8110992) # label(negated_conjecture). [clausify(95)].
% 11.22/11.51 216 perp(c9,c8,c1,c3) # label(exemplo6GDDFULL8110992) # label(negated_conjecture). [clausify(95)].
% 11.22/11.51 217 coll(c9,c1,c3) # label(exemplo6GDDFULL8110992) # label(negated_conjecture). [clausify(95)].
% 11.22/11.51 220 para(c6,c7,c11,c8) # label(exemplo6GDDFULL8110992) # label(negated_conjecture). [clausify(95)].
% 11.22/11.51 221 -para(c11,c5,c10,c9) # label(exemplo6GDDFULL8110992) # label(negated_conjecture). [clausify(95)].
% 11.22/11.51 316 -coll(A,B,C) | coll(C,C,A). [factor(115,a,b)].
% 11.22/11.51 321 -cyclic(A,B,C,D) | cyclic(B,C,D,D). [factor(128,a,b)].
% 11.22/11.51 322 -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(155,a,b)].
% 11.22/11.51 324 -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(155,b,c)].
% 11.22/11.51 327 -cong(A,B,C,B) | -cyclic(A,C,B,B) | perp(B,A,A,B). [factor(164,a,b)].
% 11.22/11.51 329 -midp(A,B,C) | para(B,B,C,C). [factor(170,a,b)].
% 11.22/11.51 330 -midp(A,B,C) | -para(B,D,C,D) | midp(A,D,D). [factor(171,b,c)].
% 11.22/11.51 391 -perp(c1,c3,A,B) | para(c6,c5,A,B). [resolve(212,a,121,a)].
% 11.22/11.51 392 perp(c1,c3,c6,c5). [resolve(212,a,120,a)].
% 11.22/11.51 397 coll(c6,c3,c1). [resolve(213,a,113,a)].
% 11.22/11.51 416 coll(c7,c2,c1). [resolve(215,a,113,a)].
% 11.22/11.51 429 -perp(c1,c3,A,B) | para(c9,c8,A,B). [resolve(216,a,121,a)].
% 11.22/11.51 430 perp(c1,c3,c9,c8). [resolve(216,a,120,a)].
% 11.22/11.51 434 coll(c1,c9,c3). [resolve(217,a,114,a)].
% 11.22/11.51 467 -para(A,B,c6,c7) | para(A,B,c11,c8). [resolve(220,a,118,b)].
% 11.22/11.51 468 -para(c11,c8,A,B) | para(c6,c7,A,B). [resolve(220,a,118,a)].
% 11.22/11.51 469 para(c11,c8,c6,c7). [resolve(220,a,117,a)].
% 11.22/11.51 574 coll(c3,c3,c6). [resolve(316,a,213,a)].
% 11.22/11.51 581 coll(c1,c1,c6). [resolve(397,a,316,a)].
% 11.22/11.51 589 coll(c1,c1,c7). [resolve(416,a,316,a)].
% 11.22/11.51 595 coll(c1,c3,c9). [resolve(434,a,113,a)].
% 11.22/11.51 619 coll(c6,c6,c3). [resolve(574,a,316,a)].
% 11.22/11.51 631 -coll(c1,c1,A) | coll(A,c6,c1). [resolve(581,a,115,b)].
% 11.22/11.51 649 coll(c9,c9,c1). [resolve(595,a,316,a)].
% 11.22/11.51 689 coll(c6,c3,c6). [resolve(619,a,113,a)].
% 11.22/11.51 722 -coll(c9,c9,A) | coll(A,c1,c9). [resolve(649,a,115,b)].
% 11.22/11.51 743 para(c6,c5,c6,c5). [resolve(392,a,391,a)].
% 11.22/11.51 758 perp(c1,c3,c5,c6). [resolve(392,a,119,a)].
% 11.22/11.51 788 coll(c6,c6,c6). [resolve(689,a,316,a)].
% 11.22/11.51 970 -midp(A,c6,c6) | midp(A,c5,c5). [resolve(743,a,330,b)].
% 11.22/11.51 977 coll(c6,c5,c5). [resolve(743,a,173,a)].
% 11.22/11.51 980 eqangle(c6,c5,A,B,c6,c5,A,B). [resolve(743,a,151,a)].
% 11.22/11.51 981 para(c6,c5,c5,c6). [resolve(743,a,116,a)].
% 11.22/11.51 982 coll(c5,c5,c6). [resolve(977,a,316,a)].
% 11.22/11.51 988 coll(c6,c6,c5). [resolve(982,a,316,a)].
% 11.22/11.51 996 coll(c6,c5,c6). [resolve(988,a,113,a)].
% 11.22/11.51 1000 coll(c5,c6,c6). [resolve(996,a,114,a)].
% 11.22/11.51 1028 -perp(c5,c6,A,B) | para(c1,c3,A,B). [resolve(758,a,121,a)].
% 11.22/11.51 1029 perp(c5,c6,c1,c3). [resolve(758,a,120,a)].
% 11.22/11.51 1198 para(c5,c6,c6,c5). [resolve(981,a,117,a)].
% 11.22/11.51 1229 -perp(A,B,c5,c6) | para(A,B,c1,c3). [resolve(1029,a,121,b)].
% 11.22/11.51 1451 -perp(c6,c5,A,B) | perp(c5,c6,A,B). [resolve(1198,a,122,a)].
% 11.22/11.51 1453 para(c5,c6,c5,c6). [resolve(1198,a,116,a)].
% 11.22/11.51 1690 eqangle(c5,c6,A,B,c5,c6,A,B). [resolve(1453,a,151,a)].
% 11.22/11.51 1869 para(c9,c8,c9,c8). [resolve(429,a,430,a)].
% 11.22/11.51 1895 coll(c9,c8,c8). [resolve(1869,a,173,a)].
% 11.22/11.51 1899 coll(c8,c8,c9). [resolve(1895,a,316,a)].
% 11.22/11.51 1908 -coll(c8,c8,A) | coll(A,c9,c8). [resolve(1899,a,115,b)].
% 11.22/11.51 2144 coll(c7,c6,c1). [resolve(631,a,589,a)].
% 11.22/11.51 2155 coll(c6,c7,c1). [resolve(2144,a,114,a)].
% 11.22/11.51 2156 coll(c7,c1,c6). [resolve(2144,a,113,a)].
% 11.22/11.51 2175 coll(c6,c1,c7). [resolve(2155,a,113,a)].
% 11.22/11.51 2178 coll(c6,c6,c7). [resolve(2156,a,316,a)].
% 11.22/11.51 2216 coll(c7,c7,c6). [resolve(2175,a,316,a)].
% 11.22/11.51 2232 coll(c6,c7,c6). [resolve(2178,a,113,a)].
% 11.22/11.51 2247 para(c11,c8,c11,c8). [resolve(467,a,469,a)].
% 11.22/11.51 2262 para(c6,c7,c6,c7). [resolve(468,a,469,a)].
% 11.22/11.51 2286 coll(c7,c6,c7). [resolve(2216,a,113,a)].
% 11.22/11.51 2300 coll(c7,c6,c6). [resolve(2232,a,114,a)].
% 11.22/11.51 2764 coll(c11,c8,c8). [resolve(2247,a,173,a)].
% 11.22/11.51 2768 coll(c8,c8,c11). [resolve(2764,a,316,a)].
% 11.22/11.51 2817 -midp(A,c6,c6) | midp(A,c7,c7). [resolve(2262,a,330,b)].
% 11.22/11.51 2825 -midp(c6,A,c6) | -coll(c7,A,c7) | midp(c7,A,c7). [resolve(2262,a,157,b)].
% 11.22/11.51 4991 coll(c11,c9,c8). [resolve(1908,a,2768,a)].
% 11.22/11.51 5020 coll(c11,c8,c9). [resolve(4991,a,113,a)].
% 11.22/11.51 5055 coll(c9,c9,c11). [resolve(5020,a,316,a)].
% 11.22/11.51 5091 coll(c11,c1,c9). [resolve(5055,a,722,a)].
% 11.22/11.51 5124 coll(c11,c9,c1). [resolve(5091,a,113,a)].
% 11.22/11.51 5147 coll(c1,c1,c11). [resolve(5124,a,316,a)].
% 11.22/11.51 5187 coll(c11,c6,c1). [resolve(5147,a,631,a)].
% 11.22/11.51 5238 coll(c11,c1,c6). [resolve(5187,a,113,a)].
% 11.22/11.51 5303 coll(c6,c6,c11). [resolve(5238,a,316,a)].
% 11.22/11.51 6184 -cyclic(c5,c6,c6,c5) | -cyclic(c5,c6,c6,c6) | cong(c5,c6,c5,c6). [resolve(980,a,324,c)].
% 11.22/11.51 6194 -coll(c6,c6,A) | cyclic(c5,A,c6,c6). [resolve(980,a,154,a)].
% 11.22/11.51 6196 eqangle(A,B,c6,c5,A,B,c6,c5). [resolve(980,a,130,a)].
% 11.22/11.51 9775 -cyclic(c6,c5,c5,c6) | -cyclic(c6,c5,c5,c5) | cong(c6,c5,c6,c5). [resolve(1690,a,324,c)].
% 11.22/11.51 9776 -cyclic(c6,c6,c5,c6) | -cyclic(c6,c6,c5,c5) | cong(c6,c6,c6,c6). [resolve(1690,a,322,c)].
% 11.22/11.51 20278 cyclic(c5,c11,c6,c6). [resolve(6194,a,5303,a)].
% 11.22/11.51 20281 cyclic(c5,c7,c6,c6). [resolve(6194,a,2178,a)].
% 11.22/11.51 20285 cyclic(c5,c5,c6,c6). [resolve(6194,a,988,a)].
% 11.22/11.51 20286 cyclic(c5,c6,c6,c6). [resolve(6194,a,788,a)].
% 11.22/11.51 20290 -cyclic(c5,c6,c6,c5) | cong(c5,c6,c5,c6). [back_unit_del(6184),unit_del(b,20286)].
% 11.22/11.51 20295 cyclic(c11,c5,c6,c6). [resolve(20278,a,127,a)].
% 11.22/11.51 20310 cyclic(c7,c6,c6,c6). [resolve(20281,a,321,a)].
% 11.22/11.51 20333 -cong(c5,c6,c5,c6) | perp(c6,c5,c5,c6). [resolve(20285,a,327,b)].
% 11.22/11.51 20336 cyclic(c5,c6,c5,c6). [resolve(20285,a,126,a)].
% 11.22/11.51 20341 cyclic(c6,c5,c6,c6). [resolve(20286,a,127,a)].
% 11.22/11.51 20362 cyclic(c11,c6,c5,c6). [resolve(20295,a,126,a)].
% 11.22/11.51 20399 cyclic(c6,c7,c6,c6). [resolve(20310,a,127,a)].
% 11.22/11.51 20454 cyclic(c6,c5,c5,c6). [resolve(20336,a,127,a)].
% 11.22/11.51 20455 cyclic(c5,c6,c6,c5). [resolve(20336,a,125,a)].
% 11.22/11.51 20456 -cyclic(c6,c5,c5,c5) | cong(c6,c5,c6,c5). [back_unit_del(9775),unit_del(a,20454)].
% 11.22/11.51 20457 cong(c5,c6,c5,c6). [back_unit_del(20290),unit_del(a,20455)].
% 11.22/11.51 20458 perp(c6,c5,c5,c6). [back_unit_del(20333),unit_del(a,20457)].
% 11.22/11.51 20464 cyclic(c6,c6,c5,c6). [resolve(20341,a,126,a)].
% 11.22/11.51 20465 -cyclic(c6,c6,c5,c5) | cong(c6,c6,c6,c6). [back_unit_del(9776),unit_del(a,20464)].
% 11.22/11.51 20501 cyclic(c6,c11,c5,c6). [resolve(20362,a,127,a)].
% 11.22/11.51 20547 cyclic(c6,c6,c7,c6). [resolve(20399,a,126,a)].
% 11.22/11.51 20617 cyclic(c6,c6,c5,c5). [resolve(20455,a,321,a)].
% 11.22/11.51 20622 cong(c6,c6,c6,c6). [back_unit_del(20465),unit_del(a,20617)].
% 11.22/11.51 20633 midp(c5,c6,c6). [resolve(20457,a,174,a),unit_del(a,1000)].
% 11.22/11.51 20642 midp(c5,c5,c5). [resolve(20633,a,970,a)].
% 11.22/11.51 20736 perp(c5,c6,c5,c6). [resolve(20458,a,1451,a)].
% 11.22/11.51 20758 -cong(c6,c5,c6,c5) | perp(c5,c6,c6,c6). [resolve(20464,a,164,c),unit_del(b,20622)].
% 11.22/11.51 20802 cyclic(c6,c11,c6,c5). [resolve(20501,a,125,a)].
% 11.22/11.51 20861 -cong(c6,c7,c6,c7) | perp(c7,c6,c6,c6). [resolve(20547,a,164,c),unit_del(b,20622)].
% 11.22/11.51 20951 cyclic(c6,c5,c5,c5). [resolve(20617,a,321,a)].
% 11.22/11.51 20955 cong(c6,c5,c6,c5). [back_unit_del(20456),unit_del(a,20951)].
% 11.22/11.51 20956 perp(c5,c6,c6,c6). [back_unit_del(20758),unit_del(a,20955)].
% 11.22/11.51 20971 midp(c6,c6,c6). [resolve(20622,a,174,a),unit_del(a,788)].
% 11.22/11.51 20975 midp(c7,c6,c7). [resolve(20971,a,2825,a),unit_del(a,2286)].
% 11.22/11.51 20976 midp(c6,c7,c7). [resolve(20971,a,2817,a)].
% 11.22/11.51 20998 para(c6,c6,c7,c7). [resolve(20975,a,329,a)].
% 11.22/11.51 21011 cong(c6,c7,c6,c7). [resolve(20976,a,175,a)].
% 11.22/11.51 21016 perp(c7,c6,c6,c6). [back_unit_del(20861),unit_del(a,21011)].
% 11.22/11.51 21217 para(c5,c6,c1,c3). [resolve(20736,a,1229,a)].
% 11.22/11.51 21325 cyclic(c11,c6,c5,c5). [resolve(20802,a,321,a)].
% 11.22/11.51 21536 para(c1,c3,c6,c6). [resolve(20956,a,1028,a)].
% 11.22/11.51 21548 -perp(c7,c7,A,B) | perp(c6,c6,A,B). [resolve(20998,a,122,a)].
% 11.22/11.51 21579 cong(c7,c6,c7,c6). [resolve(21016,a,162,b),unit_del(a,20971)].
% 11.22/11.51 21744 -perp(c1,c3,A,B) | perp(c5,c6,A,B). [resolve(21217,a,122,a)].
% 11.22/11.51 21853 cyclic(c11,c5,c6,c5). [resolve(21325,a,126,a)].
% 11.22/11.51 22118 -perp(c6,c6,A,B) | perp(c1,c3,A,B). [resolve(21536,a,122,a)].
% 11.22/11.51 22175 midp(c7,c6,c6). [resolve(21579,a,174,a),unit_del(a,2300)].
% 11.22/11.51 22183 midp(c7,c5,c5). [resolve(22175,a,970,a)].
% 11.22/11.51 22577 cyclic(c5,c11,c6,c5). [resolve(21853,a,127,a)].
% 11.22/11.51 23344 cyclic(c5,c11,c5,c6). [resolve(22577,a,125,a)].
% 11.22/11.51 24025 cyclic(c5,c5,c11,c6). [resolve(23344,a,126,a)].
% 11.22/11.51 24486 -cong(c5,c11,c5,c11) | perp(c11,c5,c5,c6). [resolve(24025,a,164,c),unit_del(b,20457)].
% 11.22/11.51 27056 para(A,B,A,B). [resolve(6196,a,150,a)].
% 11.22/11.51 27060 -midp(A,B,B) | midp(A,C,C). [resolve(27056,a,330,b)].
% 11.22/11.51 29587 midp(c7,A,A). [resolve(27060,a,22183,a)].
% 11.22/11.51 29589 midp(c5,A,A). [resolve(27060,a,20642,a)].
% 11.22/11.51 29597 cong(c7,A,c7,A). [resolve(29587,a,175,a)].
% 11.22/11.51 29664 cong(c5,A,c5,A). [resolve(29589,a,175,a)].
% 11.22/11.51 29699 perp(c11,c5,c5,c6). [back_unit_del(24486),unit_del(a,29664)].
% 11.22/11.51 29836 perp(c7,c7,A,B). [resolve(29597,a,163,b),unit_del(a,29597)].
% 11.22/11.51 29844 perp(c6,c6,A,B). [back_unit_del(21548),unit_del(a,29836)].
% 11.22/11.51 29860 perp(c1,c3,A,B). [back_unit_del(22118),unit_del(a,29844)].
% 11.22/11.51 29876 perp(c5,c6,A,B). [back_unit_del(21744),unit_del(a,29860)].
% 11.22/11.51 30724 para(c11,c5,A,B). [resolve(29699,a,121,a),unit_del(a,29876)].
% 11.22/11.51 30725 $F. [resolve(30724,a,221,a)].
% 11.22/11.51
% 11.22/11.51 % SZS output end Refutation
% 11.22/11.51 ============================== end of proof ==========================
% 11.22/11.51
% 11.22/11.51 ============================== STATISTICS ============================
% 11.22/11.51
% 11.22/11.51 Given=14435. Generated=175179. Kept=30588. proofs=1.
% 11.22/11.51 Usable=10743. Sos=5902. Demods=0. Limbo=9, Disabled=14130. Hints=0.
% 11.22/11.51 Megabytes=17.36.
% 11.22/11.51 User_CPU=10.31, System_CPU=0.11, Wall_clock=11.
% 11.22/11.51
% 11.22/11.51 ============================== end of statistics =====================
% 11.22/11.51
% 11.22/11.51 ============================== end of search =========================
% 11.22/11.51
% 11.22/11.51 THEOREM PROVED
% 11.22/11.51 % SZS status Theorem
% 11.22/11.51
% 11.22/11.51 Exiting with 1 proof.
% 11.22/11.51
% 11.22/11.51 Process 23000 exit (max_proofs) Sat Jun 18 15:49:13 2022
% 11.22/11.51 Prover9 interrupted
%------------------------------------------------------------------------------