0.13/0.14 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.13/0.14 % Command : tptp2X_and_run_prover9 %d %s 0.14/0.36 % Computer : n009.cluster.edu 0.14/0.36 % Model : x86_64 x86_64 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.14/0.36 % Memory : 8042.1875MB 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64 0.14/0.36 % CPULimit : 1200 0.14/0.36 % DateTime : Tue Jul 13 14:19:12 EDT 2021 0.14/0.36 % CPUTime : 0.84/1.12 ============================== Prover9 =============================== 0.84/1.12 Prover9 (32) version 2009-11A, November 2009. 0.84/1.12 Process 27093 was started by sandbox on n009.cluster.edu, 0.84/1.12 Tue Jul 13 14:19:13 2021 0.84/1.12 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1200 -f /tmp/Prover9_26940_n009.cluster.edu". 0.84/1.12 ============================== end of head =========================== 0.84/1.12 0.84/1.12 ============================== INPUT ================================= 0.84/1.12 0.84/1.12 % Reading from file /tmp/Prover9_26940_n009.cluster.edu 0.84/1.12 0.84/1.12 set(prolog_style_variables). 0.84/1.12 set(auto2). 0.84/1.12 % set(auto2) -> set(auto). 0.84/1.12 % set(auto) -> set(auto_inference). 0.84/1.12 % set(auto) -> set(auto_setup). 0.84/1.12 % set(auto_setup) -> set(predicate_elim). 0.84/1.12 % set(auto_setup) -> assign(eq_defs, unfold). 0.84/1.12 % set(auto) -> set(auto_limits). 0.84/1.12 % set(auto_limits) -> assign(max_weight, "100.000"). 0.84/1.12 % set(auto_limits) -> assign(sos_limit, 20000). 0.84/1.12 % set(auto) -> set(auto_denials). 0.84/1.12 % set(auto) -> set(auto_process). 0.84/1.12 % set(auto2) -> assign(new_constants, 1). 0.84/1.12 % set(auto2) -> assign(fold_denial_max, 3). 0.84/1.12 % set(auto2) -> assign(max_weight, "200.000"). 0.84/1.12 % set(auto2) -> assign(max_hours, 1). 0.84/1.12 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.84/1.12 % set(auto2) -> assign(max_seconds, 0). 0.84/1.12 % set(auto2) -> assign(max_minutes, 5). 0.84/1.12 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.84/1.12 % set(auto2) -> set(sort_initial_sos). 0.84/1.12 % set(auto2) -> assign(sos_limit, -1). 0.84/1.12 % set(auto2) -> assign(lrs_ticks, 3000). 0.84/1.12 % set(auto2) -> assign(max_megs, 400). 0.84/1.12 % set(auto2) -> assign(stats, some). 0.84/1.12 % set(auto2) -> clear(echo_input). 0.84/1.12 % set(auto2) -> set(quiet). 0.84/1.12 % set(auto2) -> clear(print_initial_clauses). 0.84/1.12 % set(auto2) -> clear(print_given). 0.84/1.12 assign(lrs_ticks,-1). 0.84/1.12 assign(sos_limit,10000). 0.84/1.12 assign(order,kbo). 0.84/1.12 set(lex_order_vars). 0.84/1.12 clear(print_given). 0.84/1.12 0.84/1.12 % formulas(sos). % not echoed (95 formulas) 0.84/1.12 0.84/1.12 ============================== end of input ========================== 0.84/1.12 0.84/1.12 % From the command line: assign(max_seconds, 1200). 0.84/1.12 0.84/1.12 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.84/1.12 0.84/1.12 % Formulas that are not ordinary clauses: 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 17 (all A all B all C (coll(A,B,C) -> coll(B,A,C))) # label(ruleD2) # label(axiom) # label(non_clause). [assumption]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 22 (all A all B all C (midp(A,B,C) -> cong(A,B,A,C))) # label(ruleD68) # label(axiom) # label(non_clause). [assumption]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 45 (all A all B all C (para(A,B,A,C) -> coll(A,B,C))) # label(ruleD66) # label(axiom) # label(non_clause). [assumption]. 0.84/1.12 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]. 0.84/1.12 47 (all A all B all M (midp(M,B,A) -> midp(M,A,B))) # label(ruleD11) # label(axiom) # label(non_clause). [assumption]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 62 (all A all B all C (coll(A,B,C) -> coll(A,C,B))) # label(ruleD1) # label(axiom) # label(non_clause). [assumption]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 78 (all A all B all C (midp(A,B,C) -> coll(A,B,C))) # label(ruleD69) # label(axiom) # label(non_clause). [assumption]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/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(A,B,P,Q,C,D,U,V))) # label(ruleD21) # label(axiom) # label(non_clause). [assumption]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 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]. 0.84/1.12 95 -(all A all B all C all I all E (eqangle(I,A,A,B,I,A,A,C) & eqangle(I,C,C,A,I,C,C,B) & coll(E,A,C) & para(A,B,E,I) & eqangle(I,B,B,C,I,B,B,A) -> cong(E,I,E,A))) # label(exemplo6GDDFULL214040) # label(negated_conjecture) # label(non_clause). [assumption]. 0.84/1.12 0.84/1.12 ============================== end of process non-clausal formulas === 0.84/1.12 0.84/1.12 ============================== PROCESS INITIAL CLAUSES =============== 0.84/1.12 0.84/1.12 ============================== PREDICATE ELIMINATION ================= 0.84/1.12 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)]. 0.84/1.12 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)]. 0.84/1.12 98 -circle(A,B,C,D) | -eqangle(B,E,B,C,D,B,D,C) | perp(A,B,B,E) # label(ruleD49) # label(axiom). [clausify(7)]. 0.84/1.12 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)]. 0.84/1.12 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)]. 0.84/1.12 99 -cong(A,B,A,C) | -cong(A,B,A,D) | circle(A,B,C,D) # label(ruleD12) # label(axiom). [clausify(29)]. 0.84/1.12 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)]. 0.84/1.12 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)]. 0.84/1.12 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)]. 0.84/1.12 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)]. 0.84/1.12 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)]. 0.84/1.12 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)]. 0.84/1.12 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)]. 0.84/1.12 Derived: -midp(A,B,C) | eqangle(D,B,D,C,E,B,E,A) | -cong(E,D,E,B) | -cong(E,D,E,C). [resolve(101,b,99,c)]. 0.84/1.12 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)]. 0.84/1.12 102 -circle(A,B,C,D) | -coll(A,B,D) | perp(B,C,C,D) # label(ruleD53) # label(axiom). [clausify(59)]. 0.84/1.12 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)]. 0.84/1.12 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)]. 0.84/1.12 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)]. 0.84/1.12 103 -circle(A,B,C,D) | perp(f16(B,C,D,A),B,B,A) # label(ruleX11) # label(axiom). [clausify(75)]. 0.84/1.12 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)]. 0.84/1.12 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)]. 0.96/1.27 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)]. 0.96/1.27 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)]. 0.96/1.27 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)]. 0.96/1.27 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)]. 0.96/1.27 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)]. 0.96/1.27 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)]. 0.96/1.27 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)]. 0.96/1.27 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)]. 0.96/1.27 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)]. 0.96/1.27 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)]. 0.96/1.27 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)]. 0.96/1.27 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)]. 0.96/1.27 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)]. 0.96/1.27 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)]. 0.96/1.27 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)]. 0.96/1.27 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)]. 0.96/1.27 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)]. 0.96/1.27 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)]. 0.96/1.27 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)]. 0.96/1.27 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)]. 0.96/1.27 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)]. 0.96/1.27 0.96/1.27 ============================== end predicate elimination ============= 0.96/1.27 0.96/1.27 Auto_denials: (non-Horn, no changes). 0.96/1.27 0.96/1.27 Term ordering decisions: 0.96/1.27 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. c5=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. 0.96/1.27 0.96/1.27 ============================== end of process initial clauses ======== 0.96/1.27 0.96/1.27 ============================== CLAUSES FOR SEARCH ==================== 0.96/1.27 0.96/1.27 ============================== end of clauses for search ============= 0.96/1.27 0.96/1.27 ============================== SEARCH ================================ 0.96/1.27 0.96/1.27 % Starting search at 0.04 seconds. 0.96/1.27 0.96/1.27 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 65 (0.00 of 0.17 sec). 1.51/1.86 1.51/1.86 Low Water (keep): wt=48.000, iters=3365 1.51/1.86 1.51/1.86 Low Water (keep): wt=29.000, iters=3333 1.51/1.86 1.51/1.86 ============================== PROOF ================================= 1.51/1.86 % SZS status Theorem 1.51/1.86 % SZS output start Refutation 1.51/1.86 1.51/1.86 % Proof 1 at 0.74 (+ 0.02) seconds. 1.51/1.86 % Length of proof is 221. 1.51/1.86 % Level of proof is 30. 1.51/1.86 % Maximum clause weight is 35.000. 1.51/1.86 % Given clauses 1813. 1.51/1.86 1.51/1.86 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.51/1.86 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.51/1.86 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.51/1.86 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.51/1.86 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.51/1.86 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.51/1.86 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.51/1.86 17 (all A all B all C (coll(A,B,C) -> coll(B,A,C))) # label(ruleD2) # label(axiom) # label(non_clause). [assumption]. 1.51/1.86 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.51/1.86 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.51/1.86 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.51/1.86 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.51/1.86 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.51/1.86 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.51/1.86 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.51/1.86 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.51/1.86 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.51/1.86 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.51/1.86 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.51/1.86 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.51/1.86 62 (all A all B all C (coll(A,B,C) -> coll(A,C,B))) # label(ruleD1) # label(axiom) # label(non_clause). [assumption]. 1.51/1.86 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.51/1.86 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.51/1.86 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.51/1.86 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.51/1.86 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.51/1.86 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.51/1.86 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.51/1.86 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.51/1.86 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.51/1.86 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.51/1.86 95 -(all A all B all C all I all E (eqangle(I,A,A,B,I,A,A,C) & eqangle(I,C,C,A,I,C,C,B) & coll(E,A,C) & para(A,B,E,I) & eqangle(I,B,B,C,I,B,B,A) -> cong(E,I,E,A))) # label(exemplo6GDDFULL214040) # label(negated_conjecture) # label(non_clause). [assumption]. 1.51/1.86 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.51/1.86 99 -cong(A,B,A,C) | -cong(A,B,A,D) | circle(A,B,C,D) # label(ruleD12) # label(axiom). [clausify(29)]. 1.51/1.86 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.51/1.86 114 -para(A,B,C,D) | para(C,D,A,B) # label(ruleD5) # label(axiom). [clausify(3)]. 1.51/1.86 116 -cyclic(A,B,C,D) | cyclic(A,C,B,D) # label(ruleD15) # label(axiom). [clausify(5)]. 1.51/1.86 117 -midp(A,B,C) | -para(B,D,C,E) | -para(B,E,C,D) | midp(A,E,D) # label(ruleD64) # label(axiom). [clausify(8)]. 1.51/1.86 123 -eqangle(A,B,C,D,E,F,V6,V7) | eqangle(B,A,C,D,E,F,V6,V7) # label(ruleD18) # label(axiom). [clausify(13)]. 1.51/1.86 124 -cyclic(A,B,C,D) | -cyclic(A,B,C,E) | cyclic(B,C,D,E) # label(ruleD17) # label(axiom). [clausify(14)]. 1.51/1.86 125 -perp(A,B,C,D) | perp(A,B,D,C) # label(ruleD7) # label(axiom). [clausify(15)]. 1.51/1.86 127 -coll(A,B,C) | coll(B,A,C) # label(ruleD2) # label(axiom). [clausify(17)]. 1.51/1.86 128 -cyclic(A,B,C,D) | -cong(A,D,B,D) | -cong(A,C,B,C) | perp(C,A,A,D) # label(ruleD57) # label(axiom). [clausify(18)]. 1.51/1.86 130 -cyclic(A,B,C,D) | cyclic(A,B,D,C) # label(ruleD14) # label(axiom). [clausify(20)]. 1.51/1.86 133 -midp(A,B,C) | cong(A,B,A,C) # label(ruleD68) # label(axiom). [clausify(22)]. 1.51/1.86 134 -para(A,B,C,D) | -para(C,D,E,F) | para(A,B,E,F) # label(ruleD6) # label(axiom). [clausify(23)]. 1.51/1.86 150 -midp(A,B,C) | -para(A,D,C,E) | -coll(D,B,E) | midp(D,B,E) # label(ruleD45) # label(axiom). [clausify(38)]. 1.51/1.86 156 -para(A,B,C,D) | para(A,B,D,C) # label(ruleD4) # label(axiom). [clausify(44)]. 1.51/1.86 157 -para(A,B,A,C) | coll(A,B,C) # label(ruleD66) # label(axiom). [clausify(45)]. 1.51/1.86 158 -cong(A,B,C,B) | -cong(A,D,C,D) | perp(A,C,B,D) # label(ruleD56) # label(axiom). [clausify(46)]. 1.51/1.86 164 -perp(A,B,C,D) | -para(E,F,A,B) | perp(E,F,C,D) # label(ruleD10) # label(axiom). [clausify(52)]. 1.51/1.86 165 -coll(A,B,C) | -coll(A,B,D) | coll(C,D,A) # label(ruleD3) # label(axiom). [clausify(53)]. 1.51/1.86 172 -coll(A,B,C) | coll(A,C,B) # label(ruleD1) # label(axiom). [clausify(62)]. 1.51/1.86 179 -perp(A,B,C,D) | -midp(B,C,D) | cong(A,C,A,D) # label(ruleD55) # label(axiom). [clausify(68)]. 1.51/1.86 183 -para(A,B,C,D) | eqangle(A,B,E,F,C,D,E,F) # label(ruleD40) # label(axiom). [clausify(70)]. 1.51/1.86 187 -cyclic(A,B,C,D) | -eqangle(C,A,C,B,E,D,E,F) | -cyclic(A,B,C,E) | -cyclic(A,B,C,F) | cong(A,B,D,F) # label(ruleD43) # label(axiom). [clausify(73)]. 1.51/1.86 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)]. 1.51/1.86 194 -eqangle(A,B,C,D,E,F,C,D) | para(A,B,E,F) # label(ruleD39) # label(axiom). [clausify(80)]. 1.51/1.86 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)]. 1.51/1.86 197 -cyclic(A,B,C,D) | cyclic(B,A,C,D) # label(ruleD16) # label(axiom). [clausify(84)]. 1.51/1.86 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)]. 1.51/1.86 199 -para(A,B,C,D) | -eqangle(E,F,V6,V7,A,B,C,D) | para(E,F,V6,V7) # label(ruleD73) # label(axiom). [clausify(86)]. 1.51/1.86 201 -eqangle(A,B,C,D,E,F,V6,V7) | -perp(E,F,V6,V7) | perp(A,B,C,D) # label(ruleD74) # label(axiom). [clausify(88)]. 1.51/1.86 208 eqangle(c4,c1,c1,c2,c4,c1,c1,c3) # label(exemplo6GDDFULL214040) # label(negated_conjecture). [clausify(95)]. 1.51/1.86 209 eqangle(c4,c3,c3,c1,c4,c3,c3,c2) # label(exemplo6GDDFULL214040) # label(negated_conjecture). [clausify(95)]. 1.51/1.86 210 coll(c5,c1,c3) # label(exemplo6GDDFULL214040) # label(negated_conjecture). [clausify(95)]. 1.51/1.86 211 para(c1,c2,c5,c4) # label(exemplo6GDDFULL214040) # label(negated_conjecture). [clausify(95)]. 1.51/1.86 212 eqangle(c4,c2,c2,c3,c4,c2,c2,c1) # label(exemplo6GDDFULL214040) # label(negated_conjecture). [clausify(95)]. 1.51/1.86 213 -cong(c5,c4,c5,c1) # label(exemplo6GDDFULL214040) # label(negated_conjecture). [clausify(95)]. 1.51/1.86 216 -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.51/1.86 218 -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.51/1.86 256 -midp(A,B,C) | -para(B,D,C,D) | midp(A,D,D). [factor(117,b,c)]. 1.51/1.86 260 -cyclic(A,B,C,D) | cyclic(B,C,D,D). [factor(124,a,b)]. 1.51/1.86 272 -coll(A,B,C) | coll(C,C,A). [factor(165,a,b)]. 1.51/1.86 281 -cyclic(A,B,C,D) | -eqangle(C,A,C,B,E,D,E,E) | -cyclic(A,B,C,E) | cong(A,B,D,E). [factor(187,c,d)]. 1.51/1.86 287 -cong(A,B,A,C) | -eqangle(B,C,B,C,A,C,A,D) | -coll(D,C,C) | midp(D,C,C). [factor(216,a,b)]. 1.51/1.86 317 eqangle(c4,c1,c4,c1,c1,c2,c1,c3). [resolve(208,a,198,a)]. 1.51/1.86 318 eqangle(c1,c2,c4,c1,c1,c3,c4,c1). [resolve(208,a,195,a)]. 1.51/1.86 326 eqangle(c4,c3,c4,c3,c3,c1,c3,c2). [resolve(209,a,198,a)]. 1.51/1.86 327 eqangle(c3,c1,c4,c3,c3,c2,c4,c3). [resolve(209,a,195,a)]. 1.51/1.86 333 coll(c5,c3,c1). [resolve(210,a,172,a)]. 1.51/1.86 343 para(c1,c2,c4,c5). [resolve(211,a,156,a)]. 1.51/1.86 348 -para(A,B,c1,c2) | para(A,B,c5,c4). [resolve(211,a,134,b)]. 1.51/1.86 355 eqangle(c4,c2,c4,c2,c2,c3,c2,c1). [resolve(212,a,198,a)]. 1.51/1.86 356 eqangle(c2,c3,c4,c2,c2,c1,c4,c2). [resolve(212,a,195,a)]. 1.51/1.86 365 coll(c1,c1,c5). [resolve(333,a,272,a)]. 1.51/1.86 378 coll(c1,c5,c1). [resolve(365,a,172,a)]. 1.51/1.86 394 -para(c1,c2,c1,c3) | para(c4,c1,c4,c1). [resolve(317,a,199,b)]. 1.51/1.86 408 coll(c1,c1,c1). [resolve(378,a,272,a)]. 1.51/1.86 417 para(c1,c2,c1,c3). [resolve(318,a,194,a)]. 1.51/1.86 422 para(c4,c1,c4,c1). [back_unit_del(394),unit_del(a,417)]. 1.51/1.86 476 para(c4,c5,c1,c2). [resolve(343,a,114,a)]. 1.51/1.86 501 eqangle(c1,c2,A,B,c1,c3,A,B). [resolve(417,a,183,a)]. 1.51/1.86 503 coll(c1,c2,c3). [resolve(417,a,157,a)]. 1.51/1.86 509 -para(A,B,c1,c2) | para(A,B,c1,c3). [resolve(417,a,134,b)]. 1.51/1.86 513 para(c1,c3,c1,c2). [resolve(417,a,114,a)]. 1.51/1.86 516 coll(c1,c3,c2). [resolve(503,a,172,a)]. 1.51/1.86 523 coll(c3,c1,c2). [resolve(516,a,127,a)]. 1.51/1.86 540 coll(c2,c2,c3). [resolve(523,a,272,a)]. 1.51/1.86 556 coll(c2,c3,c2). [resolve(540,a,172,a)]. 1.51/1.86 571 -para(c3,c1,c3,c2) | para(c4,c3,c4,c3). [resolve(326,a,199,b)]. 1.51/1.86 577 eqangle(c3,c4,c4,c3,c3,c1,c3,c2). [resolve(326,a,123,a)]. 1.51/1.86 580 coll(c3,c2,c2). [resolve(556,a,127,a)]. 1.51/1.86 589 para(c3,c1,c3,c2). [resolve(327,a,194,a)]. 1.51/1.86 594 para(c4,c3,c4,c3). [back_unit_del(571),unit_del(a,589)]. 1.51/1.86 602 eqangle(c4,c1,A,B,c4,c1,A,B). [resolve(422,a,183,a)]. 1.51/1.86 603 coll(c4,c1,c1). [resolve(422,a,157,a)]. 1.51/1.86 604 para(c4,c1,c1,c4). [resolve(422,a,156,a)]. 1.51/1.86 609 coll(c1,c1,c4). [resolve(603,a,272,a)]. 1.51/1.86 615 coll(c4,c4,c1). [resolve(609,a,272,a)]. 1.51/1.86 617 -coll(c1,c1,A) | coll(c4,A,c1). [resolve(609,a,165,a)]. 1.51/1.86 626 coll(c4,c1,c4). [resolve(615,a,172,a)]. 1.51/1.86 629 coll(c4,c4,c4). [resolve(626,a,272,a)]. 1.51/1.86 693 eqangle(c1,c3,A,B,c1,c2,A,B). [resolve(513,a,183,a)]. 1.51/1.86 718 -midp(A,c3,c3) | -para(c3,c2,c3,c1) | midp(A,c1,c2). [resolve(589,a,117,c)]. 1.51/1.86 720 para(c3,c2,c3,c1). [resolve(589,a,114,a)]. 1.51/1.86 722 -midp(A,c3,c3) | midp(A,c1,c2). [back_unit_del(718),unit_del(b,720)]. 1.51/1.86 732 para(c4,c3,c3,c4). [resolve(594,a,156,a)]. 1.51/1.86 777 para(c1,c4,c4,c1). [resolve(604,a,114,a)]. 1.51/1.86 894 para(c3,c4,c4,c3). [resolve(732,a,114,a)]. 1.51/1.86 905 para(c1,c4,c1,c4). [resolve(777,a,156,a)]. 1.51/1.86 1009 -perp(c4,c3,A,B) | perp(c3,c4,A,B). [resolve(894,a,164,b)]. 1.51/1.86 1010 para(c3,c4,c3,c4). [resolve(894,a,156,a)]. 1.51/1.86 1023 eqangle(c1,c4,A,B,c1,c4,A,B). [resolve(905,a,183,a)]. 1.51/1.86 1087 eqangle(c3,c4,A,B,c3,c4,A,B). [resolve(1010,a,183,a)]. 1.51/1.86 1222 para(c4,c5,c5,c4). [resolve(348,a,476,a)]. 1.51/1.86 1317 para(c4,c5,c4,c5). [resolve(1222,a,156,a)]. 1.51/1.86 1406 -para(c2,c3,c2,c1) | para(c4,c2,c4,c2). [resolve(355,a,199,b)]. 1.51/1.86 1448 -midp(A,c4,c4) | midp(A,c5,c5). [resolve(1317,a,256,b)]. 1.51/1.86 1475 para(c2,c3,c2,c1). [resolve(356,a,194,a)]. 1.51/1.86 1480 para(c4,c2,c4,c2). [back_unit_del(1406),unit_del(a,1475)]. 1.51/1.86 1563 para(c4,c2,c2,c4). [resolve(1480,a,156,a)]. 1.51/1.86 1657 para(c2,c4,c4,c2). [resolve(1563,a,114,a)]. 1.51/1.86 1726 para(c2,c4,c2,c4). [resolve(1657,a,156,a)]. 1.51/1.86 1812 -midp(A,c2,c2) | midp(A,c4,c4). [resolve(1726,a,256,b)]. 1.51/1.86 2168 eqangle(A,B,c1,c2,A,B,c1,c3). [resolve(501,a,195,a)]. 1.51/1.86 2200 para(c1,c3,c1,c3). [resolve(509,a,513,a)]. 1.51/1.86 2220 -midp(A,c1,c1) | midp(A,c3,c3). [resolve(2200,a,256,b)]. 1.51/1.86 2225 eqangle(c1,c3,A,B,c1,c3,A,B). [resolve(2200,a,183,a)]. 1.51/1.86 2280 eqangle(c4,c3,c3,c4,c3,c2,c3,c1). [resolve(577,a,195,a)]. 1.51/1.86 2285 -cyclic(c1,c4,c4,c1) | -cyclic(c1,c4,c4,c4) | cong(c1,c4,c1,c4). [resolve(602,a,281,b)]. 1.51/1.86 2288 eqangle(c4,c1,c4,c1,A,B,A,B). [resolve(602,a,198,a)]. 1.51/1.86 2289 eqangle(A,B,c4,c1,A,B,c4,c1). [resolve(602,a,195,a)]. 1.51/1.86 2292 -coll(c4,c4,A) | cyclic(c1,A,c4,c4). [resolve(602,a,188,a)]. 1.51/1.86 2293 -cyclic(c1,A,c4,c1) | -cyclic(c1,A,c4,c4) | -cyclic(c1,A,c4,A) | cong(c1,A,c1,A). [resolve(602,a,187,b)]. 1.51/1.86 2317 -cyclic(c3,c1,c1,c2) | -cyclic(c3,c1,c1,c1) | cong(c3,c1,c2,c1). [resolve(693,a,281,b)]. 1.51/1.86 2321 -cyclic(c3,A,c1,c2) | -cyclic(c3,A,c1,c1) | -cyclic(c3,A,c1,A) | cong(c3,A,c2,A). [resolve(693,a,187,b)]. 1.51/1.86 2469 -coll(c1,c1,A) | cyclic(c4,A,c1,c1). [resolve(1023,a,188,a)]. 1.51/1.86 2499 -cong(c3,c3,c3,c4) | midp(c4,c4,c4). [resolve(1087,a,287,b),unit_del(b,629)]. 1.51/1.86 3073 -cong(c1,c1,c1,c2) | midp(c3,c2,c2). [resolve(2168,a,287,b),unit_del(b,580)]. 1.51/1.86 3135 -coll(c1,c1,A) | cyclic(c3,A,c1,c1). [resolve(2225,a,188,a)]. 1.51/1.86 3203 -perp(c3,c2,c3,c1) | perp(c4,c3,c3,c4). [resolve(2280,a,201,a)]. 1.51/1.86 3221 -cyclic(c4,c1,c1,A) | -perp(c4,c1,c1,c1) | midp(c1,c1,c1). [resolve(2288,a,218,c),unit_del(c,408)]. 1.51/1.86 3225 -coll(c4,A,c1) | cyclic(c1,c1,c4,A). [resolve(2288,a,188,a)]. 1.51/1.86 3235 para(A,B,A,B). [resolve(2289,a,194,a)]. 1.51/1.86 3250 -midp(A,B,B) | midp(A,C,C). [resolve(3235,a,256,b)]. 1.51/1.86 3256 coll(A,B,B). [resolve(3235,a,157,a)]. 1.51/1.86 3258 -midp(A,B,A) | -coll(C,B,C) | midp(C,B,C). [resolve(3235,a,150,b)]. 1.51/1.86 3355 coll(A,A,B). [resolve(3256,a,272,a)]. 1.51/1.86 3358 coll(A,B,A). [resolve(3256,a,127,a)]. 1.51/1.86 3364 cyclic(c3,A,c1,c1). [back_unit_del(3135),unit_del(a,3355)]. 1.51/1.86 3372 cyclic(c4,A,c1,c1). [back_unit_del(2469),unit_del(a,3355)]. 1.51/1.86 3374 cyclic(c1,A,c4,c4). [back_unit_del(2292),unit_del(a,3355)]. 1.51/1.86 3405 coll(c4,A,c1). [back_unit_del(617),unit_del(a,3355)]. 1.51/1.86 3428 -midp(A,B,A) | midp(C,B,C). [back_unit_del(3258),unit_del(b,3358)]. 1.51/1.86 3478 -cyclic(c3,A,c1,c2) | -cyclic(c3,A,c1,A) | cong(c3,A,c2,A). [back_unit_del(2321),unit_del(b,3364)]. 1.51/1.86 3480 -cyclic(c3,c1,c1,c2) | cong(c3,c1,c2,c1). [back_unit_del(2317),unit_del(b,3364)]. 1.51/1.86 3515 -cyclic(c1,A,c4,c1) | -cyclic(c1,A,c4,A) | cong(c1,A,c1,A). [back_unit_del(2293),unit_del(b,3374)]. 1.51/1.86 3516 -cyclic(c1,c4,c4,c1) | cong(c1,c4,c1,c4). [back_unit_del(2285),unit_del(b,3374)]. 1.51/1.86 3641 cyclic(c1,c1,c4,A). [back_unit_del(3225),unit_del(a,3405)]. 1.51/1.86 3848 cyclic(c3,c1,A,c1). [resolve(3364,a,116,a)]. 1.51/1.86 3987 cyclic(c4,c1,A,c1). [resolve(3372,a,116,a)]. 1.51/1.86 4020 cyclic(c1,c4,A,A). [resolve(3641,a,260,a)]. 1.51/1.86 4032 cyclic(c1,c1,A,c4). [resolve(3641,a,130,a)]. 1.51/1.86 4033 -cong(c1,A,c1,A) | -cong(c1,c4,c1,c4) | perp(c4,c1,c1,A). [resolve(3641,a,128,a)]. 1.51/1.86 4034 cyclic(c1,c4,A,B). [resolve(3641,a,124,b),unit_del(a,3641)]. 1.51/1.86 4035 cong(c1,c4,c1,c4). [back_unit_del(3516),unit_del(a,4034)]. 1.51/1.86 4036 -cong(c1,A,c1,A) | perp(c4,c1,c1,A). [back_unit_del(4033),unit_del(b,4035)]. 1.51/1.86 4256 cyclic(c1,c3,A,c1). [resolve(3848,a,197,a)]. 1.51/1.86 4257 cyclic(c3,c1,c1,A). [resolve(3848,a,130,a)]. 1.51/1.86 4262 cong(c3,c1,c2,c1). [back_unit_del(3480),unit_del(a,4257)]. 1.51/1.86 4580 cyclic(c4,c1,c1,A). [resolve(3987,a,130,a)]. 1.51/1.86 4582 -cyclic(c4,c1,A,B) | cyclic(c1,A,B,c1). [resolve(3987,a,124,b)]. 1.51/1.86 4586 -perp(c4,c1,c1,c1) | midp(c1,c1,c1). [back_unit_del(3221),unit_del(a,4580)]. 1.51/1.86 4702 cyclic(c1,A,c4,A). [resolve(4020,a,116,a)]. 1.51/1.86 4704 -cyclic(c1,A,c4,c1) | cong(c1,A,c1,A). [back_unit_del(3515),unit_del(b,4702)]. 1.51/1.86 4723 -cong(c1,A,c1,A) | perp(A,c1,c1,c4). [resolve(4032,a,128,a),unit_del(a,4035)]. 1.51/1.86 4727 cyclic(c4,A,B,B). [resolve(4034,a,260,a)]. 1.51/1.86 4738 cyclic(c4,c1,A,B). [resolve(4034,a,197,a)]. 1.51/1.86 4741 cyclic(c4,A,B,C). [resolve(4034,a,124,b),unit_del(a,4034)]. 1.51/1.86 4745 cyclic(c1,A,B,c1). [back_unit_del(4582),unit_del(a,4741)]. 1.51/1.86 4761 cong(c1,A,c1,A). [back_unit_del(4704),unit_del(a,4745)]. 1.51/1.86 4773 perp(A,c1,c1,c4). [back_unit_del(4723),unit_del(a,4761)]. 1.51/1.86 4776 perp(c4,c1,c1,A). [back_unit_del(4036),unit_del(a,4761)]. 1.51/1.86 4787 midp(c1,c1,c1). [back_unit_del(4586),unit_del(a,4776)]. 1.51/1.86 4795 midp(c1,c3,c3). [resolve(4787,a,2220,a)]. 1.51/1.86 4814 midp(c1,c1,c2). [resolve(4795,a,722,a)]. 1.51/1.86 4915 cong(c1,c1,c1,c2). [resolve(4814,a,133,a)]. 1.51/1.86 4918 midp(c3,c2,c2). [back_unit_del(3073),unit_del(a,4915)]. 1.51/1.86 4991 midp(c3,c4,c4). [resolve(4918,a,1812,a)]. 1.51/1.86 5044 midp(c3,c5,c5). [resolve(4991,a,1448,a)]. 1.51/1.86 5798 -cyclic(c1,c3,A,B) | cyclic(c3,A,c1,B). [resolve(4256,a,124,a)]. 1.51/1.86 5819 -cong(c3,A,c2,A) | perp(c3,c2,A,c1). [resolve(4262,a,158,b)]. 1.51/1.86 7029 cyclic(A,B,C,B). [resolve(4727,a,124,b),unit_del(a,4741)]. 1.51/1.86 7032 -cyclic(c3,A,c1,c2) | cong(c3,A,c2,A). [back_unit_del(3478),unit_del(b,7029)]. 1.51/1.86 7048 cyclic(c1,A,B,C). [resolve(4738,a,124,b),unit_del(a,4741)]. 1.51/1.86 7054 cyclic(c3,A,c1,B). [back_unit_del(5798),unit_del(a,7048)]. 1.51/1.86 7076 cong(c3,A,c2,A). [back_unit_del(7032),unit_del(a,7054)]. 1.51/1.86 7128 perp(c3,c2,A,c1). [back_unit_del(5819),unit_del(a,7076)]. 1.51/1.86 7131 perp(c4,c3,c3,c4). [back_unit_del(3203),unit_del(a,7128)]. 1.51/1.86 7560 perp(A,c1,c4,c1). [resolve(4773,a,125,a)]. 1.51/1.86 9751 perp(c3,c4,c3,c4). [resolve(7131,a,1009,a)]. 1.51/1.86 10359 -midp(c1,c4,c1) | cong(A,c4,A,c1). [resolve(7560,a,179,a)]. 1.51/1.86 10766 -midp(c4,c3,c4) | cong(c3,c3,c3,c4). [resolve(9751,a,179,a)]. 1.51/1.86 11183 midp(c3,A,A). [resolve(3250,a,5044,a)]. 1.51/1.86 11198 midp(A,c3,A). [resolve(3428,a,11183,a)]. 1.51/1.86 11201 cong(c3,c3,c3,c4). [back_unit_del(10766),unit_del(a,11198)]. 1.51/1.86 11205 midp(c4,c4,c4). [back_unit_del(2499),unit_del(a,11201)]. 1.51/1.86 11235 midp(A,c4,A). [resolve(11205,a,3428,a)]. 1.51/1.86 11241 cong(A,c4,A,c1). [back_unit_del(10359),unit_del(a,11235)]. 1.51/1.86 11242 $F. [resolve(11241,a,213,a)]. 1.51/1.86 1.51/1.86 % SZS output end Refutation 1.51/1.86 ============================== end of proof ========================== 1.51/1.86 1.51/1.86 ============================== STATISTICS ============================ 1.51/1.86 1.51/1.86 Given=1813. Generated=31000. Kept=11125. proofs=1. 1.51/1.86 Usable=1298. Sos=5874. Demods=0. Limbo=6, Disabled=4095. Hints=0. 1.51/1.86 Megabytes=8.04. 1.51/1.86 User_CPU=0.74, System_CPU=0.02, Wall_clock=1. 1.51/1.86 1.51/1.86 ============================== end of statistics ===================== 1.51/1.86 1.51/1.86 ============================== end of search ========================= 1.51/1.86 1.51/1.86 THEOREM PROVED 1.51/1.86 % SZS status Theorem 1.51/1.86 1.51/1.86 Exiting with 1 proof. 1.51/1.86 1.51/1.86 Process 27093 exit (max_proofs) Tue Jul 13 14:19:14 2021 1.51/1.86 Prover9 interrupted 1.51/1.86 EOF