TSTP Solution File: GEO255+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GEO255+1 : TPTP v8.1.0. Bugfixed v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n011.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 : 300s
% DateTime : Wed Jul 27 12:55:04 EDT 2022
% Result : Theorem 2.06s 2.21s
% Output : Refutation 2.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of clauses : 19 ( 7 unt; 11 nHn; 9 RR)
% Number of literals : 39 ( 0 equ; 9 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 25 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(30,axiom,
~ une_qually_directed_lines(A,A),
file('GEO255+1.p',unknown),
[] ).
cnf(31,axiom,
( ~ une_qually_directed_lines(A,B)
| une_qually_directed_lines(A,C)
| une_qually_directed_lines(B,C) ),
file('GEO255+1.p',unknown),
[] ).
cnf(34,axiom,
( ~ line(A)
| ~ line(B)
| une_qually_directed_lines(A,B)
| une_qually_directed_lines(A,reverse_line(B)) ),
file('GEO255+1.p',unknown),
[] ).
cnf(35,axiom,
( ~ une_qually_directed_lines(A,B)
| ~ une_qually_directed_lines(A,reverse_line(B))
| left_convergent_lines(A,B)
| left_convergent_lines(A,reverse_line(B)) ),
file('GEO255+1.p',unknown),
[] ).
cnf(37,axiom,
~ left_convergent_lines(A,B),
file('GEO255+1.p',unknown),
[] ).
cnf(48,axiom,
~ une_qually_directed_lines(line_connecting(A,B),reverse_line(line_connecting(B,A))),
file('GEO255+1.p',unknown),
[] ).
cnf(58,plain,
( ~ line(A)
| une_qually_directed_lines(A,reverse_line(A)) ),
inference(unit_del,[status(thm)],[inference(factor,[status(thm)],[34]),30]),
[iquote('factor,34.1.2,unit_del,30')] ).
cnf(59,axiom,
line(dollar_c3),
file('GEO255+1.p',unknown),
[] ).
cnf(63,plain,
une_qually_directed_lines(dollar_c3,reverse_line(dollar_c3)),
inference(hyper,[status(thm)],[59,58]),
[iquote('hyper,59,58')] ).
cnf(73,plain,
( une_qually_directed_lines(dollar_c3,A)
| une_qually_directed_lines(reverse_line(dollar_c3),A) ),
inference(hyper,[status(thm)],[63,31]),
[iquote('hyper,63,31')] ).
cnf(106,plain,
( une_qually_directed_lines(dollar_c3,reverse_line(A))
| une_qually_directed_lines(dollar_c3,A) ),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[73,35,73]),37,37]),
[iquote('hyper,73,35,73,unit_del,37,37')] ).
cnf(138,plain,
( une_qually_directed_lines(dollar_c3,A)
| une_qually_directed_lines(dollar_c3,B)
| une_qually_directed_lines(reverse_line(A),B) ),
inference(hyper,[status(thm)],[106,31]),
[iquote('hyper,106,31')] ).
cnf(145,plain,
( une_qually_directed_lines(dollar_c3,reverse_line(A))
| une_qually_directed_lines(dollar_c3,B)
| une_qually_directed_lines(A,B) ),
inference(hyper,[status(thm)],[106,31]),
[iquote('hyper,106,31')] ).
cnf(146,plain,
( une_qually_directed_lines(dollar_c3,A)
| une_qually_directed_lines(reverse_line(A),A) ),
inference(factor,[status(thm)],[138]),
[iquote('factor,138.1.2')] ).
cnf(147,plain,
( une_qually_directed_lines(dollar_c3,reverse_line(A))
| une_qually_directed_lines(A,reverse_line(A)) ),
inference(factor,[status(thm)],[145]),
[iquote('factor,145.1.2')] ).
cnf(227,plain,
( une_qually_directed_lines(A,reverse_line(A))
| une_qually_directed_lines(reverse_line(A),A) ),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[147,35,146]),37,37]),
[iquote('hyper,147,35,146,unit_del,37,37')] ).
cnf(256,plain,
( une_qually_directed_lines(A,reverse_line(A))
| une_qually_directed_lines(reverse_line(A),B)
| une_qually_directed_lines(A,B) ),
inference(hyper,[status(thm)],[227,31]),
[iquote('hyper,227,31')] ).
cnf(258,plain,
une_qually_directed_lines(A,reverse_line(A)),
inference(unit_del,[status(thm)],[inference(factor,[status(thm)],[256]),30]),
[iquote('factor,256.1.3,unit_del,30')] ).
cnf(259,plain,
$false,
inference(binary,[status(thm)],[258,48]),
[iquote('binary,258.1,48.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : GEO255+1 : TPTP v8.1.0. Bugfixed v6.4.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n011.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 : 300
% 0.12/0.33 % DateTime : Wed Jul 27 07:21:25 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.00/2.19 ----- Otter 3.3f, August 2004 -----
% 2.00/2.19 The process was started by sandbox on n011.cluster.edu,
% 2.00/2.19 Wed Jul 27 07:21:25 2022
% 2.00/2.19 The command was "./otter". The process ID is 26953.
% 2.00/2.19
% 2.00/2.19 set(prolog_style_variables).
% 2.00/2.19 set(auto).
% 2.00/2.19 dependent: set(auto1).
% 2.00/2.19 dependent: set(process_input).
% 2.00/2.19 dependent: clear(print_kept).
% 2.00/2.19 dependent: clear(print_new_demod).
% 2.00/2.19 dependent: clear(print_back_demod).
% 2.00/2.19 dependent: clear(print_back_sub).
% 2.00/2.19 dependent: set(control_memory).
% 2.00/2.19 dependent: assign(max_mem, 12000).
% 2.00/2.19 dependent: assign(pick_given_ratio, 4).
% 2.00/2.19 dependent: assign(stats_level, 1).
% 2.00/2.19 dependent: assign(max_seconds, 10800).
% 2.00/2.19 clear(print_given).
% 2.00/2.19
% 2.00/2.19 formula_list(usable).
% 2.00/2.19 all A L (apart_point_and_line(A,L)<->left_apart_point(A,L)|left_apart_point(A,reverse_line(L))).
% 2.00/2.19 all L M (convergent_lines(L,M)<->une_qually_directed_lines(L,M)&une_qually_directed_lines(L,reverse_line(M))).
% 2.00/2.19 all A B 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)).
% 2.00/2.19 all L A 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)))& -une_qually_directed_lines(L,line_connecting(A,B))).
% 2.00/2.19 all L A B 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)).
% 2.00/2.19 all A (-distinct_points(A,A)).
% 2.00/2.19 all A B C (distinct_points(A,B)->distinct_points(A,C)|distinct_points(B,C)).
% 2.00/2.19 all L (-distinct_lines(L,L)).
% 2.00/2.19 all L M N (distinct_lines(L,M)->distinct_lines(L,N)|distinct_lines(M,N)).
% 2.00/2.19 all L (-une_qually_directed_lines(L,L)).
% 2.00/2.19 all L M N (une_qually_directed_lines(L,M)->une_qually_directed_lines(L,N)|une_qually_directed_lines(M,N)).
% 2.00/2.19 all L M N (une_qually_directed_lines(L,M)&une_qually_directed_lines(L,reverse_line(M))->une_qually_directed_lines(L,N)&une_qually_directed_lines(L,reverse_line(N))|une_qually_directed_lines(M,N)&une_qually_directed_lines(M,reverse_line(N))).
% 2.00/2.19 all L M (line(L)&line(M)->une_qually_directed_lines(L,M)|une_qually_directed_lines(L,reverse_line(M))).
% 2.00/2.19 all L M (une_qually_directed_lines(L,M)&une_qually_directed_lines(L,reverse_line(M))->left_convergent_lines(L,M)|left_convergent_lines(L,reverse_line(M))).
% 2.00/2.19 all A L (-(left_apart_point(A,L)|left_apart_point(A,reverse_line(L)))).
% 2.00/2.19 all L M (-(left_convergent_lines(L,M)|left_convergent_lines(L,reverse_line(M)))).
% 2.00/2.19 all A B (point(A)&point(B)&distinct_points(A,B)->line(line_connecting(A,B))).
% 2.00/2.19 all L M (line(L)&line(M)&une_qually_directed_lines(L,M)&une_qually_directed_lines(L,reverse_line(M))->point(intersection_point(L,M))).
% 2.00/2.19 all L A (point(A)&line(L)->line(parallel_through_point(L,A))).
% 2.00/2.19 all L (line(L)->line(reverse_line(L))).
% 2.00/2.19 all A B (distinct_points(A,B)-> -apart_point_and_line(A,line_connecting(A,B))& -apart_point_and_line(B,line_connecting(A,B))).
% 2.00/2.19 all L M (une_qually_directed_lines(L,M)&une_qually_directed_lines(L,reverse_line(M))-> -apart_point_and_line(intersection_point(L,M),L)& -apart_point_and_line(intersection_point(L,M),M)).
% 2.00/2.19 all A L (-apart_point_and_line(A,parallel_through_point(L,A))).
% 2.00/2.19 all L (-distinct_lines(L,reverse_line(L))).
% 2.00/2.19 all A B (-une_qually_directed_lines(line_connecting(A,B),reverse_line(line_connecting(B,A)))).
% 2.00/2.19 all A L (-une_qually_directed_lines(parallel_through_point(L,A),L)).
% 2.00/2.19 all A B L 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))).
% 2.00/2.19 all A B L (distinct_points(A,B)&left_apart_point(A,L)->left_apart_point(B,L)|left_convergent_lines(line_connecting(A,B),L)).
% 2.00/2.19 all A B L (left_apart_point(A,L)->distinct_points(A,B)|left_apart_point(B,L)).
% 2.00/2.19 all A L M (left_apart_point(A,L)&une_qually_directed_lines(L,M)->distinct_lines(L,M)|left_apart_point(A,reverse_line(M))).
% 2.00/2.19 all L M N (left_convergent_lines(L,M)->une_qually_directed_lines(M,N)|left_convergent_lines(L,N)).
% 2.00/2.19 -(all L A B (line(L)&distinct_points(A,B)-> -(before_on_line(L,A,B)&before_on_line(L,B,A)))).
% 2.00/2.19 end_of_list.
% 2.00/2.19
% 2.00/2.19 -------> usable clausifies to:
% 2.00/2.19
% 2.00/2.19 list(usable).
% 2.00/2.19 0 [] -apart_point_and_line(A,L)|left_apart_point(A,L)|left_apart_point(A,reverse_line(L)).
% 2.00/2.19 0 [] apart_point_and_line(A,L)| -left_apart_point(A,L).
% 2.00/2.19 0 [] apart_point_and_line(A,L)| -left_apart_point(A,reverse_line(L)).
% 2.00/2.19 0 [] -convergent_lines(L,M)|une_qually_directed_lines(L,M).
% 2.00/2.19 0 [] -convergent_lines(L,M)|une_qually_directed_lines(L,reverse_line(M)).
% 2.00/2.19 0 [] convergent_lines(L,M)| -une_qually_directed_lines(L,M)| -une_qually_directed_lines(L,reverse_line(M)).
% 2.00/2.19 0 [] -divides_points(L,A,B)|left_apart_point(A,L)|left_apart_point(A,reverse_line(L)).
% 2.00/2.19 0 [] -divides_points(L,A,B)|left_apart_point(A,L)|left_apart_point(B,L).
% 2.00/2.19 0 [] -divides_points(L,A,B)|left_apart_point(B,reverse_line(L))|left_apart_point(A,reverse_line(L)).
% 2.00/2.19 0 [] -divides_points(L,A,B)|left_apart_point(B,reverse_line(L))|left_apart_point(B,L).
% 2.00/2.19 0 [] divides_points(L,A,B)| -left_apart_point(A,L)| -left_apart_point(B,reverse_line(L)).
% 2.00/2.19 0 [] divides_points(L,A,B)| -left_apart_point(A,reverse_line(L))| -left_apart_point(B,L).
% 2.00/2.19 0 [] -before_on_line(L,A,B)|distinct_points(A,B).
% 2.00/2.19 0 [] -before_on_line(L,A,B)| -left_apart_point(A,L).
% 2.00/2.19 0 [] -before_on_line(L,A,B)| -left_apart_point(A,reverse_line(L)).
% 2.00/2.19 0 [] -before_on_line(L,A,B)| -left_apart_point(B,L).
% 2.00/2.19 0 [] -before_on_line(L,A,B)| -left_apart_point(B,reverse_line(L)).
% 2.00/2.19 0 [] -before_on_line(L,A,B)| -une_qually_directed_lines(L,line_connecting(A,B)).
% 2.00/2.19 0 [] 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))|une_qually_directed_lines(L,line_connecting(A,B)).
% 2.00/2.19 0 [] -between_on_line(L,A,B,C)|before_on_line(L,A,B)|before_on_line(L,C,B).
% 2.00/2.19 0 [] -between_on_line(L,A,B,C)|before_on_line(L,A,B)|before_on_line(L,B,A).
% 2.00/2.19 0 [] -between_on_line(L,A,B,C)|before_on_line(L,B,C)|before_on_line(L,C,B).
% 2.00/2.19 0 [] -between_on_line(L,A,B,C)|before_on_line(L,B,C)|before_on_line(L,B,A).
% 2.00/2.19 0 [] between_on_line(L,A,B,C)| -before_on_line(L,A,B)| -before_on_line(L,B,C).
% 2.00/2.19 0 [] between_on_line(L,A,B,C)| -before_on_line(L,C,B)| -before_on_line(L,B,A).
% 2.00/2.19 0 [] -distinct_points(A,A).
% 2.00/2.19 0 [] -distinct_points(A,B)|distinct_points(A,C)|distinct_points(B,C).
% 2.00/2.19 0 [] -distinct_lines(L,L).
% 2.00/2.19 0 [] -distinct_lines(L,M)|distinct_lines(L,N)|distinct_lines(M,N).
% 2.00/2.19 0 [] -une_qually_directed_lines(L,L).
% 2.00/2.19 0 [] -une_qually_directed_lines(L,M)|une_qually_directed_lines(L,N)|une_qually_directed_lines(M,N).
% 2.00/2.19 0 [] -une_qually_directed_lines(L,M)| -une_qually_directed_lines(L,reverse_line(M))|une_qually_directed_lines(L,N)|une_qually_directed_lines(M,N).
% 2.00/2.19 0 [] -une_qually_directed_lines(L,M)| -une_qually_directed_lines(L,reverse_line(M))|une_qually_directed_lines(L,N)|une_qually_directed_lines(M,reverse_line(N)).
% 2.00/2.19 0 [] -une_qually_directed_lines(L,M)| -une_qually_directed_lines(L,reverse_line(M))|une_qually_directed_lines(L,reverse_line(N))|une_qually_directed_lines(M,N).
% 2.00/2.19 0 [] -une_qually_directed_lines(L,M)| -une_qually_directed_lines(L,reverse_line(M))|une_qually_directed_lines(L,reverse_line(N))|une_qually_directed_lines(M,reverse_line(N)).
% 2.00/2.19 0 [] -line(L)| -line(M)|une_qually_directed_lines(L,M)|une_qually_directed_lines(L,reverse_line(M)).
% 2.00/2.19 0 [] -une_qually_directed_lines(L,M)| -une_qually_directed_lines(L,reverse_line(M))|left_convergent_lines(L,M)|left_convergent_lines(L,reverse_line(M)).
% 2.00/2.19 0 [] -left_apart_point(A,L).
% 2.00/2.19 0 [] -left_apart_point(A,reverse_line(L)).
% 2.00/2.19 0 [] -left_convergent_lines(L,M).
% 2.00/2.19 0 [] -left_convergent_lines(L,reverse_line(M)).
% 2.00/2.19 0 [] -point(A)| -point(B)| -distinct_points(A,B)|line(line_connecting(A,B)).
% 2.00/2.19 0 [] -line(L)| -line(M)| -une_qually_directed_lines(L,M)| -une_qually_directed_lines(L,reverse_line(M))|point(intersection_point(L,M)).
% 2.00/2.19 0 [] -point(A)| -line(L)|line(parallel_through_point(L,A)).
% 2.00/2.19 0 [] -line(L)|line(reverse_line(L)).
% 2.00/2.19 0 [] -distinct_points(A,B)| -apart_point_and_line(A,line_connecting(A,B)).
% 2.00/2.19 0 [] -distinct_points(A,B)| -apart_point_and_line(B,line_connecting(A,B)).
% 2.00/2.19 0 [] -une_qually_directed_lines(L,M)| -une_qually_directed_lines(L,reverse_line(M))| -apart_point_and_line(intersection_point(L,M),L).
% 2.00/2.19 0 [] -une_qually_directed_lines(L,M)| -une_qually_directed_lines(L,reverse_line(M))| -apart_point_and_line(intersection_point(L,M),M).
% 2.00/2.19 0 [] -apart_point_and_line(A,parallel_through_point(L,A)).
% 2.00/2.19 0 [] -distinct_lines(L,reverse_line(L)).
% 2.00/2.19 0 [] -une_qually_directed_lines(line_connecting(A,B),reverse_line(line_connecting(B,A))).
% 2.00/2.19 0 [] -une_qually_directed_lines(parallel_through_point(L,A),L).
% 2.00/2.19 0 [] -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)).
% 2.00/2.19 0 [] -distinct_points(A,B)| -left_apart_point(A,L)|left_apart_point(B,L)|left_convergent_lines(line_connecting(A,B),L).
% 2.00/2.19 0 [] -left_apart_point(A,L)|distinct_points(A,B)|left_apart_point(B,L).
% 2.00/2.19 0 [] -left_apart_point(A,L)| -une_qually_directed_lines(L,M)|distinct_lines(L,M)|left_apart_point(A,reverse_line(M)).
% 2.00/2.19 0 [] -left_convergent_lines(L,M)|une_qually_directed_lines(M,N)|left_convergent_lines(L,N).
% 2.00/2.19 0 [] line($c3).
% 2.00/2.19 0 [] distinct_points($c2,$c1).
% 2.00/2.19 0 [] before_on_line($c3,$c2,$c1).
% 2.00/2.19 0 [] before_on_line($c3,$c1,$c2).
% 2.00/2.19 end_of_list.
% 2.00/2.19
% 2.00/2.19 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=10.
% 2.00/2.19
% 2.00/2.19 This is a non-Horn set without equality. The strategy will
% 2.00/2.19 be ordered hyper_res, unit deletion, and factoring, with
% 2.00/2.19 satellites in sos and with nuclei in usable.
% 2.00/2.19
% 2.00/2.19 dependent: set(hyper_res).
% 2.00/2.19 dependent: set(factor).
% 2.00/2.19 dependent: set(unit_deletion).
% 2.00/2.19
% 2.00/2.19 ------------> process usable:
% 2.00/2.19 ** KEPT (pick-wt=10): 1 [] -apart_point_and_line(A,B)|left_apart_point(A,B)|left_apart_point(A,reverse_line(B)).
% 2.00/2.19 ** KEPT (pick-wt=6): 2 [] apart_point_and_line(A,B)| -left_apart_point(A,B).
% 2.00/2.19 ** KEPT (pick-wt=7): 3 [] apart_point_and_line(A,B)| -left_apart_point(A,reverse_line(B)).
% 2.00/2.19 ** KEPT (pick-wt=6): 4 [] -convergent_lines(A,B)|une_qually_directed_lines(A,B).
% 2.00/2.19 ** KEPT (pick-wt=7): 5 [] -convergent_lines(A,B)|une_qually_directed_lines(A,reverse_line(B)).
% 2.00/2.19 ** KEPT (pick-wt=10): 6 [] convergent_lines(A,B)| -une_qually_directed_lines(A,B)| -une_qually_directed_lines(A,reverse_line(B)).
% 2.00/2.19 ** KEPT (pick-wt=11): 7 [] -divides_points(A,B,C)|left_apart_point(B,A)|left_apart_point(B,reverse_line(A)).
% 2.00/2.19 ** KEPT (pick-wt=10): 8 [] -divides_points(A,B,C)|left_apart_point(B,A)|left_apart_point(C,A).
% 2.00/2.19 ** KEPT (pick-wt=12): 9 [] -divides_points(A,B,C)|left_apart_point(C,reverse_line(A))|left_apart_point(B,reverse_line(A)).
% 2.00/2.19 ** KEPT (pick-wt=11): 10 [] -divides_points(A,B,C)|left_apart_point(C,reverse_line(A))|left_apart_point(C,A).
% 2.00/2.19 ** KEPT (pick-wt=11): 11 [] divides_points(A,B,C)| -left_apart_point(B,A)| -left_apart_point(C,reverse_line(A)).
% 2.00/2.19 ** KEPT (pick-wt=11): 12 [] divides_points(A,B,C)| -left_apart_point(B,reverse_line(A))| -left_apart_point(C,A).
% 2.00/2.19 ** KEPT (pick-wt=7): 13 [] -before_on_line(A,B,C)|distinct_points(B,C).
% 2.00/2.19 ** KEPT (pick-wt=7): 14 [] -before_on_line(A,B,C)| -left_apart_point(B,A).
% 2.00/2.19 ** KEPT (pick-wt=8): 15 [] -before_on_line(A,B,C)| -left_apart_point(B,reverse_line(A)).
% 2.00/2.19 ** KEPT (pick-wt=7): 16 [] -before_on_line(A,B,C)| -left_apart_point(C,A).
% 2.00/2.19 ** KEPT (pick-wt=8): 17 [] -before_on_line(A,B,C)| -left_apart_point(C,reverse_line(A)).
% 2.00/2.19 ** KEPT (pick-wt=9): 18 [] -before_on_line(A,B,C)| -une_qually_directed_lines(A,line_connecting(B,C)).
% 2.00/2.19 ** KEPT (pick-wt=26): 19 [] before_on_line(A,B,C)| -distinct_points(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))|une_qually_directed_lines(A,line_connecting(B,C)).
% 2.00/2.19 ** KEPT (pick-wt=13): 20 [] -between_on_line(A,B,C,D)|before_on_line(A,B,C)|before_on_line(A,D,C).
% 2.00/2.19 ** KEPT (pick-wt=13): 21 [] -between_on_line(A,B,C,D)|before_on_line(A,B,C)|before_on_line(A,C,B).
% 2.00/2.19 ** KEPT (pick-wt=13): 22 [] -between_on_line(A,B,C,D)|before_on_line(A,C,D)|before_on_line(A,D,C).
% 2.00/2.19 ** KEPT (pick-wt=13): 23 [] -between_on_line(A,B,C,D)|before_on_line(A,C,D)|before_on_line(A,C,B).
% 2.00/2.19 ** KEPT (pick-wt=13): 24 [] between_on_line(A,B,C,D)| -before_on_line(A,B,C)| -before_on_line(A,C,D).
% 2.00/2.19 ** KEPT (pick-wt=13): 25 [] between_on_line(A,B,C,D)| -before_on_line(A,D,C)| -before_on_line(A,C,B).
% 2.00/2.19 ** KEPT (pick-wt=3): 26 [] -distinct_points(A,A).
% 2.00/2.19 ** KEPT (pick-wt=9): 27 [] -distinct_points(A,B)|distinct_points(A,C)|distinct_points(B,C).
% 2.00/2.19 ** KEPT (pick-wt=3): 28 [] -distinct_lines(A,A).
% 2.00/2.19 ** KEPT (pick-wt=9): 29 [] -distinct_lines(A,B)|distinct_lines(A,C)|distinct_lines(B,C).
% 2.00/2.19 ** KEPT (pick-wt=3): 30 [] -une_qually_directed_lines(A,A).
% 2.00/2.19 ** KEPT (pick-wt=9): 31 [] -une_qually_directed_lines(A,B)|une_qually_directed_lines(A,C)|une_qually_directed_lines(B,C).
% 2.00/2.19 Following clause subsumed by 31 during input processing: 0 [] -une_qually_directed_lines(A,B)| -une_qually_directed_lines(A,reverse_line(B))|une_qually_directed_lines(A,C)|une_qually_directed_lines(B,C).
% 2.00/2.19 ** KEPT (pick-wt=14): 32 [] -une_qually_directed_lines(A,B)| -une_qually_directed_lines(A,reverse_line(B))|une_qually_directed_lines(A,C)|une_qually_directed_lines(B,reverse_line(C)).
% 2.00/2.19 ** KEPT (pick-wt=14): 33 [] -une_qually_directed_lines(A,B)| -une_qually_directed_lines(A,reverse_line(B))|une_qually_directed_lines(A,reverse_line(C))|une_qually_directed_lines(B,C).
% 2.00/2.19 Following clause subsumed by 31 during input processing: 0 [] -une_qually_directed_lines(A,B)| -une_qually_directed_lines(A,reverse_line(B))|une_qually_directed_lines(A,reverse_line(C))|une_qually_directed_lines(B,reverse_line(C)).
% 2.00/2.19 ** KEPT (pick-wt=11): 34 [] -line(A)| -line(B)|une_qually_directed_lines(A,B)|une_qually_directed_lines(A,reverse_line(B)).
% 2.00/2.19 ** KEPT (pick-wt=14): 35 [] -une_qually_directed_lines(A,B)| -une_qually_directed_lines(A,reverse_line(B))|left_convergent_lines(A,B)|left_convergent_lines(A,reverse_line(B)).
% 2.00/2.19 ** KEPT (pick-wt=3): 36 [] -left_apart_point(A,B).
% 2.00/2.19 Following clause subsumed by 36 during input processing: 0 [] -left_apart_point(A,reverse_line(B)).
% 2.00/2.19 ** KEPT (pick-wt=3): 37 [] -left_convergent_lines(A,B).
% 2.00/2.19 Following clause subsumed by 37 during input processing: 0 [] -left_convergent_lines(A,reverse_line(B)).
% 2.00/2.19 ** KEPT (pick-wt=11): 38 [] -point(A)| -point(B)| -distinct_points(A,B)|line(line_connecting(A,B)).
% 2.00/2.19 ** KEPT (pick-wt=15): 39 [] -line(A)| -line(B)| -une_qually_directed_lines(A,B)| -une_qually_directed_lines(A,reverse_line(B))|point(intersection_point(A,B)).
% 2.00/2.19 ** KEPT (pick-wt=8): 40 [] -point(A)| -line(B)|line(parallel_through_point(B,A)).
% 2.00/2.19 ** KEPT (pick-wt=5): 41 [] -line(A)|line(reverse_line(A)).
% 2.00/2.19 ** KEPT (pick-wt=8): 42 [] -distinct_points(A,B)| -apart_point_and_line(A,line_connecting(A,B)).
% 2.00/2.19 ** KEPT (pick-wt=8): 43 [] -distinct_points(A,B)| -apart_point_and_line(B,line_connecting(A,B)).
% 2.00/2.19 ** KEPT (pick-wt=12): 44 [] -une_qually_directed_lines(A,B)| -une_qually_directed_lines(A,reverse_line(B))| -apart_point_and_line(intersection_point(A,B),A).
% 2.00/2.19 ** KEPT (pick-wt=12): 45 [] -une_qually_directed_lines(A,B)| -une_qually_directed_lines(A,reverse_line(B))| -apart_point_and_line(intersection_point(A,B),B).
% 2.00/2.19 ** KEPT (pick-wt=5): 46 [] -apart_point_and_line(A,parallel_through_point(B,A)).
% 2.00/2.19 ** KEPT (pick-wt=4): 47 [] -distinct_lines(A,reverse_line(A)).
% 2.00/2.19 ** KEPT (pick-wt=8): 48 [] -une_qually_directed_lines(line_connecting(A,B),reverse_line(line_connecting(B,A))).
% 2.00/2.19 ** KEPT (pick-wt=5): 49 [] -une_qually_directed_lines(parallel_through_point(A,B),A).
% 2.00/2.19 ** KEPT (pick-wt=6): 51 [copy,50,unit_del,36,36,36,36,36,36,36,36] -distinct_points(A,B)| -distinct_lines(C,D).
% 2.00/2.19 Following clause subsumed by 36 during input processing: 0 [unit_del,36,37] -distinct_points(A,B)| -left_apart_point(A,C).
% 2.00/2.19 Following clause subsumed by 36 during input processing: 0 [unit_del,36] -left_apart_point(A,B)|distinct_points(A,C).
% 2.00/2.19 Following clause subsumed by 36 during input processing: 0 [unit_del,36] -left_apart_point(A,B)| -une_qually_directed_lines(B,C)|distinct_lines(B,C).
% 2.00/2.19 Following clause subsumed by 37 during input processing: 0 [unit_del,37] -left_convergent_lines(A,B)|une_qually_directed_lines(B,C).
% 2.00/2.19 36 back subsumes 17.
% 2.00/2.19 36 back subsumes 16.
% 2.00/2.19 36 back subsumes 15.
% 2.00/2.19 36 back subsumes 14.
% 2.00/2.19 36 back subsumes 12.
% 2.00/2.19 36 back subsumes 11.
% 2.00/2.19 36 back subsumes 3.
% 2.00/2.19 36 back subsumes 2.
% 2.00/2.19
% 2.00/2.19 ------------> process sos:
% 2.00/2.19 ** KEPT (pick-wt=2): 59 [] line($c3).
% 2.00/2.19 ** KEPT (pick-wt=3): 60 [] distinct_points($c2,$c1).
% 2.06/2.21 ** KEPT (pick-wt=4): 61 [] before_on_line($c3,$c2,$c1).
% 2.06/2.21 ** KEPT (pick-wt=4): 62 [] before_on_line($c3,$c1,$c2).
% 2.06/2.21
% 2.06/2.21 ======= end of input processing =======
% 2.06/2.21
% 2.06/2.21 =========== start of search ===========
% 2.06/2.21
% 2.06/2.21 -------- PROOF --------
% 2.06/2.21
% 2.06/2.21 ----> UNIT CONFLICT at 0.03 sec ----> 259 [binary,258.1,48.1] $F.
% 2.06/2.21
% 2.06/2.21 Length of proof is 11. Level of proof is 9.
% 2.06/2.21
% 2.06/2.21 ---------------- PROOF ----------------
% 2.06/2.21 % SZS status Theorem
% 2.06/2.21 % SZS output start Refutation
% See solution above
% 2.06/2.21 ------------ end of proof -------------
% 2.06/2.21
% 2.06/2.21
% 2.06/2.21 Search stopped by max_proofs option.
% 2.06/2.21
% 2.06/2.21
% 2.06/2.21 Search stopped by max_proofs option.
% 2.06/2.21
% 2.06/2.21 ============ end of search ============
% 2.06/2.21
% 2.06/2.21 -------------- statistics -------------
% 2.06/2.21 clauses given 53
% 2.06/2.21 clauses generated 1289
% 2.06/2.21 clauses kept 257
% 2.06/2.21 clauses forward subsumed 1094
% 2.06/2.21 clauses back subsumed 29
% 2.06/2.21 Kbytes malloced 1953
% 2.06/2.21
% 2.06/2.21 ----------- times (seconds) -----------
% 2.06/2.21 user CPU time 0.03 (0 hr, 0 min, 0 sec)
% 2.06/2.21 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.06/2.21 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.06/2.21
% 2.06/2.21 That finishes the proof of the theorem.
% 2.06/2.21
% 2.06/2.21 Process 26953 finished Wed Jul 27 07:21:27 2022
% 2.06/2.21 Otter interrupted
% 2.06/2.21 PROOF FOUND
%------------------------------------------------------------------------------