0.03/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s 0.12/0.34 % Computer : n005.cluster.edu 0.12/0.34 % Model : x86_64 x86_64 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.34 % Memory : 8042.1875MB 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.34 % CPULimit : 960 0.12/0.34 % DateTime : Thu Jul 2 06:54:06 EDT 2020 0.12/0.34 % CPUTime : 0.44/1.01 ============================== Prover9 =============================== 0.44/1.01 Prover9 (32) version 2009-11A, November 2009. 0.44/1.01 Process 16101 was started by sandbox2 on n005.cluster.edu, 0.44/1.01 Thu Jul 2 06:54:07 2020 0.44/1.01 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_15806_n005.cluster.edu". 0.44/1.01 ============================== end of head =========================== 0.44/1.01 0.44/1.01 ============================== INPUT ================================= 0.44/1.01 0.44/1.01 % Reading from file /tmp/Prover9_15806_n005.cluster.edu 0.44/1.01 0.44/1.01 set(prolog_style_variables). 0.44/1.01 set(auto2). 0.44/1.01 % set(auto2) -> set(auto). 0.44/1.01 % set(auto) -> set(auto_inference). 0.44/1.01 % set(auto) -> set(auto_setup). 0.44/1.01 % set(auto_setup) -> set(predicate_elim). 0.44/1.01 % set(auto_setup) -> assign(eq_defs, unfold). 0.44/1.01 % set(auto) -> set(auto_limits). 0.44/1.01 % set(auto_limits) -> assign(max_weight, "100.000"). 0.44/1.01 % set(auto_limits) -> assign(sos_limit, 20000). 0.44/1.01 % set(auto) -> set(auto_denials). 0.44/1.01 % set(auto) -> set(auto_process). 0.44/1.01 % set(auto2) -> assign(new_constants, 1). 0.44/1.01 % set(auto2) -> assign(fold_denial_max, 3). 0.44/1.01 % set(auto2) -> assign(max_weight, "200.000"). 0.44/1.01 % set(auto2) -> assign(max_hours, 1). 0.44/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.44/1.01 % set(auto2) -> assign(max_seconds, 0). 0.44/1.01 % set(auto2) -> assign(max_minutes, 5). 0.44/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.44/1.01 % set(auto2) -> set(sort_initial_sos). 0.44/1.01 % set(auto2) -> assign(sos_limit, -1). 0.44/1.01 % set(auto2) -> assign(lrs_ticks, 3000). 0.44/1.01 % set(auto2) -> assign(max_megs, 400). 0.44/1.01 % set(auto2) -> assign(stats, some). 0.44/1.01 % set(auto2) -> clear(echo_input). 0.44/1.01 % set(auto2) -> set(quiet). 0.44/1.01 % set(auto2) -> clear(print_initial_clauses). 0.44/1.01 % set(auto2) -> clear(print_given). 0.44/1.01 assign(lrs_ticks,-1). 0.44/1.01 assign(sos_limit,10000). 0.44/1.01 assign(order,kbo). 0.44/1.01 set(lex_order_vars). 0.44/1.01 clear(print_given). 0.44/1.01 0.44/1.01 % formulas(sos). % not echoed (32 formulas) 0.44/1.01 0.44/1.01 ============================== end of input ========================== 0.44/1.01 0.44/1.01 % From the command line: assign(max_seconds, 960). 0.44/1.01 0.44/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.44/1.01 0.44/1.01 % Formulas that are not ordinary clauses: 0.44/1.01 1 (all L all M (line(L) & unequally_directed_lines(L,M) & unequally_directed_lines(L,reverse_line(M)) & line(M) -> point(intersection_point(L,M)))) # label(oagco2) # label(axiom) # label(non_clause). [assumption]. 0.44/1.01 2 (all A all L all M (unequally_directed_lines(L,M) & left_apart_point(A,L) -> left_apart_point(A,reverse_line(M)) | distinct_lines(L,M))) # label(oagsub2) # label(axiom) # label(non_clause). [assumption]. 0.44/1.01 3 (all L all M -(left_convergent_lines(L,reverse_line(M)) | left_convergent_lines(L,M))) # label(oag11) # label(axiom) # label(non_clause). [assumption]. 0.44/1.01 4 (all A all L (left_apart_point(A,reverse_line(L)) | left_apart_point(A,L) <-> apart_point_and_line(A,L))) # label(apt_def) # label(axiom) # label(non_clause). [assumption]. 0.44/1.01 5 (all L all M all N (distinct_lines(L,M) -> distinct_lines(L,N) | distinct_lines(M,N))) # label(oag4) # label(axiom) # label(non_clause). [assumption]. 0.44/1.01 6 (all L all A all B all C (between_on_line(L,A,B,C) <-> before_on_line(L,B,C) & before_on_line(L,A,B) | before_on_line(L,C,B) & before_on_line(L,B,A))) # label(bet_def) # label(axiom) # label(non_clause). [assumption]. 0.44/1.01 7 (all L -distinct_lines(L,L)) # label(oag3) # label(axiom) # label(non_clause). [assumption]. 0.44/1.01 8 (all L -distinct_lines(L,reverse_line(L))) # label(oagco8) # label(axiom) # label(non_clause). [assumption]. 0.44/1.01 9 (all A all B all L (left_apart_point(A,L) & distinct_points(A,B) -> left_convergent_lines(line_connecting(A,B),L) | left_apart_point(B,L))) # label(oaguc2) # label(axiom) # label(non_clause). [assumption]. 0.44/1.01 10 (all L (line(L) -> line(reverse_line(L)))) # label(oagco4) # label(axiom) # label(non_clause). [assumption]. 0.44/1.01 11 (all L all M (line(M) & line(L) -> unequally_directed_lines(L,reverse_line(M)) | unequally_directed_lines(L,M))) # label(oag8) # label(axiom) # label(non_clause). [assumption]. 0.44/1.01 12 (all L all M all N (unequally_directed_lines(L,M) -> unequally_directed_lines(L,N) | unequally_directed_lines(M,N))) # label(oag6) # label(axiom) # label(non_clause). [assumption]. 0.44/1.01 13 (all L all M (unequally_directed_lines(L,M) & unequally_directed_lines(L,reverse_line(M)) -> left_convergent_lines(L,reverse_line(M)) | left_convergent_lines(L,M))) # label(oag9) # label(axiom) # label(non_clause). [assumption]. 0.44/1.01 14 (all A all B all C (distinct_points(A,B) -> distinct_points(A,C) | distinct_points(B,C))) # label(oag2) # label(axiom) # label(non_clause). [assumption]. 0.44/1.01 15 (all A all B (distinct_points(A,B) -> -apart_point_and_line(A,line_connecting(A,B)) & -apart_point_and_line(B,line_connecting(A,B)))) # label(oagco5) # label(axiom) # label(non_clause). [assumption]. 0.44/1.01 16 (all L -unequally_directed_lines(L,L)) # label(oag5) # label(axiom) # label(non_clause). [assumption]. 0.44/1.01 17 (all L all M (unequally_directed_lines(L,reverse_line(M)) & unequally_directed_lines(L,M) -> -apart_point_and_line(intersection_point(L,M),M) & -apart_point_and_line(intersection_point(L,M),L))) # label(oagco6) # label(axiom) # label(non_clause). [assumption]. 0.44/1.01 18 (all A all L -(left_apart_point(A,reverse_line(L)) | left_apart_point(A,L))) # label(oag10) # label(axiom) # label(non_clause). [assumption]. 0.44/1.01 19 (all L all M all N (unequally_directed_lines(L,reverse_line(M)) & unequally_directed_lines(L,M) -> unequally_directed_lines(M,reverse_line(N)) & unequally_directed_lines(M,N) | unequally_directed_lines(L,N) & unequally_directed_lines(L,reverse_line(N)))) # label(oag7) # label(axiom) # label(non_clause). [assumption]. 0.44/1.01 20 (all L all M (convergent_lines(L,M) <-> unequally_directed_lines(L,reverse_line(M)) & unequally_directed_lines(L,M))) # label(con_def) # label(axiom) # label(non_clause). [assumption]. 0.44/1.01 21 (all A all B (point(B) & distinct_points(A,B) & point(A) -> line(line_connecting(A,B)))) # label(oagco1) # label(axiom) # label(non_clause). [assumption]. 0.44/1.01 22 (all A all B -unequally_directed_lines(line_connecting(A,B),reverse_line(line_connecting(B,A)))) # label(oagco9) # label(axiom) # label(non_clause). [assumption]. 0.44/1.01 23 (all A -distinct_points(A,A)) # label(oag1) # label(axiom) # label(non_clause). [assumption]. 0.44/1.01 24 (all A all B all L (left_apart_point(B,reverse_line(L)) & left_apart_point(A,L) | left_apart_point(A,reverse_line(L)) & left_apart_point(B,L) <-> divides_points(L,A,B))) # label(div_def) # label(axiom) # label(non_clause). [assumption]. 0.44/1.01 25 (all L all A all B (before_on_line(L,A,B) <-> -(left_apart_point(A,L) | left_apart_point(A,reverse_line(L))) & -(left_apart_point(B,L) | left_apart_point(B,reverse_line(L))) & -unequally_directed_lines(L,line_connecting(A,B)) & distinct_points(A,B))) # label(bf_def) # label(axiom) # label(non_clause). [assumption]. 0.44/1.01 26 (all A all B all L (left_apart_point(A,L) -> distinct_points(A,B) | left_apart_point(B,L))) # label(oagsub1) # label(axiom) # label(non_clause). [assumption]. 0.44/1.01 27 (all L all M all N (left_convergent_lines(L,M) -> left_convergent_lines(L,N) | unequally_directed_lines(M,N))) # label(oagsub3) # label(axiom) # label(non_clause). [assumption]. 0.44/1.01 28 (all A all L -unequally_directed_lines(parallel_through_point(L,A),L)) # label(oagco10) # label(axiom) # label(non_clause). [assumption]. 0.44/1.01 29 (all A all B all L all M (distinct_points(A,B) & distinct_lines(L,M) -> left_apart_point(B,L) | left_apart_point(B,reverse_line(L)) | left_apart_point(A,reverse_line(L)) | left_apart_point(B,M) | left_apart_point(A,L) | left_apart_point(B,reverse_line(M)) | left_apart_point(A,reverse_line(M)) | left_apart_point(A,M))) # label(oaguc1) # label(axiom) # label(non_clause). [assumption]. 0.44/1.01 30 (all A all L -apart_point_and_line(A,parallel_through_point(L,A))) # label(oagco7) # label(axiom) # label(non_clause). [assumption]. 0.44/1.01 31 (all L all A (point(A) & line(L) -> line(parallel_through_point(L,A)))) # label(oagco3) # label(axiom) # label(non_clause). [assumption]. 0.44/1.01 32 -(all A all B all L (-apart_point_and_line(A,L) & -apart_point_and_line(B,L) & distinct_points(A,B) -> before_on_line(L,A,B) & before_on_line(L,B,A))) # label(con) # label(negated_conjecture) # label(non_clause). [assumption]. 0.44/1.01 0.44/1.01 ============================== end of process non-clausal formulas === 0.44/1.01 0.44/1.01 ============================== PROCESS INITIAL CLAUSES =============== 0.44/1.01 0.44/1.01 ============================== PREDICATE ELIMINATION ================= 0.44/1.01 33 -left_apart_point(A,B) | apart_point_and_line(A,B) # label(apt_def) # label(axiom). [clausify(4)]. 0.44/1.01 34 -apart_point_and_line(c1,c3) # label(con) # label(negated_conjecture). [clausify(32)]. 0.44/1.01 35 -apart_point_and_line(c2,c3) # label(con) # label(negated_conjecture). [clausify(32)]. 0.44/1.01 36 -apart_point_and_line(A,parallel_through_point(B,A)) # label(oagco7) # label(axiom). [clausify(30)]. 0.44/1.01 37 -distinct_points(A,B) | -apart_point_and_line(A,line_connecting(A,B)) # label(oagco5) # label(axiom). [clausify(15)]. 0.44/1.01 38 -distinct_points(A,B) | -apart_point_and_line(B,line_connecting(A,B)) # label(oagco5) # label(axiom). [clausify(15)]. 0.44/1.01 39 -unequally_directed_lines(A,reverse_line(B)) | -unequally_directed_lines(A,B) | -apart_point_and_line(intersection_point(A,B),B) # label(oagco6) # label(axiom). [clausify(17)]. 0.44/1.01 40 -unequally_directed_lines(A,reverse_line(B)) | -unequally_directed_lines(A,B) | -apart_point_and_line(intersection_point(A,B),A) # label(oagco6) # label(axiom). [clausify(17)]. 0.44/1.01 Derived: -left_apart_point(c1,c3). [resolve(33,b,34,a)]. 0.44/1.01 Derived: -left_apart_point(c2,c3). [resolve(33,b,35,a)]. 0.44/1.01 Derived: -left_apart_point(A,parallel_through_point(B,A)). [resolve(33,b,36,a)]. 0.44/1.01 Derived: -left_apart_point(A,line_connecting(A,B)) | -distinct_points(A,B). [resolve(33,b,37,b)]. 0.44/1.01 Derived: -left_apart_point(A,line_connecting(B,A)) | -distinct_points(B,A). [resolve(33,b,38,b)]. 0.44/1.01 Derived: -left_apart_point(intersection_point(A,B),B) | -unequally_directed_lines(A,reverse_line(B)) | -unequally_directed_lines(A,B). [resolve(33,b,39,c)]. 0.44/1.01 Derived: -left_apart_point(intersection_point(A,B),A) | -unequally_directed_lines(A,reverse_line(B)) | -unequally_directed_lines(A,B). [resolve(33,b,40,c)]. 0.44/1.01 41 -left_apart_point(A,reverse_line(B)) | apart_point_and_line(A,B) # label(apt_def) # label(axiom). [clausify(4)]. 0.44/1.01 Derived: -left_apart_point(c1,reverse_line(c3)). [resolve(41,b,34,a)]. 0.44/1.01 Derived: -left_apart_point(c2,reverse_line(c3)). [resolve(41,b,35,a)]. 0.44/1.01 Derived: -left_apart_point(A,reverse_line(parallel_through_point(B,A))). [resolve(41,b,36,a)]. 0.44/1.01 Derived: -left_apart_point(A,reverse_line(line_connecting(A,B))) | -distinct_points(A,B). [resolve(41,b,37,b)]. 0.44/1.01 Derived: -left_apart_point(A,reverse_line(line_connecting(B,A))) | -distinct_points(B,A). [resolve(41,b,38,b)]. 0.44/1.01 Derived: -left_apart_point(intersection_point(A,B),reverse_line(B)) | -unequally_directed_lines(A,reverse_line(B)) | -unequally_directed_lines(A,B). [resolve(41,b,39,c)]. 0.44/1.01 Derived: -left_apart_point(intersection_point(A,B),reverse_line(A)) | -unequally_directed_lines(A,reverse_line(B)) | -unequally_directed_lines(A,B). [resolve(41,b,40,c)]. 0.44/1.01 42 left_apart_point(A,reverse_line(B)) | left_apart_point(A,B) | -apart_point_and_line(A,B) # label(apt_def) # label(axiom). [clausify(4)]. 0.44/1.01 43 convergent_lines(A,B) | -unequally_directed_lines(A,reverse_line(B)) | -unequally_directed_lines(A,B) # label(con_def) # label(axiom). [clausify(20)]. 0.44/1.01 44 -convergent_lines(A,B) | unequally_directed_lines(A,B) # label(con_def) # label(axiom). [clausify(20)]. 0.44/1.01 45 -convergent_lines(A,B) | unequally_directed_lines(A,reverse_line(B)) # label(con_def) # label(axiom). [clausify(20)]. 0.44/1.01 46 -left_apart_point(A,reverse_line(B)) | -left_apart_point(C,B) | divides_points(B,C,A) # label(div_def) # label(axiom). [clausify(24)]. 0.44/1.01 47 left_apart_point(A,B) | left_apart_point(C,B) | -divides_points(B,A,C) # label(div_def) # label(axiom). [clausify(24)]. 0.44/1.01 48 -left_apart_point(A,reverse_line(B)) | -left_apart_point(C,B) | divides_points(B,A,C) # label(div_def) # label(axiom). [clausify(24)]. 0.44/1.01 49 left_apart_point(A,reverse_line(B)) | left_apart_point(A,B) | -divides_points(B,C,A) # label(div_def) # label(axiom). [clausify(24)]. 0.44/1.01 50 left_apart_point(A,B) | left_apart_point(A,reverse_line(B)) | -divides_points(B,A,C) # label(div_def) # label(axiom). [clausify(24)]. 0.44/1.01 51 left_apart_point(A,reverse_line(B)) | left_apart_point(C,reverse_line(B)) | -divides_points(B,C,A) # label(div_def) # label(axiom). [clausify(24)]. 0.87/1.14 52 between_on_line(A,B,C,D) | -before_on_line(A,C,D) | -before_on_line(A,B,C) # label(bet_def) # label(axiom). [clausify(6)]. 0.87/1.14 53 -between_on_line(A,B,C,D) | before_on_line(A,C,D) | before_on_line(A,D,C) # label(bet_def) # label(axiom). [clausify(6)]. 0.87/1.14 54 -between_on_line(A,B,C,D) | before_on_line(A,C,D) | before_on_line(A,C,B) # label(bet_def) # label(axiom). [clausify(6)]. 0.87/1.14 55 -between_on_line(A,B,C,D) | before_on_line(A,B,C) | before_on_line(A,D,C) # label(bet_def) # label(axiom). [clausify(6)]. 0.87/1.14 56 -between_on_line(A,B,C,D) | before_on_line(A,B,C) | before_on_line(A,C,B) # label(bet_def) # label(axiom). [clausify(6)]. 0.87/1.14 57 between_on_line(A,B,C,D) | -before_on_line(A,D,C) | -before_on_line(A,C,B) # label(bet_def) # label(axiom). [clausify(6)]. 0.87/1.14 0.87/1.14 ============================== end predicate elimination ============= 0.87/1.14 0.87/1.14 Auto_denials: (non-Horn, no changes). 0.87/1.14 0.87/1.14 Term ordering decisions: 0.87/1.14 0.87/1.14 % Assigning unary symbol reverse_line kb_weight 0 and highest precedence (15). 0.87/1.14 Function symbol KB weights: c1=1. c2=1. c3=1. line_connecting=1. intersection_point=1. parallel_through_point=1. reverse_line=0. 0.87/1.14 0.87/1.14 ============================== end of process initial clauses ======== 0.87/1.14 0.87/1.14 ============================== CLAUSES FOR SEARCH ==================== 0.87/1.14 0.87/1.14 ============================== end of clauses for search ============= 0.87/1.14 0.87/1.14 ============================== SEARCH ================================ 0.87/1.14 0.87/1.14 % Starting search at 0.02 seconds. 0.87/1.14 0.87/1.14 ============================== PROOF ================================= 0.87/1.14 % SZS status Theorem 0.87/1.14 % SZS output start Refutation 0.87/1.14 0.87/1.14 % Proof 1 at 0.13 (+ 0.01) seconds. 0.87/1.14 % Length of proof is 57. 0.87/1.14 % Level of proof is 25. 0.87/1.14 % Maximum clause weight is 16.000. 0.87/1.14 % Given clauses 257. 0.87/1.14 0.87/1.14 3 (all L all M -(left_convergent_lines(L,reverse_line(M)) | left_convergent_lines(L,M))) # label(oag11) # label(axiom) # label(non_clause). [assumption]. 0.87/1.14 12 (all L all M all N (unequally_directed_lines(L,M) -> unequally_directed_lines(L,N) | unequally_directed_lines(M,N))) # label(oag6) # label(axiom) # label(non_clause). [assumption]. 0.87/1.14 13 (all L all M (unequally_directed_lines(L,M) & unequally_directed_lines(L,reverse_line(M)) -> left_convergent_lines(L,reverse_line(M)) | left_convergent_lines(L,M))) # label(oag9) # label(axiom) # label(non_clause). [assumption]. 0.87/1.14 14 (all A all B all C (distinct_points(A,B) -> distinct_points(A,C) | distinct_points(B,C))) # label(oag2) # label(axiom) # label(non_clause). [assumption]. 0.87/1.14 16 (all L -unequally_directed_lines(L,L)) # label(oag5) # label(axiom) # label(non_clause). [assumption]. 0.87/1.14 18 (all A all L -(left_apart_point(A,reverse_line(L)) | left_apart_point(A,L))) # label(oag10) # label(axiom) # label(non_clause). [assumption]. 0.87/1.14 22 (all A all B -unequally_directed_lines(line_connecting(A,B),reverse_line(line_connecting(B,A)))) # label(oagco9) # label(axiom) # label(non_clause). [assumption]. 0.87/1.14 23 (all A -distinct_points(A,A)) # label(oag1) # label(axiom) # label(non_clause). [assumption]. 0.87/1.14 25 (all L all A all B (before_on_line(L,A,B) <-> -(left_apart_point(A,L) | left_apart_point(A,reverse_line(L))) & -(left_apart_point(B,L) | left_apart_point(B,reverse_line(L))) & -unequally_directed_lines(L,line_connecting(A,B)) & distinct_points(A,B))) # label(bf_def) # label(axiom) # label(non_clause). [assumption]. 0.87/1.14 32 -(all A all B all L (-apart_point_and_line(A,L) & -apart_point_and_line(B,L) & distinct_points(A,B) -> before_on_line(L,A,B) & before_on_line(L,B,A))) # label(con) # label(negated_conjecture) # label(non_clause). [assumption]. 0.87/1.14 58 distinct_points(c1,c2) # label(con) # label(negated_conjecture). [clausify(32)]. 0.87/1.14 59 -left_convergent_lines(A,B) # label(oag11) # label(axiom). [clausify(3)]. 0.87/1.14 61 -unequally_directed_lines(A,A) # label(oag5) # label(axiom). [clausify(16)]. 0.87/1.14 62 -left_apart_point(A,B) # label(oag10) # label(axiom). [clausify(18)]. 0.87/1.14 63 -distinct_points(A,A) # label(oag1) # label(axiom). [clausify(23)]. 0.87/1.14 66 -unequally_directed_lines(line_connecting(A,B),reverse_line(line_connecting(B,A))) # label(oagco9) # label(axiom). [clausify(22)]. 0.87/1.14 67 -before_on_line(c3,c1,c2) | -before_on_line(c3,c2,c1) # label(con) # label(negated_conjecture). [clausify(32)]. 0.87/1.14 73 -unequally_directed_lines(A,B) | unequally_directed_lines(A,C) | unequally_directed_lines(B,C) # label(oag6) # label(axiom). [clausify(12)]. 0.87/1.14 74 -distinct_points(A,B) | distinct_points(A,C) | distinct_points(B,C) # label(oag2) # label(axiom). [clausify(14)]. 0.87/1.14 81 -unequally_directed_lines(A,B) | -unequally_directed_lines(A,reverse_line(B)) | left_convergent_lines(A,reverse_line(B)) | left_convergent_lines(A,B) # label(oag9) # label(axiom). [clausify(13)]. 0.87/1.14 82 -unequally_directed_lines(A,B) | -unequally_directed_lines(A,reverse_line(B)). [copy(81),unit_del(c,59),unit_del(d,59)]. 0.87/1.14 83 before_on_line(A,B,C) | left_apart_point(B,A) | left_apart_point(B,reverse_line(A)) | left_apart_point(C,A) | left_apart_point(C,reverse_line(A)) | unequally_directed_lines(A,line_connecting(B,C)) | -distinct_points(B,C) # label(bf_def) # label(axiom). [clausify(25)]. 0.87/1.14 84 before_on_line(A,B,C) | unequally_directed_lines(A,line_connecting(B,C)) | -distinct_points(B,C). [copy(83),unit_del(b,62),unit_del(c,62),unit_del(d,62),unit_del(e,62)]. 0.87/1.14 93 -unequally_directed_lines(reverse_line(line_connecting(A,B)),line_connecting(B,A)). [ur(73,b,61,a,c,66,a)]. 0.87/1.14 95 distinct_points(c1,A) | distinct_points(c2,A). [resolve(74,a,58,a)]. 0.87/1.14 97 before_on_line(A,c1,c2) | unequally_directed_lines(A,line_connecting(c1,c2)). [resolve(84,c,58,a)]. 0.87/1.14 106 distinct_points(c1,A) | distinct_points(c2,B) | distinct_points(A,B). [resolve(95,b,74,a)]. 0.87/1.14 107 distinct_points(c2,c1). [factor(106,a,c),unit_del(a,63)]. 0.87/1.14 108 before_on_line(A,c2,c1) | unequally_directed_lines(A,line_connecting(c2,c1)). [resolve(107,a,84,c)]. 0.87/1.14 174 unequally_directed_lines(c3,line_connecting(c2,c1)) | -before_on_line(c3,c1,c2). [resolve(108,a,67,b)]. 0.87/1.14 209 unequally_directed_lines(c3,line_connecting(c2,c1)) | unequally_directed_lines(c3,line_connecting(c1,c2)). [resolve(174,b,97,a)]. 0.87/1.14 210 unequally_directed_lines(c3,line_connecting(c1,c2)) | unequally_directed_lines(c3,A) | unequally_directed_lines(line_connecting(c2,c1),A). [resolve(209,a,73,a)]. 0.87/1.14 513 unequally_directed_lines(c3,A) | unequally_directed_lines(line_connecting(c2,c1),A) | unequally_directed_lines(c3,B) | unequally_directed_lines(line_connecting(c1,c2),B). [resolve(210,a,73,a)]. 0.87/1.14 524 unequally_directed_lines(c3,line_connecting(c1,c2)) | unequally_directed_lines(c3,reverse_line(A)) | -unequally_directed_lines(line_connecting(c2,c1),A). [resolve(210,c,82,b)]. 0.87/1.14 525 unequally_directed_lines(c3,line_connecting(c1,c2)) | unequally_directed_lines(c3,A) | unequally_directed_lines(line_connecting(c2,c1),B) | unequally_directed_lines(A,B). [resolve(210,c,73,a)]. 0.87/1.14 527 unequally_directed_lines(c3,A) | unequally_directed_lines(line_connecting(c2,c1),A) | unequally_directed_lines(line_connecting(c1,c2),A). [factor(513,a,c)]. 0.87/1.14 528 unequally_directed_lines(c3,line_connecting(c1,c2)) | unequally_directed_lines(line_connecting(c2,c1),c3). [factor(525,b,d),unit_del(b,61)]. 0.87/1.14 556 unequally_directed_lines(c3,A) | unequally_directed_lines(line_connecting(c1,c2),A) | unequally_directed_lines(line_connecting(c2,c1),B) | unequally_directed_lines(A,B). [resolve(527,b,73,a)]. 0.87/1.14 559 unequally_directed_lines(line_connecting(c1,c2),c3) | unequally_directed_lines(line_connecting(c2,c1),c3). [factor(556,a,d),unit_del(a,61)]. 0.87/1.14 568 unequally_directed_lines(line_connecting(c1,c2),c3) | unequally_directed_lines(line_connecting(c2,c1),A) | unequally_directed_lines(c3,A). [resolve(559,b,73,a)]. 0.87/1.14 583 unequally_directed_lines(line_connecting(c1,c2),c3) | unequally_directed_lines(c3,reverse_line(line_connecting(c1,c2))). [resolve(568,b,66,a)]. 0.87/1.14 777 unequally_directed_lines(c3,line_connecting(c1,c2)) | unequally_directed_lines(c3,reverse_line(c3)). [resolve(524,c,528,b),merge(c)]. 0.87/1.14 780 unequally_directed_lines(c3,reverse_line(c3)) | unequally_directed_lines(c3,A) | unequally_directed_lines(line_connecting(c1,c2),A). [resolve(777,a,73,a)]. 0.87/1.14 781 unequally_directed_lines(c3,reverse_line(c3)) | unequally_directed_lines(line_connecting(c1,c2),reverse_line(c3)). [factor(780,a,b)]. 0.87/1.14 782 unequally_directed_lines(c3,reverse_line(c3)) | -unequally_directed_lines(line_connecting(c1,c2),c3). [resolve(781,b,82,b)]. 0.87/1.14 793 unequally_directed_lines(c3,reverse_line(c3)) | unequally_directed_lines(c3,reverse_line(line_connecting(c1,c2))). [resolve(782,b,583,a)]. 0.87/1.14 796 unequally_directed_lines(c3,reverse_line(c3)) | -unequally_directed_lines(c3,line_connecting(c1,c2)). [resolve(793,b,82,b)]. 0.87/1.14 799 unequally_directed_lines(c3,reverse_line(c3)). [resolve(796,b,777,a),merge(b)]. 0.87/1.14 808 unequally_directed_lines(c3,A) | unequally_directed_lines(reverse_line(c3),A). [resolve(799,a,73,a)]. 0.87/1.14 818 unequally_directed_lines(c3,reverse_line(A)) | -unequally_directed_lines(reverse_line(c3),A). [resolve(808,b,82,b)]. 0.87/1.14 895 unequally_directed_lines(c3,reverse_line(A)) | unequally_directed_lines(c3,A). [resolve(818,b,808,b)]. 0.87/1.14 896 unequally_directed_lines(c3,A) | unequally_directed_lines(c3,B) | unequally_directed_lines(reverse_line(A),B). [resolve(895,a,73,a)]. 0.87/1.14 897 unequally_directed_lines(c3,A) | unequally_directed_lines(reverse_line(A),A). [factor(896,a,b)]. 0.87/1.14 910 unequally_directed_lines(c3,line_connecting(A,A)). [resolve(897,b,93,a)]. 0.87/1.14 959 unequally_directed_lines(c3,A) | unequally_directed_lines(line_connecting(B,B),A). [resolve(910,a,73,a)]. 0.87/1.14 960 -unequally_directed_lines(c3,reverse_line(line_connecting(A,A))). [ur(82,a,910,a)]. 0.87/1.14 981 $F. [resolve(959,b,66,a),unit_del(a,960)]. 0.87/1.14 0.87/1.14 % SZS output end Refutation 0.87/1.14 ============================== end of proof ========================== 0.87/1.14 0.87/1.14 ============================== STATISTICS ============================ 0.87/1.14 0.87/1.14 Given=257. Generated=6739. Kept=916. proofs=1. 0.87/1.14 Usable=243. Sos=621. Demods=0. Limbo=17, Disabled=111. Hints=0. 0.87/1.14 Megabytes=0.92. 0.87/1.14 User_CPU=0.13, System_CPU=0.01, Wall_clock=0. 0.87/1.14 0.87/1.14 ============================== end of statistics ===================== 0.87/1.14 0.87/1.14 ============================== end of search ========================= 0.87/1.14 0.87/1.14 THEOREM PROVED 0.87/1.14 % SZS status Theorem 0.87/1.14 0.87/1.14 Exiting with 1 proof. 0.87/1.14 0.87/1.14 Process 16101 exit (max_proofs) Thu Jul 2 06:54:07 2020 0.87/1.14 Prover9 interrupted 0.87/1.14 EOF