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