TSTP Solution File: GEO656+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GEO656+1 : TPTP v8.1.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n024.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sat Jul 16 05:57:27 EDT 2022
% Result : Theorem 3.66s 3.98s
% Output : Refutation 3.74s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GEO656+1 : TPTP v8.1.0. Released v7.5.0.
% 0.12/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n024.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sat Jun 18 00:17:32 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.45/1.11 ============================== Prover9 ===============================
% 0.45/1.11 Prover9 (32) version 2009-11A, November 2009.
% 0.45/1.11 Process 14126 was started by sandbox2 on n024.cluster.edu,
% 0.45/1.11 Sat Jun 18 00:17:33 2022
% 0.45/1.11 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_13973_n024.cluster.edu".
% 0.45/1.11 ============================== end of head ===========================
% 0.45/1.11
% 0.45/1.11 ============================== INPUT =================================
% 0.45/1.11
% 0.45/1.11 % Reading from file /tmp/Prover9_13973_n024.cluster.edu
% 0.45/1.11
% 0.45/1.11 set(prolog_style_variables).
% 0.45/1.11 set(auto2).
% 0.45/1.11 % set(auto2) -> set(auto).
% 0.45/1.11 % set(auto) -> set(auto_inference).
% 0.45/1.11 % set(auto) -> set(auto_setup).
% 0.45/1.11 % set(auto_setup) -> set(predicate_elim).
% 0.45/1.11 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/1.11 % set(auto) -> set(auto_limits).
% 0.45/1.11 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/1.11 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/1.11 % set(auto) -> set(auto_denials).
% 0.45/1.11 % set(auto) -> set(auto_process).
% 0.45/1.11 % set(auto2) -> assign(new_constants, 1).
% 0.45/1.11 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/1.11 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/1.11 % set(auto2) -> assign(max_hours, 1).
% 0.45/1.11 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/1.11 % set(auto2) -> assign(max_seconds, 0).
% 0.45/1.11 % set(auto2) -> assign(max_minutes, 5).
% 0.45/1.11 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/1.11 % set(auto2) -> set(sort_initial_sos).
% 0.45/1.11 % set(auto2) -> assign(sos_limit, -1).
% 0.45/1.11 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/1.11 % set(auto2) -> assign(max_megs, 400).
% 0.45/1.11 % set(auto2) -> assign(stats, some).
% 0.45/1.11 % set(auto2) -> clear(echo_input).
% 0.45/1.11 % set(auto2) -> set(quiet).
% 0.45/1.11 % set(auto2) -> clear(print_initial_clauses).
% 0.45/1.11 % set(auto2) -> clear(print_given).
% 0.45/1.11 assign(lrs_ticks,-1).
% 0.45/1.11 assign(sos_limit,10000).
% 0.45/1.11 assign(order,kbo).
% 0.45/1.11 set(lex_order_vars).
% 0.45/1.11 clear(print_given).
% 0.45/1.11
% 0.45/1.11 % formulas(sos). % not echoed (95 formulas)
% 0.45/1.11
% 0.45/1.11 ============================== end of input ==========================
% 0.45/1.11
% 0.45/1.11 % From the command line: assign(max_seconds, 300).
% 0.45/1.11
% 0.45/1.11 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/1.11
% 0.45/1.11 % Formulas that are not ordinary clauses:
% 0.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/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.45/1.11 66 (all A all B all C all D all O (para(A,B,C,D) & coll(O,A,C) & coll(O,B,D) -> eqratio(O,A,A,C,O,B,B,D))) # label(ruleD65) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.11 67 (all A all B all C (para(A,B,A,C) -> coll(A,B,C))) # label(ruleD66) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.11 68 (all A all B all C (cong(A,B,A,C) & coll(A,B,C) -> midp(A,B,C))) # label(ruleD67) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.11 69 (all A all B all C (midp(A,B,C) -> cong(A,B,A,C))) # label(ruleD68) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.11 70 (all A all B all C (midp(A,B,C) -> coll(A,B,C))) # label(ruleD69) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.11 71 (all A all B all C all D all M all N (midp(M,A,B) & midp(N,C,D) -> eqratio(M,A,A,B,N,C,C,D))) # label(ruleD70) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.11 72 (all A all B all C all D (eqangle(A,B,C,D,C,D,A,B) & -para(A,B,C,D) -> perp(A,B,C,D))) # label(ruleD71) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.11 73 (all A all B all C all D (eqangle(A,B,C,D,C,D,A,B) & -perp(A,B,C,D) -> para(A,B,C,D))) # label(ruleD72) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.11 74 (all A all B all C all D all P all Q all U all V (eqangle(A,B,C,D,P,Q,U,V) & para(P,Q,U,V) -> para(A,B,C,D))) # label(ruleD73) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.11 75 (all A all B all C all D all P all Q all U all V (eqangle(A,B,C,D,P,Q,U,V) & perp(P,Q,U,V) -> perp(A,B,C,D))) # label(ruleD74) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.11 76 (all A all B all C all D all P all Q all U all V (eqratio(A,B,C,D,P,Q,U,V) & cong(P,Q,U,V) -> cong(A,B,C,D))) # label(ruleD75) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.11 77 (all A all M all O all X exists B (perp(O,M,M,A) & eqangle(X,O,M,O,M,O,A,O) -> coll(B,A,M) & coll(B,O,X))) # label(ruleX1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.11 78 (all A all B all O all X exists M (cong(O,A,O,B) & eqangle(A,O,O,X,O,X,O,B) -> coll(B,A,M) & coll(M,O,X))) # label(ruleX2) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.11 79 (all A all B all O all X exists M (perp(O,X,A,B) & eqangle(A,O,O,X,O,X,O,B) -> coll(B,A,M) & coll(M,O,X))) # label(ruleX3) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.11 80 (all A all B all O all X exists M (perp(O,X,A,B) & cong(O,A,O,B) -> coll(B,A,M) & coll(M,O,X))) # label(ruleX4) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.11 81 (all A all B all P all X all Y exists Q (eqangle(A,P,B,P,A,X,B,Y) & -coll(A,B,P) -> eqangle(A,P,B,P,A,Q,B,Q) & cyclic(X,B,P,Q))) # label(ruleX5) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.11 82 (all A all B all C all D all M all N exists P (midp(M,A,B) & midp(N,C,D) -> midp(P,A,D) & para(P,M,B,D) & para(P,N,A,C))) # label(ruleX6) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.11 83 (all A all B all C all D all M all N all Q exists P (midp(M,A,B) & midp(N,C,D) & coll(C,A,B) & coll(D,A,B) -> midp(P,A,Q))) # label(ruleX7) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.11 84 (all A all B all M all P all Q all R all M exists X (midp(M,A,B) & para(A,P,R,M) & para(A,P,B,Q) & coll(P,Q,R) -> coll(X,A,Q) & coll(X,M,R))) # label(ruleX8) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.11 85 (all A all B all C all D all O exists P (cong(O,C,O,D) & perp(A,B,B,O) -> cong(O,C,O,P) & para(P,C,A,B) & cong(B,C,B,P))) # label(ruleX9) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.11 86 (all A all B all C all H exists P exists Q (perp(A,H,B,C) & perp(B,H,A,C) -> coll(P,C,B) & perp(A,P,C,B) & coll(Q,C,A) & perp(B,Q,C,A))) # label(ruleX10) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.11 87 (all A all B all C all O exists P (circle(O,A,B,C) -> perp(P,A,A,O))) # label(ruleX11) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.11 88 (all A all B all C all D all M all N exists P exists Q (circle(M,A,B,C) & cong(M,A,M,D) & cong(N,A,N,B) & M != N -> coll(P,A,C) & cong(P,N,N,A) & coll(Q,B,D) & cong(Q,N,N,A))) # label(ruleX12) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.11 89 (all A all B all C all D all M exists O (cyclic(A,B,C,D) & para(A,B,C,D) & midp(M,A,B) -> circle(O,A,B,C))) # label(ruleX13) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.11 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.45/1.11 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.45/1.11 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.45/1.11 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.45/1.11 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.45/1.11 95 -(all A all B all C all D all E all F (midp(D,B,A) & eqangle(E,D,D,A,E,D,D,C) & eqangle(F,D,D,B,F,D,D,C) -> para(E,F,A,B))) # label(exemplo6GDDFULLmoreE02314) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.45/1.11
% 0.45/1.11 ============================== end of process non-clausal formulas ===
% 0.45/1.11
% 0.45/1.11 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/1.11
% 0.45/1.11 ============================== PREDICATE ELIMINATION =================
% 0.45/1.11 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.45/1.11 97 -cong(A,B,A,C) | -cong(A,B,A,D) | circle(A,B,C,D) # label(ruleD12) # label(axiom). [clausify(12)].
% 0.45/1.11 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.45/1.11 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.45/1.11 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.45/1.11 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.45/1.11 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.45/1.11 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.45/1.11 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.45/1.11 101 -circle(A,B,C,D) | -coll(A,B,D) | perp(B,C,C,D) # label(ruleD53) # label(axiom). [clausify(54)].
% 0.45/1.11 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.45/1.11 102 -circle(A,B,C,D) | perp(f12(B,C,D,A),B,B,A) # label(ruleX11) # label(axiom). [clausify(87)].
% 0.45/1.11 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.45/1.11 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.45/1.11 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.45/1.11 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.45/1.11 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.45/1.11 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.45/1.11 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.45/1.11 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.45/1.11 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.45/1.11 107 -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | circle(f15(A,B,C,D,E),A,B,C) # label(ruleX13) # label(axiom). [clausify(89)].
% 1.00/1.30 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)].
% 1.00/1.30 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)].
% 1.00/1.30 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)].
% 1.00/1.30 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)].
% 1.00/1.30 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)].
% 1.00/1.30 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)].
% 1.00/1.30 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)].
% 1.00/1.30 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)].
% 1.00/1.30 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)].
% 1.00/1.30 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)].
% 1.00/1.30 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)].
% 1.00/1.30 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)].
% 1.00/1.30 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)].
% 1.00/1.30 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)].
% 1.00/1.30 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)].
% 1.00/1.30 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)].
% 1.00/1.30 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)].
% 1.00/1.30 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)].
% 1.00/1.30 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)].
% 1.00/1.30 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)].
% 1.00/1.30 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)].
% 1.00/1.30
% 1.00/1.30 ============================== end predicate elimination =============
% 1.00/1.30
% 1.00/1.30 Auto_denials: (non-Horn, no changes).
% 1.00/1.30
% 1.00/1.30 Term ordering decisions:
% 1.00/1.30 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. f19=1. f1=1. f2=1. f3=1. f4=1. f10=1. f11=1. f12=1. f16=1. f5=1. f9=1. f15=1. f17=1. f18=1. f6=1. f13=1. f14=1. f20=1. f7=1. f8=1.
% 1.00/1.30
% 1.00/1.30 ============================== end of process initial clauses ========
% 1.00/1.30
% 1.00/1.30 ============================== CLAUSES FOR SEARCH ====================
% 1.00/1.30
% 1.00/1.30 ============================== end of clauses for search =============
% 1.00/1.30
% 1.00/1.30 ============================== SEARCH ================================
% 1.00/1.30
% 1.00/1.30 % Starting search at 0.04 seconds.
% 1.00/1.30
% 1.00/1.30 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 24 (0.00 of 0.21 sec).
% 3.66/3.98
% 3.66/3.98 Low Water (keep): wt=40.000, iters=3341
% 3.66/3.98
% 3.66/3.98 Low Water (keep): wt=39.000, iters=3383
% 3.66/3.98
% 3.66/3.98 Low Water (keep): wt=29.000, iters=3353
% 3.66/3.98
% 3.66/3.98 Low Water (keep): wt=27.000, iters=3387
% 3.66/3.98
% 3.66/3.98 Low Water (keep): wt=24.000, iters=3341
% 3.66/3.98
% 3.66/3.98 Low Water (keep): wt=23.000, iters=3381
% 3.66/3.98
% 3.66/3.98 Low Water (keep): wt=22.000, iters=3344
% 3.66/3.98
% 3.66/3.98 Low Water (keep): wt=19.000, iters=3394
% 3.66/3.98
% 3.66/3.98 Low Water (keep): wt=18.000, iters=3405
% 3.66/3.98
% 3.66/3.98 Low Water (keep): wt=17.000, iters=3375
% 3.66/3.98
% 3.66/3.98 Low Water (keep): wt=16.000, iters=3429
% 3.66/3.98
% 3.66/3.98 Low Water (keep): wt=15.000, iters=3333
% 3.66/3.98
% 3.66/3.98 Low Water (keep): wt=14.000, iters=3346
% 3.66/3.98
% 3.66/3.98 Low Water (displace): id=6621, wt=53.000
% 3.66/3.98
% 3.66/3.98 Low Water (displace): id=6622, wt=52.000
% 3.66/3.98
% 3.66/3.98 Low Water (displace): id=6788, wt=48.000
% 3.66/3.98
% 3.66/3.98 Low Water (displace): id=13121, wt=11.000
% 3.66/3.98
% 3.66/3.98 Low Water (keep): wt=13.000, iters=3338
% 3.66/3.98
% 3.66/3.98 Low Water (displace): id=13148, wt=10.000
% 3.66/3.98
% 3.66/3.98 Low Water (displace): id=13180, wt=9.000
% 3.66/3.98
% 3.66/3.98 Low Water (displace): id=13403, wt=8.000
% 3.66/3.98
% 3.66/3.98 Low Water (displace): id=14511, wt=7.000
% 3.66/3.98
% 3.66/3.98 Low Water (keep): wt=11.000, iters=3333
% 3.66/3.98
% 3.66/3.98 Low Water (keep): wt=10.000, iters=3333
% 3.66/3.98
% 3.66/3.98 Low Water (displace): id=21897, wt=5.000
% 3.66/3.98
% 3.66/3.98 ============================== PROOF =================================
% 3.66/3.98 % SZS status Theorem
% 3.66/3.98 % SZS output start Refutation
% 3.66/3.98
% 3.66/3.98 % Proof 1 at 2.82 (+ 0.07) seconds.
% 3.66/3.98 % Length of proof is 208.
% 3.66/3.98 % Level of proof is 29.
% 3.66/3.98 % Maximum clause weight is 27.000.
% 3.66/3.98 % Given clauses 6044.
% 3.66/3.98
% 3.66/3.98 1 (all A all B all C (coll(A,B,C) -> coll(A,C,B))) # label(ruleD1) # label(axiom) # label(non_clause). [assumption].
% 3.66/3.98 2 (all A all B all C (coll(A,B,C) -> coll(B,A,C))) # label(ruleD2) # label(axiom) # label(non_clause). [assumption].
% 3.66/3.98 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].
% 3.66/3.98 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].
% 3.66/3.98 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].
% 3.66/3.98 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].
% 3.66/3.98 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].
% 3.66/3.98 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].
% 3.66/3.98 11 (all A all B all M (midp(M,B,A) -> midp(M,A,B))) # label(ruleD11) # label(axiom) # label(non_clause). [assumption].
% 3.66/3.98 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].
% 3.66/3.98 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].
% 3.66/3.98 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].
% 3.66/3.98 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].
% 3.66/3.98 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].
% 3.66/3.98 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].
% 3.66/3.98 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].
% 3.66/3.98 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].
% 3.66/3.98 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].
% 3.66/3.98 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].
% 3.66/3.98 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].
% 3.66/3.98 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].
% 3.66/3.98 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].
% 3.66/3.98 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].
% 3.66/3.98 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].
% 3.66/3.98 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].
% 3.66/3.98 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].
% 3.66/3.98 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].
% 3.66/3.98 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].
% 3.66/3.98 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].
% 3.66/3.98 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].
% 3.66/3.98 67 (all A all B all C (para(A,B,A,C) -> coll(A,B,C))) # label(ruleD66) # label(axiom) # label(non_clause). [assumption].
% 3.66/3.98 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].
% 3.66/3.98 69 (all A all B all C (midp(A,B,C) -> cong(A,B,A,C))) # label(ruleD68) # label(axiom) # label(non_clause). [assumption].
% 3.66/3.98 70 (all A all B all C (midp(A,B,C) -> coll(A,B,C))) # label(ruleD69) # label(axiom) # label(non_clause). [assumption].
% 3.66/3.98 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].
% 3.66/3.98 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].
% 3.66/3.98 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].
% 3.66/3.98 95 -(all A all B all C all D all E all F (midp(D,B,A) & eqangle(E,D,D,A,E,D,D,C) & eqangle(F,D,D,B,F,D,D,C) -> para(E,F,A,B))) # label(exemplo6GDDFULLmoreE02314) # label(negated_conjecture) # label(non_clause). [assumption].
% 3.66/3.98 97 -cong(A,B,A,C) | -cong(A,B,A,D) | circle(A,B,C,D) # label(ruleD12) # label(axiom). [clausify(12)].
% 3.66/3.98 101 -circle(A,B,C,D) | -coll(A,B,D) | perp(B,C,C,D) # label(ruleD53) # label(axiom). [clausify(54)].
% 3.66/3.98 109 -coll(A,B,C) | coll(A,C,B) # label(ruleD1) # label(axiom). [clausify(1)].
% 3.66/3.98 110 -coll(A,B,C) | coll(B,A,C) # label(ruleD2) # label(axiom). [clausify(2)].
% 3.66/3.98 111 -coll(A,B,C) | -coll(A,B,D) | coll(C,D,A) # label(ruleD3) # label(axiom). [clausify(3)].
% 3.66/3.98 112 -para(A,B,C,D) | para(A,B,D,C) # label(ruleD4) # label(axiom). [clausify(4)].
% 3.66/3.98 113 -para(A,B,C,D) | para(C,D,A,B) # label(ruleD5) # label(axiom). [clausify(5)].
% 3.66/3.98 116 -perp(A,B,C,D) | perp(C,D,A,B) # label(ruleD8) # label(axiom). [clausify(8)].
% 3.66/3.98 117 -perp(A,B,C,D) | -perp(C,D,E,F) | para(A,B,E,F) # label(ruleD9) # label(axiom). [clausify(9)].
% 3.66/3.98 118 -para(A,B,C,D) | -perp(C,D,E,F) | perp(A,B,E,F) # label(ruleD10) # label(axiom). [clausify(10)].
% 3.66/3.98 119 -midp(A,B,C) | midp(A,C,B) # label(ruleD11) # label(axiom). [clausify(11)].
% 3.66/3.98 120 -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)].
% 3.66/3.98 121 -cyclic(A,B,C,D) | cyclic(A,B,D,C) # label(ruleD14) # label(axiom). [clausify(14)].
% 3.66/3.98 122 -cyclic(A,B,C,D) | cyclic(A,C,B,D) # label(ruleD15) # label(axiom). [clausify(15)].
% 3.66/3.98 123 -cyclic(A,B,C,D) | cyclic(B,A,C,D) # label(ruleD16) # label(axiom). [clausify(16)].
% 3.66/3.98 124 -cyclic(A,B,C,D) | -cyclic(A,B,C,E) | cyclic(B,C,D,E) # label(ruleD17) # label(axiom). [clausify(17)].
% 3.66/3.98 125 -eqangle(A,B,C,D,E,F,V6,V7) | eqangle(B,A,C,D,E,F,V6,V7) # label(ruleD18) # label(axiom). [clausify(18)].
% 3.66/3.98 126 -eqangle(A,B,C,D,E,F,V6,V7) | eqangle(C,D,A,B,V6,V7,E,F) # label(ruleD19) # label(axiom). [clausify(19)].
% 3.66/3.98 127 -eqangle(A,B,C,D,E,F,V6,V7) | eqangle(E,F,V6,V7,A,B,C,D) # label(ruleD20) # label(axiom). [clausify(20)].
% 3.66/3.98 128 -eqangle(A,B,C,D,E,F,V6,V7) | eqangle(A,B,E,F,C,D,V6,V7) # label(ruleD21) # label(axiom). [clausify(21)].
% 3.66/3.98 130 -cong(A,B,C,D) | cong(A,B,D,C) # label(ruleD23) # label(axiom). [clausify(23)].
% 3.66/3.98 131 -cong(A,B,C,D) | cong(C,D,A,B) # label(ruleD24) # label(axiom). [clausify(24)].
% 3.66/3.98 132 -cong(A,B,C,D) | -cong(C,D,E,F) | cong(A,B,E,F) # label(ruleD25) # label(axiom). [clausify(25)].
% 3.66/3.98 146 -eqangle(A,B,C,D,E,F,C,D) | para(A,B,E,F) # label(ruleD39) # label(axiom). [clausify(39)].
% 3.66/3.98 153 -midp(A,B,C) | -para(A,D,C,E) | -coll(D,B,E) | midp(D,B,E) # label(ruleD45) # label(axiom). [clausify(46)].
% 3.66/3.98 158 -midp(A,B,C) | -perp(D,A,B,C) | cong(D,B,D,C) # label(ruleD55) # label(axiom). [clausify(56)].
% 3.66/3.98 159 -cong(A,B,C,B) | -cong(A,D,C,D) | perp(A,C,B,D) # label(ruleD56) # label(axiom). [clausify(57)].
% 3.66/3.98 160 -cong(A,B,C,B) | -cong(A,D,C,D) | -cyclic(A,C,B,D) | perp(B,A,A,D) # label(ruleD57) # label(axiom). [clausify(58)].
% 3.66/3.98 166 -midp(A,B,C) | -midp(A,D,E) | para(B,D,C,E) # label(ruleD63) # label(axiom). [clausify(64)].
% 3.66/3.98 167 -midp(A,B,C) | -para(B,D,C,E) | -para(B,E,C,D) | midp(A,D,E) # label(ruleD64) # label(axiom). [clausify(65)].
% 3.66/3.98 169 -para(A,B,A,C) | coll(A,B,C) # label(ruleD66) # label(axiom). [clausify(67)].
% 3.66/3.98 170 -cong(A,B,A,C) | -coll(A,B,C) | midp(A,B,C) # label(ruleD67) # label(axiom). [clausify(68)].
% 3.66/3.98 171 -midp(A,B,C) | cong(A,B,A,C) # label(ruleD68) # label(axiom). [clausify(69)].
% 3.66/3.98 172 -midp(A,B,C) | coll(A,B,C) # label(ruleD69) # label(axiom). [clausify(70)].
% 3.66/3.98 175 -eqangle(A,B,C,D,E,F,V6,V7) | -para(E,F,V6,V7) | para(A,B,C,D) # label(ruleD73) # label(axiom). [clausify(74)].
% 3.66/3.98 176 -eqangle(A,B,C,D,E,F,V6,V7) | -perp(E,F,V6,V7) | perp(A,B,C,D) # label(ruleD74) # label(axiom). [clausify(75)].
% 3.66/3.98 191 -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)].
% 3.66/3.98 208 midp(c4,c2,c1) # label(exemplo6GDDFULLmoreE02314) # label(negated_conjecture). [clausify(95)].
% 3.66/3.98 209 eqangle(c5,c4,c4,c1,c5,c4,c4,c3) # label(exemplo6GDDFULLmoreE02314) # label(negated_conjecture). [clausify(95)].
% 3.66/3.98 210 eqangle(c6,c4,c4,c2,c6,c4,c4,c3) # label(exemplo6GDDFULLmoreE02314) # label(negated_conjecture). [clausify(95)].
% 3.66/3.98 211 -para(c5,c6,c1,c2) # label(exemplo6GDDFULLmoreE02314) # label(negated_conjecture). [clausify(95)].
% 3.66/3.98 216 -coll(A,B,C) | perp(B,D,D,C) | -cong(A,B,A,D) | -cong(A,B,A,C). [resolve(101,a,97,c)].
% 3.66/3.98 250 -coll(A,B,C) | coll(C,C,A). [factor(111,a,b)].
% 3.66/3.98 252 -cong(A,B,A,C) | -cong(A,B,A,D) | cyclic(B,C,C,D). [factor(120,a,b)].
% 3.66/3.98 255 -cyclic(A,B,C,D) | cyclic(B,C,D,D). [factor(124,a,b)].
% 3.66/3.98 260 -cong(A,B,C,B) | perp(A,C,B,B). [factor(159,a,b)].
% 3.66/3.98 261 -cong(A,B,C,B) | -cyclic(A,C,B,B) | perp(B,A,A,B). [factor(160,a,b)].
% 3.66/3.98 263 -midp(A,B,C) | para(B,B,C,C). [factor(166,a,b)].
% 3.66/3.98 264 -midp(A,B,C) | -para(B,D,C,D) | midp(A,D,D). [factor(167,b,c)].
% 3.66/3.98 289 -coll(A,B,C) | perp(B,C,C,C) | -cong(A,B,A,C). [factor(216,c,d)].
% 3.66/3.98 304 -cong(A,B,A,C) | cyclic(B,C,C,C). [factor(252,a,b)].
% 3.66/3.98 314 -midp(A,B,C) | -coll(B,c2,c1) | -coll(C,c2,c1) | midp(f7(c2,c1,B,C,c4,A,D),c2,D). [resolve(208,a,191,a)].
% 3.66/3.98 323 coll(c4,c2,c1). [resolve(208,a,172,a)].
% 3.66/3.98 324 cong(c4,c2,c4,c1). [resolve(208,a,171,a)].
% 3.66/3.98 329 midp(c4,c1,c2). [resolve(208,a,119,a)].
% 3.66/3.98 336 eqangle(c5,c4,c5,c4,c4,c1,c4,c3). [resolve(209,a,128,a)].
% 3.66/3.98 338 eqangle(c4,c1,c5,c4,c4,c3,c5,c4). [resolve(209,a,126,a)].
% 3.66/3.98 345 eqangle(c6,c4,c6,c4,c4,c2,c4,c3). [resolve(210,a,128,a)].
% 3.66/3.98 347 eqangle(c4,c2,c6,c4,c4,c3,c6,c4). [resolve(210,a,126,a)].
% 3.66/3.98 356 coll(c1,c1,c4). [resolve(323,a,250,a)].
% 3.66/3.98 359 coll(c2,c4,c1). [resolve(323,a,110,a)].
% 3.66/3.98 360 coll(c4,c1,c2). [resolve(323,a,109,a)].
% 3.66/3.98 380 cong(c4,c1,c4,c2). [resolve(329,a,171,a)].
% 3.66/3.98 385 coll(c4,c4,c1). [resolve(356,a,250,a)].
% 3.66/3.98 388 coll(c1,c4,c1). [resolve(356,a,109,a)].
% 3.66/3.98 389 coll(c1,c1,c2). [resolve(359,a,250,a)].
% 3.66/3.98 392 coll(c2,c1,c4). [resolve(359,a,109,a)].
% 3.66/3.98 395 -coll(c1,c2,c1) | -coll(c2,c2,c1) | midp(f7(c2,c1,c1,c2,c4,c4,A),c2,A). [resolve(314,a,329,a)].
% 3.66/3.98 397 -coll(c4,c1,A) | coll(A,c2,c4). [resolve(360,a,111,b)].
% 3.66/3.98 400 -coll(c4,c4,A) | coll(A,c1,c4). [resolve(385,a,111,b)].
% 3.66/3.98 402 coll(c4,c1,c4). [resolve(385,a,109,a)].
% 3.66/3.98 406 coll(c4,c1,c1). [resolve(388,a,110,a)].
% 3.66/3.98 407 coll(c2,c2,c1). [resolve(389,a,250,a)].
% 3.66/3.98 410 coll(c1,c2,c1). [resolve(389,a,109,a)].
% 3.66/3.98 411 midp(f7(c2,c1,c1,c2,c4,c4,A),c2,A). [back_unit_del(395),unit_del(a,410),unit_del(b,407)].
% 3.66/3.98 414 coll(c4,c4,c2). [resolve(392,a,250,a)].
% 3.66/3.98 423 coll(c4,c4,c4). [resolve(402,a,250,a)].
% 3.66/3.98 426 coll(c1,c4,c4). [resolve(402,a,110,a)].
% 3.66/3.98 442 coll(c4,c2,c4). [resolve(414,a,109,a)].
% 3.66/3.98 460 coll(c2,c4,c4). [resolve(442,a,110,a)].
% 3.66/3.98 547 -cong(A,B,c4,c2) | cong(A,B,c4,c1). [resolve(324,a,132,b)].
% 3.66/3.98 549 cong(c4,c2,c1,c4). [resolve(324,a,130,a)].
% 3.66/3.98 654 perp(c1,c2,c2,c2). [resolve(380,a,289,c),unit_del(a,360)].
% 3.66/3.98 687 cong(c4,c1,c2,c4). [resolve(380,a,130,a)].
% 3.66/3.98 745 cong(c1,c4,c4,c2). [resolve(549,a,131,a)].
% 3.66/3.98 814 -perp(c2,c2,A,B) | para(c1,c2,A,B). [resolve(654,a,117,a)].
% 3.66/3.98 826 cong(c2,c4,c4,c1). [resolve(687,a,131,a)].
% 3.66/3.98 951 cong(c2,c4,c1,c4). [resolve(826,a,130,a)].
% 3.66/3.98 1061 perp(c2,c1,c4,c4). [resolve(951,a,260,a)].
% 3.66/3.98 1166 -midp(c1,c4,c4) | cong(c2,c4,c2,c4). [resolve(1061,a,158,b)].
% 3.66/3.98 1309 -para(c4,c1,c4,c3) | para(c5,c4,c5,c4). [resolve(336,a,175,a)].
% 3.66/3.98 1313 eqangle(c4,c1,c4,c3,c5,c4,c5,c4). [resolve(336,a,127,a)].
% 3.66/3.98 1314 eqangle(c5,c4,c5,c4,c4,c3,c4,c1). [resolve(336,a,126,a)].
% 3.66/3.98 1315 eqangle(c4,c5,c5,c4,c4,c1,c4,c3). [resolve(336,a,125,a)].
% 3.66/3.98 1327 para(c4,c1,c4,c3). [resolve(338,a,146,a)].
% 3.66/3.98 1331 para(c5,c4,c5,c4). [back_unit_del(1309),unit_del(a,1327)].
% 3.66/3.98 1340 coll(c4,c1,c3). [resolve(1327,a,169,a)].
% 3.66/3.98 1349 para(c4,c3,c4,c1). [resolve(1327,a,113,a)].
% 3.66/3.98 1354 coll(c3,c2,c4). [resolve(1340,a,397,a)].
% 3.66/3.98 1363 coll(c4,c4,c3). [resolve(1354,a,250,a)].
% 3.66/3.98 1393 coll(c3,c1,c4). [resolve(1363,a,400,a)].
% 3.66/3.98 1448 -para(c4,c2,c4,c3) | para(c6,c4,c6,c4). [resolve(345,a,175,a)].
% 3.66/3.98 1485 para(c4,c2,c4,c3). [resolve(347,a,146,a)].
% 3.66/3.98 1489 para(c6,c4,c6,c4). [back_unit_del(1448),unit_del(a,1485)].
% 3.66/3.98 1503 coll(c5,c4,c4). [resolve(1331,a,169,a)].
% 3.66/3.98 1507 para(c5,c4,c4,c5). [resolve(1331,a,112,a)].
% 3.66/3.98 1508 coll(c4,c4,c5). [resolve(1503,a,250,a)].
% 3.66/3.98 1511 coll(c4,c5,c4). [resolve(1503,a,110,a)].
% 3.66/3.98 1522 coll(c5,c5,c4). [resolve(1508,a,250,a)].
% 3.66/3.98 1523 -coll(c4,c4,A) | coll(A,c5,c4). [resolve(1508,a,111,b)].
% 3.66/3.98 1782 para(c4,c3,c1,c4). [resolve(1349,a,112,a)].
% 3.66/3.98 1813 -perp(c4,c3,A,B) | perp(c4,c2,A,B). [resolve(1485,a,118,a)].
% 3.66/3.98 1829 coll(c6,c4,c4). [resolve(1489,a,169,a)].
% 3.66/3.98 1833 para(c6,c4,c4,c6). [resolve(1489,a,112,a)].
% 3.66/3.98 1836 coll(c4,c4,c6). [resolve(1829,a,250,a)].
% 3.66/3.98 1980 para(c4,c5,c5,c4). [resolve(1507,a,113,a)].
% 3.66/3.98 1992 -midp(c4,A,c1) | -coll(c3,A,c4) | midp(c3,A,c4). [resolve(1782,a,153,b)].
% 3.74/3.98 1994 -perp(c1,c4,A,B) | perp(c4,c3,A,B). [resolve(1782,a,118,a)].
% 3.74/3.98 2064 para(c4,c6,c6,c4). [resolve(1833,a,113,a)].
% 3.74/3.98 2076 -midp(c4,A,c5) | -coll(c5,A,c4) | midp(c5,A,c4). [resolve(1980,a,153,b)].
% 3.74/3.98 2080 para(c4,c5,c4,c5). [resolve(1980,a,112,a)].
% 3.74/3.98 2166 para(c4,c6,c4,c6). [resolve(2064,a,112,a)].
% 3.74/3.98 2169 -midp(A,c4,c4) | midp(A,c5,c5). [resolve(2080,a,264,b)].
% 3.74/3.98 2239 -midp(c4,A,c4) | -coll(c6,A,c6) | midp(c6,A,c6). [resolve(2166,a,153,b)].
% 3.74/3.98 2288 para(c2,c2,A,A). [resolve(411,a,263,a)].
% 3.74/3.98 2328 -perp(A,A,B,C) | perp(c2,c2,B,C). [resolve(2288,a,118,a)].
% 3.74/3.98 2942 coll(c6,c5,c4). [resolve(1523,a,1836,a)].
% 3.74/3.98 2945 coll(c5,c6,c4). [resolve(2942,a,110,a)].
% 3.74/3.98 2949 coll(c5,c4,c6). [resolve(2945,a,109,a)].
% 3.74/3.98 2954 coll(c6,c6,c5). [resolve(2949,a,250,a)].
% 3.74/3.98 2965 coll(c6,c5,c6). [resolve(2954,a,109,a)].
% 3.74/3.98 3055 cong(c1,c4,c4,c1). [resolve(547,a,745,a)].
% 3.74/3.98 3056 cong(c4,c1,c4,c1). [resolve(547,a,380,a)].
% 3.74/3.98 3059 cong(c1,c4,c1,c4). [resolve(3055,a,130,a)].
% 3.74/3.98 3138 midp(c4,c1,c1). [resolve(3056,a,170,a),unit_del(a,406)].
% 3.74/3.98 3394 midp(c1,c4,c4). [resolve(3059,a,170,a),unit_del(a,426)].
% 3.74/3.98 3403 cong(c2,c4,c2,c4). [back_unit_del(1166),unit_del(a,3394)].
% 3.74/3.98 4108 midp(c2,c4,c4). [resolve(3403,a,170,a),unit_del(a,460)].
% 3.74/3.98 16210 -perp(c5,c4,c5,c4) | perp(c4,c1,c4,c3). [resolve(1313,a,176,a)].
% 3.74/3.98 16223 -perp(c4,c3,c4,c1) | perp(c5,c4,c5,c4). [resolve(1314,a,176,a)].
% 3.74/3.98 16227 -perp(c4,c1,c4,c3) | perp(c4,c5,c5,c4). [resolve(1315,a,176,a)].
% 3.74/3.98 17418 midp(c3,c1,c4). [resolve(1992,a,3138,a),unit_del(a,1393)].
% 3.74/3.98 17430 cong(c3,c1,c3,c4). [resolve(17418,a,171,a)].
% 3.74/3.98 17484 cyclic(c1,c4,c4,c4). [resolve(17430,a,304,a)].
% 3.74/3.98 17486 perp(c1,c4,c4,c4). [resolve(17430,a,289,c),unit_del(a,1393)].
% 3.74/3.98 17544 cyclic(c4,c1,c4,c4). [resolve(17484,a,123,a)].
% 3.74/3.98 17545 perp(c4,c3,c4,c4). [resolve(17486,a,1994,a)].
% 3.74/3.98 17604 cyclic(c4,c4,c1,c4). [resolve(17544,a,122,a)].
% 3.74/3.98 17605 perp(c4,c2,c4,c4). [resolve(17545,a,1813,a)].
% 3.74/3.98 17699 cyclic(c4,c4,c4,c1). [resolve(17604,a,121,a)].
% 3.74/3.98 17704 cong(c4,c4,c4,c4). [resolve(17605,a,158,b),unit_del(a,4108)].
% 3.74/3.98 17803 cyclic(c4,c4,c1,c1). [resolve(17699,a,255,a)].
% 3.74/3.98 17816 midp(c4,c4,c4). [resolve(17704,a,170,a),unit_del(a,423)].
% 3.74/3.98 18240 perp(c1,c4,c4,c1). [resolve(17803,a,261,b),unit_del(a,3056)].
% 3.74/3.98 18737 perp(c4,c3,c4,c1). [resolve(18240,a,1994,a)].
% 3.74/3.98 18747 perp(c5,c4,c5,c4). [back_unit_del(16223),unit_del(a,18737)].
% 3.74/3.98 18748 perp(c4,c1,c4,c3). [back_unit_del(16210),unit_del(a,18747)].
% 3.74/3.98 18749 perp(c4,c5,c5,c4). [back_unit_del(16227),unit_del(a,18748)].
% 3.74/3.98 19175 -midp(c5,c5,c4) | cong(c4,c5,c4,c4). [resolve(18749,a,158,b)].
% 3.74/3.98 20799 midp(c4,c5,c5). [resolve(2169,a,17816,a)].
% 3.74/3.98 20819 midp(c5,c5,c4). [resolve(20799,a,2076,a),unit_del(a,1522)].
% 3.74/3.98 20840 cong(c4,c5,c4,c4). [back_unit_del(19175),unit_del(a,20819)].
% 3.74/3.98 20981 midp(c4,c5,c4). [resolve(20840,a,170,a),unit_del(a,1511)].
% 3.74/3.98 21992 midp(c6,c5,c6). [resolve(2239,a,20981,a),unit_del(a,2965)].
% 3.74/3.98 22002 cong(c6,c5,c6,c6). [resolve(21992,a,171,a)].
% 3.74/3.98 22367 perp(c5,c6,c6,c6). [resolve(22002,a,289,c),unit_del(a,2965)].
% 3.74/3.98 22589 perp(c6,c6,c5,c6). [resolve(22367,a,116,a)].
% 3.74/3.98 23127 perp(c2,c2,c5,c6). [resolve(22589,a,2328,a)].
% 3.74/3.98 24164 para(c1,c2,c5,c6). [resolve(23127,a,814,a)].
% 3.74/3.98 24444 $F. [resolve(24164,a,113,a),unit_del(a,211)].
% 3.74/3.98
% 3.74/3.98 % SZS output end Refutation
% 3.74/3.98 ============================== end of proof ==========================
% 3.74/3.98
% 3.74/3.98 ============================== STATISTICS ============================
% 3.74/3.98
% 3.74/3.98 Given=6044. Generated=104569. Kept=24327. proofs=1.
% 3.74/3.98 Usable=5375. Sos=8384. Demods=0. Limbo=1, Disabled=10714. Hints=0.
% 3.74/3.98 Megabytes=14.02.
% 3.74/3.98 User_CPU=2.82, System_CPU=0.07, Wall_clock=3.
% 3.74/3.98
% 3.74/3.98 ============================== end of statistics =====================
% 3.74/3.98
% 3.74/3.98 ============================== end of search =========================
% 3.74/3.98
% 3.74/3.98 THEOREM PROVED
% 3.74/3.98 % SZS status Theorem
% 3.74/3.98
% 3.74/3.98 Exiting with 1 proof.
% 3.74/3.98
% 3.74/3.98 Process 14126 exit (max_proofs) Sat Jun 18 00:17:36 2022
% 3.74/3.98 Prover9 interrupted
%------------------------------------------------------------------------------