0.04/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.04/0.13 % Command : tptp2X_and_run_prover9 %d %s 0.14/0.34 % Computer : n005.cluster.edu 0.14/0.34 % Model : x86_64 x86_64 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.14/0.34 % Memory : 8042.1875MB 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.14/0.34 % CPULimit : 1440 0.14/0.34 % WCLimit : 180 0.14/0.34 % DateTime : Mon Jul 3 05:50:15 EDT 2023 0.14/0.34 % CPUTime : 1.00/1.30 ============================== Prover9 =============================== 1.00/1.30 Prover9 (32) version 2009-11A, November 2009. 1.00/1.30 Process 6033 was started by sandbox on n005.cluster.edu, 1.00/1.30 Mon Jul 3 05:50:16 2023 1.00/1.30 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1440 -f /tmp/Prover9_5865_n005.cluster.edu". 1.00/1.30 ============================== end of head =========================== 1.00/1.30 1.00/1.30 ============================== INPUT ================================= 1.00/1.30 1.00/1.30 % Reading from file /tmp/Prover9_5865_n005.cluster.edu 1.00/1.30 1.00/1.30 set(prolog_style_variables). 1.00/1.30 set(auto2). 1.00/1.30 % set(auto2) -> set(auto). 1.00/1.30 % set(auto) -> set(auto_inference). 1.00/1.30 % set(auto) -> set(auto_setup). 1.00/1.30 % set(auto_setup) -> set(predicate_elim). 1.00/1.30 % set(auto_setup) -> assign(eq_defs, unfold). 1.00/1.30 % set(auto) -> set(auto_limits). 1.00/1.30 % set(auto_limits) -> assign(max_weight, "100.000"). 1.00/1.30 % set(auto_limits) -> assign(sos_limit, 20000). 1.00/1.30 % set(auto) -> set(auto_denials). 1.00/1.30 % set(auto) -> set(auto_process). 1.00/1.30 % set(auto2) -> assign(new_constants, 1). 1.00/1.30 % set(auto2) -> assign(fold_denial_max, 3). 1.00/1.30 % set(auto2) -> assign(max_weight, "200.000"). 1.00/1.30 % set(auto2) -> assign(max_hours, 1). 1.00/1.30 % assign(max_hours, 1) -> assign(max_seconds, 3600). 1.00/1.30 % set(auto2) -> assign(max_seconds, 0). 1.00/1.30 % set(auto2) -> assign(max_minutes, 5). 1.00/1.30 % assign(max_minutes, 5) -> assign(max_seconds, 300). 1.00/1.30 % set(auto2) -> set(sort_initial_sos). 1.00/1.30 % set(auto2) -> assign(sos_limit, -1). 1.00/1.30 % set(auto2) -> assign(lrs_ticks, 3000). 1.00/1.30 % set(auto2) -> assign(max_megs, 400). 1.00/1.30 % set(auto2) -> assign(stats, some). 1.00/1.30 % set(auto2) -> clear(echo_input). 1.00/1.30 % set(auto2) -> set(quiet). 1.00/1.30 % set(auto2) -> clear(print_initial_clauses). 1.00/1.30 % set(auto2) -> clear(print_given). 1.00/1.30 assign(lrs_ticks,-1). 1.00/1.30 assign(sos_limit,10000). 1.00/1.30 assign(order,kbo). 1.00/1.30 set(lex_order_vars). 1.00/1.30 clear(print_given). 1.00/1.30 1.00/1.30 % formulas(sos). % not echoed (95 formulas) 1.00/1.30 1.00/1.30 ============================== end of input ========================== 1.00/1.30 1.00/1.30 % From the command line: assign(max_seconds, 1440). 1.00/1.30 1.00/1.30 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 1.00/1.30 1.00/1.30 % Formulas that are not ordinary clauses: 1.00/1.30 1 (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]. 1.00/1.30 2 (all A all B all C (midp(A,B,C) -> coll(A,B,C))) # label(ruleD69) # label(axiom) # label(non_clause). [assumption]. 1.00/1.30 3 (all A all B all C all D all O exists P (cong(O,C,O,D) & perp(A,B,B,O) -> cong(B,C,B,P) & para(P,C,A,B) & cong(O,C,O,P))) # label(ruleX9) # label(axiom) # label(non_clause). [assumption]. 1.00/1.30 4 (all A all B all O all X exists M (eqangle(A,O,O,X,O,X,O,B) & perp(O,X,A,B) -> coll(B,A,M) & coll(M,O,X))) # label(ruleX3) # label(axiom) # label(non_clause). [assumption]. 1.00/1.30 5 (all A all B all C (coll(A,B,C) -> coll(B,A,C))) # label(ruleD2) # label(axiom) # label(non_clause). [assumption]. 1.00/1.30 6 (all A all B all C all P all Q all R (eqangle(A,B,B,C,P,Q,Q,R) & -coll(A,B,C) & eqangle(A,C,B,C,P,R,Q,R) -> simtri(A,B,C,P,Q,R))) # label(ruleD58) # label(axiom) # label(non_clause). [assumption]. 1.00/1.30 7 (all A all B all O (-coll(O,A,B) & eqangle(O,A,A,B,A,B,O,B) -> cong(O,A,O,B))) # label(ruleD47) # label(axiom) # label(non_clause). [assumption]. 1.00/1.30 8 (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]. 1.00/1.30 9 (all A all B all C all D all P all Q exists R (coll(P,B,D) & coll(Q,A,B) & coll(P,A,C) & para(A,B,C,D) -> coll(P,Q,R) & coll(R,C,D))) # label(ruleX18) # label(axiom) # label(non_clause). [assumption]. 1.00/1.30 10 (all A all B all C all D all P all Q (eqangle(A,B,P,Q,C,D,P,Q) -> para(A,B,C,D))) # label(ruleD39) # label(axiom) # label(non_clause). [assumption]. 1.00/1.30 11 (all A all B all C all M (midp(M,A,C) & perp(A,B,B,C) -> cong(A,M,B,M))) # label(ruleD52) # label(axiom) # label(non_clause). [assumption]. 1.00/1.30 12 (all A all B all C all E all F (coll(F,A,C) & para(E,F,B,C) & midp(E,A,B) -> midp(F,A,C))) # label(ruleD45) # label(axiom) # label(non_clause). [assumption]. 1.00/1.30 13 (all A all B all C all D (para(A,B,C,D) -> para(C,D,A,B))) # label(ruleD5) # label(axiom) # label(non_clause). [assumption]. 1.00/1.30 14 (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]. 1.00/1.30 15 (all A all B all O exists C (perp(A,O,O,B) & cong(O,A,O,B) -> coll(A,O,C) & cong(O,A,O,C))) # label(ruleX17) # label(axiom) # label(non_clause). [assumption]. 1.00/1.30 16 (all A all B all M (midp(M,B,A) -> midp(M,A,B))) # label(ruleD11) # label(axiom) # label(non_clause). [assumption]. 1.00/1.30 17 (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]. 1.00/1.30 18 (all A all B all C all D (cyclic(A,B,C,D) -> cyclic(A,B,D,C))) # label(ruleD14) # label(axiom) # label(non_clause). [assumption]. 1.00/1.30 19 (all A all B all C all D (coll(A,B,D) & coll(A,B,C) -> coll(C,D,A))) # label(ruleD3) # label(axiom) # label(non_clause). [assumption]. 1.00/1.30 20 (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]. 1.00/1.30 21 (all A all B all P all Q (cyclic(A,B,P,Q) & cong(A,Q,B,Q) & cong(A,P,B,P) -> perp(P,A,A,Q))) # label(ruleD57) # label(axiom) # label(non_clause). [assumption]. 1.00/1.30 22 (all A all B all C all D all M all N exists P exists Q (cong(M,A,M,D) & cong(N,A,N,B) & M != N & circle(M,A,B,C) -> cong(P,N,N,A) & cong(Q,N,N,A) & coll(Q,B,D) & coll(P,A,C))) # label(ruleX12) # label(axiom) # label(non_clause). [assumption]. 1.00/1.30 23 (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]. 1.00/1.30 24 (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]. 1.00/1.30 25 (all A all B all P all Q (-coll(P,Q,A) & eqangle(P,A,P,B,Q,A,Q,B) -> cyclic(A,B,P,Q))) # label(ruleD42a) # label(axiom) # label(non_clause). [assumption]. 1.00/1.30 26 (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(P,Q,U,V,E,F,G,H) & eqratio(A,B,C,D,P,Q,U,V) -> eqratio(A,B,C,D,E,F,G,H))) # label(ruleD30) # label(axiom) # label(non_clause). [assumption]. 1.00/1.30 27 (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]. 1.00/1.30 28 (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]. 1.00/1.30 29 (all A all B all C all D all P all Q all U all V (eqangle(A,B,C,D,P,Q,U,V) -> eqangle(A,B,P,Q,C,D,U,V))) # label(ruleD21) # label(axiom) # label(non_clause). [assumption]. 1.00/1.30 30 (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) & coll(P,Q,R) & para(A,P,B,Q) -> coll(X,A,Q) & coll(X,M,R))) # label(ruleX8) # label(axiom) # label(non_clause). [assumption]. 1.00/1.30 31 (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]. 1.00/1.30 32 (all A all B all C all D all E all F (para(A,B,C,D) & para(C,D,E,F) -> para(A,B,E,F))) # label(ruleD6) # label(axiom) # label(non_clause). [assumption]. 1.00/1.30 33 (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]. 1.00/1.30 34 (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]. 1.00/1.30 35 (all A all B all C (cong(A,B,A,C) & coll(A,B,C) -> midp(A,B,C))) # label(ruleD67) # label(axiom) # label(non_clause). [assumption]. 1.00/1.30 36 (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]. 1.00/1.30 37 (all A all B all C all E all F all G all P all Q all R (contri(E,F,G,P,Q,R) & contri(A,B,C,E,F,G) -> contri(A,B,C,P,Q,R))) # label(ruleD38) # label(axiom) # label(non_clause). [assumption]. 1.00/1.30 38 (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]. 1.00/1.30 39 (all A all B all C all D (cyclic(A,B,C,D) -> cyclic(B,A,C,D))) # label(ruleD16) # label(axiom) # label(non_clause). [assumption]. 1.00/1.30 40 (all A all B all C all E all F exists P (coll(B,E,F) & perp(A,C,C,B) -> coll(P,E,F) & perp(P,A,E,F))) # label(ruleX15) # label(axiom) # label(non_clause). [assumption]. 1.00/1.30 41 (all A all B all C all D all P all Q all U all V (para(P,Q,U,V) & eqangle(A,B,C,D,P,Q,U,V) -> para(A,B,C,D))) # label(ruleD73) # label(axiom) # label(non_clause). [assumption]. 1.00/1.30 42 (all A all B all C all D all M all N all Q exists P (midp(M,A,B) & coll(D,A,B) & coll(C,A,B) & midp(N,C,D) -> midp(P,A,Q))) # label(ruleX7) # label(axiom) # label(non_clause). [assumption]. 1.00/1.30 43 (all A all B all C all D all P all Q (para(A,B,C,D) -> eqangle(A,B,P,Q,C,D,P,Q))) # label(ruleD40) # label(axiom) # label(non_clause). [assumption]. 1.00/1.30 44 (all A all B all C all P all Q all R (cyclic(A,B,C,P) & cyclic(A,B,C,Q) & cyclic(A,B,C,R) & eqangle(C,A,C,B,R,P,R,Q) -> cong(A,B,P,Q))) # label(ruleD43) # label(axiom) # label(non_clause). [assumption]. 1.00/1.30 45 (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]. 1.00/1.30 46 (all A all B all O all X exists M (perp(O,X,A,B) & cong(O,A,O,B) -> coll(M,O,X) & coll(B,A,M))) # label(ruleX4) # label(axiom) # label(non_clause). [assumption]. 1.00/1.30 47 (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]. 1.00/1.30 48 (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]. 1.00/1.30 49 (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]. 1.00/1.30 50 (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]. 1.00/1.30 51 (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]. 1.00/1.30 52 (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]. 1.00/1.30 53 (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]. 1.00/1.30 54 (all A all B all C all D (-perp(A,B,C,D) & eqangle(A,B,C,D,C,D,A,B) -> para(A,B,C,D))) # label(ruleD72) # label(axiom) # label(non_clause). [assumption]. 1.00/1.30 55 (all A all B all C (para(A,B,A,C) -> coll(A,B,C))) # label(ruleD66) # label(axiom) # label(non_clause). [assumption]. 1.00/1.30 56 (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]. 1.00/1.30 57 (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]. 1.00/1.30 58 (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]. 1.00/1.30 59 (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]. 1.00/1.30 60 (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]. 1.00/1.30 61 (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]. 1.00/1.30 62 (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]. 1.00/1.30 63 (all A all B all C (coll(A,B,C) -> coll(A,C,B))) # label(ruleD1) # label(axiom) # label(non_clause). [assumption]. 1.00/1.30 64 (all A all B all C (midp(A,B,C) -> cong(A,B,A,C))) # label(ruleD68) # label(axiom) # label(non_clause). [assumption]. 1.00/1.30 65 (all A all B all P all Q (coll(P,Q,B) & eqangle(P,A,P,B,Q,A,Q,B) -> cyclic(A,B,P,Q))) # label(ruleD42b) # label(axiom) # label(non_clause). [assumption]. 1.00/1.30 66 (all A all B all C all D all O (cong(O,A,O,B) & cong(O,A,O,D) & cong(O,A,O,C) -> cyclic(A,B,C,D))) # label(ruleD13) # label(axiom) # label(non_clause). [assumption]. 1.00/1.30 67 (all A all B all C all O all M (eqangle(A,B,A,C,O,B,O,M) & coll(M,B,C) & circle(O,A,B,C) -> midp(M,B,C))) # label(ruleD51) # label(axiom) # label(non_clause). [assumption]. 1.00/1.30 68 (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]. 1.00/1.30 69 (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]. 1.00/1.30 70 (all A all B all C all D all O (coll(O,A,C) & coll(O,B,D) & para(A,B,C,D) -> eqratio(O,A,A,C,O,B,B,D))) # label(ruleD65) # label(axiom) # label(non_clause). [assumption]. 1.00/1.30 71 (all A all B all C all D all E (cyclic(A,B,C,E) & cyclic(A,B,C,D) -> cyclic(B,C,D,E))) # label(ruleD17) # label(axiom) # label(non_clause). [assumption]. 1.00/1.30 72 (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]. 1.00/1.30 73 (all A all B all C all E all F (midp(F,A,C) & midp(E,A,B) -> para(E,F,B,C))) # label(ruleD44) # label(axiom) # label(non_clause). [assumption]. 1.00/1.30 74 (all A all B all C all P all Q all R (cong(A,B,P,Q) & simtri(A,B,C,P,Q,R) -> contri(A,B,C,P,Q,R))) # label(ruleD61) # label(axiom) # label(non_clause). [assumption]. 1.00/1.30 75 (all A all B all M all O (perp(O,M,A,B) & midp(M,A,B) -> cong(O,A,O,B))) # label(ruleD55) # label(axiom) # label(non_clause). [assumption]. 1.00/1.30 76 (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]. 1.00/1.30 77 (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]. 1.00/1.30 78 (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]. 1.00/1.30 79 (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]. 1.00/1.30 80 (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]. 1.00/1.30 81 (all A all M all O all X exists B (eqangle(X,O,M,O,M,O,A,O) & perp(O,M,M,A) -> coll(B,O,X) & coll(B,A,M))) # label(ruleX1) # label(axiom) # label(non_clause). [assumption]. 1.00/1.30 82 (all A all B all C all D all M all N exists P (midp(N,C,D) & midp(M,A,B) -> para(P,N,A,C) & para(P,M,B,D) & midp(P,A,D))) # label(ruleX6) # label(axiom) # label(non_clause). [assumption]. 1.00/1.30 83 (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]. 1.00/1.30 84 (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]. 1.00/1.30 85 (all A all B all C all D all P all Q all U all V (eqangle(A,B,C,D,P,Q,U,V) -> eqangle(C,D,A,B,U,V,P,Q))) # label(ruleD19) # label(axiom) # label(non_clause). [assumption]. 1.00/1.30 86 (all A all B all C all D all M exists P (perp(A,B,A,C) & midp(M,B,D) & perp(C,A,C,D) -> midp(P,A,C))) # label(ruleX16) # label(axiom) # label(non_clause). [assumption]. 1.00/1.30 87 (all A all B all C all D (cyclic(A,B,C,D) -> cyclic(A,C,B,D))) # label(ruleD15) # label(axiom) # label(non_clause). [assumption]. 1.00/1.30 88 (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(P,Q,U,V,E,F,G,H) & eqangle(A,B,C,D,P,Q,U,V) -> eqangle(A,B,C,D,E,F,G,H))) # label(ruleD22) # label(axiom) # label(non_clause). [assumption]. 1.00/1.30 89 (all A all B all C all D all M (midp(M,A,B) & para(A,D,B,C) & para(A,C,B,D) -> midp(M,C,D))) # label(ruleD64) # label(axiom) # label(non_clause). [assumption]. 1.00/1.30 90 (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]. 1.00/1.30 91 (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]. 1.00/1.30 92 (all A all B all C all D (para(A,B,C,D) -> para(A,B,D,C))) # label(ruleD4) # label(axiom) # label(non_clause). [assumption]. 1.00/1.30 93 (all A all B all C all H exists P exists Q (perp(B,H,A,C) & perp(A,H,B,C) -> coll(Q,C,A) & perp(B,Q,C,A) & perp(A,P,C,B) & coll(P,C,B))) # label(ruleX10) # label(axiom) # label(non_clause). [assumption]. 1.00/1.30 94 (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]. 1.00/1.30 95 -(all A all C all K all O all N all B all G all O1 all M all NWPNT1 all NWPNT2 all NWPNT3 (circle(O,A,C,K) & coll(B,A,K) & coll(B,C,N) & circle(O1,K,N,B) & circle(O1,K,M,NWPNT3) & circle(G,A,M,NWPNT2) & circle(G,A,C,B) & circle(O,A,N,NWPNT1) -> cyclic(M,K,O,C))) # label(exemplo6GDDFULL012017) # label(negated_conjecture) # label(non_clause). [assumption]. 1.00/1.30 1.00/1.30 ============================== end of process non-clausal formulas === 1.00/1.30 1.00/1.30 ============================== PROCESS INITIAL CLAUSES =============== 1.00/1.30 1.00/1.30 ============================== PREDICATE ELIMINATION ================= 1.00/1.30 96 -cong(A,B,A,C) | -cong(D,B,D,E) | D = A | -circle(A,B,E,F) | cong(f6(B,E,F,C,A,D),D,D,B) # label(ruleX12) # label(axiom). [clausify(22)]. 1.00/1.30 97 -perp(A,B,B,C) | -cyclic(A,C,B,D) | circle(f5(A,C,B,D),A,C,B) # label(ruleX14) # label(axiom). [clausify(20)]. 1.00/1.30 Derived: -cong(f5(A,B,C,D),A,f5(A,B,C,D),E) | -cong(F,A,F,B) | F = f5(A,B,C,D) | cong(f6(A,B,C,E,f5(A,B,C,D),F),F,F,A) | -perp(A,C,C,B) | -cyclic(A,B,C,D). [resolve(96,d,97,c)]. 1.00/1.30 98 -cong(A,B,A,C) | -cong(D,B,D,E) | D = A | -circle(A,B,E,F) | cong(f7(B,E,F,C,A,D),D,D,B) # label(ruleX12) # label(axiom). [clausify(22)]. 1.00/1.30 Derived: -cong(f5(A,B,C,D),A,f5(A,B,C,D),E) | -cong(F,A,F,B) | F = f5(A,B,C,D) | cong(f7(A,B,C,E,f5(A,B,C,D),F),F,F,A) | -perp(A,C,C,B) | -cyclic(A,B,C,D). [resolve(98,d,97,c)]. 1.00/1.30 99 -cong(A,B,A,C) | -cong(D,B,D,E) | D = A | -circle(A,B,E,F) | coll(f7(B,E,F,C,A,D),E,C) # label(ruleX12) # label(axiom). [clausify(22)]. 1.00/1.30 Derived: -cong(f5(A,B,C,D),A,f5(A,B,C,D),E) | -cong(F,A,F,B) | F = f5(A,B,C,D) | coll(f7(A,B,C,E,f5(A,B,C,D),F),B,E) | -perp(A,C,C,B) | -cyclic(A,B,C,D). [resolve(99,d,97,c)]. 1.00/1.30 100 -cong(A,B,A,C) | -cong(D,B,D,E) | D = A | -circle(A,B,E,F) | coll(f6(B,E,F,C,A,D),B,F) # label(ruleX12) # label(axiom). [clausify(22)]. 1.00/1.30 Derived: -cong(f5(A,B,C,D),A,f5(A,B,C,D),E) | -cong(F,A,F,B) | F = f5(A,B,C,D) | coll(f6(A,B,C,E,f5(A,B,C,D),F),A,C) | -perp(A,C,C,B) | -cyclic(A,B,C,D). [resolve(100,d,97,c)]. 1.00/1.30 101 -circle(A,B,C,D) | perp(f8(B,C,D,A),B,B,A) # label(ruleX11) # label(axiom). [clausify(27)]. 1.00/1.30 Derived: perp(f8(A,B,C,f5(A,B,C,D)),A,A,f5(A,B,C,D)) | -perp(A,C,C,B) | -cyclic(A,B,C,D). [resolve(101,a,97,c)]. 1.00/1.30 102 -circle(A,B,C,D) | -perp(A,B,B,E) | eqangle(B,E,B,C,D,B,D,C) # label(ruleD48) # label(axiom). [clausify(38)]. 1.00/1.30 Derived: -perp(f5(A,B,C,D),A,A,E) | eqangle(A,E,A,B,C,A,C,B) | -perp(A,C,C,B) | -cyclic(A,B,C,D). [resolve(102,a,97,c)]. 1.00/1.30 103 -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | circle(f14(A,B,C,D,E),A,B,C) # label(ruleX13) # label(axiom). [clausify(47)]. 1.00/1.30 Derived: -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | -cong(f14(A,B,C,D,E),A,f14(A,B,C,D,E),F) | -cong(V6,A,V6,B) | V6 = f14(A,B,C,D,E) | cong(f6(A,B,C,F,f14(A,B,C,D,E),V6),V6,V6,A). [resolve(103,d,96,d)]. 1.00/1.30 Derived: -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | -cong(f14(A,B,C,D,E),A,f14(A,B,C,D,E),F) | -cong(V6,A,V6,B) | V6 = f14(A,B,C,D,E) | cong(f7(A,B,C,F,f14(A,B,C,D,E),V6),V6,V6,A). [resolve(103,d,98,d)]. 1.00/1.30 Derived: -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | -cong(f14(A,B,C,D,E),A,f14(A,B,C,D,E),F) | -cong(V6,A,V6,B) | V6 = f14(A,B,C,D,E) | coll(f7(A,B,C,F,f14(A,B,C,D,E),V6),B,F). [resolve(103,d,99,d)]. 1.00/1.31 Derived: -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | -cong(f14(A,B,C,D,E),A,f14(A,B,C,D,E),F) | -cong(V6,A,V6,B) | V6 = f14(A,B,C,D,E) | coll(f6(A,B,C,F,f14(A,B,C,D,E),V6),A,C). [resolve(103,d,100,d)]. 1.00/1.31 Derived: -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | perp(f8(A,B,C,f14(A,B,C,D,E)),A,A,f14(A,B,C,D,E)). [resolve(103,d,101,a)]. 1.00/1.31 Derived: -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | -perp(f14(A,B,C,D,E),A,A,F) | eqangle(A,F,A,B,C,A,C,B). [resolve(103,d,102,a)]. 1.00/1.31 104 -circle(A,B,C,D) | -coll(A,B,D) | perp(B,C,C,D) # label(ruleD53) # label(axiom). [clausify(56)]. 1.00/1.31 Derived: -coll(f5(A,B,C,D),A,C) | perp(A,B,B,C) | -perp(A,C,C,B) | -cyclic(A,B,C,D). [resolve(104,a,97,c)]. 1.00/1.31 Derived: -coll(f14(A,B,C,D,E),A,C) | perp(A,B,B,C) | -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B). [resolve(104,a,103,d)]. 1.00/1.31 105 -eqangle(A,B,A,C,D,B,D,E) | -coll(E,B,C) | -circle(D,A,B,C) | midp(E,B,C) # label(ruleD51) # label(axiom). [clausify(67)]. 1.00/1.31 Derived: -eqangle(A,B,A,C,f5(A,B,C,D),B,f5(A,B,C,D),E) | -coll(E,B,C) | midp(E,B,C) | -perp(A,C,C,B) | -cyclic(A,B,C,D). [resolve(105,c,97,c)]. 1.00/1.31 Derived: -eqangle(A,B,A,C,f14(A,B,C,D,E),B,f14(A,B,C,D,E),F) | -coll(F,B,C) | midp(F,B,C) | -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B). [resolve(105,c,103,d)]. 1.00/1.31 106 -circle(A,B,C,D) | -midp(E,C,D) | eqangle(B,C,B,D,A,C,A,E) # label(ruleD50) # label(axiom). [clausify(72)]. 1.00/1.31 Derived: -midp(A,B,C) | eqangle(D,B,D,C,f5(D,B,C,E),B,f5(D,B,C,E),A) | -perp(D,C,C,B) | -cyclic(D,B,C,E). [resolve(106,a,97,c)]. 1.00/1.31 Derived: -midp(A,B,C) | eqangle(D,B,D,C,f14(D,B,C,E,F),B,f14(D,B,C,E,F),A) | -cyclic(D,B,C,E) | -para(D,B,C,E) | -midp(F,D,B). [resolve(106,a,103,d)]. 1.00/1.31 107 -circle(A,B,C,D) | -eqangle(B,E,B,C,D,B,D,C) | perp(A,B,B,E) # label(ruleD49) # label(axiom). [clausify(84)]. 1.00/1.31 Derived: -eqangle(A,B,A,C,D,A,D,C) | perp(f5(A,C,D,E),A,A,B) | -perp(A,D,D,C) | -cyclic(A,C,D,E). [resolve(107,a,97,c)]. 1.00/1.31 Derived: -eqangle(A,B,A,C,D,A,D,C) | perp(f14(A,C,D,E,F),A,A,B) | -cyclic(A,C,D,E) | -para(A,C,D,E) | -midp(F,A,C). [resolve(107,a,103,d)]. 1.00/1.31 108 -cong(A,B,A,C) | -cong(A,B,A,D) | circle(A,B,C,D) # label(ruleD12) # label(axiom). [clausify(94)]. 1.00/1.31 Derived: -cong(A,B,A,C) | -cong(A,B,A,D) | -cong(A,B,A,E) | -cong(F,B,F,C) | F = A | cong(f6(B,C,D,E,A,F),F,F,B). [resolve(108,c,96,d)]. 1.00/1.31 Derived: -cong(A,B,A,C) | -cong(A,B,A,D) | -cong(A,B,A,E) | -cong(F,B,F,C) | F = A | cong(f7(B,C,D,E,A,F),F,F,B). [resolve(108,c,98,d)]. 1.00/1.31 Derived: -cong(A,B,A,C) | -cong(A,B,A,D) | -cong(A,B,A,E) | -cong(F,B,F,C) | F = A | coll(f7(B,C,D,E,A,F),C,E). [resolve(108,c,99,d)]. 1.00/1.31 Derived: -cong(A,B,A,C) | -cong(A,B,A,D) | -cong(A,B,A,E) | -cong(F,B,F,C) | F = A | coll(f6(B,C,D,E,A,F),B,D). [resolve(108,c,100,d)]. 1.00/1.31 Derived: -cong(A,B,A,C) | -cong(A,B,A,D) | perp(f8(B,C,D,A),B,B,A). [resolve(108,c,101,a)]. 1.00/1.31 Derived: -cong(A,B,A,C) | -cong(A,B,A,D) | -perp(A,B,B,E) | eqangle(B,E,B,C,D,B,D,C). [resolve(108,c,102,a)]. 1.00/1.31 Derived: -cong(A,B,A,C) | -cong(A,B,A,D) | -coll(A,B,D) | perp(B,C,C,D). [resolve(108,c,104,a)]. 1.00/1.31 Derived: -cong(A,B,A,C) | -cong(A,B,A,D) | -eqangle(B,C,B,D,A,C,A,E) | -coll(E,C,D) | midp(E,C,D). [resolve(108,c,105,c)]. 1.00/1.31 Derived: -cong(A,B,A,C) | -cong(A,B,A,D) | -midp(E,C,D) | eqangle(B,C,B,D,A,C,A,E). [resolve(108,c,106,a)]. 1.00/1.31 Derived: -cong(A,B,A,C) | -cong(A,B,A,D) | -eqangle(B,E,B,C,D,B,D,C) | perp(A,B,B,E). [resolve(108,c,107,a)]. 1.00/1.31 109 circle(c4,c1,c2,c3) # label(exemplo6GDDFULL012017) # label(negated_conjecture). [clausify(95)]. 1.00/1.31 Derived: -cong(c4,c1,c4,A) | -cong(B,c1,B,c2) | B = c4 | cong(f6(c1,c2,c3,A,c4,B),B,B,c1). [resolve(109,a,96,d)]. 1.00/1.31 Derived: -cong(c4,c1,c4,A) | -cong(B,c1,B,c2) | B = c4 | cong(f7(c1,c2,c3,A,c4,B),B,B,c1). [resolve(109,a,98,d)]. 1.00/1.31 Derived: -cong(c4,c1,c4,A) | -cong(B,c1,B,c2) | B = c4 | coll(f7(c1,c2,c3,A,c4,B),c2,A). [resolve(109,a,99,d)]. 1.00/1.31 Derived: -cong(c4,c1,c4,A) | -cong(B,c1,B,c2) | B = c4 | coll(f6(c1,c2,c3,A,c4,B),c1,c3). [resolve(109,a,100,d)]. 1.00/1.31 Derived: perp(f8(c1,c2,c3,c4),c1,c1,c4). [resolve(109,a,101,a)]. 1.00/1.31 Derived: -perp(c4,c1,c1,A) | eqangle(c1,A,c1,c2,c3,c1,c3,c2). [resolve(109,a,102,a)]. 1.00/1.31 Derived: -coll(c4,c1,c3) | perp(c1,c2,c2,c3). [resolve(109,a,104,a)]. 1.00/1.31 Derived: -eqangle(c1,c2,c1,c3,c4,c2,c4,A) | -coll(A,c2,c3) | midp(A,c2,c3). [resolve(109,a,105,c)]. 1.00/1.31 Derived: -midp(A,c2,c3) | eqangle(c1,c2,c1,c3,c4,c2,c4,A). [resolve(109,a,106,a)]. 1.00/1.31 Derived: -eqangle(c1,A,c1,c2,c3,c1,c3,c2) | perp(c4,c1,c1,A). [resolve(109,a,107,a)]. 1.00/1.31 110 circle(c8,c3,c5,c6) # label(exemplo6GDDFULL012017) # label(negated_conjecture). [clausify(95)]. 1.00/1.31 Derived: -cong(c8,c3,c8,A) | -cong(B,c3,B,c5) | B = c8 | cong(f6(c3,c5,c6,A,c8,B),B,B,c3). [resolve(110,a,96,d)]. 1.00/1.31 Derived: -cong(c8,c3,c8,A) | -cong(B,c3,B,c5) | B = c8 | cong(f7(c3,c5,c6,A,c8,B),B,B,c3). [resolve(110,a,98,d)]. 1.00/1.31 Derived: -cong(c8,c3,c8,A) | -cong(B,c3,B,c5) | B = c8 | coll(f7(c3,c5,c6,A,c8,B),c5,A). [resolve(110,a,99,d)]. 1.00/1.31 Derived: -cong(c8,c3,c8,A) | -cong(B,c3,B,c5) | B = c8 | coll(f6(c3,c5,c6,A,c8,B),c3,c6). [resolve(110,a,100,d)]. 1.00/1.31 Derived: perp(f8(c3,c5,c6,c8),c3,c3,c8). [resolve(110,a,101,a)]. 1.00/1.31 Derived: -perp(c8,c3,c3,A) | eqangle(c3,A,c3,c5,c6,c3,c6,c5). [resolve(110,a,102,a)]. 1.00/1.31 Derived: -coll(c8,c3,c6) | perp(c3,c5,c5,c6). [resolve(110,a,104,a)]. 1.00/1.31 Derived: -eqangle(c3,c5,c3,c6,c8,c5,c8,A) | -coll(A,c5,c6) | midp(A,c5,c6). [resolve(110,a,105,c)]. 1.00/1.31 Derived: -midp(A,c5,c6) | eqangle(c3,c5,c3,c6,c8,c5,c8,A). [resolve(110,a,106,a)]. 1.00/1.31 Derived: -eqangle(c3,A,c3,c5,c6,c3,c6,c5) | perp(c8,c3,c3,A). [resolve(110,a,107,a)]. 1.00/1.31 111 circle(c8,c3,c9,c12) # label(exemplo6GDDFULL012017) # label(negated_conjecture). [clausify(95)]. 1.00/1.31 Derived: -cong(c8,c3,c8,A) | -cong(B,c3,B,c9) | B = c8 | cong(f6(c3,c9,c12,A,c8,B),B,B,c3). [resolve(111,a,96,d)]. 1.00/1.31 Derived: -cong(c8,c3,c8,A) | -cong(B,c3,B,c9) | B = c8 | cong(f7(c3,c9,c12,A,c8,B),B,B,c3). [resolve(111,a,98,d)]. 1.00/1.31 Derived: -cong(c8,c3,c8,A) | -cong(B,c3,B,c9) | B = c8 | coll(f7(c3,c9,c12,A,c8,B),c9,A). [resolve(111,a,99,d)]. 1.00/1.31 Derived: -cong(c8,c3,c8,A) | -cong(B,c3,B,c9) | B = c8 | coll(f6(c3,c9,c12,A,c8,B),c3,c12). [resolve(111,a,100,d)]. 1.00/1.31 Derived: perp(f8(c3,c9,c12,c8),c3,c3,c8). [resolve(111,a,101,a)]. 1.00/1.31 Derived: -perp(c8,c3,c3,A) | eqangle(c3,A,c3,c9,c12,c3,c12,c9). [resolve(111,a,102,a)]. 1.00/1.31 Derived: -coll(c8,c3,c12) | perp(c3,c9,c9,c12). [resolve(111,a,104,a)]. 1.00/1.31 Derived: -eqangle(c3,c9,c3,c12,c8,c9,c8,A) | -coll(A,c9,c12) | midp(A,c9,c12). [resolve(111,a,105,c)]. 1.00/1.31 Derived: -midp(A,c9,c12) | eqangle(c3,c9,c3,c12,c8,c9,c8,A). [resolve(111,a,106,a)]. 1.00/1.31 Derived: -eqangle(c3,A,c3,c9,c12,c3,c12,c9) | perp(c8,c3,c3,A). [resolve(111,a,107,a)]. 1.00/1.31 112 circle(c7,c1,c9,c11) # label(exemplo6GDDFULL012017) # label(negated_conjecture). [clausify(95)]. 1.00/1.31 Derived: -cong(c7,c1,c7,A) | -cong(B,c1,B,c9) | B = c7 | cong(f6(c1,c9,c11,A,c7,B),B,B,c1). [resolve(112,a,96,d)]. 1.00/1.31 Derived: -cong(c7,c1,c7,A) | -cong(B,c1,B,c9) | B = c7 | cong(f7(c1,c9,c11,A,c7,B),B,B,c1). [resolve(112,a,98,d)]. 1.00/1.31 Derived: -cong(c7,c1,c7,A) | -cong(B,c1,B,c9) | B = c7 | coll(f7(c1,c9,c11,A,c7,B),c9,A). [resolve(112,a,99,d)]. 1.00/1.31 Derived: -cong(c7,c1,c7,A) | -cong(B,c1,B,c9) | B = c7 | coll(f6(c1,c9,c11,A,c7,B),c1,c11). [resolve(112,a,100,d)]. 1.00/1.31 Derived: perp(f8(c1,c9,c11,c7),c1,c1,c7). [resolve(112,a,101,a)]. 1.00/1.31 Derived: -perp(c7,c1,c1,A) | eqangle(c1,A,c1,c9,c11,c1,c11,c9). [resolve(112,a,102,a)]. 1.00/1.31 Derived: -coll(c7,c1,c11) | perp(c1,c9,c9,c11). [resolve(112,a,104,a)]. 1.00/1.31 Derived: -eqangle(c1,c9,c1,c11,c7,c9,c7,A) | -coll(A,c9,c11) | midp(A,c9,c11). [resolve(112,a,105,c)]. 1.00/1.31 Derived: -midp(A,c9,c11) | eqangle(c1,c9,c1,c11,c7,c9,c7,A). [resolve(112,a,106,a)]. 1.00/1.31 Derived: -eqangle(c1,A,c1,c9,c11,c1,c11,c9) | perp(c7,c1,c1,A). [resolve(112,a,107,a)]. 1.00/1.31 113 circle(c7,c1,c2,c6) # label(exemplo6GDDFULL012017) # label(negated_conjecture). [clausify(95)]. 1.00/1.31 Derived: -cong(c7,c1,c7,A) | -cong(B,c1,B,c2) | B = c7 | cong(f6(c1,c2,c6,A,c7,B),B,B,c1). [resolve(113,a,96,d)]. 1.00/1.31 Derived: -cong(c7,c1,c7,A) | -cong(B,c1,B,c2) | B = c7 | cong(f7(c1,c2,c6,A,c7,B),B,B,c1). [resolve(113,a,98,d)]. 1.00/1.31 Derived: -cong(c7,c1,c7,A) | -cong(B,c1,B,c2) | B = c7 | coll(f7(c1,c2,c6,A,c7,B),c2,A). [resolve(113,a,99,d)]. 1.00/1.31 Derived: -cong(c7,c1,c7,A) | -cong(B,c1,B,c2) | B = c7 | coll(f6(c1,c2,c6,A,c7,B),c1,c6). [resolve(113,a,100,d)]. 5.81/6.13 Derived: perp(f8(c1,c2,c6,c7),c1,c1,c7). [resolve(113,a,101,a)]. 5.81/6.13 Derived: -perp(c7,c1,c1,A) | eqangle(c1,A,c1,c2,c6,c1,c6,c2). [resolve(113,a,102,a)]. 5.81/6.13 Derived: -coll(c7,c1,c6) | perp(c1,c2,c2,c6). [resolve(113,a,104,a)]. 5.81/6.13 Derived: -eqangle(c1,c2,c1,c6,c7,c2,c7,A) | -coll(A,c2,c6) | midp(A,c2,c6). [resolve(113,a,105,c)]. 5.81/6.13 Derived: -midp(A,c2,c6) | eqangle(c1,c2,c1,c6,c7,c2,c7,A). [resolve(113,a,106,a)]. 5.81/6.13 Derived: -eqangle(c1,A,c1,c2,c6,c1,c6,c2) | perp(c7,c1,c1,A). [resolve(113,a,107,a)]. 5.81/6.13 114 circle(c4,c1,c5,c10) # label(exemplo6GDDFULL012017) # label(negated_conjecture). [clausify(95)]. 5.81/6.13 Derived: -cong(c4,c1,c4,A) | -cong(B,c1,B,c5) | B = c4 | cong(f6(c1,c5,c10,A,c4,B),B,B,c1). [resolve(114,a,96,d)]. 5.81/6.13 Derived: -cong(c4,c1,c4,A) | -cong(B,c1,B,c5) | B = c4 | cong(f7(c1,c5,c10,A,c4,B),B,B,c1). [resolve(114,a,98,d)]. 5.81/6.13 Derived: -cong(c4,c1,c4,A) | -cong(B,c1,B,c5) | B = c4 | coll(f7(c1,c5,c10,A,c4,B),c5,A). [resolve(114,a,99,d)]. 5.81/6.13 Derived: -cong(c4,c1,c4,A) | -cong(B,c1,B,c5) | B = c4 | coll(f6(c1,c5,c10,A,c4,B),c1,c10). [resolve(114,a,100,d)]. 5.81/6.14 Derived: perp(f8(c1,c5,c10,c4),c1,c1,c4). [resolve(114,a,101,a)]. 5.81/6.14 Derived: -perp(c4,c1,c1,A) | eqangle(c1,A,c1,c5,c10,c1,c10,c5). [resolve(114,a,102,a)]. 5.81/6.14 Derived: -coll(c4,c1,c10) | perp(c1,c5,c5,c10). [resolve(114,a,104,a)]. 5.81/6.14 Derived: -eqangle(c1,c5,c1,c10,c4,c5,c4,A) | -coll(A,c5,c10) | midp(A,c5,c10). [resolve(114,a,105,c)]. 5.81/6.14 Derived: -midp(A,c5,c10) | eqangle(c1,c5,c1,c10,c4,c5,c4,A). [resolve(114,a,106,a)]. 5.81/6.14 Derived: -eqangle(c1,A,c1,c5,c10,c1,c10,c5) | perp(c4,c1,c1,A). [resolve(114,a,107,a)]. 5.81/6.14 5.81/6.14 ============================== end predicate elimination ============= 5.81/6.14 5.81/6.14 Auto_denials: (non-Horn, no changes). 5.81/6.14 5.81/6.14 Term ordering decisions: 5.81/6.14 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. c9=1. c10=1. c11=1. c12=1. f4=1. f2=1. f5=1. f8=1. f9=1. f13=1. f16=1. f19=1. f20=1. f1=1. f11=1. f14=1. f15=1. f18=1. f3=1. f6=1. f7=1. f17=1. f10=1. f12=1. 5.81/6.14 5.81/6.14 ============================== end of process initial clauses ======== 5.81/6.14 5.81/6.14 ============================== CLAUSES FOR SEARCH ==================== 5.81/6.14 5.81/6.14 ============================== end of clauses for search ============= 5.81/6.14 5.81/6.14 ============================== SEARCH ================================ 5.81/6.14 5.81/6.14 % Starting search at 0.04 seconds. 5.81/6.14 5.81/6.14 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 2147483647 (0.00 of 0.11 sec). 5.81/6.14 5.81/6.14 Low Water (keep): wt=26.000, iters=3420 5.81/6.14 5.81/6.14 Low Water (keep): wt=22.000, iters=3363 5.81/6.14 5.81/6.14 Low Water (keep): wt=21.000, iters=3342 5.81/6.14 5.81/6.14 Low Water (keep): wt=18.000, iters=3340 5.81/6.14 5.81/6.14 Low Water (keep): wt=17.000, iters=3336 5.81/6.14 5.81/6.14 Low Water (keep): wt=16.000, iters=3336 5.81/6.14 5.81/6.14 Low Water (displace): id=7584, wt=57.000 5.81/6.14 5.81/6.14 Low Water (displace): id=14090, wt=12.000 5.81/6.14 5.81/6.14 Low Water (keep): wt=14.000, iters=3797 5.81/6.14 5.81/6.14 Low Water (keep): wt=13.000, iters=3667 5.81/6.14 5.81/6.14 Low Water (keep): wt=12.000, iters=3333 5.81/6.14 5.81/6.14 ============================== PROOF ================================= 5.81/6.14 % SZS status Theorem 5.81/6.14 % SZS output start Refutation 5.81/6.14 5.81/6.14 % Proof 1 at 4.79 (+ 0.06) seconds. 5.81/6.14 % Length of proof is 74. 5.81/6.14 % Level of proof is 17. 5.81/6.14 % Maximum clause weight is 18.000. 5.81/6.14 % Given clauses 7943. 5.81/6.14 5.81/6.14 10 (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]. 5.81/6.14 13 (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]. 5.81/6.14 18 (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]. 5.81/6.14 19 (all A all B all C all D (coll(A,B,D) & coll(A,B,C) -> coll(C,D,A))) # label(ruleD3) # label(axiom) # label(non_clause). [assumption]. 5.81/6.14 24 (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]. 5.81/6.14 27 (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]. 5.81/6.14 39 (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]. 5.81/6.14 43 (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]. 5.81/6.14 55 (all A all B all C (para(A,B,A,C) -> coll(A,B,C))) # label(ruleD66) # label(axiom) # label(non_clause). [assumption]. 5.81/6.14 65 (all A all B all P all Q (coll(P,Q,B) & eqangle(P,A,P,B,Q,A,Q,B) -> cyclic(A,B,P,Q))) # label(ruleD42b) # label(axiom) # label(non_clause). [assumption]. 5.81/6.14 71 (all A all B all C all D all E (cyclic(A,B,C,E) & cyclic(A,B,C,D) -> cyclic(B,C,D,E))) # label(ruleD17) # label(axiom) # label(non_clause). [assumption]. 5.81/6.14 83 (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]. 5.81/6.14 85 (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]. 5.81/6.14 87 (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]. 5.81/6.14 92 (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]. 5.81/6.14 95 -(all A all C all K all O all N all B all G all O1 all M all NWPNT1 all NWPNT2 all NWPNT3 (circle(O,A,C,K) & coll(B,A,K) & coll(B,C,N) & circle(O1,K,N,B) & circle(O1,K,M,NWPNT3) & circle(G,A,M,NWPNT2) & circle(G,A,C,B) & circle(O,A,N,NWPNT1) -> cyclic(M,K,O,C))) # label(exemplo6GDDFULL012017) # label(negated_conjecture) # label(non_clause). [assumption]. 5.81/6.14 101 -circle(A,B,C,D) | perp(f8(B,C,D,A),B,B,A) # label(ruleX11) # label(axiom). [clausify(27)]. 5.81/6.14 109 circle(c4,c1,c2,c3) # label(exemplo6GDDFULL012017) # label(negated_conjecture). [clausify(95)]. 5.81/6.14 128 -eqangle(A,B,C,D,E,F,C,D) | para(A,B,E,F) # label(ruleD39) # label(axiom). [clausify(10)]. 5.81/6.14 131 -para(A,B,C,D) | para(C,D,A,B) # label(ruleD5) # label(axiom). [clausify(13)]. 5.81/6.14 137 -cyclic(A,B,C,D) | cyclic(A,B,D,C) # label(ruleD14) # label(axiom). [clausify(18)]. 5.81/6.14 138 -coll(A,B,C) | -coll(A,B,D) | coll(D,C,A) # label(ruleD3) # label(axiom). [clausify(19)]. 5.81/6.14 141 -perp(A,B,C,D) | perp(C,D,A,B) # label(ruleD8) # label(axiom). [clausify(24)]. 5.81/6.14 156 -cyclic(A,B,C,D) | cyclic(B,A,C,D) # label(ruleD16) # label(axiom). [clausify(39)]. 5.81/6.14 161 -para(A,B,C,D) | eqangle(A,B,E,F,C,D,E,F) # label(ruleD40) # label(axiom). [clausify(43)]. 5.81/6.14 172 -para(A,B,A,C) | coll(A,B,C) # label(ruleD66) # label(axiom). [clausify(55)]. 5.81/6.14 181 -coll(A,B,C) | -eqangle(A,D,A,C,B,D,B,C) | cyclic(D,C,A,B) # label(ruleD42b) # label(axiom). [clausify(65)]. 5.81/6.14 186 -cyclic(A,B,C,D) | -cyclic(A,B,C,E) | cyclic(B,C,E,D) # label(ruleD17) # label(axiom). [clausify(71)]. 5.81/6.14 201 -perp(A,B,C,D) | -perp(C,D,E,F) | para(A,B,E,F) # label(ruleD9) # label(axiom). [clausify(83)]. 5.81/6.14 202 -eqangle(A,B,C,D,E,F,V6,V7) | eqangle(C,D,A,B,V6,V7,E,F) # label(ruleD19) # label(axiom). [clausify(85)]. 5.81/6.14 204 -cyclic(A,B,C,D) | cyclic(A,C,B,D) # label(ruleD15) # label(axiom). [clausify(87)]. 5.81/6.14 209 -para(A,B,C,D) | para(A,B,D,C) # label(ruleD4) # label(axiom). [clausify(92)]. 5.81/6.14 216 -cyclic(c9,c3,c4,c2) # label(exemplo6GDDFULL012017) # label(negated_conjecture). [clausify(95)]. 5.81/6.14 263 perp(f8(c1,c2,c3,c4),c1,c1,c4). [resolve(109,a,101,a)]. 5.81/6.14 347 -coll(A,B,C) | coll(C,C,A). [factor(138,a,b)]. 5.81/6.14 362 -cyclic(A,B,C,D) | cyclic(B,C,D,D). [factor(186,a,b)]. 5.81/6.14 419 -perp(A,B,f8(c1,c2,c3,c4),c1) | para(A,B,c1,c4). [resolve(263,a,201,b)]. 5.81/6.14 427 perp(c1,c4,f8(c1,c2,c3,c4),c1). [resolve(263,a,141,a)]. 5.81/6.14 765 para(c1,c4,c1,c4). [resolve(427,a,419,a)]. 5.81/6.14 961 para(c1,c4,c4,c1). [resolve(765,a,209,a)]. 5.81/6.14 963 coll(c1,c4,c4). [resolve(765,a,172,a)]. 5.81/6.14 964 eqangle(c1,c4,A,B,c1,c4,A,B). [resolve(765,a,161,a)]. 5.81/6.14 972 coll(c4,c4,c1). [resolve(963,a,347,a)]. 5.81/6.14 980 coll(c1,c1,c4). [resolve(972,a,347,a)]. 5.81/6.14 1280 para(c4,c1,c1,c4). [resolve(961,a,131,a)]. 5.81/6.14 1680 para(c4,c1,c4,c1). [resolve(1280,a,209,a)]. 5.81/6.14 1773 eqangle(c4,c1,A,B,c4,c1,A,B). [resolve(1680,a,161,a)]. 5.81/6.14 3307 eqangle(A,B,c1,c4,A,B,c1,c4). [resolve(964,a,202,a)]. 5.81/6.14 10214 -coll(c4,c4,A) | cyclic(c1,A,c4,c4). [resolve(1773,a,181,b)]. 5.81/6.14 17602 cyclic(A,c4,c1,c1). [resolve(3307,a,181,b),unit_del(a,980)]. 5.81/6.14 17605 para(A,B,A,B). [resolve(3307,a,128,a)]. 5.81/6.14 17608 cyclic(c4,c1,c1,c1). [resolve(17602,a,362,a)]. 5.81/6.14 17610 cyclic(A,c1,c4,c1). [resolve(17602,a,204,a)]. 5.81/6.14 17613 cyclic(c4,A,c1,c1). [resolve(17602,a,156,a)]. 5.81/6.14 17618 coll(A,B,B). [resolve(17605,a,172,a)]. 5.81/6.14 17694 coll(A,A,B). [resolve(17618,a,347,a)]. 5.81/6.14 17837 cyclic(c1,A,c4,c4). [back_unit_del(10214),unit_del(a,17694)]. 5.81/6.14 18361 -cyclic(c4,c1,c1,A) | cyclic(c1,c1,A,c1). [resolve(17608,a,186,a)]. 5.81/6.14 18374 cyclic(c1,A,c4,c1). [resolve(17610,a,156,a)]. 5.81/6.14 18401 cyclic(c4,c1,A,c1). [resolve(17613,a,204,a)]. 5.81/6.14 18470 cyclic(c1,c4,A,c4). [resolve(17837,a,204,a)]. 5.81/6.14 18618 cyclic(c1,c4,A,c1). [resolve(18374,a,204,a)]. 5.81/6.14 18783 cyclic(c4,c1,c1,A). [resolve(18401,a,137,a)]. 5.81/6.14 18785 cyclic(c1,c1,A,c1). [back_unit_del(18361),unit_del(a,18783)]. 5.81/6.14 18901 cyclic(c4,c1,A,c4). [resolve(18470,a,156,a)]. 5.81/6.14 19039 cyclic(c1,c4,c1,A). [resolve(18618,a,137,a)]. 5.81/6.14 19087 cyclic(c1,c1,A,B). [resolve(18783,a,186,b),unit_del(a,18783)]. 5.81/6.14 19097 cyclic(c1,A,c1,B). [resolve(18785,a,186,b),unit_del(a,19087)]. 5.81/6.14 19416 -cyclic(c4,c1,A,B) | cyclic(c1,A,B,c4). [resolve(18901,a,186,a)]. 5.81/6.14 19631 cyclic(c4,c1,A,B). [resolve(19039,a,186,b),unit_del(a,19097)]. 5.81/6.14 19635 cyclic(c1,A,B,c4). [back_unit_del(19416),unit_del(a,19631)]. 5.81/6.14 19656 cyclic(c1,A,B,C). [resolve(19087,a,186,b),unit_del(a,19087)]. 5.81/6.14 20242 cyclic(A,B,c4,C). [resolve(19635,a,186,b),unit_del(a,19656)]. 5.81/6.14 20243 $F. [resolve(20242,a,216,a)]. 5.81/6.14 5.81/6.14 % SZS output end Refutation 5.81/6.14 ============================== end of proof ========================== 5.81/6.14 5.81/6.14 ============================== STATISTICS ============================ 5.81/6.14 5.81/6.14 Given=7943. Generated=81572. Kept=20096. proofs=1. 5.81/6.14 Usable=6722. Sos=6802. Demods=0. Limbo=2, Disabled=6781. Hints=0. 5.81/6.14 Megabytes=15.80. 5.81/6.14 User_CPU=4.79, System_CPU=0.06, Wall_clock=5. 5.81/6.14 5.81/6.14 ============================== end of statistics ===================== 5.81/6.14 5.81/6.14 ============================== end of search ========================= 5.81/6.14 5.81/6.14 THEOREM PROVED 5.81/6.14 % SZS status Theorem 5.81/6.14 5.81/6.14 Exiting with 1 proof. 5.81/6.14 5.81/6.14 Process 6033 exit (max_proofs) Mon Jul 3 05:50:21 2023 5.81/6.14 Prover9 interrupted 5.81/6.14 EOF