%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GEO184+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n019.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:54:40 EDT 2022
% Result : Theorem 1.59s 1.80s
% Output : Refutation 1.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 9
% Syntax : Number of clauses : 13 ( 7 unt; 4 nHn; 11 RR)
% Number of literals : 26 ( 0 equ; 10 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 15 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ distinct_points(A,A),
file('GEO184+2.p',unknown),
[] ).
cnf(4,axiom,
( ~ distinct_points(A,B)
| distinct_points(A,C)
| distinct_points(B,C) ),
file('GEO184+2.p',unknown),
[] ).
cnf(7,axiom,
( ~ distinct_points(A,B)
| ~ apart_point_and_line(C,line_connecting(A,B))
| distinct_points(C,A) ),
file('GEO184+2.p',unknown),
[] ).
cnf(8,axiom,
( ~ distinct_points(A,B)
| ~ apart_point_and_line(C,line_connecting(A,B))
| distinct_points(C,B) ),
file('GEO184+2.p',unknown),
[] ).
cnf(11,axiom,
( ~ distinct_points(A,B)
| ~ distinct_lines(C,D)
| apart_point_and_line(A,C)
| apart_point_and_line(A,D)
| apart_point_and_line(B,C)
| apart_point_and_line(B,D) ),
file('GEO184+2.p',unknown),
[] ).
cnf(15,axiom,
~ apart_point_and_line(dollar_c4,dollar_c2),
file('GEO184+2.p',unknown),
[] ).
cnf(16,axiom,
~ apart_point_and_line(dollar_c3,dollar_c2),
file('GEO184+2.p',unknown),
[] ).
cnf(17,axiom,
distinct_points(dollar_c4,dollar_c3),
file('GEO184+2.p',unknown),
[] ).
cnf(19,axiom,
distinct_lines(dollar_c2,line_connecting(dollar_c4,dollar_c3)),
file('GEO184+2.p',unknown),
[] ).
cnf(20,plain,
( distinct_points(dollar_c4,A)
| distinct_points(dollar_c3,A) ),
inference(hyper,[status(thm)],[17,4]),
[iquote('hyper,17,4')] ).
cnf(25,plain,
( apart_point_and_line(dollar_c4,line_connecting(dollar_c4,dollar_c3))
| apart_point_and_line(dollar_c3,line_connecting(dollar_c4,dollar_c3)) ),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[19,11,17]),15,16]),
[iquote('hyper,19,11,17,unit_del,15,16')] ).
cnf(72,plain,
apart_point_and_line(dollar_c3,line_connecting(dollar_c4,dollar_c3)),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[25,7,20]),1,1]),
[iquote('hyper,25,7,20,unit_del,1,1')] ).
cnf(82,plain,
$false,
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[72,8,20]),1,1]),
[iquote('hyper,72,8,20,unit_del,1,1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO184+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n019.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Wed Jul 27 07:04:22 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.59/1.79 ----- Otter 3.3f, August 2004 -----
% 1.59/1.79 The process was started by sandbox2 on n019.cluster.edu,
% 1.59/1.79 Wed Jul 27 07:04:22 2022
% 1.59/1.79 The command was "./otter". The process ID is 16949.
% 1.59/1.79
% 1.59/1.79 set(prolog_style_variables).
% 1.59/1.79 set(auto).
% 1.59/1.79 dependent: set(auto1).
% 1.59/1.79 dependent: set(process_input).
% 1.59/1.79 dependent: clear(print_kept).
% 1.59/1.79 dependent: clear(print_new_demod).
% 1.59/1.79 dependent: clear(print_back_demod).
% 1.59/1.79 dependent: clear(print_back_sub).
% 1.59/1.79 dependent: set(control_memory).
% 1.59/1.79 dependent: assign(max_mem, 12000).
% 1.59/1.79 dependent: assign(pick_given_ratio, 4).
% 1.59/1.79 dependent: assign(stats_level, 1).
% 1.59/1.79 dependent: assign(max_seconds, 10800).
% 1.59/1.79 clear(print_given).
% 1.59/1.79
% 1.59/1.79 formula_list(usable).
% 1.59/1.79 all X (-distinct_points(X,X)).
% 1.59/1.79 all X (-distinct_lines(X,X)).
% 1.59/1.79 all X (-convergent_lines(X,X)).
% 1.59/1.79 all X Y Z (distinct_points(X,Y)->distinct_points(X,Z)|distinct_points(Y,Z)).
% 1.59/1.79 all X Y Z (distinct_lines(X,Y)->distinct_lines(X,Z)|distinct_lines(Y,Z)).
% 1.59/1.79 all X Y Z (convergent_lines(X,Y)->convergent_lines(X,Z)|convergent_lines(Y,Z)).
% 1.59/1.79 all X Y Z (distinct_points(X,Y)-> (apart_point_and_line(Z,line_connecting(X,Y))->distinct_points(Z,X)&distinct_points(Z,Y))).
% 1.59/1.79 all X Y Z (convergent_lines(X,Y)-> (apart_point_and_line(Z,X)|apart_point_and_line(Z,Y)->distinct_points(Z,intersection_point(X,Y)))).
% 1.59/1.79 all X Y U V (distinct_points(X,Y)&distinct_lines(U,V)->apart_point_and_line(X,U)|apart_point_and_line(X,V)|apart_point_and_line(Y,U)|apart_point_and_line(Y,V)).
% 1.59/1.79 all X Y Z (apart_point_and_line(X,Y)->distinct_points(X,Z)|apart_point_and_line(Z,Y)).
% 1.59/1.79 all X Y Z (apart_point_and_line(X,Y)->distinct_lines(Y,Z)|apart_point_and_line(X,Z)).
% 1.59/1.79 all X Y (convergent_lines(X,Y)->distinct_lines(X,Y)).
% 1.59/1.79 -(all X Y U V (distinct_points(X,Y)&convergent_lines(U,V)& -apart_point_and_line(X,U)& -apart_point_and_line(Y,U)-> -distinct_lines(U,line_connecting(X,Y)))).
% 1.59/1.79 end_of_list.
% 1.59/1.79
% 1.59/1.79 -------> usable clausifies to:
% 1.59/1.79
% 1.59/1.79 list(usable).
% 1.59/1.79 0 [] -distinct_points(X,X).
% 1.59/1.79 0 [] -distinct_lines(X,X).
% 1.59/1.79 0 [] -convergent_lines(X,X).
% 1.59/1.79 0 [] -distinct_points(X,Y)|distinct_points(X,Z)|distinct_points(Y,Z).
% 1.59/1.79 0 [] -distinct_lines(X,Y)|distinct_lines(X,Z)|distinct_lines(Y,Z).
% 1.59/1.79 0 [] -convergent_lines(X,Y)|convergent_lines(X,Z)|convergent_lines(Y,Z).
% 1.59/1.79 0 [] -distinct_points(X,Y)| -apart_point_and_line(Z,line_connecting(X,Y))|distinct_points(Z,X).
% 1.59/1.79 0 [] -distinct_points(X,Y)| -apart_point_and_line(Z,line_connecting(X,Y))|distinct_points(Z,Y).
% 1.59/1.79 0 [] -convergent_lines(X,Y)| -apart_point_and_line(Z,X)|distinct_points(Z,intersection_point(X,Y)).
% 1.59/1.79 0 [] -convergent_lines(X,Y)| -apart_point_and_line(Z,Y)|distinct_points(Z,intersection_point(X,Y)).
% 1.59/1.79 0 [] -distinct_points(X,Y)| -distinct_lines(U,V)|apart_point_and_line(X,U)|apart_point_and_line(X,V)|apart_point_and_line(Y,U)|apart_point_and_line(Y,V).
% 1.59/1.79 0 [] -apart_point_and_line(X,Y)|distinct_points(X,Z)|apart_point_and_line(Z,Y).
% 1.59/1.79 0 [] -apart_point_and_line(X,Y)|distinct_lines(Y,Z)|apart_point_and_line(X,Z).
% 1.59/1.79 0 [] -convergent_lines(X,Y)|distinct_lines(X,Y).
% 1.59/1.79 0 [] distinct_points($c4,$c3).
% 1.59/1.79 0 [] convergent_lines($c2,$c1).
% 1.59/1.79 0 [] -apart_point_and_line($c4,$c2).
% 1.59/1.79 0 [] -apart_point_and_line($c3,$c2).
% 1.59/1.79 0 [] distinct_lines($c2,line_connecting($c4,$c3)).
% 1.59/1.79 end_of_list.
% 1.59/1.79
% 1.59/1.79 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=6.
% 1.59/1.79
% 1.59/1.79 This is a non-Horn set without equality. The strategy will
% 1.59/1.79 be ordered hyper_res, unit deletion, and factoring, with
% 1.59/1.79 satellites in sos and with nuclei in usable.
% 1.59/1.79
% 1.59/1.79 dependent: set(hyper_res).
% 1.59/1.79 dependent: set(factor).
% 1.59/1.79 dependent: set(unit_deletion).
% 1.59/1.79
% 1.59/1.79 ------------> process usable:
% 1.59/1.79 ** KEPT (pick-wt=3): 1 [] -distinct_points(A,A).
% 1.59/1.79 ** KEPT (pick-wt=3): 2 [] -distinct_lines(A,A).
% 1.59/1.79 ** KEPT (pick-wt=3): 3 [] -convergent_lines(A,A).
% 1.59/1.79 ** KEPT (pick-wt=9): 4 [] -distinct_points(A,B)|distinct_points(A,C)|distinct_points(B,C).
% 1.59/1.79 ** KEPT (pick-wt=9): 5 [] -distinct_lines(A,B)|distinct_lines(A,C)|distinct_lines(B,C).
% 1.59/1.79 ** KEPT (pick-wt=9): 6 [] -convergent_lines(A,B)|convergent_lines(A,C)|convergent_lines(B,C).
% 1.59/1.79 ** KEPT (pick-wt=11): 7 [] -distinct_points(A,B)| -apart_point_and_line(C,line_connecting(A,B))|distinct_points(C,A).
% 1.59/1.79 ** KEPT (pick-wt=11): 8 [] -distinct_points(A,B)| -apart_point_and_line(C,line_connecting(A,B))|distinct_points(C,B).
% 1.59/1.80 ** KEPT (pick-wt=11): 9 [] -convergent_lines(A,B)| -apart_point_and_line(C,A)|distinct_points(C,intersection_point(A,B)).
% 1.59/1.80 ** KEPT (pick-wt=11): 10 [] -convergent_lines(A,B)| -apart_point_and_line(C,B)|distinct_points(C,intersection_point(A,B)).
% 1.59/1.80 ** KEPT (pick-wt=18): 11 [] -distinct_points(A,B)| -distinct_lines(C,D)|apart_point_and_line(A,C)|apart_point_and_line(A,D)|apart_point_and_line(B,C)|apart_point_and_line(B,D).
% 1.59/1.80 ** KEPT (pick-wt=9): 12 [] -apart_point_and_line(A,B)|distinct_points(A,C)|apart_point_and_line(C,B).
% 1.59/1.80 ** KEPT (pick-wt=9): 13 [] -apart_point_and_line(A,B)|distinct_lines(B,C)|apart_point_and_line(A,C).
% 1.59/1.80 ** KEPT (pick-wt=6): 14 [] -convergent_lines(A,B)|distinct_lines(A,B).
% 1.59/1.80 ** KEPT (pick-wt=3): 15 [] -apart_point_and_line($c4,$c2).
% 1.59/1.80 ** KEPT (pick-wt=3): 16 [] -apart_point_and_line($c3,$c2).
% 1.59/1.80
% 1.59/1.80 ------------> process sos:
% 1.59/1.80 ** KEPT (pick-wt=3): 17 [] distinct_points($c4,$c3).
% 1.59/1.80 ** KEPT (pick-wt=3): 18 [] convergent_lines($c2,$c1).
% 1.59/1.80 ** KEPT (pick-wt=5): 19 [] distinct_lines($c2,line_connecting($c4,$c3)).
% 1.59/1.80
% 1.59/1.80 ======= end of input processing =======
% 1.59/1.80
% 1.59/1.80 =========== start of search ===========
% 1.59/1.80
% 1.59/1.80 -------- PROOF --------
% 1.59/1.80
% 1.59/1.80 -----> EMPTY CLAUSE at 0.01 sec ----> 82 [hyper,72,8,20,unit_del,1,1] $F.
% 1.59/1.80
% 1.59/1.80 Length of proof is 3. Level of proof is 2.
% 1.59/1.80
% 1.59/1.80 ---------------- PROOF ----------------
% 1.59/1.80 % SZS status Theorem
% 1.59/1.80 % SZS output start Refutation
% See solution above
% 1.59/1.80 ------------ end of proof -------------
% 1.59/1.80
% 1.59/1.80
% 1.59/1.80 Search stopped by max_proofs option.
% 1.59/1.80
% 1.59/1.80
% 1.59/1.80 Search stopped by max_proofs option.
% 1.59/1.80
% 1.59/1.80 ============ end of search ============
% 1.59/1.80
% 1.59/1.80 -------------- statistics -------------
% 1.59/1.80 clauses given 17
% 1.59/1.80 clauses generated 172
% 1.59/1.80 clauses kept 81
% 1.59/1.80 clauses forward subsumed 109
% 1.59/1.80 clauses back subsumed 15
% 1.59/1.80 Kbytes malloced 976
% 1.59/1.80
% 1.59/1.80 ----------- times (seconds) -----------
% 1.59/1.80 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.59/1.80 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.59/1.80 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.59/1.80
% 1.59/1.80 That finishes the proof of the theorem.
% 1.59/1.80
% 1.59/1.80 Process 16949 finished Wed Jul 27 07:04:23 2022
% 1.59/1.80 Otter interrupted
% 1.59/1.80 PROOF FOUND
%------------------------------------------------------------------------------