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