0.00/0.09 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.09 % Command : tptp2X_and_run_prover9 %d %s 0.08/0.29 % Computer : n018.cluster.edu 0.08/0.29 % Model : x86_64 x86_64 0.08/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.08/0.29 % Memory : 8042.1875MB 0.08/0.29 % OS : Linux 3.10.0-693.el7.x86_64 0.08/0.29 % CPULimit : 960 0.08/0.29 % DateTime : Thu Jul 2 06:51:37 EDT 2020 0.08/0.29 % CPUTime : 0.73/1.02 ============================== Prover9 =============================== 0.73/1.02 Prover9 (32) version 2009-11A, November 2009. 0.73/1.02 Process 16140 was started by sandbox2 on n018.cluster.edu, 0.73/1.02 Thu Jul 2 06:51:37 2020 0.73/1.02 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_15967_n018.cluster.edu". 0.73/1.02 ============================== end of head =========================== 0.73/1.02 0.73/1.02 ============================== INPUT ================================= 0.73/1.02 0.73/1.02 % Reading from file /tmp/Prover9_15967_n018.cluster.edu 0.73/1.02 0.73/1.02 set(prolog_style_variables). 0.73/1.02 set(auto2). 0.73/1.02 % set(auto2) -> set(auto). 0.73/1.02 % set(auto) -> set(auto_inference). 0.73/1.02 % set(auto) -> set(auto_setup). 0.73/1.02 % set(auto_setup) -> set(predicate_elim). 0.73/1.02 % set(auto_setup) -> assign(eq_defs, unfold). 0.73/1.02 % set(auto) -> set(auto_limits). 0.73/1.02 % set(auto_limits) -> assign(max_weight, "100.000"). 0.73/1.02 % set(auto_limits) -> assign(sos_limit, 20000). 0.73/1.02 % set(auto) -> set(auto_denials). 0.73/1.02 % set(auto) -> set(auto_process). 0.73/1.02 % set(auto2) -> assign(new_constants, 1). 0.73/1.02 % set(auto2) -> assign(fold_denial_max, 3). 0.73/1.02 % set(auto2) -> assign(max_weight, "200.000"). 0.73/1.02 % set(auto2) -> assign(max_hours, 1). 0.73/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.73/1.02 % set(auto2) -> assign(max_seconds, 0). 0.73/1.02 % set(auto2) -> assign(max_minutes, 5). 0.73/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.73/1.02 % set(auto2) -> set(sort_initial_sos). 0.73/1.02 % set(auto2) -> assign(sos_limit, -1). 0.73/1.02 % set(auto2) -> assign(lrs_ticks, 3000). 0.73/1.02 % set(auto2) -> assign(max_megs, 400). 0.73/1.02 % set(auto2) -> assign(stats, some). 0.73/1.02 % set(auto2) -> clear(echo_input). 0.73/1.02 % set(auto2) -> set(quiet). 0.73/1.02 % set(auto2) -> clear(print_initial_clauses). 0.73/1.02 % set(auto2) -> clear(print_given). 0.73/1.02 assign(lrs_ticks,-1). 0.73/1.02 assign(sos_limit,10000). 0.73/1.02 assign(order,kbo). 0.73/1.02 set(lex_order_vars). 0.73/1.02 clear(print_given). 0.73/1.02 0.73/1.02 % formulas(sos). % not echoed (32 formulas) 0.73/1.02 0.73/1.02 ============================== end of input ========================== 0.73/1.02 0.73/1.02 % From the command line: assign(max_seconds, 960). 0.73/1.02 0.73/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.73/1.02 0.73/1.02 % Formulas that are not ordinary clauses: 0.73/1.02 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.73/1.02 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.73/1.02 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.73/1.02 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.73/1.02 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.73/1.02 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.73/1.02 7 (all L -distinct_lines(L,L)) # label(oag3) # label(axiom) # label(non_clause). [assumption]. 0.73/1.02 8 (all L -distinct_lines(L,reverse_line(L))) # label(oagco8) # label(axiom) # label(non_clause). [assumption]. 0.73/1.02 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.73/1.02 10 (all L (line(L) -> line(reverse_line(L)))) # label(oagco4) # label(axiom) # label(non_clause). [assumption]. 0.73/1.02 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.73/1.02 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.73/1.02 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.73/1.02 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.73/1.02 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.73/1.02 16 (all L -unequally_directed_lines(L,L)) # label(oag5) # label(axiom) # label(non_clause). [assumption]. 0.73/1.02 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.73/1.02 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.73/1.02 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.73/1.02 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.73/1.02 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.73/1.02 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.73/1.02 23 (all A -distinct_points(A,A)) # label(oag1) # label(axiom) # label(non_clause). [assumption]. 0.73/1.02 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.73/1.02 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.73/1.02 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.73/1.02 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.73/1.02 28 (all A all L -unequally_directed_lines(parallel_through_point(L,A),L)) # label(oagco10) # label(axiom) # label(non_clause). [assumption]. 0.73/1.02 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.73/1.02 30 (all A all L -apart_point_and_line(A,parallel_through_point(L,A))) # label(oagco7) # label(axiom) # label(non_clause). [assumption]. 0.73/1.02 31 (all L all A (point(A) & line(L) -> line(parallel_through_point(L,A)))) # label(oagco3) # label(axiom) # label(non_clause). [assumption]. 0.73/1.02 32 -(all L all A all B all C (distinct_points(A,C) & distinct_points(B,C) & distinct_points(A,B) & line(L) -> -(between_on_line(L,A,B,C) & between_on_line(L,B,A,C)))) # label(con) # label(negated_conjecture) # label(non_clause). [assumption]. 0.73/1.02 0.73/1.02 ============================== end of process non-clausal formulas === 0.73/1.02 0.73/1.02 ============================== PROCESS INITIAL CLAUSES =============== 0.73/1.02 0.73/1.02 ============================== PREDICATE ELIMINATION ================= 0.73/1.02 33 -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.73/1.02 34 between_on_line(c1,c2,c3,c4) # label(con) # label(negated_conjecture). [clausify(32)]. 0.73/1.02 35 between_on_line(c1,c3,c2,c4) # label(con) # label(negated_conjecture). [clausify(32)]. 0.73/1.02 Derived: before_on_line(c1,c3,c4) | before_on_line(c1,c4,c3). [resolve(33,a,34,a)]. 0.73/1.02 Derived: before_on_line(c1,c2,c4) | before_on_line(c1,c4,c2). [resolve(33,a,35,a)]. 0.73/1.02 36 -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.73/1.02 Derived: before_on_line(c1,c3,c4) | before_on_line(c1,c3,c2). [resolve(36,a,34,a)]. 0.73/1.02 Derived: before_on_line(c1,c2,c4) | before_on_line(c1,c2,c3). [resolve(36,a,35,a)]. 0.73/1.02 37 -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.73/1.02 Derived: before_on_line(c1,c2,c3) | before_on_line(c1,c4,c3). [resolve(37,a,34,a)]. 0.73/1.02 Derived: before_on_line(c1,c3,c2) | before_on_line(c1,c4,c2). [resolve(37,a,35,a)]. 0.73/1.02 38 -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.73/1.02 Derived: before_on_line(c1,c2,c3) | before_on_line(c1,c3,c2). [resolve(38,a,34,a)]. 0.73/1.02 39 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.73/1.02 40 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.73/1.02 41 -left_apart_point(A,B) | apart_point_and_line(A,B) # label(apt_def) # label(axiom). [clausify(4)]. 0.73/1.02 42 -apart_point_and_line(A,parallel_through_point(B,A)) # label(oagco7) # label(axiom). [clausify(30)]. 0.73/1.02 43 -distinct_points(A,B) | -apart_point_and_line(A,line_connecting(A,B)) # label(oagco5) # label(axiom). [clausify(15)]. 0.73/1.02 44 -distinct_points(A,B) | -apart_point_and_line(B,line_connecting(A,B)) # label(oagco5) # label(axiom). [clausify(15)]. 0.73/1.02 45 -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.73/1.02 46 -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.73/1.02 Derived: -left_apart_point(A,parallel_through_point(B,A)). [resolve(41,b,42,a)]. 0.73/1.02 Derived: -left_apart_point(A,line_connecting(A,B)) | -distinct_points(A,B). [resolve(41,b,43,b)]. 0.73/1.02 Derived: -left_apart_point(A,line_connecting(B,A)) | -distinct_points(B,A). [resolve(41,b,44,b)]. 0.73/1.02 Derived: -left_apart_point(intersection_point(A,B),B) | -unequally_directed_lines(A,reverse_line(B)) | -unequally_directed_lines(A,B). [resolve(41,b,45,c)]. 0.73/1.02 Derived: -left_apart_point(intersection_point(A,B),A) | -unequally_directed_lines(A,reverse_line(B)) | -unequally_directed_lines(A,B). [resolve(41,b,46,c)]. 0.73/1.02 47 -left_apart_point(A,reverse_line(B)) | apart_point_and_line(A,B) # label(apt_def) # label(axiom). [clausify(4)]. 0.73/1.02 Derived: -left_apart_point(A,reverse_line(parallel_through_point(B,A))). [resolve(47,b,42,a)]. 0.73/1.02 Derived: -left_apart_point(A,reverse_line(line_connecting(A,B))) | -distinct_points(A,B). [resolve(47,b,43,b)]. 0.73/1.02 Derived: -left_apart_point(A,reverse_line(line_connecting(B,A))) | -distinct_points(B,A). [resolve(47,b,44,b)]. 0.73/1.02 Derived: -left_apart_point(intersection_point(A,B),reverse_line(B)) | -unequally_directed_lines(A,reverse_line(B)) | -unequally_directed_lines(A,B). [resolve(47,b,45,c)]. 0.73/1.02 Derived: -left_apart_point(intersection_point(A,B),reverse_line(A)) | -unequally_directed_lines(A,reverse_line(B)) | -unequally_directed_lines(A,B). [resolve(47,b,46,c)]. 0.73/1.02 48 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.73/1.02 49 convergent_lines(A,B) | -unequally_directed_lines(A,reverse_line(B)) | -unequally_directed_lines(A,B) # label(con_def) # label(axiom). [clausify(20)]. 0.73/1.04 50 -convergent_lines(A,B) | unequally_directed_lines(A,B) # label(con_def) # label(axiom). [clausify(20)]. 0.73/1.04 51 -convergent_lines(A,B) | unequally_directed_lines(A,reverse_line(B)) # label(con_def) # label(axiom). [clausify(20)]. 0.73/1.04 52 -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.73/1.04 53 left_apart_point(A,B) | left_apart_point(C,B) | -divides_points(B,A,C) # label(div_def) # label(axiom). [clausify(24)]. 0.73/1.04 54 -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.73/1.04 55 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.73/1.04 56 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.73/1.04 57 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.73/1.04 0.73/1.04 ============================== end predicate elimination ============= 0.73/1.04 0.73/1.04 Auto_denials: (non-Horn, no changes). 0.73/1.04 0.73/1.04 Term ordering decisions: 0.73/1.04 0.73/1.04 % Assigning unary symbol reverse_line kb_weight 0 and highest precedence (16). 0.73/1.04 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. line_connecting=1. intersection_point=1. parallel_through_point=1. reverse_line=0. 0.73/1.04 0.73/1.04 ============================== end of process initial clauses ======== 0.73/1.04 0.73/1.04 ============================== CLAUSES FOR SEARCH ==================== 0.73/1.04 0.73/1.04 ============================== end of clauses for search ============= 0.73/1.04 0.73/1.04 ============================== SEARCH ================================ 0.73/1.04 0.73/1.04 % Starting search at 0.01 seconds. 0.73/1.04 0.73/1.04 ============================== PROOF ================================= 0.73/1.04 % SZS status Theorem 0.73/1.04 % SZS output start Refutation 0.73/1.04 0.73/1.04 % Proof 1 at 0.03 (+ 0.00) seconds. 0.73/1.04 % Length of proof is 26. 0.73/1.04 % Level of proof is 11. 0.73/1.04 % Maximum clause weight is 11.000. 0.73/1.04 % Given clauses 106. 0.73/1.04 0.73/1.04 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.73/1.04 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.73/1.04 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.73/1.04 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.73/1.04 16 (all L -unequally_directed_lines(L,L)) # label(oag5) # label(axiom) # label(non_clause). [assumption]. 0.73/1.04 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.73/1.04 32 -(all L all A all B all C (distinct_points(A,C) & distinct_points(B,C) & distinct_points(A,B) & line(L) -> -(between_on_line(L,A,B,C) & between_on_line(L,B,A,C)))) # label(con) # label(negated_conjecture) # label(non_clause). [assumption]. 0.73/1.04 58 line(c1) # label(con) # label(negated_conjecture). [clausify(32)]. 0.73/1.04 62 -left_convergent_lines(A,B) # label(oag11) # label(axiom). [clausify(3)]. 0.73/1.04 64 -unequally_directed_lines(A,A) # label(oag5) # label(axiom). [clausify(16)]. 0.73/1.04 69 -unequally_directed_lines(line_connecting(A,B),reverse_line(line_connecting(B,A))) # label(oagco9) # label(axiom). [clausify(22)]. 0.73/1.04 75 -unequally_directed_lines(A,B) | unequally_directed_lines(A,C) | unequally_directed_lines(B,C) # label(oag6) # label(axiom). [clausify(12)]. 0.73/1.04 79 -line(A) | -line(B) | unequally_directed_lines(B,reverse_line(A)) | unequally_directed_lines(B,A) # label(oag8) # label(axiom). [clausify(11)]. 0.73/1.04 83 -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.73/1.04 84 -unequally_directed_lines(A,B) | -unequally_directed_lines(A,reverse_line(B)). [copy(83),unit_del(c,62),unit_del(d,62)]. 0.73/1.04 96 -line(A) | unequally_directed_lines(A,reverse_line(A)). [factor(79,a,b),unit_del(c,64)]. 0.73/1.04 103 -unequally_directed_lines(reverse_line(line_connecting(A,B)),line_connecting(B,A)). [ur(75,b,64,a,c,69,a)]. 0.73/1.04 129 unequally_directed_lines(c1,reverse_line(c1)). [resolve(96,a,58,a)]. 0.73/1.04 137 unequally_directed_lines(c1,A) | unequally_directed_lines(reverse_line(c1),A). [resolve(129,a,75,a)]. 0.73/1.04 207 unequally_directed_lines(c1,reverse_line(A)) | -unequally_directed_lines(reverse_line(c1),A). [resolve(137,b,84,b)]. 0.73/1.04 329 unequally_directed_lines(c1,reverse_line(A)) | unequally_directed_lines(c1,A). [resolve(207,b,137,b)]. 0.73/1.04 330 unequally_directed_lines(c1,A) | unequally_directed_lines(c1,B) | unequally_directed_lines(reverse_line(A),B). [resolve(329,a,75,a)]. 0.73/1.04 331 unequally_directed_lines(c1,A) | unequally_directed_lines(reverse_line(A),A). [factor(330,a,b)]. 0.73/1.04 357 unequally_directed_lines(c1,line_connecting(A,A)). [resolve(331,b,103,a)]. 0.73/1.04 361 -unequally_directed_lines(c1,reverse_line(line_connecting(A,A))). [ur(84,a,357,a)]. 0.73/1.04 377 $F. [ur(75,b,361,a,c,69,a),unit_del(a,357)]. 0.73/1.04 0.73/1.04 % SZS output end Refutation 0.73/1.04 ============================== end of proof ========================== 0.73/1.04 0.73/1.04 ============================== STATISTICS ============================ 0.73/1.04 0.73/1.04 Given=106. Generated=714. Kept=312. proofs=1. 0.73/1.04 Usable=101. Sos=189. Demods=0. Limbo=9, Disabled=94. Hints=0. 0.73/1.04 Megabytes=0.31. 0.73/1.04 User_CPU=0.03, System_CPU=0.00, Wall_clock=0. 0.73/1.04 0.73/1.04 ============================== end of statistics ===================== 0.73/1.04 0.73/1.04 ============================== end of search ========================= 0.73/1.04 0.73/1.04 THEOREM PROVED 0.73/1.04 % SZS status Theorem 0.73/1.04 0.73/1.04 Exiting with 1 proof. 0.73/1.04 0.73/1.04 Process 16140 exit (max_proofs) Thu Jul 2 06:51:37 2020 0.73/1.04 Prover9 interrupted 0.73/1.04 EOF