TSTP Solution File: GEO590+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GEO590+1 : TPTP v8.1.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n013.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:06 EDT 2022
% Result : Theorem 6.78s 7.08s
% Output : Refutation 6.81s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO590+1 : TPTP v8.1.0. Released v7.5.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n013.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 : Fri Jun 17 16:48:59 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.78/1.11 ============================== Prover9 ===============================
% 0.78/1.11 Prover9 (32) version 2009-11A, November 2009.
% 0.78/1.11 Process 25472 was started by sandbox on n013.cluster.edu,
% 0.78/1.11 Fri Jun 17 16:48:59 2022
% 0.78/1.11 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_25319_n013.cluster.edu".
% 0.78/1.11 ============================== end of head ===========================
% 0.78/1.11
% 0.78/1.11 ============================== INPUT =================================
% 0.78/1.11
% 0.78/1.11 % Reading from file /tmp/Prover9_25319_n013.cluster.edu
% 0.78/1.11
% 0.78/1.11 set(prolog_style_variables).
% 0.78/1.11 set(auto2).
% 0.78/1.11 % set(auto2) -> set(auto).
% 0.78/1.11 % set(auto) -> set(auto_inference).
% 0.78/1.11 % set(auto) -> set(auto_setup).
% 0.78/1.11 % set(auto_setup) -> set(predicate_elim).
% 0.78/1.11 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.78/1.11 % set(auto) -> set(auto_limits).
% 0.78/1.11 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.78/1.11 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.78/1.11 % set(auto) -> set(auto_denials).
% 0.78/1.11 % set(auto) -> set(auto_process).
% 0.78/1.11 % set(auto2) -> assign(new_constants, 1).
% 0.78/1.11 % set(auto2) -> assign(fold_denial_max, 3).
% 0.78/1.11 % set(auto2) -> assign(max_weight, "200.000").
% 0.78/1.11 % set(auto2) -> assign(max_hours, 1).
% 0.78/1.11 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.78/1.11 % set(auto2) -> assign(max_seconds, 0).
% 0.78/1.11 % set(auto2) -> assign(max_minutes, 5).
% 0.78/1.11 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.78/1.11 % set(auto2) -> set(sort_initial_sos).
% 0.78/1.11 % set(auto2) -> assign(sos_limit, -1).
% 0.78/1.11 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.78/1.11 % set(auto2) -> assign(max_megs, 400).
% 0.78/1.11 % set(auto2) -> assign(stats, some).
% 0.78/1.11 % set(auto2) -> clear(echo_input).
% 0.78/1.11 % set(auto2) -> set(quiet).
% 0.78/1.11 % set(auto2) -> clear(print_initial_clauses).
% 0.78/1.11 % set(auto2) -> clear(print_given).
% 0.78/1.11 assign(lrs_ticks,-1).
% 0.78/1.11 assign(sos_limit,10000).
% 0.78/1.11 assign(order,kbo).
% 0.78/1.11 set(lex_order_vars).
% 0.78/1.11 clear(print_given).
% 0.78/1.11
% 0.78/1.11 % formulas(sos). % not echoed (95 formulas)
% 0.78/1.11
% 0.78/1.11 ============================== end of input ==========================
% 0.78/1.11
% 0.78/1.11 % From the command line: assign(max_seconds, 300).
% 0.78/1.11
% 0.78/1.11 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.78/1.11
% 0.78/1.11 % Formulas that are not ordinary clauses:
% 0.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/1.12 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.78/1.12 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.78/1.12 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.78/1.12 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.78/1.12 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.78/1.12 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.78/1.12 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.78/1.12 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.78/1.12 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.78/1.12 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.78/1.12 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.78/1.12 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.78/1.12 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.78/1.12 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.78/1.12 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.78/1.12 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.78/1.12 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.78/1.12 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.78/1.12 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.78/1.12 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.78/1.12 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.78/1.12 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.78/1.12 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.78/1.12 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.78/1.12 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.78/1.12 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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/1.12 95 -(all C all D all E all O all A all F (perp(E,C,E,D) & midp(O,D,C) & perp(C,D,C,A) & perp(E,O,E,A) & coll(F,C,A) & coll(F,D,E) -> cong(A,E,A,F))) # label(exemplo6GDDFULL416052) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.78/1.12
% 0.78/1.12 ============================== end of process non-clausal formulas ===
% 0.78/1.12
% 0.78/1.12 ============================== PROCESS INITIAL CLAUSES ===============
% 0.78/1.12
% 0.78/1.12 ============================== PREDICATE ELIMINATION =================
% 0.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/1.12 101 -circle(A,B,C,D) | -coll(A,B,D) | perp(B,C,C,D) # label(ruleD53) # label(axiom). [clausify(54)].
% 0.78/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.78/1.12 102 -circle(A,B,C,D) | perp(f12(B,C,D,A),B,B,A) # label(ruleX11) # label(axiom). [clausify(87)].
% 0.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.78/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.84/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)].
% 0.84/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)].
% 0.84/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)].
% 0.84/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)].
% 0.84/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)].
% 0.84/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)].
% 0.84/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)].
% 0.84/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)].
% 0.84/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)].
% 0.84/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)].
% 0.84/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)].
% 0.84/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)].
% 0.84/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)].
% 0.84/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)].
% 0.84/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)].
% 0.84/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)].
% 0.84/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)].
% 0.84/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)].
% 0.84/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)].
% 0.84/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)].
% 0.84/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)].
% 0.84/1.30
% 0.84/1.30 ============================== end predicate elimination =============
% 0.84/1.30
% 0.84/1.30 Auto_denials: (non-Horn, no changes).
% 0.84/1.30
% 0.84/1.30 Term ordering decisions:
% 0.84/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.
% 0.84/1.30
% 0.84/1.30 ============================== end of process initial clauses ========
% 0.84/1.30
% 0.84/1.30 ============================== CLAUSES FOR SEARCH ====================
% 0.84/1.30
% 0.84/1.30 ============================== end of clauses for search =============
% 0.84/1.30
% 0.84/1.30 ============================== SEARCH ================================
% 0.84/1.30
% 0.84/1.30 % Starting search at 0.04 seconds.
% 0.84/1.30
% 0.84/1.30 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 1257 (0.00 of 0.20 sec).
% 6.78/7.08
% 6.78/7.08 Low Water (keep): wt=29.000, iters=3413
% 6.78/7.08
% 6.78/7.08 Low Water (keep): wt=28.000, iters=3370
% 6.78/7.08
% 6.78/7.08 Low Water (keep): wt=24.000, iters=3334
% 6.78/7.08
% 6.78/7.08 Low Water (keep): wt=23.000, iters=3341
% 6.78/7.08
% 6.78/7.08 Low Water (keep): wt=22.000, iters=3484
% 6.78/7.08
% 6.78/7.08 Low Water (keep): wt=19.000, iters=3404
% 6.78/7.08
% 6.78/7.08 Low Water (keep): wt=18.000, iters=3333
% 6.78/7.08
% 6.78/7.08 Low Water (keep): wt=17.000, iters=3468
% 6.78/7.08
% 6.78/7.08 Low Water (keep): wt=15.000, iters=3344
% 6.78/7.08
% 6.78/7.08 Low Water (keep): wt=14.000, iters=3340
% 6.78/7.08
% 6.78/7.08 Low Water (keep): wt=13.000, iters=3337
% 6.78/7.08
% 6.78/7.08 Low Water (displace): id=6422, wt=48.000
% 6.78/7.08
% 6.78/7.08 Low Water (displace): id=12740, wt=11.000
% 6.78/7.08
% 6.78/7.08 Low Water (displace): id=12755, wt=10.000
% 6.78/7.08
% 6.78/7.08 Low Water (displace): id=12898, wt=7.000
% 6.78/7.08
% 6.78/7.08 Low Water (keep): wt=12.000, iters=3363
% 6.78/7.08
% 6.78/7.08 Low Water (keep): wt=11.000, iters=3335
% 6.78/7.08
% 6.78/7.08 Low Water (keep): wt=10.000, iters=3333
% 6.78/7.08
% 6.78/7.08 Low Water (displace): id=22382, wt=5.000
% 6.78/7.08
% 6.78/7.08 Low Water (keep): wt=9.000, iters=3335
% 6.78/7.08
% 6.78/7.08 ============================== PROOF =================================
% 6.78/7.08 % SZS status Theorem
% 6.78/7.08 % SZS output start Refutation
% 6.78/7.08
% 6.78/7.08 % Proof 1 at 5.88 (+ 0.10) seconds.
% 6.78/7.08 % Length of proof is 185.
% 6.78/7.08 % Level of proof is 28.
% 6.78/7.08 % Maximum clause weight is 27.000.
% 6.78/7.08 % Given clauses 10467.
% 6.78/7.08
% 6.78/7.08 1 (all A all B all C (coll(A,B,C) -> coll(A,C,B))) # label(ruleD1) # label(axiom) # label(non_clause). [assumption].
% 6.78/7.08 2 (all A all B all C (coll(A,B,C) -> coll(B,A,C))) # label(ruleD2) # label(axiom) # label(non_clause). [assumption].
% 6.78/7.08 3 (all A all B all C all D (coll(A,B,C) & coll(A,B,D) -> coll(C,D,A))) # label(ruleD3) # label(axiom) # label(non_clause). [assumption].
% 6.78/7.08 4 (all A all B all C all D (para(A,B,C,D) -> para(A,B,D,C))) # label(ruleD4) # label(axiom) # label(non_clause). [assumption].
% 6.78/7.08 5 (all A all B all C all D (para(A,B,C,D) -> para(C,D,A,B))) # label(ruleD5) # label(axiom) # label(non_clause). [assumption].
% 6.78/7.08 6 (all A all B all C all D all E all F (para(A,B,C,D) & para(C,D,E,F) -> para(A,B,E,F))) # label(ruleD6) # label(axiom) # label(non_clause). [assumption].
% 6.78/7.08 7 (all A all B all C all D (perp(A,B,C,D) -> perp(A,B,D,C))) # label(ruleD7) # label(axiom) # label(non_clause). [assumption].
% 6.78/7.08 8 (all A all B all C all D (perp(A,B,C,D) -> perp(C,D,A,B))) # label(ruleD8) # label(axiom) # label(non_clause). [assumption].
% 6.78/7.08 9 (all A all B all C all D all E all F (perp(A,B,C,D) & perp(C,D,E,F) -> para(A,B,E,F))) # label(ruleD9) # label(axiom) # label(non_clause). [assumption].
% 6.78/7.08 11 (all A all B all M (midp(M,B,A) -> midp(M,A,B))) # label(ruleD11) # label(axiom) # label(non_clause). [assumption].
% 6.78/7.08 12 (all A all B all C all O (cong(O,A,O,B) & cong(O,A,O,C) -> circle(O,A,B,C))) # label(ruleD12) # label(axiom) # label(non_clause). [assumption].
% 6.78/7.08 23 (all A all B all C all D (cong(A,B,C,D) -> cong(A,B,D,C))) # label(ruleD23) # label(axiom) # label(non_clause). [assumption].
% 6.78/7.08 24 (all A all B all C all D (cong(A,B,C,D) -> cong(C,D,A,B))) # label(ruleD24) # label(axiom) # label(non_clause). [assumption].
% 6.78/7.08 25 (all A all B all C all D all E all F (cong(A,B,C,D) & cong(C,D,E,F) -> cong(A,B,E,F))) # label(ruleD25) # label(axiom) # label(non_clause). [assumption].
% 6.78/7.08 46 (all A all B all C all E all F (midp(E,A,B) & para(E,F,B,C) & coll(F,A,C) -> midp(F,A,C))) # label(ruleD45) # label(axiom) # label(non_clause). [assumption].
% 6.78/7.08 54 (all A all B all C all O (circle(O,A,B,C) & coll(O,A,C) -> perp(A,B,B,C))) # label(ruleD53) # label(axiom) # label(non_clause). [assumption].
% 6.78/7.08 56 (all A all B all M all O (midp(M,A,B) & perp(O,M,A,B) -> cong(O,A,O,B))) # label(ruleD55) # label(axiom) # label(non_clause). [assumption].
% 6.78/7.08 57 (all A all B all P all Q (cong(A,P,B,P) & cong(A,Q,B,Q) -> perp(A,B,P,Q))) # label(ruleD56) # label(axiom) # label(non_clause). [assumption].
% 6.78/7.08 64 (all A all B all C all D all M (midp(M,A,B) & midp(M,C,D) -> para(A,C,B,D))) # label(ruleD63) # label(axiom) # label(non_clause). [assumption].
% 6.78/7.08 65 (all A all B all C all D all M (midp(M,A,B) & para(A,C,B,D) & para(A,D,B,C) -> midp(M,C,D))) # label(ruleD64) # label(axiom) # label(non_clause). [assumption].
% 6.78/7.08 67 (all A all B all C (para(A,B,A,C) -> coll(A,B,C))) # label(ruleD66) # label(axiom) # label(non_clause). [assumption].
% 6.78/7.08 68 (all A all B all C (cong(A,B,A,C) & coll(A,B,C) -> midp(A,B,C))) # label(ruleD67) # label(axiom) # label(non_clause). [assumption].
% 6.78/7.08 69 (all A all B all C (midp(A,B,C) -> cong(A,B,A,C))) # label(ruleD68) # label(axiom) # label(non_clause). [assumption].
% 6.78/7.08 70 (all A all B all C (midp(A,B,C) -> coll(A,B,C))) # label(ruleD69) # label(axiom) # label(non_clause). [assumption].
% 6.78/7.08 83 (all A all B all C all D all M all N all Q exists P (midp(M,A,B) & midp(N,C,D) & coll(C,A,B) & coll(D,A,B) -> midp(P,A,Q))) # label(ruleX7) # label(axiom) # label(non_clause). [assumption].
% 6.78/7.08 95 -(all C all D all E all O all A all F (perp(E,C,E,D) & midp(O,D,C) & perp(C,D,C,A) & perp(E,O,E,A) & coll(F,C,A) & coll(F,D,E) -> cong(A,E,A,F))) # label(exemplo6GDDFULL416052) # label(negated_conjecture) # label(non_clause). [assumption].
% 6.78/7.08 97 -cong(A,B,A,C) | -cong(A,B,A,D) | circle(A,B,C,D) # label(ruleD12) # label(axiom). [clausify(12)].
% 6.78/7.08 101 -circle(A,B,C,D) | -coll(A,B,D) | perp(B,C,C,D) # label(ruleD53) # label(axiom). [clausify(54)].
% 6.78/7.08 109 -coll(A,B,C) | coll(A,C,B) # label(ruleD1) # label(axiom). [clausify(1)].
% 6.78/7.08 110 -coll(A,B,C) | coll(B,A,C) # label(ruleD2) # label(axiom). [clausify(2)].
% 6.78/7.08 111 -coll(A,B,C) | -coll(A,B,D) | coll(C,D,A) # label(ruleD3) # label(axiom). [clausify(3)].
% 6.78/7.08 112 -para(A,B,C,D) | para(A,B,D,C) # label(ruleD4) # label(axiom). [clausify(4)].
% 6.78/7.08 113 -para(A,B,C,D) | para(C,D,A,B) # label(ruleD5) # label(axiom). [clausify(5)].
% 6.78/7.08 114 -para(A,B,C,D) | -para(C,D,E,F) | para(A,B,E,F) # label(ruleD6) # label(axiom). [clausify(6)].
% 6.78/7.08 115 -perp(A,B,C,D) | perp(A,B,D,C) # label(ruleD7) # label(axiom). [clausify(7)].
% 6.78/7.08 116 -perp(A,B,C,D) | perp(C,D,A,B) # label(ruleD8) # label(axiom). [clausify(8)].
% 6.78/7.08 117 -perp(A,B,C,D) | -perp(C,D,E,F) | para(A,B,E,F) # label(ruleD9) # label(axiom). [clausify(9)].
% 6.78/7.08 119 -midp(A,B,C) | midp(A,C,B) # label(ruleD11) # label(axiom). [clausify(11)].
% 6.78/7.08 130 -cong(A,B,C,D) | cong(A,B,D,C) # label(ruleD23) # label(axiom). [clausify(23)].
% 6.78/7.08 131 -cong(A,B,C,D) | cong(C,D,A,B) # label(ruleD24) # label(axiom). [clausify(24)].
% 6.78/7.08 132 -cong(A,B,C,D) | -cong(C,D,E,F) | cong(A,B,E,F) # label(ruleD25) # label(axiom). [clausify(25)].
% 6.78/7.08 153 -midp(A,B,C) | -para(A,D,C,E) | -coll(D,B,E) | midp(D,B,E) # label(ruleD45) # label(axiom). [clausify(46)].
% 6.78/7.08 158 -midp(A,B,C) | -perp(D,A,B,C) | cong(D,B,D,C) # label(ruleD55) # label(axiom). [clausify(56)].
% 6.78/7.08 159 -cong(A,B,C,B) | -cong(A,D,C,D) | perp(A,C,B,D) # label(ruleD56) # label(axiom). [clausify(57)].
% 6.78/7.08 166 -midp(A,B,C) | -midp(A,D,E) | para(B,D,C,E) # label(ruleD63) # label(axiom). [clausify(64)].
% 6.78/7.08 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)].
% 6.78/7.08 169 -para(A,B,A,C) | coll(A,B,C) # label(ruleD66) # label(axiom). [clausify(67)].
% 6.78/7.08 170 -cong(A,B,A,C) | -coll(A,B,C) | midp(A,B,C) # label(ruleD67) # label(axiom). [clausify(68)].
% 6.78/7.08 171 -midp(A,B,C) | cong(A,B,A,C) # label(ruleD68) # label(axiom). [clausify(69)].
% 6.78/7.08 172 -midp(A,B,C) | coll(A,B,C) # label(ruleD69) # label(axiom). [clausify(70)].
% 6.78/7.08 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)].
% 6.78/7.08 208 perp(c3,c1,c3,c2) # label(exemplo6GDDFULL416052) # label(negated_conjecture). [clausify(95)].
% 6.78/7.08 209 midp(c4,c2,c1) # label(exemplo6GDDFULL416052) # label(negated_conjecture). [clausify(95)].
% 6.78/7.08 210 perp(c1,c2,c1,c5) # label(exemplo6GDDFULL416052) # label(negated_conjecture). [clausify(95)].
% 6.78/7.08 211 perp(c3,c4,c3,c5) # label(exemplo6GDDFULL416052) # label(negated_conjecture). [clausify(95)].
% 6.78/7.08 212 coll(c6,c1,c5) # label(exemplo6GDDFULL416052) # label(negated_conjecture). [clausify(95)].
% 6.78/7.08 213 coll(c6,c2,c3) # label(exemplo6GDDFULL416052) # label(negated_conjecture). [clausify(95)].
% 6.78/7.08 214 -cong(c5,c3,c5,c6) # label(exemplo6GDDFULL416052) # label(negated_conjecture). [clausify(95)].
% 6.78/7.08 219 -coll(A,B,C) | perp(B,D,D,C) | -cong(A,B,A,D) | -cong(A,B,A,C). [resolve(101,a,97,c)].
% 6.78/7.08 253 -coll(A,B,C) | coll(C,C,A). [factor(111,a,b)].
% 6.78/7.08 267 -midp(A,B,C) | -para(B,D,C,D) | midp(A,D,D). [factor(167,b,c)].
% 6.78/7.08 273 -midp(A,B,C) | -coll(B,B,C) | -coll(C,B,C) | midp(f7(B,C,B,C,A,A,D),B,D). [factor(191,a,b)].
% 6.78/7.08 292 -coll(A,B,C) | perp(B,C,C,C) | -cong(A,B,A,C). [factor(219,c,d)].
% 6.78/7.08 325 -perp(A,B,c3,c1) | para(A,B,c3,c2). [resolve(208,a,117,b)].
% 6.78/7.08 326 -perp(c3,c2,A,B) | para(c3,c1,A,B). [resolve(208,a,117,a)].
% 6.78/7.08 327 perp(c3,c2,c3,c1). [resolve(208,a,116,a)].
% 6.78/7.08 339 coll(c4,c2,c1). [resolve(209,a,172,a)].
% 6.78/7.08 340 cong(c4,c2,c4,c1). [resolve(209,a,171,a)].
% 6.78/7.08 341 -midp(c4,A,B) | para(A,c2,B,c1). [resolve(209,a,166,b)].
% 6.78/7.08 345 midp(c4,c1,c2). [resolve(209,a,119,a)].
% 6.78/7.08 356 -perp(A,B,c1,c2) | para(A,B,c1,c5). [resolve(210,a,117,b)].
% 6.78/7.08 370 -perp(c3,c5,A,B) | para(c3,c4,A,B). [resolve(211,a,117,a)].
% 6.78/7.08 371 perp(c3,c5,c3,c4). [resolve(211,a,116,a)].
% 6.78/7.08 375 coll(c1,c6,c5). [resolve(212,a,110,a)].
% 6.78/7.08 379 coll(c2,c6,c3). [resolve(213,a,110,a)].
% 6.78/7.08 380 coll(c6,c3,c2). [resolve(213,a,109,a)].
% 6.78/7.08 381 coll(c3,c3,c6). [resolve(253,a,213,a)].
% 6.78/7.08 389 -coll(c2,c2,c1) | -coll(c1,c2,c1) | midp(f7(c2,c1,c2,c1,c4,c4,A),c2,A). [resolve(273,a,209,a)].
% 6.78/7.08 390 coll(c1,c1,c4). [resolve(339,a,253,a)].
% 6.78/7.08 392 -coll(c4,c2,A) | coll(c1,A,c4). [resolve(339,a,111,a)].
% 6.78/7.08 393 coll(c2,c4,c1). [resolve(339,a,110,a)].
% 6.78/7.08 413 cong(c4,c1,c4,c2). [resolve(345,a,171,a)].
% 6.78/7.08 418 coll(c5,c5,c1). [resolve(375,a,253,a)].
% 6.78/7.08 419 -coll(c1,c6,A) | coll(A,c5,c1). [resolve(375,a,111,b)].
% 6.78/7.08 426 coll(c3,c3,c2). [resolve(379,a,253,a)].
% 6.78/7.08 431 -coll(c6,c3,A) | coll(A,c2,c6). [resolve(380,a,111,b)].
% 6.78/7.08 435 -coll(c3,c3,A) | coll(A,c6,c3). [resolve(381,a,111,b)].
% 6.78/7.08 457 coll(c4,c4,c1). [resolve(390,a,253,a)].
% 6.78/7.08 460 coll(c1,c4,c1). [resolve(390,a,109,a)].
% 6.78/7.08 461 coll(c1,c1,c2). [resolve(393,a,253,a)].
% 6.78/7.08 470 coll(c1,c1,c5). [resolve(418,a,253,a)].
% 6.78/7.08 488 coll(c2,c2,c3). [resolve(426,a,253,a)].
% 6.78/7.08 537 coll(c4,c1,c4). [resolve(457,a,109,a)].
% 6.78/7.08 541 coll(c4,c1,c1). [resolve(460,a,110,a)].
% 6.78/7.08 542 coll(c2,c2,c1). [resolve(461,a,253,a)].
% 6.78/7.08 545 coll(c1,c2,c1). [resolve(461,a,109,a)].
% 6.78/7.08 546 midp(f7(c2,c1,c2,c1,c4,c4,A),c2,A). [back_unit_del(389),unit_del(a,542),unit_del(b,545)].
% 6.78/7.08 558 coll(c1,c5,c1). [resolve(470,a,109,a)].
% 6.78/7.08 572 coll(c2,c3,c2). [resolve(488,a,109,a)].
% 6.78/7.08 596 para(c3,c1,c3,c1). [resolve(327,a,326,a)].
% 6.78/7.08 597 para(c3,c2,c3,c2). [resolve(327,a,325,a)].
% 6.78/7.08 615 coll(c1,c4,c4). [resolve(537,a,110,a)].
% 6.78/7.08 651 coll(c5,c1,c1). [resolve(558,a,110,a)].
% 6.78/7.08 752 perp(c2,c1,c1,c1). [resolve(340,a,292,c),unit_del(a,339)].
% 6.78/7.08 783 -cong(A,B,c4,c2) | cong(A,B,c4,c1). [resolve(340,a,132,b)].
% 6.78/7.08 785 cong(c4,c2,c1,c4). [resolve(340,a,130,a)].
% 6.78/7.08 827 perp(c3,c5,c4,c3). [resolve(371,a,115,a)].
% 6.78/7.08 982 -midp(A,c3,c3) | midp(A,c1,c1). [resolve(596,a,267,b)].
% 6.78/7.08 993 para(c3,c1,c1,c3). [resolve(596,a,112,a)].
% 6.78/7.08 1009 para(c1,c2,c2,c1). [resolve(341,a,345,a)].
% 6.78/7.08 1017 -midp(A,c3,c3) | midp(A,c2,c2). [resolve(597,a,267,b)].
% 6.78/7.08 1025 -midp(c3,A,c3) | -coll(c2,A,c2) | midp(c2,A,c2). [resolve(597,a,153,b)].
% 6.78/7.08 1110 perp(c1,c1,c2,c1). [resolve(752,a,116,a)].
% 6.78/7.08 1121 cong(c1,c4,c4,c2). [resolve(785,a,131,a)].
% 6.78/7.08 1293 para(c1,c3,c3,c1). [resolve(993,a,113,a)].
% 6.78/7.08 1309 para(c1,c2,c1,c2). [resolve(1009,a,112,a)].
% 6.78/7.08 1436 perp(c1,c1,c1,c2). [resolve(1110,a,115,a)].
% 6.78/7.08 1626 para(c1,c3,c1,c3). [resolve(1293,a,112,a)].
% 6.78/7.08 1629 -midp(A,c1,c1) | midp(A,c2,c2). [resolve(1309,a,267,b)].
% 6.78/7.08 1772 -midp(A,c1,c1) | midp(A,c3,c3). [resolve(1626,a,267,b)].
% 6.78/7.08 1874 para(c1,c1,c1,c5). [resolve(356,a,1436,a)].
% 6.78/7.08 1952 -midp(A,c1,c1) | -para(c1,c5,c1,c1) | midp(A,c5,c1). [resolve(1874,a,167,c)].
% 6.78/7.08 1959 para(c1,c5,c1,c1). [resolve(1874,a,113,a)].
% 6.78/7.08 1962 -midp(A,c1,c1) | midp(A,c5,c1). [back_unit_del(1952),unit_del(b,1959)].
% 6.78/7.08 2337 para(c3,c4,c4,c3). [resolve(370,a,827,a)].
% 6.78/7.08 2338 para(c3,c4,c3,c4). [resolve(370,a,371,a)].
% 6.78/7.08 2704 para(c4,c3,c3,c4). [resolve(2337,a,113,a)].
% 6.78/7.08 2714 coll(c3,c4,c4). [resolve(2338,a,169,a)].
% 6.78/7.08 2720 coll(c4,c4,c3). [resolve(2714,a,253,a)].
% 6.78/7.08 2728 coll(c3,c3,c4). [resolve(2720,a,253,a)].
% 6.78/7.08 2733 coll(c4,c6,c3). [resolve(2728,a,435,a)].
% 6.78/7.08 2741 coll(c6,c4,c3). [resolve(2733,a,110,a)].
% 6.78/7.08 2748 coll(c6,c3,c4). [resolve(2741,a,109,a)].
% 6.78/7.08 2758 coll(c4,c2,c6). [resolve(2748,a,431,a)].
% 6.78/7.08 2773 coll(c1,c6,c4). [resolve(2758,a,392,a)].
% 6.78/7.08 2794 coll(c4,c5,c1). [resolve(2773,a,419,a)].
% 6.78/7.08 2960 para(c4,c3,c4,c3). [resolve(2704,a,112,a)].
% 6.78/7.08 2963 -midp(A,c4,c4) | midp(A,c3,c3). [resolve(2960,a,267,b)].
% 6.78/7.08 3156 -midp(f7(c2,c1,c2,c1,c4,c4,A),B,C) | para(c2,B,A,C). [resolve(546,a,166,a)].
% 6.78/7.08 3159 midp(f7(c2,c1,c2,c1,c4,c4,A),A,c2). [resolve(546,a,119,a)].
% 6.78/7.08 4250 cong(c1,c4,c4,c1). [resolve(783,a,1121,a)].
% 6.78/7.08 4251 cong(c4,c1,c4,c1). [resolve(783,a,413,a)].
% 6.78/7.08 4254 cong(c1,c4,c1,c4). [resolve(4250,a,130,a)].
% 6.78/7.08 4333 midp(c4,c1,c1). [resolve(4251,a,170,a),unit_del(a,541)].
% 6.78/7.08 4355 midp(c4,c5,c1). [resolve(4333,a,1962,a)].
% 6.78/7.08 4357 midp(c4,c3,c3). [resolve(4333,a,1772,a)].
% 6.78/7.08 4527 cong(c4,c5,c4,c1). [resolve(4355,a,171,a)].
% 6.78/7.08 4621 cong(c4,c3,c4,c3). [resolve(4357,a,171,a)].
% 6.78/7.08 4825 midp(c1,c4,c4). [resolve(4254,a,170,a),unit_del(a,615)].
% 6.78/7.08 4835 midp(c1,c3,c3). [resolve(4825,a,2963,a)].
% 6.78/7.08 4879 midp(c1,c1,c1). [resolve(4835,a,982,a)].
% 6.78/7.08 5799 perp(c5,c1,c1,c1). [resolve(4527,a,292,c),unit_del(a,2794)].
% 6.78/7.08 6185 cong(c4,c3,c3,c4). [resolve(4621,a,130,a)].
% 6.78/7.08 8070 cong(c5,c1,c5,c1). [resolve(5799,a,158,b),unit_del(a,4879)].
% 6.78/7.08 8474 cong(c3,c4,c4,c3). [resolve(6185,a,131,a)].
% 6.78/7.08 8892 midp(c5,c1,c1). [resolve(8070,a,170,a),unit_del(a,651)].
% 6.78/7.08 8909 midp(c5,c2,c2). [resolve(8892,a,1629,a)].
% 6.81/7.08 9467 cong(c3,c4,c3,c4). [resolve(8474,a,130,a)].
% 6.81/7.08 10228 midp(c3,c4,c4). [resolve(9467,a,170,a),unit_del(a,2714)].
% 6.81/7.08 10237 midp(c3,c3,c3). [resolve(10228,a,2963,a)].
% 6.81/7.08 10282 midp(c3,c2,c2). [resolve(10237,a,1017,a)].
% 6.81/7.08 13563 midp(c2,c3,c2). [resolve(1025,a,10237,a),unit_del(a,572)].
% 6.81/7.08 13594 midp(c2,c2,c3). [resolve(13563,a,119,a)].
% 6.81/7.08 13624 cong(c2,c2,c2,c3). [resolve(13594,a,171,a)].
% 6.81/7.08 13737 perp(c2,c3,c3,c3). [resolve(13624,a,292,c),unit_del(a,488)].
% 6.81/7.08 13844 perp(c3,c3,c2,c3). [resolve(13737,a,116,a)].
% 6.81/7.08 14132 perp(c3,c3,c3,c2). [resolve(13844,a,115,a)].
% 6.81/7.08 14548 -perp(A,B,c3,c3) | para(A,B,c3,c2). [resolve(14132,a,117,b)].
% 6.81/7.08 14550 perp(c3,c2,c3,c3). [resolve(14132,a,116,a)].
% 6.81/7.08 14797 -perp(c3,c3,A,B) | para(c3,c2,A,B). [resolve(14550,a,117,a)].
% 6.81/7.08 22908 para(c2,A,A,c2). [resolve(3159,a,3156,a)].
% 6.81/7.08 23071 para(c2,A,c2,A). [resolve(22908,a,112,a)].
% 6.81/7.08 23197 -midp(A,c2,c2) | midp(A,B,B). [resolve(23071,a,267,b)].
% 6.81/7.08 26115 midp(c3,A,A). [resolve(23197,a,10282,a)].
% 6.81/7.08 26116 midp(c5,A,A). [resolve(23197,a,8909,a)].
% 6.81/7.08 26120 cong(c3,A,c3,A). [resolve(26115,a,171,a)].
% 6.81/7.08 26189 perp(c3,c3,A,B). [resolve(26120,a,159,b),unit_del(a,26120)].
% 6.81/7.08 26191 para(c3,c2,A,B). [back_unit_del(14797),unit_del(a,26189)].
% 6.81/7.08 26322 perp(A,B,c3,c3). [resolve(26189,a,116,a)].
% 6.81/7.08 26323 para(A,B,c3,c2). [back_unit_del(14548),unit_del(a,26322)].
% 6.81/7.08 26349 para(A,B,C,D). [resolve(26191,a,114,b),unit_del(a,26323)].
% 6.81/7.08 26351 -midp(A,B,C) | midp(A,D,E). [back_unit_del(167),unit_del(b,26349),unit_del(c,26349)].
% 6.81/7.08 26996 midp(c5,A,B). [resolve(26351,a,26116,a)].
% 6.81/7.08 27137 cong(c5,A,c5,B). [resolve(26996,a,171,a)].
% 6.81/7.08 27138 $F. [resolve(27137,a,214,a)].
% 6.81/7.08
% 6.81/7.08 % SZS output end Refutation
% 6.81/7.08 ============================== end of proof ==========================
% 6.81/7.08
% 6.81/7.08 ============================== STATISTICS ============================
% 6.81/7.08
% 6.81/7.08 Given=10467. Generated=211971. Kept=27021. proofs=1.
% 6.81/7.08 Usable=8935. Sos=6969. Demods=0. Limbo=0, Disabled=11266. Hints=0.
% 6.81/7.08 Megabytes=14.53.
% 6.81/7.08 User_CPU=5.88, System_CPU=0.10, Wall_clock=6.
% 6.81/7.08
% 6.81/7.08 ============================== end of statistics =====================
% 6.81/7.08
% 6.81/7.08 ============================== end of search =========================
% 6.81/7.08
% 6.81/7.08 THEOREM PROVED
% 6.81/7.08 % SZS status Theorem
% 6.81/7.08
% 6.81/7.08 Exiting with 1 proof.
% 6.81/7.08
% 6.81/7.08 Process 25472 exit (max_proofs) Fri Jun 17 16:49:05 2022
% 6.81/7.08 Prover9 interrupted
%------------------------------------------------------------------------------