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