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