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