0.00/0.10 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.11 % Command : tptp2X_and_run_prover9 %d %s 0.10/0.31 % Computer : n003.cluster.edu 0.10/0.31 % Model : x86_64 x86_64 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.10/0.31 % Memory : 8042.1875MB 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64 0.10/0.31 % CPULimit : 960 0.10/0.31 % WCLimit : 120 0.10/0.31 % DateTime : Tue Aug 9 03:18:06 EDT 2022 0.10/0.31 % CPUTime : 0.83/1.16 ============================== Prover9 =============================== 0.83/1.16 Prover9 (32) version 2009-11A, November 2009. 0.83/1.16 Process 17368 was started by sandbox2 on n003.cluster.edu, 0.83/1.16 Tue Aug 9 03:18:06 2022 0.83/1.16 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_17205_n003.cluster.edu". 0.83/1.16 ============================== end of head =========================== 0.83/1.16 0.83/1.16 ============================== INPUT ================================= 0.83/1.16 0.83/1.16 % Reading from file /tmp/Prover9_17205_n003.cluster.edu 0.83/1.16 0.83/1.16 set(prolog_style_variables). 0.83/1.16 set(auto2). 0.83/1.16 % set(auto2) -> set(auto). 0.83/1.16 % set(auto) -> set(auto_inference). 0.83/1.16 % set(auto) -> set(auto_setup). 0.83/1.16 % set(auto_setup) -> set(predicate_elim). 0.83/1.16 % set(auto_setup) -> assign(eq_defs, unfold). 0.83/1.16 % set(auto) -> set(auto_limits). 0.83/1.16 % set(auto_limits) -> assign(max_weight, "100.000"). 0.83/1.16 % set(auto_limits) -> assign(sos_limit, 20000). 0.83/1.16 % set(auto) -> set(auto_denials). 0.83/1.16 % set(auto) -> set(auto_process). 0.83/1.16 % set(auto2) -> assign(new_constants, 1). 0.83/1.16 % set(auto2) -> assign(fold_denial_max, 3). 0.83/1.16 % set(auto2) -> assign(max_weight, "200.000"). 0.83/1.16 % set(auto2) -> assign(max_hours, 1). 0.83/1.16 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.83/1.16 % set(auto2) -> assign(max_seconds, 0). 0.83/1.16 % set(auto2) -> assign(max_minutes, 5). 0.83/1.16 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.83/1.16 % set(auto2) -> set(sort_initial_sos). 0.83/1.16 % set(auto2) -> assign(sos_limit, -1). 0.83/1.16 % set(auto2) -> assign(lrs_ticks, 3000). 0.83/1.16 % set(auto2) -> assign(max_megs, 400). 0.83/1.16 % set(auto2) -> assign(stats, some). 0.83/1.16 % set(auto2) -> clear(echo_input). 0.83/1.16 % set(auto2) -> set(quiet). 0.83/1.16 % set(auto2) -> clear(print_initial_clauses). 0.83/1.16 % set(auto2) -> clear(print_given). 0.83/1.16 assign(lrs_ticks,-1). 0.83/1.16 assign(sos_limit,10000). 0.83/1.16 assign(order,kbo). 0.83/1.16 set(lex_order_vars). 0.83/1.16 clear(print_given). 0.83/1.16 0.83/1.16 % formulas(sos). % not echoed (95 formulas) 0.83/1.16 0.83/1.16 ============================== end of input ========================== 0.83/1.16 0.83/1.16 % From the command line: assign(max_seconds, 960). 0.83/1.16 0.83/1.16 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.83/1.16 0.83/1.16 % Formulas that are not ordinary clauses: 0.83/1.16 1 (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.83/1.16 2 (all A all B all C all D all P all Q all U all V (perp(P,Q,U,V) & eqangle(A,B,C,D,P,Q,U,V) -> perp(A,B,C,D))) # label(ruleD74) # label(axiom) # label(non_clause). [assumption]. 0.83/1.16 3 (all A all B all C all D all M all N exists P exists Q (cong(M,A,M,D) & N != M & cong(N,A,N,B) & circle(M,A,B,C) -> coll(Q,B,D) & cong(Q,N,N,A) & cong(P,N,N,A) & coll(P,A,C))) # label(ruleX12) # label(axiom) # label(non_clause). [assumption]. 0.83/1.16 4 (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.83/1.16 5 (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.83/1.16 6 (all A all B all P all Q (cong(A,Q,B,Q) & cong(A,P,B,P) -> perp(A,B,P,Q))) # label(ruleD56) # label(axiom) # label(non_clause). [assumption]. 0.83/1.16 7 (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.83/1.16 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.83/1.16 9 (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.83/1.16 10 (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.83/1.16 11 (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(M,O,X) & coll(B,A,M))) # label(ruleX2) # label(axiom) # label(non_clause). [assumption]. 0.83/1.16 12 (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.83/1.16 13 (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.83/1.16 14 (all A all B all C all D all O (cong(O,A,O,C) & cong(O,A,O,D) & cong(O,A,O,B) -> cyclic(A,B,C,D))) # label(ruleD13) # label(axiom) # label(non_clause). [assumption]. 0.83/1.16 15 (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.83/1.16 16 (all A all B all C (para(A,B,A,C) -> coll(A,B,C))) # label(ruleD66) # label(axiom) # label(non_clause). [assumption]. 0.83/1.16 17 (all A all B all O exists C (cong(O,A,O,B) & perp(A,O,O,B) -> cong(O,A,O,C) & coll(A,O,C))) # label(ruleX17) # label(axiom) # label(non_clause). [assumption]. 0.83/1.16 18 (all A all B all C all D all M exists P (midp(M,B,D) & perp(C,A,C,D) & perp(A,B,A,C) -> midp(P,A,C))) # label(ruleX16) # label(axiom) # label(non_clause). [assumption]. 0.83/1.16 19 (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.83/1.16 20 (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.83/1.16 21 (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.83/1.16 22 (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.83/1.16 23 (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.83/1.16 24 (all A all B all C all D all O exists P (perp(A,B,B,O) & cong(O,C,O,D) -> para(P,C,A,B) & cong(B,C,B,P) & cong(O,C,O,P))) # label(ruleX9) # label(axiom) # label(non_clause). [assumption]. 0.83/1.16 25 (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.83/1.16 26 (all A all B all C (midp(A,B,C) -> coll(A,B,C))) # label(ruleD69) # label(axiom) # label(non_clause). [assumption]. 0.83/1.16 27 (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.83/1.16 28 (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.83/1.16 29 (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.83/1.16 30 (all A all B all C all D all M (midp(M,A,B) & para(A,C,B,D) & para(A,D,B,C) -> midp(M,C,D))) # label(ruleD64) # label(axiom) # label(non_clause). [assumption]. 0.83/1.16 31 (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.83/1.16 32 (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.83/1.16 33 (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.83/1.16 34 (all A all B all C all O (cong(O,A,O,C) & cong(O,A,O,B) -> circle(O,A,B,C))) # label(ruleD12) # label(axiom) # label(non_clause). [assumption]. 0.83/1.16 35 (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.83/1.16 36 (all A all B all C all P all Q all R (contri(B,A,C,Q,P,R) -> contri(A,B,C,P,Q,R))) # label(ruleD36) # label(axiom) # label(non_clause). [assumption]. 0.83/1.16 37 (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.83/1.16 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.83/1.17 39 (all A all B all C all H exists P exists Q (perp(A,H,B,C) & perp(B,H,A,C) -> perp(B,Q,C,A) & coll(Q,C,A) & perp(A,P,C,B) & coll(P,C,B))) # label(ruleX10) # label(axiom) # label(non_clause). [assumption]. 0.83/1.17 40 (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.83/1.17 41 (all A all B all C all D all M all N exists P (midp(M,A,B) & midp(N,C,D) -> para(P,M,B,D) & para(P,N,A,C) & midp(P,A,D))) # label(ruleX6) # label(axiom) # label(non_clause). [assumption]. 0.83/1.17 42 (all A all B all M (midp(M,B,A) -> midp(M,A,B))) # label(ruleD11) # label(axiom) # label(non_clause). [assumption]. 0.83/1.17 43 (all A all B all C all P all Q all R (cyclic(A,B,C,P) & cyclic(A,B,C,Q) & eqangle(C,A,C,B,R,P,R,Q) & cyclic(A,B,C,R) -> cong(A,B,P,Q))) # label(ruleD43) # label(axiom) # label(non_clause). [assumption]. 0.83/1.17 44 (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.83/1.17 45 (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.83/1.17 46 (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.83/1.17 47 (all A all B all C (coll(A,B,C) -> coll(B,A,C))) # label(ruleD2) # label(axiom) # label(non_clause). [assumption]. 0.83/1.17 48 (all A all B all C all D all M all N (midp(N,C,D) & midp(M,A,B) -> eqratio(M,A,A,B,N,C,C,D))) # label(ruleD70) # label(axiom) # label(non_clause). [assumption]. 0.83/1.17 49 (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.83/1.17 50 (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.83/1.17 51 (all A all B all P all Q (cong(A,P,B,P) & cyclic(A,B,P,Q) & cong(A,Q,B,Q) -> perp(P,A,A,Q))) # label(ruleD57) # label(axiom) # label(non_clause). [assumption]. 0.83/1.17 52 (all A all B all C (coll(A,B,C) -> coll(A,C,B))) # label(ruleD1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.17 53 (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.83/1.17 54 (all A all B all C all E all F (midp(E,A,B) & coll(F,A,C) & para(E,F,B,C) -> midp(F,A,C))) # label(ruleD45) # label(axiom) # label(non_clause). [assumption]. 0.83/1.17 55 (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.83/1.17 56 (all A all B all C all D all M exists O (midp(M,A,B) & para(A,B,C,D) & cyclic(A,B,C,D) -> circle(O,A,B,C))) # label(ruleX13) # label(axiom) # label(non_clause). [assumption]. 0.83/1.17 57 (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.83/1.17 58 (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.83/1.17 59 (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) -> cyclic(X,B,P,Q) & eqangle(A,P,B,P,A,Q,B,Q))) # label(ruleX5) # label(axiom) # label(non_clause). [assumption]. 0.83/1.17 60 (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.83/1.17 61 (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.83/1.17 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) -> eqratio(A,B,P,Q,C,D,U,V))) # label(ruleD29) # label(axiom) # label(non_clause). [assumption]. 0.83/1.17 63 (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.83/1.17 64 (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.83/1.17 65 (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.83/1.17 66 (all A all B all C all D (-para(A,B,C,D) & eqangle(A,B,C,D,C,D,A,B) -> perp(A,B,C,D))) # label(ruleD71) # label(axiom) # label(non_clause). [assumption]. 0.83/1.17 67 (all A all B all C (midp(A,B,C) -> cong(A,B,A,C))) # label(ruleD68) # label(axiom) # label(non_clause). [assumption]. 0.83/1.17 68 (all A all B all C all E all F exists P (perp(A,C,C,B) & coll(B,E,F) -> coll(P,E,F) & perp(P,A,E,F))) # label(ruleX15) # label(axiom) # label(non_clause). [assumption]. 0.83/1.17 69 (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.83/1.17 70 (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.83/1.17 71 (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.83/1.17 72 (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.83/1.17 73 (all A all B all O all X exists M (cong(O,A,O,B) & perp(O,X,A,B) -> coll(M,O,X) & coll(B,A,M))) # label(ruleX4) # label(axiom) # label(non_clause). [assumption]. 0.83/1.17 74 (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.83/1.17 75 (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.83/1.17 76 (all A all B all C all D all P all Q exists R (para(A,B,C,D) & coll(P,B,D) & coll(Q,A,B) & coll(P,A,C) -> coll(R,C,D) & coll(P,Q,R))) # label(ruleX18) # label(axiom) # label(non_clause). [assumption]. 0.83/1.17 77 (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.83/1.17 78 (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(M,O,X) & coll(B,A,M))) # label(ruleX3) # label(axiom) # label(non_clause). [assumption]. 0.83/1.17 79 (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.83/1.17 80 (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.83/1.17 81 (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.83/1.17 82 (all A all B all O (eqangle(O,A,A,B,A,B,O,B) & -coll(O,A,B) -> cong(O,A,O,B))) # label(ruleD47) # label(axiom) # label(non_clause). [assumption]. 0.83/1.17 83 (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.83/1.17 84 (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.83/1.17 85 (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.83/1.17 86 (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.83/1.17 87 (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.83/1.17 88 (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.83/1.17 89 (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.83/1.17 90 (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.83/1.17 91 (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.83/1.17 92 (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.83/1.17 93 (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.83/1.17 94 (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.83/1.17 95 -(all A all B all C all D all E all F all G (coll(D,A,B) & midp(F,C,B) & midp(G,D,E) & coll(E,A,C) & perp(E,B,A,C) & perp(D,C,A,B) -> perp(F,G,D,E))) # label(exemplo6GDDFULL012001) # label(negated_conjecture) # label(non_clause). [assumption]. 0.83/1.17 0.83/1.17 ============================== end of process non-clausal formulas === 0.83/1.17 0.83/1.17 ============================== PROCESS INITIAL CLAUSES =============== 0.83/1.17 0.83/1.17 ============================== PREDICATE ELIMINATION ================= 0.83/1.17 96 -cong(A,B,A,C) | -cong(A,B,A,D) | circle(A,B,D,C) # label(ruleD12) # label(axiom). [clausify(34)]. 0.83/1.17 97 -cong(A,B,A,C) | D = A | -cong(D,B,D,E) | -circle(A,B,E,F) | coll(f2(B,E,F,C,A,D),E,C) # label(ruleX12) # label(axiom). [clausify(3)]. 0.83/1.17 98 -cong(A,B,A,C) | D = A | -cong(D,B,D,E) | -circle(A,B,E,F) | cong(f2(B,E,F,C,A,D),D,D,B) # label(ruleX12) # label(axiom). [clausify(3)]. 0.83/1.17 99 -cong(A,B,A,C) | D = A | -cong(D,B,D,E) | -circle(A,B,E,F) | cong(f1(B,E,F,C,A,D),D,D,B) # label(ruleX12) # label(axiom). [clausify(3)]. 0.83/1.17 100 -cong(A,B,A,C) | D = A | -cong(D,B,D,E) | -circle(A,B,E,F) | coll(f1(B,E,F,C,A,D),B,F) # label(ruleX12) # label(axiom). [clausify(3)]. 0.83/1.17 101 -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(19)]. 0.83/1.17 Derived: -cong(A,B,A,C) | -cong(A,B,A,D) | -cong(A,B,A,E) | F = A | -cong(F,B,F,D) | coll(f2(B,D,C,E,A,F),D,E). [resolve(96,c,97,d)]. 0.83/1.17 Derived: -cong(A,B,A,C) | -cong(A,B,A,D) | -cong(A,B,A,E) | F = A | -cong(F,B,F,D) | cong(f2(B,D,C,E,A,F),F,F,B). [resolve(96,c,98,d)]. 0.83/1.17 Derived: -cong(A,B,A,C) | -cong(A,B,A,D) | -cong(A,B,A,E) | F = A | -cong(F,B,F,D) | cong(f1(B,D,C,E,A,F),F,F,B). [resolve(96,c,99,d)]. 0.83/1.17 Derived: -cong(A,B,A,C) | -cong(A,B,A,D) | -cong(A,B,A,E) | F = A | -cong(F,B,F,D) | coll(f1(B,D,C,E,A,F),B,C). [resolve(96,c,100,d)]. 0.83/1.17 Derived: -cong(A,B,A,C) | -cong(A,B,A,D) | -eqangle(B,D,B,C,A,D,A,E) | -coll(E,D,C) | midp(E,D,C). [resolve(96,c,101,a)]. 0.83/1.17 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.83/1.17 Derived: -perp(A,B,B,C) | eqangle(B,C,B,D,E,B,E,D) | -cong(A,B,A,E) | -cong(A,B,A,D). [resolve(102,a,96,c)]. 0.83/1.17 103 -circle(A,B,C,D) | -coll(A,B,D) | perp(B,C,C,D) # label(ruleD53) # label(axiom). [clausify(44)]. 0.83/1.17 Derived: -coll(A,B,C) | perp(B,D,D,C) | -cong(A,B,A,C) | -cong(A,B,A,D). [resolve(103,a,96,c)]. 0.83/1.17 104 -circle(A,B,C,D) | perp(f11(B,C,D,A),B,B,A) # label(ruleX11) # label(axiom). [clausify(46)]. 0.83/1.17 Derived: perp(f11(A,B,C,D),A,A,D) | -cong(D,A,D,C) | -cong(D,A,D,B). [resolve(104,a,96,c)]. 0.83/1.17 105 -midp(A,B,C) | -para(B,C,D,E) | -cyclic(B,C,D,E) | circle(f12(B,C,D,E,A),B,C,D) # label(ruleX13) # label(axiom). [clausify(56)]. 0.83/1.17 Derived: -midp(A,B,C) | -para(B,C,D,E) | -cyclic(B,C,D,E) | -cong(f12(B,C,D,E,A),B,f12(B,C,D,E,A),F) | V6 = f12(B,C,D,E,A) | -cong(V6,B,V6,C) | coll(f2(B,C,D,F,f12(B,C,D,E,A),V6),C,F). [resolve(105,d,97,d)]. 0.83/1.17 Derived: -midp(A,B,C) | -para(B,C,D,E) | -cyclic(B,C,D,E) | -cong(f12(B,C,D,E,A),B,f12(B,C,D,E,A),F) | V6 = f12(B,C,D,E,A) | -cong(V6,B,V6,C) | cong(f2(B,C,D,F,f12(B,C,D,E,A),V6),V6,V6,B). [resolve(105,d,98,d)]. 1.09/1.40 Derived: -midp(A,B,C) | -para(B,C,D,E) | -cyclic(B,C,D,E) | -cong(f12(B,C,D,E,A),B,f12(B,C,D,E,A),F) | V6 = f12(B,C,D,E,A) | -cong(V6,B,V6,C) | cong(f1(B,C,D,F,f12(B,C,D,E,A),V6),V6,V6,B). [resolve(105,d,99,d)]. 1.09/1.40 Derived: -midp(A,B,C) | -para(B,C,D,E) | -cyclic(B,C,D,E) | -cong(f12(B,C,D,E,A),B,f12(B,C,D,E,A),F) | V6 = f12(B,C,D,E,A) | -cong(V6,B,V6,C) | coll(f1(B,C,D,F,f12(B,C,D,E,A),V6),B,D). [resolve(105,d,100,d)]. 1.09/1.40 Derived: -midp(A,B,C) | -para(B,C,D,E) | -cyclic(B,C,D,E) | -eqangle(B,C,B,D,f12(B,C,D,E,A),C,f12(B,C,D,E,A),F) | -coll(F,C,D) | midp(F,C,D). [resolve(105,d,101,a)]. 1.09/1.40 Derived: -midp(A,B,C) | -para(B,C,D,E) | -cyclic(B,C,D,E) | -perp(f12(B,C,D,E,A),B,B,F) | eqangle(B,F,B,C,D,B,D,C). [resolve(105,d,102,a)]. 1.09/1.40 Derived: -midp(A,B,C) | -para(B,C,D,E) | -cyclic(B,C,D,E) | -coll(f12(B,C,D,E,A),B,D) | perp(B,C,C,D). [resolve(105,d,103,a)]. 1.09/1.40 Derived: -midp(A,B,C) | -para(B,C,D,E) | -cyclic(B,C,D,E) | perp(f11(B,C,D,f12(B,C,D,E,A)),B,B,f12(B,C,D,E,A)). [resolve(105,d,104,a)]. 1.09/1.40 106 -midp(A,B,C) | -circle(D,E,B,C) | eqangle(E,B,E,C,D,B,D,A) # label(ruleD50) # label(axiom). [clausify(61)]. 1.09/1.40 Derived: -midp(A,B,C) | eqangle(D,B,D,C,E,B,E,A) | -cong(E,D,E,C) | -cong(E,D,E,B). [resolve(106,b,96,c)]. 1.09/1.40 Derived: -midp(A,B,C) | eqangle(D,B,D,C,f12(D,B,C,E,F),B,f12(D,B,C,E,F),A) | -midp(F,D,B) | -para(D,B,C,E) | -cyclic(D,B,C,E). [resolve(106,b,105,d)]. 1.09/1.40 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(87)]. 1.09/1.40 Derived: -eqangle(A,B,A,C,D,A,D,C) | perp(E,A,A,B) | -cong(E,A,E,D) | -cong(E,A,E,C). [resolve(107,a,96,c)]. 1.09/1.40 Derived: -eqangle(A,B,A,C,D,A,D,C) | perp(f12(A,C,D,E,F),A,A,B) | -midp(F,A,C) | -para(A,C,D,E) | -cyclic(A,C,D,E). [resolve(107,a,105,d)]. 1.09/1.40 108 -cyclic(A,B,C,D) | -perp(A,C,C,B) | circle(f20(A,B,C,D),A,B,C) # label(ruleX14) # label(axiom). [clausify(90)]. 1.09/1.40 Derived: -cyclic(A,B,C,D) | -perp(A,C,C,B) | -cong(f20(A,B,C,D),A,f20(A,B,C,D),E) | F = f20(A,B,C,D) | -cong(F,A,F,B) | coll(f2(A,B,C,E,f20(A,B,C,D),F),B,E). [resolve(108,c,97,d)]. 1.09/1.40 Derived: -cyclic(A,B,C,D) | -perp(A,C,C,B) | -cong(f20(A,B,C,D),A,f20(A,B,C,D),E) | F = f20(A,B,C,D) | -cong(F,A,F,B) | cong(f2(A,B,C,E,f20(A,B,C,D),F),F,F,A). [resolve(108,c,98,d)]. 1.09/1.40 Derived: -cyclic(A,B,C,D) | -perp(A,C,C,B) | -cong(f20(A,B,C,D),A,f20(A,B,C,D),E) | F = f20(A,B,C,D) | -cong(F,A,F,B) | cong(f1(A,B,C,E,f20(A,B,C,D),F),F,F,A). [resolve(108,c,99,d)]. 1.09/1.40 Derived: -cyclic(A,B,C,D) | -perp(A,C,C,B) | -cong(f20(A,B,C,D),A,f20(A,B,C,D),E) | F = f20(A,B,C,D) | -cong(F,A,F,B) | coll(f1(A,B,C,E,f20(A,B,C,D),F),A,C). [resolve(108,c,100,d)]. 1.09/1.40 Derived: -cyclic(A,B,C,D) | -perp(A,C,C,B) | -eqangle(A,B,A,C,f20(A,B,C,D),B,f20(A,B,C,D),E) | -coll(E,B,C) | midp(E,B,C). [resolve(108,c,101,a)]. 1.09/1.40 Derived: -cyclic(A,B,C,D) | -perp(A,C,C,B) | -perp(f20(A,B,C,D),A,A,E) | eqangle(A,E,A,B,C,A,C,B). [resolve(108,c,102,a)]. 1.09/1.40 Derived: -cyclic(A,B,C,D) | -perp(A,C,C,B) | -coll(f20(A,B,C,D),A,C) | perp(A,B,B,C). [resolve(108,c,103,a)]. 1.09/1.40 Derived: -cyclic(A,B,C,D) | -perp(A,C,C,B) | perp(f11(A,B,C,f20(A,B,C,D)),A,A,f20(A,B,C,D)). [resolve(108,c,104,a)]. 1.09/1.40 Derived: -cyclic(A,B,C,D) | -perp(A,C,C,B) | -midp(E,B,C) | eqangle(A,B,A,C,f20(A,B,C,D),B,f20(A,B,C,D),E). [resolve(108,c,106,b)]. 1.09/1.40 Derived: -cyclic(A,B,C,D) | -perp(A,C,C,B) | -eqangle(A,E,A,B,C,A,C,B) | perp(f20(A,B,C,D),A,A,E). [resolve(108,c,107,a)]. 1.09/1.40 1.09/1.40 ============================== end predicate elimination ============= 1.09/1.40 1.09/1.40 Auto_denials: (non-Horn, no changes). 1.09/1.40 1.09/1.40 Term ordering decisions: 1.09/1.40 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. f4=1. f3=1. f7=1. f8=1. f11=1. f15=1. f16=1. f18=1. f20=1. f5=1. f6=1. f12=1. f13=1. f14=1. f1=1. f2=1. f9=1. f17=1. f10=1. f19=1. 1.09/1.40 1.09/1.40 ============================== end of process initial clauses ======== 1.09/1.40 1.09/1.40 ============================== CLAUSES FOR SEARCH ==================== 1.09/1.40 1.09/1.40 ============================== end of clauses for search ============= 1.09/1.40 1.09/1.40 ============================== SEARCH ================================ 1.09/1.40 1.09/1.40 % Starting search at 0.03 seconds. 1.09/1.40 1.09/1.40 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 697 (0.00 of 0.24 sec). 5.53/5.82 5.53/5.82 Low Water (keep): wt=47.000, iters=3340 5.53/5.82 5.53/5.82 Low Water (keep): wt=42.000, iters=3395 5.53/5.82 5.53/5.82 Low Water (keep): wt=40.000, iters=3385 5.53/5.82 5.53/5.82 Low Water (keep): wt=33.000, iters=3341 5.53/5.82 5.53/5.82 Low Water (keep): wt=32.000, iters=3485 5.53/5.82 5.53/5.82 Low Water (keep): wt=30.000, iters=3476 5.53/5.82 5.53/5.82 Low Water (keep): wt=29.000, iters=3473 5.53/5.82 5.53/5.82 Low Water (keep): wt=28.000, iters=3439 5.53/5.82 5.53/5.82 Low Water (keep): wt=24.000, iters=3346 5.53/5.82 5.53/5.82 Low Water (keep): wt=23.000, iters=3416 5.53/5.82 5.53/5.82 Low Water (keep): wt=22.000, iters=3423 5.53/5.82 5.53/5.82 Low Water (keep): wt=21.000, iters=3467 5.53/5.82 5.53/5.82 Low Water (keep): wt=19.000, iters=3398 5.53/5.82 5.53/5.82 Low Water (keep): wt=18.000, iters=3359 5.53/5.82 5.53/5.82 Low Water (keep): wt=17.000, iters=3414 5.53/5.82 5.53/5.82 Low Water (keep): wt=16.000, iters=3336 5.53/5.82 5.53/5.82 Low Water (keep): wt=15.000, iters=3333 5.53/5.82 5.53/5.82 Low Water (keep): wt=14.000, iters=3343 5.53/5.82 5.53/5.82 Low Water (keep): wt=13.000, iters=3333 5.53/5.82 5.53/5.82 Low Water (displace): id=4841, wt=48.000 5.53/5.82 5.53/5.82 Low Water (displace): id=13185, wt=12.000 5.53/5.82 5.53/5.82 Low Water (displace): id=13569, wt=8.000 5.53/5.82 5.53/5.82 Low Water (keep): wt=12.000, iters=3376 5.53/5.82 5.53/5.82 Low Water (keep): wt=11.000, iters=3368 5.53/5.82 5.53/5.82 Low Water (displace): id=22130, wt=7.000 5.53/5.82 5.53/5.82 Low Water (displace): id=22153, wt=5.000 5.53/5.82 5.53/5.82 Low Water (keep): wt=10.000, iters=3333 5.53/5.82 5.53/5.82 ============================== PROOF ================================= 5.53/5.82 % SZS status Theorem 5.53/5.82 % SZS output start Refutation 5.53/5.82 5.53/5.82 % Proof 1 at 4.59 (+ 0.08) seconds. 5.53/5.82 % Length of proof is 93. 5.53/5.82 % Level of proof is 17. 5.53/5.82 % Maximum clause weight is 18.000. 5.53/5.82 % Given clauses 5557. 5.53/5.82 5.53/5.82 6 (all A all B all P all Q (cong(A,Q,B,Q) & cong(A,P,B,P) -> perp(A,B,P,Q))) # label(ruleD56) # label(axiom) # label(non_clause). [assumption]. 5.53/5.82 26 (all A all B all C (midp(A,B,C) -> coll(A,B,C))) # label(ruleD69) # label(axiom) # label(non_clause). [assumption]. 5.53/5.82 30 (all A all B all C all D all M (midp(M,A,B) & para(A,C,B,D) & para(A,D,B,C) -> midp(M,C,D))) # label(ruleD64) # label(axiom) # label(non_clause). [assumption]. 5.53/5.82 42 (all A all B all M (midp(M,B,A) -> midp(M,A,B))) # label(ruleD11) # label(axiom) # label(non_clause). [assumption]. 5.53/5.82 47 (all A all B all C (coll(A,B,C) -> coll(B,A,C))) # label(ruleD2) # label(axiom) # label(non_clause). [assumption]. 5.53/5.82 49 (all A all B all C all D (coll(A,B,D) & coll(A,B,C) -> coll(C,D,A))) # label(ruleD3) # label(axiom) # label(non_clause). [assumption]. 5.53/5.82 52 (all A all B all C (coll(A,B,C) -> coll(A,C,B))) # label(ruleD1) # label(axiom) # label(non_clause). [assumption]. 5.53/5.82 55 (all A all B all C all D (para(A,B,C,D) -> para(A,B,D,C))) # label(ruleD4) # label(axiom) # label(non_clause). [assumption]. 5.53/5.82 57 (all A all B all C all D (para(A,B,C,D) -> para(C,D,A,B))) # label(ruleD5) # label(axiom) # label(non_clause). [assumption]. 5.53/5.82 58 (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]. 5.53/5.82 60 (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]. 5.53/5.82 63 (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]. 5.53/5.82 64 (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]. 5.53/5.82 65 (all A all B all C all D (perp(A,B,C,D) -> perp(C,D,A,B))) # label(ruleD8) # label(axiom) # label(non_clause). [assumption]. 5.53/5.82 67 (all A all B all C (midp(A,B,C) -> cong(A,B,A,C))) # label(ruleD68) # label(axiom) # label(non_clause). [assumption]. 5.53/5.82 71 (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]. 5.53/5.82 72 (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]. 5.53/5.82 85 (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]. 5.53/5.82 94 (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]. 5.53/5.82 95 -(all A all B all C all D all E all F all G (coll(D,A,B) & midp(F,C,B) & midp(G,D,E) & coll(E,A,C) & perp(E,B,A,C) & perp(D,C,A,B) -> perp(F,G,D,E))) # label(exemplo6GDDFULL012001) # label(negated_conjecture) # label(non_clause). [assumption]. 5.53/5.82 113 -cong(A,B,C,B) | -cong(A,D,C,D) | perp(A,C,D,B) # label(ruleD56) # label(axiom). [clausify(6)]. 5.53/5.82 136 -midp(A,B,C) | coll(A,B,C) # label(ruleD69) # label(axiom). [clausify(26)]. 5.53/5.82 140 -midp(A,B,C) | -para(B,D,C,E) | -para(B,E,C,D) | midp(A,D,E) # label(ruleD64) # label(axiom). [clausify(30)]. 5.53/5.82 155 -midp(A,B,C) | midp(A,C,B) # label(ruleD11) # label(axiom). [clausify(42)]. 5.53/5.82 158 -coll(A,B,C) | coll(B,A,C) # label(ruleD2) # label(axiom). [clausify(47)]. 5.53/5.82 160 -coll(A,B,C) | -coll(A,B,D) | coll(D,C,A) # label(ruleD3) # label(axiom). [clausify(49)]. 5.53/5.82 163 -coll(A,B,C) | coll(A,C,B) # label(ruleD1) # label(axiom). [clausify(52)]. 5.53/5.82 166 -para(A,B,C,D) | para(A,B,D,C) # label(ruleD4) # label(axiom). [clausify(55)]. 5.53/5.82 167 -para(A,B,C,D) | para(C,D,A,B) # label(ruleD5) # label(axiom). [clausify(57)]. 5.53/5.82 168 -midp(A,B,C) | -midp(A,D,E) | para(D,B,E,C) # label(ruleD63) # label(axiom). [clausify(58)]. 5.53/5.82 171 -cong(A,B,A,C) | -coll(A,B,C) | midp(A,B,C) # label(ruleD67) # label(axiom). [clausify(60)]. 5.53/5.82 173 -para(A,B,C,D) | -perp(C,D,E,F) | perp(A,B,E,F) # label(ruleD10) # label(axiom). [clausify(63)]. 5.53/5.82 174 -cong(A,B,C,D) | cong(C,D,A,B) # label(ruleD24) # label(axiom). [clausify(64)]. 5.53/5.82 175 -perp(A,B,C,D) | perp(C,D,A,B) # label(ruleD8) # label(axiom). [clausify(65)]. 5.53/5.82 177 -midp(A,B,C) | cong(A,B,A,C) # label(ruleD68) # label(axiom). [clausify(67)]. 5.53/5.82 183 -perp(A,B,C,D) | -perp(E,F,A,B) | para(E,F,C,D) # label(ruleD9) # label(axiom). [clausify(71)]. 5.53/5.82 184 -cong(A,B,C,D) | -cong(E,F,A,B) | cong(E,F,C,D) # label(ruleD25) # label(axiom). [clausify(72)]. 5.53/5.82 200 -perp(A,B,C,D) | perp(A,B,D,C) # label(ruleD7) # label(axiom). [clausify(85)]. 5.53/5.82 207 -cong(A,B,C,D) | cong(A,B,D,C) # label(ruleD23) # label(axiom). [clausify(94)]. 5.53/5.82 209 midp(c6,c3,c2) # label(exemplo6GDDFULL012001) # label(negated_conjecture). [clausify(95)]. 5.53/5.82 210 midp(c7,c4,c5) # label(exemplo6GDDFULL012001) # label(negated_conjecture). [clausify(95)]. 5.53/5.82 213 perp(c4,c3,c1,c2) # label(exemplo6GDDFULL012001) # label(negated_conjecture). [clausify(95)]. 5.53/5.82 214 -perp(c6,c7,c4,c5) # label(exemplo6GDDFULL012001) # label(negated_conjecture). [clausify(95)]. 5.53/5.82 259 -midp(A,B,C) | -para(B,D,C,D) | midp(A,D,D). [factor(140,b,c)]. 5.53/5.82 274 -coll(A,B,C) | coll(C,C,A). [factor(160,a,b)]. 5.53/5.82 322 cong(c6,c3,c6,c2). [resolve(209,a,177,a)]. 5.53/5.82 329 midp(c6,c2,c3). [resolve(209,a,155,a)]. 5.53/5.82 340 cong(c7,c4,c7,c5). [resolve(210,a,177,a)]. 5.53/5.82 341 -midp(c7,A,B) | para(c4,A,c5,B). [resolve(210,a,168,b)]. 5.53/5.82 342 -midp(c7,A,B) | para(A,c4,B,c5). [resolve(210,a,168,a)]. 5.53/5.82 347 midp(c7,c5,c4). [resolve(210,a,155,a)]. 5.53/5.82 378 -perp(c1,c2,A,B) | para(c4,c3,A,B). [resolve(213,a,183,b)]. 5.53/5.82 380 perp(c1,c2,c4,c3). [resolve(213,a,175,a)]. 5.53/5.82 424 cong(c6,c2,c6,c3). [resolve(329,a,177,a)]. 5.53/5.82 437 coll(c6,c2,c3). [resolve(329,a,136,a)]. 5.53/5.82 452 cong(c7,c5,c7,c4). [resolve(347,a,177,a)]. 5.53/5.82 454 -midp(c7,A,B) | para(A,c5,B,c4). [resolve(347,a,168,a)]. 5.53/5.82 465 coll(c7,c5,c4). [resolve(347,a,136,a)]. 5.53/5.82 499 coll(c3,c3,c6). [resolve(437,a,274,a)]. 5.53/5.82 512 coll(c4,c4,c7). [resolve(465,a,274,a)]. 5.53/5.82 606 -cong(c6,c2,A,B) | cong(c6,c3,A,B). [resolve(322,a,184,b)]. 5.53/5.82 656 coll(c3,c6,c3). [resolve(499,a,163,a)]. 5.53/5.82 680 coll(c4,c7,c4). [resolve(512,a,163,a)]. 5.53/5.82 762 coll(c6,c3,c3). [resolve(656,a,158,a)]. 5.53/5.82 790 coll(c7,c4,c4). [resolve(680,a,158,a)]. 5.53/5.82 902 cong(c7,c4,c5,c7). [resolve(340,a,207,a)]. 5.53/5.82 903 -cong(c7,c5,A,B) | cong(c7,c4,A,B). [resolve(340,a,184,b)]. 5.53/5.82 918 para(c4,c5,c5,c4). [resolve(341,a,347,a)]. 5.53/5.82 997 perp(c1,c2,c3,c4). [resolve(380,a,200,a)]. 5.53/5.82 1416 cong(c5,c7,c7,c4). [resolve(902,a,174,a)]. 5.53/5.82 1430 -perp(c5,c4,A,B) | perp(c4,c5,A,B). [resolve(918,a,173,a)]. 5.53/5.82 1784 cong(c5,c7,c4,c7). [resolve(1416,a,207,a)]. 5.53/5.82 2062 -cong(c5,A,c4,A) | perp(c5,c4,A,c7). [resolve(1784,a,113,a)]. 5.53/5.82 2555 para(c4,c3,c3,c4). [resolve(378,a,997,a)]. 5.53/5.82 2675 para(c3,c4,c4,c3). [resolve(2555,a,167,a)]. 5.53/5.82 2864 para(c3,c4,c3,c4). [resolve(2675,a,166,a)]. 5.53/5.82 2897 -midp(A,c3,c3) | midp(A,c4,c4). [resolve(2864,a,259,b)]. 5.53/5.82 4243 cong(c6,c3,c6,c3). [resolve(606,a,424,a)]. 5.53/5.82 4375 midp(c6,c3,c3). [resolve(4243,a,171,a),unit_del(a,762)]. 5.53/5.82 4410 midp(c6,c4,c4). [resolve(4375,a,2897,a)]. 5.53/5.82 8239 cong(c7,c4,c7,c4). [resolve(903,a,452,a)]. 5.53/5.82 8340 midp(c7,c4,c4). [resolve(8239,a,171,a),unit_del(a,790)]. 5.53/5.82 8365 para(c4,c5,c4,c4). [resolve(8340,a,454,a)]. 5.53/5.82 8387 para(c4,c4,c4,c5). [resolve(8340,a,342,a)]. 5.53/5.82 8772 -midp(A,c4,c4) | midp(A,c4,c5). [resolve(8365,a,140,c),unit_del(b,8387)]. 5.53/5.82 12162 midp(c6,c4,c5). [resolve(8772,a,4410,a)]. 5.53/5.82 12215 cong(c6,c4,c6,c5). [resolve(12162,a,177,a)]. 5.53/5.82 12327 cong(c6,c4,c5,c6). [resolve(12215,a,207,a)]. 5.53/5.82 12378 cong(c5,c6,c6,c4). [resolve(12327,a,174,a)]. 5.53/5.82 12424 cong(c5,c6,c4,c6). [resolve(12378,a,207,a)]. 5.53/5.82 24393 perp(c5,c4,c6,c7). [resolve(2062,a,12424,a)]. 5.53/5.82 24466 perp(c4,c5,c6,c7). [resolve(24393,a,1430,a)]. 5.53/5.82 24534 $F. [resolve(24466,a,175,a),unit_del(a,214)]. 5.53/5.82 5.53/5.82 % SZS output end Refutation 5.53/5.82 ============================== end of proof ========================== 5.53/5.82 5.53/5.82 ============================== STATISTICS ============================ 5.53/5.82 5.53/5.82 Given=5557. Generated=70917. Kept=24417. proofs=1. 5.53/5.82 Usable=5517. Sos=9999. Demods=0. Limbo=2, Disabled=9049. Hints=0. 5.53/5.82 Megabytes=14.73. 5.53/5.82 User_CPU=4.59, System_CPU=0.08, Wall_clock=5. 5.53/5.82 5.53/5.82 ============================== end of statistics ===================== 5.53/5.82 5.53/5.82 ============================== end of search ========================= 5.53/5.82 5.53/5.82 THEOREM PROVED 5.53/5.82 % SZS status Theorem 5.53/5.82 5.53/5.82 Exiting with 1 proof. 5.53/5.82 5.53/5.82 Process 17368 exit (max_proofs) Tue Aug 9 03:18:11 2022 5.53/5.82 Prover9 interrupted 5.53/5.83 EOF