TSTP Solution File: GEO171+2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GEO171+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n026.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:35 EDT 2022
% Result : Theorem 1.93s 2.10s
% Output : Refutation 1.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 5 ( 4 unt; 0 nHn; 5 RR)
% Number of literals : 6 ( 0 equ; 2 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 2 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(14,axiom,
( ~ convergent_lines(A,B)
| distinct_lines(A,B) ),
file('GEO171+2.p',unknown),
[] ).
cnf(15,axiom,
~ distinct_lines(dollar_c2,dollar_c1),
file('GEO171+2.p',unknown),
[] ).
cnf(16,axiom,
convergent_lines(dollar_c2,dollar_c1),
file('GEO171+2.p',unknown),
[] ).
cnf(17,plain,
distinct_lines(dollar_c2,dollar_c1),
inference(hyper,[status(thm)],[16,14]),
[iquote('hyper,16,14')] ).
cnf(18,plain,
$false,
inference(binary,[status(thm)],[17,15]),
[iquote('binary,17.1,15.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GEO171+2 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n026.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:09:24 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.93/2.10 ----- Otter 3.3f, August 2004 -----
% 1.93/2.10 The process was started by sandbox2 on n026.cluster.edu,
% 1.93/2.10 Wed Jul 27 07:09:24 2022
% 1.93/2.10 The command was "./otter". The process ID is 30822.
% 1.93/2.10
% 1.93/2.10 set(prolog_style_variables).
% 1.93/2.10 set(auto).
% 1.93/2.10 dependent: set(auto1).
% 1.93/2.10 dependent: set(process_input).
% 1.93/2.10 dependent: clear(print_kept).
% 1.93/2.10 dependent: clear(print_new_demod).
% 1.93/2.10 dependent: clear(print_back_demod).
% 1.93/2.10 dependent: clear(print_back_sub).
% 1.93/2.10 dependent: set(control_memory).
% 1.93/2.10 dependent: assign(max_mem, 12000).
% 1.93/2.10 dependent: assign(pick_given_ratio, 4).
% 1.93/2.10 dependent: assign(stats_level, 1).
% 1.93/2.10 dependent: assign(max_seconds, 10800).
% 1.93/2.10 clear(print_given).
% 1.93/2.10
% 1.93/2.10 formula_list(usable).
% 1.93/2.10 all X (-distinct_points(X,X)).
% 1.93/2.10 all X (-distinct_lines(X,X)).
% 1.93/2.10 all X (-convergent_lines(X,X)).
% 1.93/2.10 all X Y Z (distinct_points(X,Y)->distinct_points(X,Z)|distinct_points(Y,Z)).
% 1.93/2.10 all X Y Z (distinct_lines(X,Y)->distinct_lines(X,Z)|distinct_lines(Y,Z)).
% 1.93/2.10 all X Y Z (convergent_lines(X,Y)->convergent_lines(X,Z)|convergent_lines(Y,Z)).
% 1.93/2.10 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.93/2.10 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.93/2.10 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.93/2.10 all X Y Z (apart_point_and_line(X,Y)->distinct_points(X,Z)|apart_point_and_line(Z,Y)).
% 1.93/2.10 all X Y Z (apart_point_and_line(X,Y)->distinct_lines(Y,Z)|apart_point_and_line(X,Z)).
% 1.93/2.10 all X Y (convergent_lines(X,Y)->distinct_lines(X,Y)).
% 1.93/2.10 -(all X Y (convergent_lines(X,Y)->distinct_lines(X,Y))).
% 1.93/2.10 end_of_list.
% 1.93/2.10
% 1.93/2.10 -------> usable clausifies to:
% 1.93/2.10
% 1.93/2.10 list(usable).
% 1.93/2.10 0 [] -distinct_points(X,X).
% 1.93/2.10 0 [] -distinct_lines(X,X).
% 1.93/2.10 0 [] -convergent_lines(X,X).
% 1.93/2.10 0 [] -distinct_points(X,Y)|distinct_points(X,Z)|distinct_points(Y,Z).
% 1.93/2.10 0 [] -distinct_lines(X,Y)|distinct_lines(X,Z)|distinct_lines(Y,Z).
% 1.93/2.10 0 [] -convergent_lines(X,Y)|convergent_lines(X,Z)|convergent_lines(Y,Z).
% 1.93/2.10 0 [] -distinct_points(X,Y)| -apart_point_and_line(Z,line_connecting(X,Y))|distinct_points(Z,X).
% 1.93/2.10 0 [] -distinct_points(X,Y)| -apart_point_and_line(Z,line_connecting(X,Y))|distinct_points(Z,Y).
% 1.93/2.10 0 [] -convergent_lines(X,Y)| -apart_point_and_line(Z,X)|distinct_points(Z,intersection_point(X,Y)).
% 1.93/2.10 0 [] -convergent_lines(X,Y)| -apart_point_and_line(Z,Y)|distinct_points(Z,intersection_point(X,Y)).
% 1.93/2.10 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.93/2.10 0 [] -apart_point_and_line(X,Y)|distinct_points(X,Z)|apart_point_and_line(Z,Y).
% 1.93/2.10 0 [] -apart_point_and_line(X,Y)|distinct_lines(Y,Z)|apart_point_and_line(X,Z).
% 1.93/2.10 0 [] -convergent_lines(X,Y)|distinct_lines(X,Y).
% 1.93/2.10 0 [] convergent_lines($c2,$c1).
% 1.93/2.10 0 [] -distinct_lines($c2,$c1).
% 1.93/2.10 end_of_list.
% 1.93/2.10
% 1.93/2.10 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=6.
% 1.93/2.10
% 1.93/2.10 This is a non-Horn set without equality. The strategy will
% 1.93/2.10 be ordered hyper_res, unit deletion, and factoring, with
% 1.93/2.10 satellites in sos and with nuclei in usable.
% 1.93/2.10
% 1.93/2.10 dependent: set(hyper_res).
% 1.93/2.10 dependent: set(factor).
% 1.93/2.10 dependent: set(unit_deletion).
% 1.93/2.10
% 1.93/2.10 ------------> process usable:
% 1.93/2.10 ** KEPT (pick-wt=3): 1 [] -distinct_points(A,A).
% 1.93/2.10 ** KEPT (pick-wt=3): 2 [] -distinct_lines(A,A).
% 1.93/2.10 ** KEPT (pick-wt=3): 3 [] -convergent_lines(A,A).
% 1.93/2.10 ** KEPT (pick-wt=9): 4 [] -distinct_points(A,B)|distinct_points(A,C)|distinct_points(B,C).
% 1.93/2.10 ** KEPT (pick-wt=9): 5 [] -distinct_lines(A,B)|distinct_lines(A,C)|distinct_lines(B,C).
% 1.93/2.10 ** KEPT (pick-wt=9): 6 [] -convergent_lines(A,B)|convergent_lines(A,C)|convergent_lines(B,C).
% 1.93/2.10 ** KEPT (pick-wt=11): 7 [] -distinct_points(A,B)| -apart_point_and_line(C,line_connecting(A,B))|distinct_points(C,A).
% 1.93/2.10 ** KEPT (pick-wt=11): 8 [] -distinct_points(A,B)| -apart_point_and_line(C,line_connecting(A,B))|distinct_points(C,B).
% 1.93/2.10 ** KEPT (pick-wt=11): 9 [] -convergent_lines(A,B)| -apart_point_and_line(C,A)|distinct_points(C,intersection_point(A,B)).
% 1.93/2.10 ** KEPT (pick-wt=11): 10 [] -convergent_lines(A,B)| -apart_point_and_line(C,B)|distinct_points(C,intersection_point(A,B)).
% 1.93/2.10 ** 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.93/2.10 ** KEPT (pick-wt=9): 12 [] -apart_point_and_line(A,B)|distinct_points(A,C)|apart_point_and_line(C,B).
% 1.93/2.10 ** KEPT (pick-wt=9): 13 [] -apart_point_and_line(A,B)|distinct_lines(B,C)|apart_point_and_line(A,C).
% 1.93/2.10 ** KEPT (pick-wt=6): 14 [] -convergent_lines(A,B)|distinct_lines(A,B).
% 1.93/2.10 ** KEPT (pick-wt=3): 15 [] -distinct_lines($c2,$c1).
% 1.93/2.10
% 1.93/2.10 ------------> process sos:
% 1.93/2.10 ** KEPT (pick-wt=3): 16 [] convergent_lines($c2,$c1).
% 1.93/2.10
% 1.93/2.10 ======= end of input processing =======
% 1.93/2.10
% 1.93/2.10 =========== start of search ===========
% 1.93/2.10
% 1.93/2.10 -------- PROOF --------
% 1.93/2.10
% 1.93/2.10 ----> UNIT CONFLICT at 0.00 sec ----> 18 [binary,17.1,15.1] $F.
% 1.93/2.10
% 1.93/2.10 Length of proof is 1. Level of proof is 1.
% 1.93/2.10
% 1.93/2.10 ---------------- PROOF ----------------
% 1.93/2.10 % SZS status Theorem
% 1.93/2.10 % SZS output start Refutation
% See solution above
% 1.93/2.10 ------------ end of proof -------------
% 1.93/2.10
% 1.93/2.10
% 1.93/2.10 Search stopped by max_proofs option.
% 1.93/2.10
% 1.93/2.10
% 1.93/2.10 Search stopped by max_proofs option.
% 1.93/2.10
% 1.93/2.10 ============ end of search ============
% 1.93/2.10
% 1.93/2.10 -------------- statistics -------------
% 1.93/2.10 clauses given 1
% 1.93/2.10 clauses generated 10
% 1.93/2.10 clauses kept 17
% 1.93/2.10 clauses forward subsumed 9
% 1.93/2.10 clauses back subsumed 0
% 1.93/2.10 Kbytes malloced 976
% 1.93/2.10
% 1.93/2.10 ----------- times (seconds) -----------
% 1.93/2.10 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.93/2.10 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.93/2.10 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.93/2.10
% 1.93/2.10 That finishes the proof of the theorem.
% 1.93/2.10
% 1.93/2.10 Process 30822 finished Wed Jul 27 07:09:26 2022
% 1.93/2.10 Otter interrupted
% 1.93/2.10 PROOF FOUND
%------------------------------------------------------------------------------