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