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