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.13/0.34 % Computer : n028.cluster.edu 0.13/0.34 % Model : x86_64 x86_64 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.34 % Memory : 8042.1875MB 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.34 % CPULimit : 1440 0.13/0.34 % WCLimit : 180 0.13/0.34 % DateTime : Mon Jul 3 03:38:43 EDT 2023 0.13/0.34 % CPUTime : 0.80/1.12 ============================== Prover9 =============================== 0.80/1.12 Prover9 (32) version 2009-11A, November 2009. 0.80/1.12 Process 19748 was started by sandbox on n028.cluster.edu, 0.80/1.12 Mon Jul 3 03:38:44 2023 0.80/1.12 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1440 -f /tmp/Prover9_19591_n028.cluster.edu". 0.80/1.12 ============================== end of head =========================== 0.80/1.12 0.80/1.12 ============================== INPUT ================================= 0.80/1.12 0.80/1.12 % Reading from file /tmp/Prover9_19591_n028.cluster.edu 0.80/1.12 0.80/1.12 set(prolog_style_variables). 0.80/1.12 set(auto2). 0.80/1.12 % set(auto2) -> set(auto). 0.80/1.12 % set(auto) -> set(auto_inference). 0.80/1.12 % set(auto) -> set(auto_setup). 0.80/1.12 % set(auto_setup) -> set(predicate_elim). 0.80/1.12 % set(auto_setup) -> assign(eq_defs, unfold). 0.80/1.12 % set(auto) -> set(auto_limits). 0.80/1.12 % set(auto_limits) -> assign(max_weight, "100.000"). 0.80/1.12 % set(auto_limits) -> assign(sos_limit, 20000). 0.80/1.12 % set(auto) -> set(auto_denials). 0.80/1.12 % set(auto) -> set(auto_process). 0.80/1.12 % set(auto2) -> assign(new_constants, 1). 0.80/1.12 % set(auto2) -> assign(fold_denial_max, 3). 0.80/1.12 % set(auto2) -> assign(max_weight, "200.000"). 0.80/1.12 % set(auto2) -> assign(max_hours, 1). 0.80/1.12 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.80/1.12 % set(auto2) -> assign(max_seconds, 0). 0.80/1.12 % set(auto2) -> assign(max_minutes, 5). 0.80/1.12 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.80/1.12 % set(auto2) -> set(sort_initial_sos). 0.80/1.12 % set(auto2) -> assign(sos_limit, -1). 0.80/1.12 % set(auto2) -> assign(lrs_ticks, 3000). 0.80/1.12 % set(auto2) -> assign(max_megs, 400). 0.80/1.12 % set(auto2) -> assign(stats, some). 0.80/1.12 % set(auto2) -> clear(echo_input). 0.80/1.12 % set(auto2) -> set(quiet). 0.80/1.12 % set(auto2) -> clear(print_initial_clauses). 0.80/1.12 % set(auto2) -> clear(print_given). 0.80/1.12 assign(lrs_ticks,-1). 0.80/1.12 assign(sos_limit,10000). 0.80/1.12 assign(order,kbo). 0.80/1.12 set(lex_order_vars). 0.80/1.12 clear(print_given). 0.80/1.12 0.80/1.12 % formulas(sos). % not echoed (95 formulas) 0.80/1.12 0.80/1.12 ============================== end of input ========================== 0.80/1.12 0.80/1.12 % From the command line: assign(max_seconds, 1440). 0.80/1.12 0.80/1.12 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.80/1.12 0.80/1.12 % Formulas that are not ordinary clauses: 0.80/1.12 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]. 0.80/1.12 2 (all A all B all C (midp(A,B,C) -> coll(A,B,C))) # label(ruleD69) # label(axiom) # label(non_clause). [assumption]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 5 (all A all B all C (coll(A,B,C) -> coll(B,A,C))) # label(ruleD2) # label(axiom) # label(non_clause). [assumption]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 16 (all A all B all M (midp(M,B,A) -> midp(M,A,B))) # label(ruleD11) # label(axiom) # label(non_clause). [assumption]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/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.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 55 (all A all B all C (para(A,B,A,C) -> coll(A,B,C))) # label(ruleD66) # label(axiom) # label(non_clause). [assumption]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 63 (all A all B all C (coll(A,B,C) -> coll(A,C,B))) # label(ruleD1) # label(axiom) # label(non_clause). [assumption]. 0.80/1.12 64 (all A all B all C (midp(A,B,C) -> cong(A,B,A,C))) # label(ruleD68) # label(axiom) # label(non_clause). [assumption]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.12 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]. 0.80/1.13 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]. 0.80/1.13 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]. 0.80/1.13 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]. 0.80/1.13 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]. 0.80/1.13 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]. 0.80/1.13 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]. 0.80/1.13 95 -(all A all B all C all O all I all E all J all L (coll(I,A,O) & perp(A,O,A,E) & perp(J,C,A,E) & coll(J,A,E) & coll(L,B,O) & perp(L,C,B,O) & perp(I,C,A,O) & eqangle(O,C,C,A,O,C,C,B) & eqangle(O,B,B,C,O,B,B,A) & eqangle(O,A,A,B,O,A,A,C) -> coll(I,L,J))) # label(exemplo6GDDFULL8110982) # label(negated_conjecture) # label(non_clause). [assumption]. 0.80/1.13 0.80/1.13 ============================== end of process non-clausal formulas === 0.80/1.13 0.80/1.13 ============================== PROCESS INITIAL CLAUSES =============== 0.80/1.13 0.80/1.13 ============================== PREDICATE ELIMINATION ================= 0.80/1.13 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)]. 0.80/1.13 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)]. 0.80/1.13 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)]. 0.80/1.13 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)]. 0.80/1.13 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)]. 0.80/1.13 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)]. 0.80/1.13 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)]. 0.80/1.13 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)]. 0.80/1.13 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)]. 0.80/1.13 101 -circle(A,B,C,D) | perp(f8(B,C,D,A),B,B,A) # label(ruleX11) # label(axiom). [clausify(27)]. 0.80/1.13 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)]. 0.80/1.13 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)]. 0.80/1.13 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)]. 0.80/1.13 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)]. 0.80/1.13 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)]. 0.80/1.13 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)]. 0.80/1.13 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)]. 0.85/1.15 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)]. 0.85/1.15 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)]. 0.85/1.15 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)]. 0.85/1.15 104 -circle(A,B,C,D) | -coll(A,B,D) | perp(B,C,C,D) # label(ruleD53) # label(axiom). [clausify(56)]. 0.85/1.15 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)]. 0.85/1.15 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)]. 0.85/1.15 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)]. 0.85/1.15 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)]. 0.85/1.15 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)]. 0.85/1.15 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)]. 0.85/1.15 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)]. 0.85/1.15 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)]. 0.85/1.15 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)]. 0.85/1.15 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)]. 0.85/1.15 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)]. 0.85/1.15 108 -cong(A,B,A,C) | -cong(A,B,A,D) | circle(A,B,C,D) # label(ruleD12) # label(axiom). [clausify(94)]. 0.85/1.15 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)]. 0.85/1.15 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)]. 0.85/1.15 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)]. 0.85/1.15 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)]. 0.85/1.15 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)]. 0.85/1.15 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)]. 0.85/1.15 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)]. 0.85/1.15 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)]. 0.85/1.15 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)]. 0.85/1.15 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)]. 0.85/1.15 0.85/1.15 ============================== end predicate elimination ============= 0.85/1.15 0.85/1.15 Auto_denials: (non-Horn, no changes). 0.85/1.15 0.85/1.15 Term ordering decisions: 0.85/1.15 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=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. 0.85/1.15 0.85/1.15 ============================== end of process initial clauses ======== 0.85/1.15 0.85/1.15 ============================== CLAUSES FOR SEARCH ==================== 0.85/1.15 0.85/1.15 ============================== end of clauses for search ============= 0.85/1.15 0.85/1.15 ============================== SEARCH ================================ 0.85/1.15 0.85/1.15 % Starting search at 0.05 seconds. 0.85/1.38 0.85/1.38 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 1770 (0.00 of 0.16 sec). 0.85/1.38 0.85/1.38 ============================== PROOF ================================= 0.85/1.38 % SZS status Theorem 0.85/1.38 % SZS output start Refutation 0.85/1.38 0.85/1.38 % Proof 1 at 0.28 (+ 0.01) seconds. 0.85/1.38 % Length of proof is 31. 0.85/1.38 % Level of proof is 13. 0.85/1.38 % Maximum clause weight is 12.000. 0.85/1.38 % Given clauses 1075. 0.85/1.38 0.85/1.38 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]. 0.85/1.38 63 (all A all B all C (coll(A,B,C) -> coll(A,C,B))) # label(ruleD1) # label(axiom) # label(non_clause). [assumption]. 0.85/1.38 95 -(all A all B all C all O all I all E all J all L (coll(I,A,O) & perp(A,O,A,E) & perp(J,C,A,E) & coll(J,A,E) & coll(L,B,O) & perp(L,C,B,O) & perp(I,C,A,O) & eqangle(O,C,C,A,O,C,C,B) & eqangle(O,B,B,C,O,B,B,A) & eqangle(O,A,A,B,O,A,A,C) -> coll(I,L,J))) # label(exemplo6GDDFULL8110982) # label(negated_conjecture) # label(non_clause). [assumption]. 0.85/1.38 132 -coll(A,B,C) | -coll(A,B,D) | coll(D,C,A) # label(ruleD3) # label(axiom). [clausify(19)]. 0.85/1.38 173 -coll(A,B,C) | coll(A,C,B) # label(ruleD1) # label(axiom). [clausify(63)]. 0.85/1.38 208 coll(c5,c1,c4) # label(exemplo6GDDFULL8110982) # label(negated_conjecture). [clausify(95)]. 0.85/1.38 211 coll(c7,c1,c6) # label(exemplo6GDDFULL8110982) # label(negated_conjecture). [clausify(95)]. 0.85/1.38 212 coll(c8,c2,c4) # label(exemplo6GDDFULL8110982) # label(negated_conjecture). [clausify(95)]. 0.85/1.38 218 -coll(c5,c8,c7) # label(exemplo6GDDFULL8110982) # label(negated_conjecture). [clausify(95)]. 0.85/1.38 265 -coll(A,B,C) | coll(C,C,A). [factor(132,a,b)]. 0.85/1.38 320 coll(c5,c4,c1). [resolve(208,a,173,a)]. 0.85/1.38 322 -coll(c5,c1,A) | coll(A,c4,c5). [resolve(208,a,132,a)]. 0.85/1.38 352 coll(c7,c6,c1). [resolve(211,a,173,a)]. 0.85/1.38 417 coll(c4,c4,c8). [resolve(265,a,212,a)]. 0.85/1.38 419 coll(c4,c4,c5). [resolve(265,a,208,a)]. 0.85/1.38 420 coll(c1,c1,c5). [resolve(320,a,265,a)]. 0.85/1.38 428 coll(c1,c1,c7). [resolve(352,a,265,a)]. 0.85/1.38 446 -coll(c4,c4,A) | coll(c8,A,c4). [resolve(417,a,132,b)]. 0.85/1.38 458 -coll(c1,c1,A) | coll(c5,A,c1). [resolve(420,a,132,b)]. 0.85/1.38 1545 coll(c8,c5,c4). [resolve(446,a,419,a)]. 0.85/1.38 1550 coll(c8,c4,c5). [resolve(1545,a,173,a)]. 0.85/1.38 1566 -coll(c8,c4,A) | coll(c5,A,c8). [resolve(1550,a,132,b)]. 0.85/1.38 2715 coll(c5,c7,c1). [resolve(458,a,428,a)]. 0.85/1.38 2725 coll(c5,c1,c7). [resolve(2715,a,173,a)]. 0.85/1.38 2740 coll(c7,c4,c5). [resolve(2725,a,322,a)]. 0.85/1.38 2771 coll(c7,c5,c4). [resolve(2740,a,173,a)]. 0.85/1.38 2830 coll(c4,c4,c7). [resolve(2771,a,265,a)]. 0.85/1.38 2891 coll(c8,c7,c4). [resolve(2830,a,446,a)]. 0.85/1.38 2947 coll(c8,c4,c7). [resolve(2891,a,173,a)]. 0.85/1.38 3582 coll(c5,c7,c8). [resolve(1566,a,2947,a)]. 0.85/1.38 3585 $F. [resolve(3582,a,173,a),unit_del(a,218)]. 0.85/1.38 0.85/1.38 % SZS output end Refutation 0.85/1.38 ============================== end of proof ========================== 0.85/1.38 0.85/1.38 ============================== STATISTICS ============================ 0.85/1.38 0.85/1.38 Given=1075. Generated=6273. Kept=3468. proofs=1. 0.85/1.38 Usable=1075. Sos=2334. Demods=0. Limbo=0, Disabled=213. Hints=0. 0.85/1.38 Megabytes=3.01. 0.85/1.38 User_CPU=0.28, System_CPU=0.01, Wall_clock=0. 0.85/1.38 0.85/1.38 ============================== end of statistics ===================== 0.85/1.38 0.85/1.38 ============================== end of search ========================= 0.85/1.38 0.85/1.38 THEOREM PROVED 0.85/1.38 % SZS status Theorem 0.85/1.38 0.85/1.38 Exiting with 1 proof. 0.85/1.38 0.85/1.38 Process 19748 exit (max_proofs) Mon Jul 3 03:38:44 2023 0.85/1.38 Prover9 interrupted 0.85/1.38 EOF