TSTP Solution File: GEO170+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GEO170+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n018.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:34 EDT 2022
% Result : Theorem 1.31s 1.72s
% Output : Refutation 1.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 9
% Syntax : Number of clauses : 14 ( 8 unt; 4 nHn; 12 RR)
% Number of literals : 25 ( 0 equ; 10 neg)
% Maximal clause size : 6 ( 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 : 13 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ distinct_points(A,A),
file('GEO170+1.p',unknown),
[] ).
cnf(4,axiom,
( ~ distinct_points(A,B)
| distinct_points(A,C)
| distinct_points(B,C) ),
file('GEO170+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ distinct_points(A,B)
| ~ apart_point_and_line(A,line_connecting(A,B)) ),
file('GEO170+1.p',unknown),
[] ).
cnf(8,axiom,
( ~ distinct_points(A,B)
| ~ apart_point_and_line(B,line_connecting(A,B)) ),
file('GEO170+1.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('GEO170+1.p',unknown),
[] ).
cnf(15,axiom,
~ apart_point_and_line(dollar_c3,dollar_c1),
file('GEO170+1.p',unknown),
[] ).
cnf(16,axiom,
~ apart_point_and_line(dollar_c2,dollar_c1),
file('GEO170+1.p',unknown),
[] ).
cnf(17,axiom,
distinct_points(dollar_c3,dollar_c2),
file('GEO170+1.p',unknown),
[] ).
cnf(18,axiom,
distinct_lines(dollar_c1,line_connecting(dollar_c3,dollar_c2)),
file('GEO170+1.p',unknown),
[] ).
cnf(19,plain,
( distinct_points(dollar_c3,A)
| distinct_points(dollar_c2,A) ),
inference(hyper,[status(thm)],[17,4]),
[iquote('hyper,17,4')] ).
cnf(20,plain,
( apart_point_and_line(dollar_c3,line_connecting(dollar_c3,dollar_c2))
| apart_point_and_line(dollar_c2,line_connecting(dollar_c3,dollar_c2)) ),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[18,11,17]),15,16]),
[iquote('hyper,18,11,17,unit_del,15,16')] ).
cnf(37,plain,
apart_point_and_line(dollar_c2,line_connecting(dollar_c3,dollar_c2)),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[20,7,19]),1]),
[iquote('hyper,20,7,19,unit_del,1')] ).
cnf(43,plain,
distinct_points(dollar_c2,dollar_c2),
inference(hyper,[status(thm)],[37,8,19]),
[iquote('hyper,37,8,19')] ).
cnf(44,plain,
$false,
inference(binary,[status(thm)],[43,1]),
[iquote('binary,43.1,1.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : GEO170+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.11/0.31 % Computer : n018.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Wed Jul 27 07:17:31 EDT 2022
% 0.11/0.31 % CPUTime :
% 1.31/1.72 ----- Otter 3.3f, August 2004 -----
% 1.31/1.72 The process was started by sandbox on n018.cluster.edu,
% 1.31/1.72 Wed Jul 27 07:17:31 2022
% 1.31/1.72 The command was "./otter". The process ID is 10792.
% 1.31/1.72
% 1.31/1.72 set(prolog_style_variables).
% 1.31/1.72 set(auto).
% 1.31/1.72 dependent: set(auto1).
% 1.31/1.72 dependent: set(process_input).
% 1.31/1.72 dependent: clear(print_kept).
% 1.31/1.72 dependent: clear(print_new_demod).
% 1.31/1.72 dependent: clear(print_back_demod).
% 1.31/1.72 dependent: clear(print_back_sub).
% 1.31/1.72 dependent: set(control_memory).
% 1.31/1.72 dependent: assign(max_mem, 12000).
% 1.31/1.72 dependent: assign(pick_given_ratio, 4).
% 1.31/1.72 dependent: assign(stats_level, 1).
% 1.31/1.72 dependent: assign(max_seconds, 10800).
% 1.31/1.72 clear(print_given).
% 1.31/1.72
% 1.31/1.72 formula_list(usable).
% 1.31/1.72 all X (-distinct_points(X,X)).
% 1.31/1.72 all X (-distinct_lines(X,X)).
% 1.31/1.72 all X (-convergent_lines(X,X)).
% 1.31/1.72 all X Y Z (distinct_points(X,Y)->distinct_points(X,Z)|distinct_points(Y,Z)).
% 1.31/1.72 all X Y Z (distinct_lines(X,Y)->distinct_lines(X,Z)|distinct_lines(Y,Z)).
% 1.31/1.72 all X Y Z (convergent_lines(X,Y)->convergent_lines(X,Z)|convergent_lines(Y,Z)).
% 1.31/1.72 all X Y (distinct_points(X,Y)-> -apart_point_and_line(X,line_connecting(X,Y))).
% 1.31/1.72 all X Y (distinct_points(X,Y)-> -apart_point_and_line(Y,line_connecting(X,Y))).
% 1.31/1.72 all X Y (convergent_lines(X,Y)-> -apart_point_and_line(intersection_point(X,Y),X)).
% 1.31/1.72 all X Y (convergent_lines(X,Y)-> -apart_point_and_line(intersection_point(X,Y),Y)).
% 1.31/1.72 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.31/1.72 all X Y Z (apart_point_and_line(X,Y)->distinct_points(X,Z)|apart_point_and_line(Z,Y)).
% 1.31/1.72 all X Y Z (apart_point_and_line(X,Y)->distinct_lines(Y,Z)|apart_point_and_line(X,Z)).
% 1.31/1.72 all X Y Z (convergent_lines(X,Y)->distinct_lines(Y,Z)|convergent_lines(X,Z)).
% 1.31/1.72 -(all X Y Z (distinct_points(X,Y)& -apart_point_and_line(X,Z)& -apart_point_and_line(Y,Z)-> -distinct_lines(Z,line_connecting(X,Y)))).
% 1.31/1.72 end_of_list.
% 1.31/1.72
% 1.31/1.72 -------> usable clausifies to:
% 1.31/1.72
% 1.31/1.72 list(usable).
% 1.31/1.72 0 [] -distinct_points(X,X).
% 1.31/1.72 0 [] -distinct_lines(X,X).
% 1.31/1.72 0 [] -convergent_lines(X,X).
% 1.31/1.72 0 [] -distinct_points(X,Y)|distinct_points(X,Z)|distinct_points(Y,Z).
% 1.31/1.72 0 [] -distinct_lines(X,Y)|distinct_lines(X,Z)|distinct_lines(Y,Z).
% 1.31/1.72 0 [] -convergent_lines(X,Y)|convergent_lines(X,Z)|convergent_lines(Y,Z).
% 1.31/1.72 0 [] -distinct_points(X,Y)| -apart_point_and_line(X,line_connecting(X,Y)).
% 1.31/1.72 0 [] -distinct_points(X,Y)| -apart_point_and_line(Y,line_connecting(X,Y)).
% 1.31/1.72 0 [] -convergent_lines(X,Y)| -apart_point_and_line(intersection_point(X,Y),X).
% 1.31/1.72 0 [] -convergent_lines(X,Y)| -apart_point_and_line(intersection_point(X,Y),Y).
% 1.31/1.72 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.31/1.72 0 [] -apart_point_and_line(X,Y)|distinct_points(X,Z)|apart_point_and_line(Z,Y).
% 1.31/1.72 0 [] -apart_point_and_line(X,Y)|distinct_lines(Y,Z)|apart_point_and_line(X,Z).
% 1.31/1.72 0 [] -convergent_lines(X,Y)|distinct_lines(Y,Z)|convergent_lines(X,Z).
% 1.31/1.72 0 [] distinct_points($c3,$c2).
% 1.31/1.72 0 [] -apart_point_and_line($c3,$c1).
% 1.31/1.72 0 [] -apart_point_and_line($c2,$c1).
% 1.31/1.72 0 [] distinct_lines($c1,line_connecting($c3,$c2)).
% 1.31/1.72 end_of_list.
% 1.31/1.72
% 1.31/1.72 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=6.
% 1.31/1.72
% 1.31/1.72 This is a non-Horn set without equality. The strategy will
% 1.31/1.72 be ordered hyper_res, unit deletion, and factoring, with
% 1.31/1.72 satellites in sos and with nuclei in usable.
% 1.31/1.72
% 1.31/1.72 dependent: set(hyper_res).
% 1.31/1.72 dependent: set(factor).
% 1.31/1.72 dependent: set(unit_deletion).
% 1.31/1.72
% 1.31/1.72 ------------> process usable:
% 1.31/1.72 ** KEPT (pick-wt=3): 1 [] -distinct_points(A,A).
% 1.31/1.72 ** KEPT (pick-wt=3): 2 [] -distinct_lines(A,A).
% 1.31/1.72 ** KEPT (pick-wt=3): 3 [] -convergent_lines(A,A).
% 1.31/1.72 ** KEPT (pick-wt=9): 4 [] -distinct_points(A,B)|distinct_points(A,C)|distinct_points(B,C).
% 1.31/1.72 ** KEPT (pick-wt=9): 5 [] -distinct_lines(A,B)|distinct_lines(A,C)|distinct_lines(B,C).
% 1.31/1.72 ** KEPT (pick-wt=9): 6 [] -convergent_lines(A,B)|convergent_lines(A,C)|convergent_lines(B,C).
% 1.31/1.72 ** KEPT (pick-wt=8): 7 [] -distinct_points(A,B)| -apart_point_and_line(A,line_connecting(A,B)).
% 1.31/1.72 ** KEPT (pick-wt=8): 8 [] -distinct_points(A,B)| -apart_point_and_line(B,line_connecting(A,B)).
% 1.31/1.72 ** KEPT (pick-wt=8): 9 [] -convergent_lines(A,B)| -apart_point_and_line(intersection_point(A,B),A).
% 1.31/1.72 ** KEPT (pick-wt=8): 10 [] -convergent_lines(A,B)| -apart_point_and_line(intersection_point(A,B),B).
% 1.31/1.72 ** 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.31/1.72 ** KEPT (pick-wt=9): 12 [] -apart_point_and_line(A,B)|distinct_points(A,C)|apart_point_and_line(C,B).
% 1.31/1.72 ** KEPT (pick-wt=9): 13 [] -apart_point_and_line(A,B)|distinct_lines(B,C)|apart_point_and_line(A,C).
% 1.31/1.72 ** KEPT (pick-wt=9): 14 [] -convergent_lines(A,B)|distinct_lines(B,C)|convergent_lines(A,C).
% 1.31/1.72 ** KEPT (pick-wt=3): 15 [] -apart_point_and_line($c3,$c1).
% 1.31/1.72 ** KEPT (pick-wt=3): 16 [] -apart_point_and_line($c2,$c1).
% 1.31/1.72
% 1.31/1.72 ------------> process sos:
% 1.31/1.72 ** KEPT (pick-wt=3): 17 [] distinct_points($c3,$c2).
% 1.31/1.72 ** KEPT (pick-wt=5): 18 [] distinct_lines($c1,line_connecting($c3,$c2)).
% 1.31/1.72
% 1.31/1.72 ======= end of input processing =======
% 1.31/1.72
% 1.31/1.72 =========== start of search ===========
% 1.31/1.72
% 1.31/1.72 -------- PROOF --------
% 1.31/1.72
% 1.31/1.72 ----> UNIT CONFLICT at 0.00 sec ----> 44 [binary,43.1,1.1] $F.
% 1.31/1.72
% 1.31/1.72 Length of proof is 4. Level of proof is 3.
% 1.31/1.72
% 1.31/1.72 ---------------- PROOF ----------------
% 1.31/1.72 % SZS status Theorem
% 1.31/1.72 % SZS output start Refutation
% See solution above
% 1.31/1.72 ------------ end of proof -------------
% 1.31/1.72
% 1.31/1.72
% 1.31/1.72 Search stopped by max_proofs option.
% 1.31/1.72
% 1.31/1.72
% 1.31/1.72 Search stopped by max_proofs option.
% 1.31/1.72
% 1.31/1.72 ============ end of search ============
% 1.31/1.72
% 1.31/1.72 -------------- statistics -------------
% 1.31/1.72 clauses given 8
% 1.31/1.72 clauses generated 78
% 1.31/1.72 clauses kept 43
% 1.31/1.72 clauses forward subsumed 53
% 1.31/1.72 clauses back subsumed 9
% 1.31/1.72 Kbytes malloced 976
% 1.31/1.72
% 1.31/1.72 ----------- times (seconds) -----------
% 1.31/1.72 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.31/1.72 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.31/1.72 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.31/1.72
% 1.31/1.72 That finishes the proof of the theorem.
% 1.31/1.72
% 1.31/1.72 Process 10792 finished Wed Jul 27 07:17:32 2022
% 1.31/1.72 Otter interrupted
% 1.31/1.72 PROOF FOUND
%------------------------------------------------------------------------------