0.00/0.09 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.10 % Command : tptp2X_and_run_prover9 %d %s 0.09/0.29 % Computer : n028.cluster.edu 0.09/0.29 % Model : x86_64 x86_64 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.09/0.29 % Memory : 8042.1875MB 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64 0.09/0.29 % CPULimit : 1200 0.09/0.29 % DateTime : Tue Jul 13 14:37:16 EDT 2021 0.09/0.30 % CPUTime : 1.93/2.30 ============================== Prover9 =============================== 1.93/2.30 Prover9 (32) version 2009-11A, November 2009. 1.93/2.30 Process 3073 was started by sandbox2 on n028.cluster.edu, 1.93/2.30 Tue Jul 13 14:37:18 2021 1.93/2.30 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1200 -f /tmp/Prover9_2917_n028.cluster.edu". 1.93/2.30 ============================== end of head =========================== 1.93/2.30 1.93/2.30 ============================== INPUT ================================= 1.93/2.30 1.93/2.30 % Reading from file /tmp/Prover9_2917_n028.cluster.edu 1.93/2.30 1.93/2.30 set(prolog_style_variables). 1.93/2.30 set(auto2). 1.93/2.30 % set(auto2) -> set(auto). 1.93/2.30 % set(auto) -> set(auto_inference). 1.93/2.30 % set(auto) -> set(auto_setup). 1.93/2.30 % set(auto_setup) -> set(predicate_elim). 1.93/2.30 % set(auto_setup) -> assign(eq_defs, unfold). 1.93/2.30 % set(auto) -> set(auto_limits). 1.93/2.30 % set(auto_limits) -> assign(max_weight, "100.000"). 1.93/2.30 % set(auto_limits) -> assign(sos_limit, 20000). 1.93/2.30 % set(auto) -> set(auto_denials). 1.93/2.30 % set(auto) -> set(auto_process). 1.93/2.30 % set(auto2) -> assign(new_constants, 1). 1.93/2.30 % set(auto2) -> assign(fold_denial_max, 3). 1.93/2.30 % set(auto2) -> assign(max_weight, "200.000"). 1.93/2.30 % set(auto2) -> assign(max_hours, 1). 1.93/2.30 % assign(max_hours, 1) -> assign(max_seconds, 3600). 1.93/2.30 % set(auto2) -> assign(max_seconds, 0). 1.93/2.30 % set(auto2) -> assign(max_minutes, 5). 1.93/2.30 % assign(max_minutes, 5) -> assign(max_seconds, 300). 1.93/2.30 % set(auto2) -> set(sort_initial_sos). 1.93/2.30 % set(auto2) -> assign(sos_limit, -1). 1.93/2.30 % set(auto2) -> assign(lrs_ticks, 3000). 1.93/2.30 % set(auto2) -> assign(max_megs, 400). 1.93/2.30 % set(auto2) -> assign(stats, some). 1.93/2.30 % set(auto2) -> clear(echo_input). 1.93/2.30 % set(auto2) -> set(quiet). 1.93/2.30 % set(auto2) -> clear(print_initial_clauses). 1.93/2.30 % set(auto2) -> clear(print_given). 1.93/2.30 assign(lrs_ticks,-1). 1.93/2.30 assign(sos_limit,10000). 1.93/2.30 assign(order,kbo). 1.93/2.30 set(lex_order_vars). 1.93/2.30 clear(print_given). 1.93/2.30 1.93/2.30 % formulas(sos). % not echoed (95 formulas) 1.93/2.30 1.93/2.30 ============================== end of input ========================== 1.93/2.30 1.93/2.30 % From the command line: assign(max_seconds, 1200). 1.93/2.30 1.93/2.30 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 1.93/2.30 1.93/2.30 % Formulas that are not ordinary clauses: 1.93/2.30 1 (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.93/2.30 2 (all A all B all C all H exists P exists Q (perp(A,H,B,C) & perp(B,H,A,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.93/2.30 3 (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.93/2.30 4 (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.93/2.30 5 (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.93/2.30 6 (all A all B all C all O all M (circle(O,A,B,C) & eqangle(A,B,A,C,O,B,O,M) & coll(M,B,C) -> midp(M,B,C))) # label(ruleD51) # label(axiom) # label(non_clause). [assumption]. 1.93/2.30 7 (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.93/2.30 8 (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.93/2.30 9 (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]. 1.93/2.30 10 (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.93/2.30 11 (all A all B all C all D all O (cong(O,A,O,D) & cong(O,A,O,C) & cong(O,A,O,B) -> cyclic(A,B,C,D))) # label(ruleD13) # label(axiom) # label(non_clause). [assumption]. 1.93/2.30 12 (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.93/2.30 13 (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.93/2.30 14 (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]. 1.93/2.30 15 (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.93/2.30 16 (all A all B all C all D all M exists P (perp(C,A,C,D) & midp(M,B,D) & perp(A,B,A,C) -> midp(P,A,C))) # label(ruleX16) # label(axiom) # label(non_clause). [assumption]. 1.93/2.30 17 (all A all B all C (coll(A,B,C) -> coll(B,A,C))) # label(ruleD2) # label(axiom) # label(non_clause). [assumption]. 1.93/2.30 18 (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.93/2.30 19 (all A all B all C all D all E all F (cong(C,D,E,F) & cong(A,B,C,D) -> cong(A,B,E,F))) # label(ruleD25) # label(axiom) # label(non_clause). [assumption]. 1.93/2.30 20 (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.93/2.30 21 (all A all B all O all X exists M (eqangle(A,O,O,X,O,X,O,B) & cong(O,A,O,B) -> coll(M,O,X) & coll(B,A,M))) # label(ruleX2) # label(axiom) # label(non_clause). [assumption]. 1.93/2.30 22 (all A all B all C (midp(A,B,C) -> cong(A,B,A,C))) # label(ruleD68) # label(axiom) # label(non_clause). [assumption]. 1.93/2.30 23 (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.93/2.30 24 (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.93/2.30 25 (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]. 1.93/2.30 26 (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.93/2.30 27 (all A all B all C all D all P all Q exists R (coll(P,A,C) & coll(P,B,D) & coll(Q,A,B) & para(A,B,C,D) -> coll(P,Q,R) & coll(R,C,D))) # label(ruleX18) # label(axiom) # label(non_clause). [assumption]. 1.93/2.30 28 (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]. 1.93/2.30 29 (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.93/2.30 30 (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.93/2.30 31 (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.93/2.30 32 (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]. 1.93/2.30 33 (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.93/2.30 34 (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.93/2.30 35 (all A all B all C all D all O (coll(O,B,D) & coll(O,A,C) & para(A,B,C,D) -> eqratio(O,A,A,C,O,B,B,D))) # label(ruleD65) # label(axiom) # label(non_clause). [assumption]. 1.93/2.30 36 (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]. 1.93/2.30 37 (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.93/2.30 38 (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]. 1.93/2.30 39 (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.93/2.30 40 (all A all B all C all D all P all Q all U all V (cong(P,Q,U,V) & eqratio(A,B,C,D,P,Q,U,V) -> cong(A,B,C,D))) # label(ruleD75) # label(axiom) # label(non_clause). [assumption]. 1.93/2.30 41 (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.93/2.30 42 (all A all B all C all D exists O (cyclic(A,B,C,D) & perp(A,C,C,B) -> circle(O,A,B,C))) # label(ruleX14) # label(axiom) # label(non_clause). [assumption]. 1.93/2.30 43 (all A all B all C all E all F exists P (coll(B,E,F) & perp(A,C,C,B) -> perp(P,A,E,F) & coll(P,E,F))) # label(ruleX15) # label(axiom) # label(non_clause). [assumption]. 1.93/2.30 44 (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.93/2.30 45 (all A all B all C (para(A,B,A,C) -> coll(A,B,C))) # label(ruleD66) # label(axiom) # label(non_clause). [assumption]. 1.93/2.30 46 (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.93/2.30 47 (all A all B all M (midp(M,B,A) -> midp(M,A,B))) # label(ruleD11) # label(axiom) # label(non_clause). [assumption]. 1.93/2.30 48 (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.93/2.30 49 (all A all B all C all D all E all F (perp(C,D,E,F) & perp(A,B,C,D) -> para(A,B,E,F))) # label(ruleD9) # label(axiom) # label(non_clause). [assumption]. 1.93/2.30 50 (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.93/2.30 51 (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.93/2.30 52 (all A all B all C all D all E all F (perp(C,D,E,F) & para(A,B,C,D) -> perp(A,B,E,F))) # label(ruleD10) # label(axiom) # label(non_clause). [assumption]. 1.93/2.30 53 (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]. 1.93/2.30 54 (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]. 1.93/2.30 55 (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]. 1.93/2.30 56 (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.93/2.30 57 (all A all B all C all O all M (midp(M,B,C) & circle(O,A,B,C) -> eqangle(A,B,A,C,O,B,O,M))) # label(ruleD50) # label(axiom) # label(non_clause). [assumption]. 1.93/2.30 58 (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(D,A,B) & coll(C,A,B) -> midp(P,A,Q))) # label(ruleX7) # label(axiom) # label(non_clause). [assumption]. 1.93/2.30 59 (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.93/2.30 60 (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.93/2.30 61 (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.93/2.30 62 (all A all B all C (coll(A,B,C) -> coll(A,C,B))) # label(ruleD1) # label(axiom) # label(non_clause). [assumption]. 1.93/2.30 63 (all A all B all C all D all M all N exists P (midp(M,A,B) & midp(N,C,D) -> para(P,N,A,C) & para(P,M,B,D) & midp(P,A,D))) # label(ruleX6) # label(axiom) # label(non_clause). [assumption]. 1.93/2.30 64 (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.93/2.31 65 (all A all B all C all D (para(A,B,C,D) & cyclic(A,B,C,D) -> eqangle(A,D,C,D,C,D,C,B))) # label(ruleD54) # label(axiom) # label(non_clause). [assumption]. 1.93/2.31 66 (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.93/2.31 67 (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.93/2.31 68 (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.93/2.31 69 (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) & cong(B,C,B,P) & para(P,C,A,B))) # label(ruleX9) # label(axiom) # label(non_clause). [assumption]. 1.93/2.31 70 (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.93/2.31 71 (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]. 1.93/2.31 72 (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.93/2.31 73 (all A all B all C all P all Q all R (cyclic(A,B,C,P) & eqangle(C,A,C,B,R,P,R,Q) & cyclic(A,B,C,R) & cyclic(A,B,C,Q) -> cong(A,B,P,Q))) # label(ruleD43) # label(axiom) # label(non_clause). [assumption]. 1.93/2.31 74 (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]. 1.93/2.31 75 (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.93/2.31 76 (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.93/2.31 77 (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.93/2.31 78 (all A all B all C (midp(A,B,C) -> coll(A,B,C))) # label(ruleD69) # label(axiom) # label(non_clause). [assumption]. 1.93/2.31 79 (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,O,X) & coll(B,A,M))) # label(ruleX1) # label(axiom) # label(non_clause). [assumption]. 1.93/2.31 80 (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.93/2.31 81 (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.93/2.31 82 (all A all B all C all O all X (perp(O,A,A,X) & circle(O,A,B,C) -> eqangle(A,X,A,B,C,A,C,B))) # label(ruleD48) # label(axiom) # label(non_clause). [assumption]. 1.93/2.31 83 (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]. 1.93/2.31 84 (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.93/2.31 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(A,B,P,Q,C,D,U,V))) # label(ruleD21) # label(axiom) # label(non_clause). [assumption]. 1.93/2.31 86 (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.93/2.31 87 (all A all B all C all D all M (midp(M,C,D) & midp(M,A,B) -> para(A,C,B,D))) # label(ruleD63) # label(axiom) # label(non_clause). [assumption]. 1.93/2.31 88 (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.93/2.31 89 (all A all B all M all P all Q all R all M exists X (para(A,P,R,M) & coll(P,Q,R) & para(A,P,B,Q) & midp(M,A,B) -> coll(X,M,R) & coll(X,A,Q))) # label(ruleX8) # label(axiom) # label(non_clause). [assumption]. 1.93/2.31 90 (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) & N != M & circle(M,A,B,C) -> 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]. 1.93/2.31 91 (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]. 1.93/2.31 92 (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.93/2.31 93 (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.93/2.31 94 (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.93/2.31 95 -(all A all B all C all D all E all F all G all H all K all I (coll(D,B,C) & perp(E,B,A,C) & perp(F,C,A,B) & coll(F,A,B) & coll(G,B,C) & perp(H,F,A,C) & coll(H,A,C) & perp(K,E,A,B) & coll(I,A,B) & perp(I,D,A,B) & coll(K,A,B) & perp(G,F,B,C) & coll(E,A,C) & perp(D,A,B,C) -> cyclic(H,K,I,G))) # label(exemplo6GDDFULL012015) # label(negated_conjecture) # label(non_clause). [assumption]. 1.93/2.31 1.93/2.31 ============================== end of process non-clausal formulas === 1.93/2.31 1.93/2.31 ============================== PROCESS INITIAL CLAUSES =============== 1.93/2.31 1.93/2.31 ============================== PREDICATE ELIMINATION ================= 1.93/2.31 96 -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | circle(f6(A,B,C,D,E),A,B,C) # label(ruleX13) # label(axiom). [clausify(26)]. 1.93/2.31 97 -circle(A,B,C,D) | -eqangle(B,C,B,D,A,C,A,E) | -coll(E,C,D) | midp(E,C,D) # label(ruleD51) # label(axiom). [clausify(6)]. 1.93/2.31 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(7)]. 1.93/2.31 Derived: -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B) | -eqangle(A,B,A,C,f6(A,B,C,D,E),B,f6(A,B,C,D,E),F) | -coll(F,B,C) | midp(F,B,C). [resolve(96,d,97,a)]. 1.93/2.31 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(f6(A,B,C,D,E),A,A,F). [resolve(96,d,98,a)]. 1.93/2.31 99 -cong(A,B,A,C) | -cong(A,B,A,D) | circle(A,B,C,D) # label(ruleD12) # label(axiom). [clausify(29)]. 1.93/2.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(99,c,97,a)]. 1.93/2.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(99,c,98,a)]. 1.93/2.31 100 -cyclic(A,B,C,D) | -perp(A,C,C,B) | circle(f10(A,B,C,D),A,B,C) # label(ruleX14) # label(axiom). [clausify(42)]. 1.93/2.31 Derived: -cyclic(A,B,C,D) | -perp(A,C,C,B) | -eqangle(A,B,A,C,f10(A,B,C,D),B,f10(A,B,C,D),E) | -coll(E,B,C) | midp(E,B,C). [resolve(100,c,97,a)]. 1.93/2.31 Derived: -cyclic(A,B,C,D) | -perp(A,C,C,B) | -eqangle(A,E,A,B,C,A,C,B) | perp(f10(A,B,C,D),A,A,E). [resolve(100,c,98,a)]. 1.93/2.31 101 -midp(A,B,C) | -circle(D,E,B,C) | eqangle(E,B,E,C,D,B,D,A) # label(ruleD50) # label(axiom). [clausify(57)]. 1.93/2.31 Derived: -midp(A,B,C) | eqangle(D,B,D,C,f6(D,B,C,E,F),B,f6(D,B,C,E,F),A) | -cyclic(D,B,C,E) | -para(D,B,C,E) | -midp(F,D,B). [resolve(101,b,96,d)]. 1.93/2.31 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(101,b,99,c)]. 1.93/2.31 Derived: -midp(A,B,C) | eqangle(D,B,D,C,f10(D,B,C,E),B,f10(D,B,C,E),A) | -cyclic(D,B,C,E) | -perp(D,C,C,B). [resolve(101,b,100,c)]. 1.93/2.31 102 -circle(A,B,C,D) | -coll(A,B,D) | perp(B,C,C,D) # label(ruleD53) # label(axiom). [clausify(59)]. 1.93/2.31 Derived: -coll(f6(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(102,a,96,d)]. 1.93/2.31 Derived: -coll(A,B,C) | perp(B,D,D,C) | -cong(A,B,A,D) | -cong(A,B,A,C). [resolve(102,a,99,c)]. 1.93/2.31 Derived: -coll(f10(A,B,C,D),A,C) | perp(A,B,B,C) | -cyclic(A,B,C,D) | -perp(A,C,C,B). [resolve(102,a,100,c)]. 1.93/2.31 103 -circle(A,B,C,D) | perp(f16(B,C,D,A),B,B,A) # label(ruleX11) # label(axiom). [clausify(75)]. 1.93/2.31 Derived: perp(f16(A,B,C,f6(A,B,C,D,E)),A,A,f6(A,B,C,D,E)) | -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B). [resolve(103,a,96,d)]. 1.93/2.32 Derived: perp(f16(A,B,C,D),A,A,D) | -cong(D,A,D,B) | -cong(D,A,D,C). [resolve(103,a,99,c)]. 1.93/2.32 Derived: perp(f16(A,B,C,f10(A,B,C,D)),A,A,f10(A,B,C,D)) | -cyclic(A,B,C,D) | -perp(A,C,C,B). [resolve(103,a,100,c)]. 1.93/2.32 104 -perp(A,B,B,C) | -circle(A,B,D,E) | eqangle(B,C,B,D,E,B,E,D) # label(ruleD48) # label(axiom). [clausify(82)]. 1.93/2.32 Derived: -perp(f6(A,B,C,D,E),A,A,F) | eqangle(A,F,A,B,C,A,C,B) | -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B). [resolve(104,b,96,d)]. 1.93/2.32 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(104,b,99,c)]. 1.93/2.32 Derived: -perp(f10(A,B,C,D),A,A,E) | eqangle(A,E,A,B,C,A,C,B) | -cyclic(A,B,C,D) | -perp(A,C,C,B). [resolve(104,b,100,c)]. 1.93/2.32 105 -cong(A,B,A,C) | -cong(D,B,D,E) | D = A | -circle(A,B,E,F) | coll(f19(B,E,F,C,A,D),B,F) # label(ruleX12) # label(axiom). [clausify(90)]. 1.93/2.32 Derived: -cong(f6(A,B,C,D,E),A,f6(A,B,C,D,E),F) | -cong(V6,A,V6,B) | V6 = f6(A,B,C,D,E) | coll(f19(A,B,C,F,f6(A,B,C,D,E),V6),A,C) | -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B). [resolve(105,d,96,d)]. 1.93/2.32 Derived: -cong(A,B,A,C) | -cong(D,B,D,E) | D = A | coll(f19(B,E,F,C,A,D),B,F) | -cong(A,B,A,E) | -cong(A,B,A,F). [resolve(105,d,99,c)]. 1.93/2.32 Derived: -cong(f10(A,B,C,D),A,f10(A,B,C,D),E) | -cong(F,A,F,B) | F = f10(A,B,C,D) | coll(f19(A,B,C,E,f10(A,B,C,D),F),A,C) | -cyclic(A,B,C,D) | -perp(A,C,C,B). [resolve(105,d,100,c)]. 1.93/2.32 106 -cong(A,B,A,C) | -cong(D,B,D,E) | D = A | -circle(A,B,E,F) | cong(f19(B,E,F,C,A,D),D,D,B) # label(ruleX12) # label(axiom). [clausify(90)]. 1.93/2.32 Derived: -cong(f6(A,B,C,D,E),A,f6(A,B,C,D,E),F) | -cong(V6,A,V6,B) | V6 = f6(A,B,C,D,E) | cong(f19(A,B,C,F,f6(A,B,C,D,E),V6),V6,V6,A) | -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B). [resolve(106,d,96,d)]. 1.93/2.32 Derived: -cong(A,B,A,C) | -cong(D,B,D,E) | D = A | cong(f19(B,E,F,C,A,D),D,D,B) | -cong(A,B,A,E) | -cong(A,B,A,F). [resolve(106,d,99,c)]. 1.93/2.32 Derived: -cong(f10(A,B,C,D),A,f10(A,B,C,D),E) | -cong(F,A,F,B) | F = f10(A,B,C,D) | cong(f19(A,B,C,E,f10(A,B,C,D),F),F,F,A) | -cyclic(A,B,C,D) | -perp(A,C,C,B). [resolve(106,d,100,c)]. 1.93/2.32 107 -cong(A,B,A,C) | -cong(D,B,D,E) | D = A | -circle(A,B,E,F) | coll(f20(B,E,F,C,A,D),E,C) # label(ruleX12) # label(axiom). [clausify(90)]. 1.93/2.32 Derived: -cong(f6(A,B,C,D,E),A,f6(A,B,C,D,E),F) | -cong(V6,A,V6,B) | V6 = f6(A,B,C,D,E) | coll(f20(A,B,C,F,f6(A,B,C,D,E),V6),B,F) | -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B). [resolve(107,d,96,d)]. 1.93/2.32 Derived: -cong(A,B,A,C) | -cong(D,B,D,E) | D = A | coll(f20(B,E,F,C,A,D),E,C) | -cong(A,B,A,E) | -cong(A,B,A,F). [resolve(107,d,99,c)]. 1.93/2.32 Derived: -cong(f10(A,B,C,D),A,f10(A,B,C,D),E) | -cong(F,A,F,B) | F = f10(A,B,C,D) | coll(f20(A,B,C,E,f10(A,B,C,D),F),B,E) | -cyclic(A,B,C,D) | -perp(A,C,C,B). [resolve(107,d,100,c)]. 1.93/2.32 108 -cong(A,B,A,C) | -cong(D,B,D,E) | D = A | -circle(A,B,E,F) | cong(f20(B,E,F,C,A,D),D,D,B) # label(ruleX12) # label(axiom). [clausify(90)]. 1.93/2.32 Derived: -cong(f6(A,B,C,D,E),A,f6(A,B,C,D,E),F) | -cong(V6,A,V6,B) | V6 = f6(A,B,C,D,E) | cong(f20(A,B,C,F,f6(A,B,C,D,E),V6),V6,V6,A) | -cyclic(A,B,C,D) | -para(A,B,C,D) | -midp(E,A,B). [resolve(108,d,96,d)]. 1.93/2.32 Derived: -cong(A,B,A,C) | -cong(D,B,D,E) | D = A | cong(f20(B,E,F,C,A,D),D,D,B) | -cong(A,B,A,E) | -cong(A,B,A,F). [resolve(108,d,99,c)]. 1.93/2.32 Derived: -cong(f10(A,B,C,D),A,f10(A,B,C,D),E) | -cong(F,A,F,B) | F = f10(A,B,C,D) | cong(f20(A,B,C,E,f10(A,B,C,D),F),F,F,A) | -cyclic(A,B,C,D) | -perp(A,C,C,B). [resolve(108,d,100,c)]. 1.93/2.32 1.93/2.32 ============================== end predicate elimination ============= 1.93/2.32 1.93/2.32 Auto_denials: (non-Horn, no changes). 1.93/2.32 1.93/2.32 Term ordering decisions: 1.93/2.32 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. c9=1. c10=1. f15=1. f1=1. f2=1. f3=1. f5=1. f8=1. f10=1. f16=1. f17=1. f4=1. f6=1. f9=1. f11=1. f14=1. f7=1. f13=1. f19=1. f20=1. f12=1. f18=1. 1.93/2.32 1.93/2.32 ============================== end of process initial clauses ======== 1.93/2.32 1.93/2.32 ============================== CLAUSES FOR SEARCH ==================== 1.93/2.32 1.93/2.32 ============================== end of clauses for search ============= 1.93/2.32 1.93/2.32 ============================== SEARCH ================================ 4.35/4.81 4.35/4.81 % Starting search at 0.04 seconds. 4.35/4.81 4.35/4.81 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 2147483647 (0.00 of 0.17 sec). 4.35/4.81 4.35/4.81 Low Water (keep): wt=53.000, iters=3335 4.35/4.81 4.35/4.81 ============================== PROOF ================================= 4.35/4.81 % SZS status Theorem 4.35/4.81 % SZS output start Refutation 4.35/4.81 4.35/4.81 % Proof 1 at 2.40 (+ 0.06) seconds. 4.35/4.81 % Length of proof is 46. 4.35/4.81 % Level of proof is 14. 4.35/4.81 % Maximum clause weight is 18.000. 4.35/4.81 % Given clauses 4575. 4.35/4.81 4.35/4.81 14 (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]. 4.35/4.81 17 (all A all B all C (coll(A,B,C) -> coll(B,A,C))) # label(ruleD2) # label(axiom) # label(non_clause). [assumption]. 4.35/4.81 39 (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]. 4.35/4.81 45 (all A all B all C (para(A,B,A,C) -> coll(A,B,C))) # label(ruleD66) # label(axiom) # label(non_clause). [assumption]. 4.35/4.81 49 (all A all B all C all D all E all F (perp(C,D,E,F) & perp(A,B,C,D) -> para(A,B,E,F))) # label(ruleD9) # label(axiom) # label(non_clause). [assumption]. 4.35/4.81 53 (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]. 4.35/4.81 70 (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]. 4.35/4.81 74 (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]. 4.35/4.81 80 (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]. 4.35/4.81 81 (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]. 4.35/4.81 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(A,B,P,Q,C,D,U,V))) # label(ruleD21) # label(axiom) # label(non_clause). [assumption]. 4.35/4.81 95 -(all A all B all C all D all E all F all G all H all K all I (coll(D,B,C) & perp(E,B,A,C) & perp(F,C,A,B) & coll(F,A,B) & coll(G,B,C) & perp(H,F,A,C) & coll(H,A,C) & perp(K,E,A,B) & coll(I,A,B) & perp(I,D,A,B) & coll(K,A,B) & perp(G,F,B,C) & coll(E,A,C) & perp(D,A,B,C) -> cyclic(H,K,I,G))) # label(exemplo6GDDFULL012015) # label(negated_conjecture) # label(non_clause). [assumption]. 4.35/4.81 124 -cyclic(A,B,C,D) | -cyclic(A,B,C,E) | cyclic(B,C,D,E) # label(ruleD17) # label(axiom). [clausify(14)]. 4.35/4.81 127 -coll(A,B,C) | coll(B,A,C) # label(ruleD2) # label(axiom). [clausify(17)]. 4.35/4.81 151 -perp(A,B,C,D) | perp(C,D,A,B) # label(ruleD8) # label(axiom). [clausify(39)]. 4.35/4.81 157 -para(A,B,A,C) | coll(A,B,C) # label(ruleD66) # label(axiom). [clausify(45)]. 4.35/4.81 161 -perp(A,B,C,D) | -perp(E,F,A,B) | para(E,F,C,D) # label(ruleD9) # label(axiom). [clausify(49)]. 4.35/4.81 165 -coll(A,B,C) | -coll(A,B,D) | coll(C,D,A) # label(ruleD3) # label(axiom). [clausify(53)]. 4.35/4.81 183 -para(A,B,C,D) | eqangle(A,B,E,F,C,D,E,F) # label(ruleD40) # label(axiom). [clausify(70)]. 4.35/4.81 188 -eqangle(A,B,A,C,D,B,D,C) | -coll(A,D,C) | cyclic(B,C,A,D) # label(ruleD42b) # label(axiom). [clausify(74)]. 4.35/4.81 194 -eqangle(A,B,C,D,E,F,C,D) | para(A,B,E,F) # label(ruleD39) # label(axiom). [clausify(80)]. 4.35/4.81 195 -eqangle(A,B,C,D,E,F,V6,V7) | eqangle(C,D,A,B,V6,V7,E,F) # label(ruleD19) # label(axiom). [clausify(81)]. 4.35/4.81 198 -eqangle(A,B,C,D,E,F,V6,V7) | eqangle(A,B,E,F,C,D,V6,V7) # label(ruleD21) # label(axiom). [clausify(85)]. 4.35/4.81 209 perp(c5,c2,c1,c3) # label(exemplo6GDDFULL012015) # label(negated_conjecture). [clausify(95)]. 4.35/4.81 214 coll(c8,c1,c3) # label(exemplo6GDDFULL012015) # label(negated_conjecture). [clausify(95)]. 4.35/4.81 222 -cyclic(c8,c9,c10,c7) # label(exemplo6GDDFULL012015) # label(negated_conjecture). [clausify(95)]. 4.35/4.81 281 -coll(A,B,C) | coll(C,C,A). [factor(165,a,b)]. 4.35/4.81 330 -perp(A,B,c5,c2) | para(A,B,c1,c3). [resolve(209,a,161,a)]. 4.35/4.81 331 perp(c1,c3,c5,c2). [resolve(209,a,151,a)]. 4.35/4.81 384 coll(c1,c8,c3). [resolve(214,a,127,a)]. 4.35/4.81 491 coll(c3,c3,c1). [resolve(384,a,281,a)]. 4.35/4.81 557 para(c1,c3,c1,c3). [resolve(331,a,330,a)]. 4.35/4.81 619 -coll(c3,c3,A) | coll(c1,A,c3). [resolve(491,a,165,a)]. 4.35/4.81 1086 eqangle(c1,c3,A,B,c1,c3,A,B). [resolve(557,a,183,a)]. 4.35/4.81 5199 eqangle(c1,c3,c1,c3,A,B,A,B). [resolve(1086,a,198,a)]. 4.35/4.81 5200 eqangle(A,B,c1,c3,A,B,c1,c3). [resolve(1086,a,195,a)]. 4.35/4.81 6848 -coll(c1,A,c3) | cyclic(c3,c3,c1,A). [resolve(5199,a,188,a)]. 4.35/4.81 6858 para(A,B,A,B). [resolve(5200,a,194,a)]. 4.35/4.81 6879 coll(A,B,B). [resolve(6858,a,157,a)]. 4.35/4.81 7032 coll(A,A,B). [resolve(6879,a,281,a)]. 4.35/4.81 7212 coll(c1,A,c3). [back_unit_del(619),unit_del(a,7032)]. 4.35/4.81 7688 cyclic(c3,c3,c1,A). [back_unit_del(6848),unit_del(a,7212)]. 4.35/4.81 8104 cyclic(c3,c1,A,B). [resolve(7688,a,124,b),unit_del(a,7688)]. 4.35/4.81 9094 cyclic(c1,A,B,C). [resolve(8104,a,124,b),unit_del(a,8104)]. 4.35/4.81 11916 cyclic(A,B,C,D). [resolve(9094,a,124,b),unit_del(a,9094)]. 4.35/4.81 11917 $F. [resolve(11916,a,222,a)]. 4.35/4.81 4.35/4.81 % SZS output end Refutation 4.35/4.81 ============================== end of proof ========================== 4.35/4.81 4.35/4.81 ============================== STATISTICS ============================ 4.35/4.81 4.35/4.81 Given=4575. Generated=45262. Kept=11800. proofs=1. 4.35/4.81 Usable=2430. Sos=5473. Demods=0. Limbo=11, Disabled=4043. Hints=0. 4.35/4.81 Megabytes=9.15. 4.35/4.81 User_CPU=2.40, System_CPU=0.06, Wall_clock=3. 4.35/4.81 4.35/4.81 ============================== end of statistics ===================== 4.35/4.81 4.35/4.81 ============================== end of search ========================= 4.35/4.81 4.35/4.81 THEOREM PROVED 4.35/4.81 % SZS status Theorem 4.35/4.81 4.35/4.81 Exiting with 1 proof. 4.35/4.81 4.35/4.81 Process 3073 exit (max_proofs) Tue Jul 13 14:37:21 2021 4.35/4.81 Prover9 interrupted 4.35/4.81 EOF