TSTP Solution File: GEO262+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GEO262+1 : TPTP v8.1.0. Bugfixed v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n025.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sat Jul 16 05:55:38 EDT 2022
% Result : Theorem 0.41s 1.01s
% Output : Refutation 0.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : GEO262+1 : TPTP v8.1.0. Bugfixed v6.4.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n025.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat Jun 18 12:46:58 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.41/1.00 ============================== Prover9 ===============================
% 0.41/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.41/1.00 Process 3125 was started by sandbox on n025.cluster.edu,
% 0.41/1.00 Sat Jun 18 12:46:58 2022
% 0.41/1.00 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_2972_n025.cluster.edu".
% 0.41/1.00 ============================== end of head ===========================
% 0.41/1.00
% 0.41/1.00 ============================== INPUT =================================
% 0.41/1.00
% 0.41/1.00 % Reading from file /tmp/Prover9_2972_n025.cluster.edu
% 0.41/1.00
% 0.41/1.00 set(prolog_style_variables).
% 0.41/1.00 set(auto2).
% 0.41/1.00 % set(auto2) -> set(auto).
% 0.41/1.00 % set(auto) -> set(auto_inference).
% 0.41/1.00 % set(auto) -> set(auto_setup).
% 0.41/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.41/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.41/1.00 % set(auto) -> set(auto_limits).
% 0.41/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.41/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.41/1.00 % set(auto) -> set(auto_denials).
% 0.41/1.00 % set(auto) -> set(auto_process).
% 0.41/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.41/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.41/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.41/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.41/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.41/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.41/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.41/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.41/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.41/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.41/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.41/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.41/1.00 % set(auto2) -> assign(stats, some).
% 0.41/1.00 % set(auto2) -> clear(echo_input).
% 0.41/1.00 % set(auto2) -> set(quiet).
% 0.41/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.41/1.00 % set(auto2) -> clear(print_given).
% 0.41/1.00 assign(lrs_ticks,-1).
% 0.41/1.00 assign(sos_limit,10000).
% 0.41/1.00 assign(order,kbo).
% 0.41/1.00 set(lex_order_vars).
% 0.41/1.00 clear(print_given).
% 0.41/1.00
% 0.41/1.00 % formulas(sos). % not echoed (32 formulas)
% 0.41/1.00
% 0.41/1.00 ============================== end of input ==========================
% 0.41/1.00
% 0.41/1.00 % From the command line: assign(max_seconds, 300).
% 0.41/1.00
% 0.41/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.41/1.00
% 0.41/1.00 % Formulas that are not ordinary clauses:
% 0.41/1.00 1 (all A all L (apart_point_and_line(A,L) <-> left_apart_point(A,L) | left_apart_point(A,reverse_line(L)))) # label(apt_def) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 2 (all L all M (convergent_lines(L,M) <-> unequally_directed_lines(L,M) & unequally_directed_lines(L,reverse_line(M)))) # label(con_def) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 3 (all A all B all L (divides_points(L,A,B) <-> left_apart_point(A,L) & left_apart_point(B,reverse_line(L)) | left_apart_point(A,reverse_line(L)) & left_apart_point(B,L))) # label(div_def) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 4 (all L all A all B (before_on_line(L,A,B) <-> distinct_points(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)))) # label(bf_def) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 5 (all L all A all B all C (between_on_line(L,A,B,C) <-> before_on_line(L,A,B) & before_on_line(L,B,C) | before_on_line(L,C,B) & before_on_line(L,B,A))) # label(bet_def) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 6 (all A -distinct_points(A,A)) # label(oag1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 7 (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.41/1.00 8 (all L -distinct_lines(L,L)) # label(oag3) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 9 (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.41/1.00 10 (all L -unequally_directed_lines(L,L)) # label(oag5) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 11 (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.41/1.00 12 (all L all M all N (unequally_directed_lines(L,M) & unequally_directed_lines(L,reverse_line(M)) -> unequally_directed_lines(L,N) & unequally_directed_lines(L,reverse_line(N)) | unequally_directed_lines(M,N) & unequally_directed_lines(M,reverse_line(N)))) # label(oag7) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 13 (all L all M (line(L) & line(M) -> unequally_directed_lines(L,M) | unequally_directed_lines(L,reverse_line(M)))) # label(oag8) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 14 (all L all M (unequally_directed_lines(L,M) & unequally_directed_lines(L,reverse_line(M)) -> left_convergent_lines(L,M) | left_convergent_lines(L,reverse_line(M)))) # label(oag9) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 15 (all A all L -(left_apart_point(A,L) | left_apart_point(A,reverse_line(L)))) # label(oag10) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 16 (all L all M -(left_convergent_lines(L,M) | left_convergent_lines(L,reverse_line(M)))) # label(oag11) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 17 (all A all B (point(A) & point(B) & distinct_points(A,B) -> line(line_connecting(A,B)))) # label(oagco1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 18 (all L all M (line(L) & line(M) & unequally_directed_lines(L,M) & unequally_directed_lines(L,reverse_line(M)) -> point(intersection_point(L,M)))) # label(oagco2) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 19 (all L all A (point(A) & line(L) -> line(parallel_through_point(L,A)))) # label(oagco3) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 20 (all L (line(L) -> line(reverse_line(L)))) # label(oagco4) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 21 (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.41/1.00 22 (all L all M (unequally_directed_lines(L,M) & unequally_directed_lines(L,reverse_line(M)) -> -apart_point_and_line(intersection_point(L,M),L) & -apart_point_and_line(intersection_point(L,M),M))) # label(oagco6) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 23 (all A all L -apart_point_and_line(A,parallel_through_point(L,A))) # label(oagco7) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 24 (all L -distinct_lines(L,reverse_line(L))) # label(oagco8) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 25 (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.41/1.00 26 (all A all L -unequally_directed_lines(parallel_through_point(L,A),L)) # label(oagco10) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 27 (all A all B all L all M (distinct_points(A,B) & distinct_lines(L,M) -> left_apart_point(A,L) | left_apart_point(B,L) | left_apart_point(A,M) | left_apart_point(B,M) | left_apart_point(A,reverse_line(L)) | left_apart_point(B,reverse_line(L)) | left_apart_point(A,reverse_line(M)) | left_apart_point(B,reverse_line(M)))) # label(oaguc1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 28 (all A all B all L (distinct_points(A,B) & left_apart_point(A,L) -> left_apart_point(B,L) | left_convergent_lines(line_connecting(A,B),L))) # label(oaguc2) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 29 (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.41/1.00 30 (all A all L all M (left_apart_point(A,L) & unequally_directed_lines(L,M) -> distinct_lines(L,M) | left_apart_point(A,reverse_line(M)))) # label(oagsub2) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 31 (all L all M all N (left_convergent_lines(L,M) -> unequally_directed_lines(M,N) | left_convergent_lines(L,N))) # label(oagsub3) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 32 -(all L all M all N all A all B all C (between_on_line(L,A,B,C) & convergent_lines(L,M) & -apart_point_and_line(B,M) & convergent_lines(L,N) & convergent_lines(M,N) & -apart_point_and_line(B,N) -> between_on_line(M,intersection_point(M,parallel_through_point(N,A)),B,intersection_point(M,parallel_through_point(N,C))))) # label(con) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.41/1.01
% 0.41/1.01 ============================== end of process non-clausal formulas ===
% 0.41/1.01
% 0.41/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.41/1.01
% 0.41/1.01 ============================== PREDICATE ELIMINATION =================
% 0.41/1.01 33 -convergent_lines(A,B) | unequally_directed_lines(A,B) # label(con_def) # label(axiom). [clausify(2)].
% 0.41/1.01 34 convergent_lines(c1,c2) # label(con) # label(negated_conjecture). [clausify(32)].
% 0.41/1.01 35 convergent_lines(c1,c3) # label(con) # label(negated_conjecture). [clausify(32)].
% 0.41/1.01 36 convergent_lines(c2,c3) # label(con) # label(negated_conjecture). [clausify(32)].
% 0.41/1.01 Derived: unequally_directed_lines(c1,c2). [resolve(33,a,34,a)].
% 0.41/1.01 Derived: unequally_directed_lines(c1,c3). [resolve(33,a,35,a)].
% 0.41/1.01 Derived: unequally_directed_lines(c2,c3). [resolve(33,a,36,a)].
% 0.41/1.01 37 -convergent_lines(A,B) | unequally_directed_lines(A,reverse_line(B)) # label(con_def) # label(axiom). [clausify(2)].
% 0.41/1.01 Derived: unequally_directed_lines(c1,reverse_line(c2)). [resolve(37,a,34,a)].
% 0.41/1.01 Derived: unequally_directed_lines(c1,reverse_line(c3)). [resolve(37,a,35,a)].
% 0.41/1.01 Derived: unequally_directed_lines(c2,reverse_line(c3)). [resolve(37,a,36,a)].
% 0.41/1.01 38 convergent_lines(A,B) | -unequally_directed_lines(A,B) | -unequally_directed_lines(A,reverse_line(B)) # label(con_def) # label(axiom). [clausify(2)].
% 0.41/1.01 39 -between_on_line(c2,intersection_point(c2,parallel_through_point(c3,c4)),c5,intersection_point(c2,parallel_through_point(c3,c6))) # label(con) # label(negated_conjecture). [clausify(32)].
% 0.41/1.01 40 between_on_line(c1,c4,c5,c6) # label(con) # label(negated_conjecture). [clausify(32)].
% 0.41/1.01 41 -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(5)].
% 0.41/1.01 Derived: before_on_line(c1,c4,c5) | before_on_line(c1,c6,c5). [resolve(41,a,40,a)].
% 0.41/1.01 42 -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(5)].
% 0.41/1.01 Derived: before_on_line(c1,c4,c5) | before_on_line(c1,c5,c4). [resolve(42,a,40,a)].
% 0.41/1.01 43 -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(5)].
% 0.41/1.01 Derived: before_on_line(c1,c5,c6) | before_on_line(c1,c6,c5). [resolve(43,a,40,a)].
% 0.41/1.01 44 -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(5)].
% 0.41/1.01 Derived: before_on_line(c1,c5,c6) | before_on_line(c1,c5,c4). [resolve(44,a,40,a)].
% 0.41/1.01 45 between_on_line(A,B,C,D) | -before_on_line(A,B,C) | -before_on_line(A,C,D) # label(bet_def) # label(axiom). [clausify(5)].
% 0.41/1.01 Derived: -before_on_line(c2,intersection_point(c2,parallel_through_point(c3,c4)),c5) | -before_on_line(c2,c5,intersection_point(c2,parallel_through_point(c3,c6))). [resolve(45,a,39,a)].
% 0.41/1.01 46 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(5)].
% 0.41/1.01 Derived: -before_on_line(c2,intersection_point(c2,parallel_through_point(c3,c6)),c5) | -before_on_line(c2,c5,intersection_point(c2,parallel_through_point(c3,c4))). [resolve(46,a,39,a)].
% 0.41/1.01 47 apart_point_and_line(A,B) | -left_apart_point(A,B) # label(apt_def) # label(axiom). [clausify(1)].
% 0.41/1.01 48 -apart_point_and_line(c5,c2) # label(con) # label(negated_conjecture). [clausify(32)].
% 0.41/1.01 49 -apart_point_and_line(c5,c3) # label(con) # label(negated_conjecture). [clausify(32)].
% 0.41/1.01 50 -apart_point_and_line(A,parallel_through_point(B,A)) # label(oagco7) # label(axiom). [clausify(23)].
% 0.41/1.01 51 -distinct_points(A,B) | -apart_point_and_line(A,line_connecting(A,B)) # label(oagco5) # label(axiom). [clausify(21)].
% 0.41/1.01 52 -distinct_points(A,B) | -apart_point_and_line(B,line_connecting(A,B)) # label(oagco5) # label(axiom). [clausify(21)].
% 0.41/1.01 53 -unequally_directed_lines(A,B) | -unequally_directed_lines(A,reverse_line(B)) | -apart_point_and_line(intersection_point(A,B),A) # label(oagco6) # label(axiom). [clausify(22)].
% 0.41/1.01 54 -unequally_directed_lines(A,B) | -unequally_directed_lines(A,reverse_line(B)) | -apart_point_and_line(intersection_point(A,B),B) # label(oagco6) # label(axiom). [clausify(22)].
% 0.41/1.01 Derived: -left_apart_point(c5,c2). [resolve(47,a,48,a)].
% 0.41/1.01 Derived: -left_apart_point(c5,c3). [resolve(47,a,49,a)].
% 0.41/1.01 Derived: -left_apart_point(A,parallel_through_point(B,A)). [resolve(47,a,50,a)].
% 0.41/1.01 Derived: -left_apart_point(A,line_connecting(A,B)) | -distinct_points(A,B). [resolve(47,a,51,b)].
% 0.41/1.01 Derived: -left_apart_point(A,line_connecting(B,A)) | -distinct_points(B,A). [resolve(47,a,52,b)].
% 0.41/1.01 Derived: -left_apart_point(intersection_point(A,B),A) | -unequally_directed_lines(A,B) | -unequally_directed_lines(A,reverse_line(B)). [resolve(47,a,53,c)].
% 0.41/1.01 Derived: -left_apart_point(intersection_point(A,B),B) | -unequally_directed_lines(A,B) | -unequally_directed_lines(A,reverse_line(B)). [resolve(47,a,54,c)].
% 0.41/1.01 55 apart_point_and_line(A,B) | -left_apart_point(A,reverse_line(B)) # label(apt_def) # label(axiom). [clausify(1)].
% 0.41/1.01 Derived: -left_apart_point(c5,reverse_line(c2)). [resolve(55,a,48,a)].
% 0.41/1.01 Derived: -left_apart_point(c5,reverse_line(c3)). [resolve(55,a,49,a)].
% 0.41/1.01 Derived: -left_apart_point(A,reverse_line(parallel_through_point(B,A))). [resolve(55,a,50,a)].
% 0.41/1.01 Derived: -left_apart_point(A,reverse_line(line_connecting(A,B))) | -distinct_points(A,B). [resolve(55,a,51,b)].
% 0.41/1.01 Derived: -left_apart_point(A,reverse_line(line_connecting(B,A))) | -distinct_points(B,A). [resolve(55,a,52,b)].
% 0.41/1.01 Derived: -left_apart_point(intersection_point(A,B),reverse_line(A)) | -unequally_directed_lines(A,B) | -unequally_directed_lines(A,reverse_line(B)). [resolve(55,a,53,c)].
% 0.41/1.01 Derived: -left_apart_point(intersection_point(A,B),reverse_line(B)) | -unequally_directed_lines(A,B) | -unequally_directed_lines(A,reverse_line(B)). [resolve(55,a,54,c)].
% 0.41/1.01 56 -apart_point_and_line(A,B) | left_apart_point(A,B) | left_apart_point(A,reverse_line(B)) # label(apt_def) # label(axiom). [clausify(1)].
% 0.41/1.01 57 divides_points(A,B,C) | -left_apart_point(B,A) | -left_apart_point(C,reverse_line(A)) # label(div_def) # label(axiom). [clausify(3)].
% 0.41/1.01 58 -divides_points(A,B,C) | left_apart_point(B,A) | left_apart_point(C,A) # label(div_def) # label(axiom). [clausify(3)].
% 0.41/1.01 59 -divides_points(A,B,C) | left_apart_point(B,A) | left_apart_point(B,reverse_line(A)) # label(div_def) # label(axiom). [clausify(3)].
% 0.41/1.01 60 -divides_points(A,B,C) | left_apart_point(C,reverse_line(A)) | left_apart_point(C,A) # label(div_def) # label(axiom). [clausify(3)].
% 0.41/1.01 61 divides_points(A,B,C) | -left_apart_point(B,reverse_line(A)) | -left_apart_point(C,A) # label(div_def) # label(axiom). [clausify(3)].
% 0.41/1.01 62 -divides_points(A,B,C) | left_apart_point(C,reverse_line(A)) | left_apart_point(B,reverse_line(A)) # label(div_def) # label(axiom). [clausify(3)].
% 0.41/1.01
% 0.41/1.01 ============================== end predicate elimination =============
% 0.41/1.01
% 0.41/1.01 Auto_denials: (non-Horn, no changes).
% 0.41/1.01
% 0.41/1.01 Term ordering decisions:
% 0.41/1.01
% 0.41/1.01 % Assigning unary symbol reverse_line kb_weight 0 and highest precedence (18).
% 0.41/1.01 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. line_connecting=1. intersection_point=1. parallel_through_point=1. reverse_line=0.
% 0.41/1.01
% 0.41/1.01 ============================== end of process initial clauses ========
% 0.41/1.01
% 0.41/1.01 ============================== CLAUSES FOR SEARCH ====================
% 0.41/1.01
% 0.41/1.01 ============================== end of clauses for search =============
% 0.41/1.01
% 0.41/1.01 ============================== SEARCH ================================
% 0.41/1.01
% 0.41/1.01 % Starting search at 0.02 seconds.
% 0.41/1.01
% 0.41/1.01 ============================== PROOF =================================
% 0.41/1.01 % SZS status Theorem
% 0.41/1.01 % SZS output start Refutation
% 0.41/1.01
% 0.41/1.01 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.41/1.01 % Length of proof is 13.
% 0.41/1.01 % Level of proof is 3.
% 0.41/1.01 % Maximum clause weight is 7.000.
% 0.41/1.01 % Given clauses 21.
% 0.41/1.01
% 0.41/1.01 2 (all L all M (convergent_lines(L,M) <-> unequally_directed_lines(L,M) & unequally_directed_lines(L,reverse_line(M)))) # label(con_def) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.01 14 (all L all M (unequally_directed_lines(L,M) & unequally_directed_lines(L,reverse_line(M)) -> left_convergent_lines(L,M) | left_convergent_lines(L,reverse_line(M)))) # label(oag9) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.01 16 (all L all M -(left_convergent_lines(L,M) | left_convergent_lines(L,reverse_line(M)))) # label(oag11) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.01 32 -(all L all M all N all A all B all C (between_on_line(L,A,B,C) & convergent_lines(L,M) & -apart_point_and_line(B,M) & convergent_lines(L,N) & convergent_lines(M,N) & -apart_point_and_line(B,N) -> between_on_line(M,intersection_point(M,parallel_through_point(N,A)),B,intersection_point(M,parallel_through_point(N,C))))) # label(con) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.41/1.01 33 -convergent_lines(A,B) | unequally_directed_lines(A,B) # label(con_def) # label(axiom). [clausify(2)].
% 0.41/1.01 34 convergent_lines(c1,c2) # label(con) # label(negated_conjecture). [clausify(32)].
% 0.41/1.01 37 -convergent_lines(A,B) | unequally_directed_lines(A,reverse_line(B)) # label(con_def) # label(axiom). [clausify(2)].
% 0.41/1.01 67 -left_convergent_lines(A,B) # label(oag11) # label(axiom). [clausify(16)].
% 0.41/1.01 85 -unequally_directed_lines(A,B) | -unequally_directed_lines(A,reverse_line(B)) | left_convergent_lines(A,B) | left_convergent_lines(A,reverse_line(B)) # label(oag9) # label(axiom). [clausify(14)].
% 0.41/1.01 86 -unequally_directed_lines(A,B) | -unequally_directed_lines(A,reverse_line(B)). [copy(85),unit_del(c,67),unit_del(d,67)].
% 0.41/1.01 92 unequally_directed_lines(c1,c2). [resolve(33,a,34,a)].
% 0.41/1.01 95 unequally_directed_lines(c1,reverse_line(c2)). [resolve(37,a,34,a)].
% 0.41/1.01 113 $F. [ur(86,a,92,a),unit_del(a,95)].
% 0.41/1.01
% 0.41/1.01 % SZS output end Refutation
% 0.41/1.01 ============================== end of proof ==========================
% 0.41/1.01
% 0.41/1.01 ============================== STATISTICS ============================
% 0.41/1.01
% 0.41/1.01 Given=21. Generated=83. Kept=43. proofs=1.
% 0.41/1.01 Usable=21. Sos=19. Demods=0. Limbo=1, Disabled=93. Hints=0.
% 0.41/1.01 Megabytes=0.13.
% 0.41/1.01 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.41/1.01
% 0.41/1.01 ============================== end of statistics =====================
% 0.41/1.01
% 0.41/1.01 ============================== end of search =========================
% 0.41/1.01
% 0.41/1.01 THEOREM PROVED
% 0.41/1.01 % SZS status Theorem
% 0.41/1.01
% 0.41/1.01 Exiting with 1 proof.
% 0.41/1.01
% 0.41/1.01 Process 3125 exit (max_proofs) Sat Jun 18 12:46:58 2022
% 0.41/1.01 Prover9 interrupted
%------------------------------------------------------------------------------