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