TSTP Solution File: GEO199+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GEO199+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n027.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:46 EDT 2022
% Result : Theorem 271.91s 272.16s
% Output : Refutation 271.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of clauses : 34 ( 8 unt; 24 nHn; 10 RR)
% Number of literals : 90 ( 0 equ; 11 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 56 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
~ convergent_lines(A,A),
file('GEO199+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ convergent_lines(A,B)
| convergent_lines(A,C)
| convergent_lines(B,C) ),
file('GEO199+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ convergent_lines(A,B)
| ~ apart_point_and_line(intersection_point(A,B),A) ),
file('GEO199+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ convergent_lines(A,B)
| ~ apart_point_and_line(intersection_point(A,B),B) ),
file('GEO199+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('GEO199+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ apart_point_and_line(A,B)
| distinct_points(A,C)
| apart_point_and_line(C,B) ),
file('GEO199+1.p',unknown),
[] ).
cnf(14,axiom,
( ~ convergent_lines(A,B)
| distinct_lines(B,C)
| convergent_lines(A,C) ),
file('GEO199+1.p',unknown),
[] ).
cnf(15,axiom,
~ apart_point_and_line(intersection_point(dollar_c3,dollar_c2),dollar_c1),
file('GEO199+1.p',unknown),
[] ).
cnf(16,axiom,
convergent_lines(dollar_c3,dollar_c2),
file('GEO199+1.p',unknown),
[] ).
cnf(19,axiom,
apart_point_and_line(intersection_point(dollar_c2,dollar_c3),dollar_c1),
file('GEO199+1.p',unknown),
[] ).
cnf(21,plain,
( convergent_lines(dollar_c3,A)
| convergent_lines(dollar_c2,A) ),
inference(hyper,[status(thm)],[16,6]),
[iquote('hyper,16,6')] ).
cnf(27,plain,
( distinct_points(intersection_point(dollar_c2,dollar_c3),A)
| apart_point_and_line(A,dollar_c1) ),
inference(hyper,[status(thm)],[19,12]),
[iquote('hyper,19,12')] ).
cnf(30,plain,
( convergent_lines(dollar_c2,A)
| convergent_lines(dollar_c3,B)
| convergent_lines(A,B) ),
inference(hyper,[status(thm)],[21,6]),
[iquote('hyper,21,6')] ).
cnf(68,plain,
( convergent_lines(dollar_c2,A)
| convergent_lines(A,B)
| convergent_lines(dollar_c3,C)
| convergent_lines(B,C) ),
inference(hyper,[status(thm)],[30,6]),
[iquote('hyper,30,6')] ).
cnf(69,plain,
( convergent_lines(dollar_c2,A)
| convergent_lines(A,dollar_c3) ),
inference(hyper,[status(thm)],[30,3]),
[iquote('hyper,30,3')] ).
cnf(71,plain,
( convergent_lines(dollar_c2,A)
| convergent_lines(dollar_c3,B)
| convergent_lines(A,C)
| convergent_lines(B,C) ),
inference(hyper,[status(thm)],[30,6]),
[iquote('hyper,30,6')] ).
cnf(72,plain,
( convergent_lines(dollar_c3,A)
| convergent_lines(A,dollar_c2) ),
inference(unit_del,[status(thm)],[inference(factor,[status(thm)],[71]),3]),
[iquote('factor,71.1.3,unit_del,3')] ).
cnf(74,plain,
( convergent_lines(A,dollar_c3)
| convergent_lines(dollar_c2,B)
| convergent_lines(A,B) ),
inference(hyper,[status(thm)],[69,6]),
[iquote('hyper,69,6')] ).
cnf(75,plain,
( convergent_lines(dollar_c2,A)
| distinct_lines(dollar_c3,B)
| convergent_lines(A,B) ),
inference(hyper,[status(thm)],[69,14]),
[iquote('hyper,69,14')] ).
cnf(76,plain,
distinct_lines(dollar_c3,dollar_c2),
inference(unit_del,[status(thm)],[inference(factor,[status(thm)],[75]),3]),
[iquote('factor,75.1.3,unit_del,3')] ).
cnf(77,plain,
( apart_point_and_line(intersection_point(dollar_c2,dollar_c3),dollar_c3)
| apart_point_and_line(intersection_point(dollar_c2,dollar_c3),dollar_c2)
| apart_point_and_line(A,dollar_c3)
| apart_point_and_line(A,dollar_c2)
| apart_point_and_line(A,dollar_c1) ),
inference(hyper,[status(thm)],[76,11,27]),
[iquote('hyper,76,11,27')] ).
cnf(80,plain,
( convergent_lines(A,dollar_c2)
| convergent_lines(dollar_c3,B)
| convergent_lines(A,B) ),
inference(hyper,[status(thm)],[72,6]),
[iquote('hyper,72,6')] ).
cnf(166,plain,
( convergent_lines(A,dollar_c3)
| convergent_lines(A,B)
| convergent_lines(dollar_c2,C)
| convergent_lines(B,C) ),
inference(hyper,[status(thm)],[74,6]),
[iquote('hyper,74,6')] ).
cnf(167,plain,
( convergent_lines(A,dollar_c3)
| convergent_lines(A,dollar_c2) ),
inference(hyper,[status(thm)],[74,3]),
[iquote('hyper,74,3')] ).
cnf(181,plain,
( convergent_lines(A,dollar_c2)
| convergent_lines(A,B)
| convergent_lines(dollar_c3,C)
| convergent_lines(B,C) ),
inference(hyper,[status(thm)],[80,6]),
[iquote('hyper,80,6')] ).
cnf(478,plain,
( convergent_lines(dollar_c2,A)
| convergent_lines(A,B)
| convergent_lines(B,dollar_c3) ),
inference(hyper,[status(thm)],[68,3]),
[iquote('hyper,68,3')] ).
cnf(523,plain,
( apart_point_and_line(intersection_point(dollar_c2,dollar_c3),dollar_c2)
| apart_point_and_line(A,dollar_c3)
| apart_point_and_line(A,dollar_c2)
| apart_point_and_line(A,dollar_c1) ),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[77,10,478]),3,3]),
[iquote('hyper,77,10,478,unit_del,3,3')] ).
cnf(984,plain,
( convergent_lines(A,dollar_c3)
| convergent_lines(A,B)
| convergent_lines(B,dollar_c2) ),
inference(hyper,[status(thm)],[166,3]),
[iquote('hyper,166,3')] ).
cnf(993,plain,
( convergent_lines(A,dollar_c3)
| convergent_lines(B,dollar_c2)
| convergent_lines(A,C)
| convergent_lines(B,C) ),
inference(hyper,[status(thm)],[984,6]),
[iquote('hyper,984,6')] ).
cnf(1043,plain,
( convergent_lines(A,dollar_c2)
| convergent_lines(A,B)
| convergent_lines(B,dollar_c3) ),
inference(hyper,[status(thm)],[181,3]),
[iquote('hyper,181,3')] ).
cnf(4140,plain,
( apart_point_and_line(A,dollar_c3)
| apart_point_and_line(A,dollar_c2)
| apart_point_and_line(A,dollar_c1) ),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[523,9,1043]),3,3]),
[iquote('hyper,523,9,1043,unit_del,3,3')] ).
cnf(4169,plain,
apart_point_and_line(intersection_point(dollar_c3,dollar_c2),dollar_c2),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[4140,9,167]),15,3]),
[iquote('hyper,4140,9,167,unit_del,15,3')] ).
cnf(4213,plain,
convergent_lines(A,dollar_c2),
inference(factor_simp,[status(thm)],[inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[4169,10,993]),3])]),
[iquote('hyper,4169,10,993,unit_del,3,factor_simp')] ).
cnf(4214,plain,
$false,
inference(binary,[status(thm)],[4213,3]),
[iquote('binary,4213.1,3.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : GEO199+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n027.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 07:20:21 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.66/1.89 ----- Otter 3.3f, August 2004 -----
% 1.66/1.89 The process was started by sandbox on n027.cluster.edu,
% 1.66/1.89 Wed Jul 27 07:20:21 2022
% 1.66/1.89 The command was "./otter". The process ID is 26635.
% 1.66/1.89
% 1.66/1.89 set(prolog_style_variables).
% 1.66/1.89 set(auto).
% 1.66/1.89 dependent: set(auto1).
% 1.66/1.89 dependent: set(process_input).
% 1.66/1.89 dependent: clear(print_kept).
% 1.66/1.89 dependent: clear(print_new_demod).
% 1.66/1.89 dependent: clear(print_back_demod).
% 1.66/1.89 dependent: clear(print_back_sub).
% 1.66/1.89 dependent: set(control_memory).
% 1.66/1.89 dependent: assign(max_mem, 12000).
% 1.66/1.89 dependent: assign(pick_given_ratio, 4).
% 1.66/1.89 dependent: assign(stats_level, 1).
% 1.66/1.89 dependent: assign(max_seconds, 10800).
% 1.66/1.89 clear(print_given).
% 1.66/1.89
% 1.66/1.89 formula_list(usable).
% 1.66/1.89 all X (-distinct_points(X,X)).
% 1.66/1.89 all X (-distinct_lines(X,X)).
% 1.66/1.89 all X (-convergent_lines(X,X)).
% 1.66/1.89 all X Y Z (distinct_points(X,Y)->distinct_points(X,Z)|distinct_points(Y,Z)).
% 1.66/1.89 all X Y Z (distinct_lines(X,Y)->distinct_lines(X,Z)|distinct_lines(Y,Z)).
% 1.66/1.89 all X Y Z (convergent_lines(X,Y)->convergent_lines(X,Z)|convergent_lines(Y,Z)).
% 1.66/1.89 all X Y (distinct_points(X,Y)-> -apart_point_and_line(X,line_connecting(X,Y))).
% 1.66/1.89 all X Y (distinct_points(X,Y)-> -apart_point_and_line(Y,line_connecting(X,Y))).
% 1.66/1.89 all X Y (convergent_lines(X,Y)-> -apart_point_and_line(intersection_point(X,Y),X)).
% 1.66/1.89 all X Y (convergent_lines(X,Y)-> -apart_point_and_line(intersection_point(X,Y),Y)).
% 1.66/1.89 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.66/1.89 all X Y Z (apart_point_and_line(X,Y)->distinct_points(X,Z)|apart_point_and_line(Z,Y)).
% 1.66/1.89 all X Y Z (apart_point_and_line(X,Y)->distinct_lines(Y,Z)|apart_point_and_line(X,Z)).
% 1.66/1.89 all X Y Z (convergent_lines(X,Y)->distinct_lines(Y,Z)|convergent_lines(X,Z)).
% 1.66/1.89 -(all X Y Z (convergent_lines(X,Y)&convergent_lines(Z,Y)&convergent_lines(X,Z)& -apart_point_and_line(intersection_point(X,Y),Z)-> -apart_point_and_line(intersection_point(Y,X),Z))).
% 1.66/1.89 end_of_list.
% 1.66/1.89
% 1.66/1.89 -------> usable clausifies to:
% 1.66/1.89
% 1.66/1.89 list(usable).
% 1.66/1.89 0 [] -distinct_points(X,X).
% 1.66/1.89 0 [] -distinct_lines(X,X).
% 1.66/1.89 0 [] -convergent_lines(X,X).
% 1.66/1.89 0 [] -distinct_points(X,Y)|distinct_points(X,Z)|distinct_points(Y,Z).
% 1.66/1.89 0 [] -distinct_lines(X,Y)|distinct_lines(X,Z)|distinct_lines(Y,Z).
% 1.66/1.89 0 [] -convergent_lines(X,Y)|convergent_lines(X,Z)|convergent_lines(Y,Z).
% 1.66/1.89 0 [] -distinct_points(X,Y)| -apart_point_and_line(X,line_connecting(X,Y)).
% 1.66/1.89 0 [] -distinct_points(X,Y)| -apart_point_and_line(Y,line_connecting(X,Y)).
% 1.66/1.89 0 [] -convergent_lines(X,Y)| -apart_point_and_line(intersection_point(X,Y),X).
% 1.66/1.89 0 [] -convergent_lines(X,Y)| -apart_point_and_line(intersection_point(X,Y),Y).
% 1.66/1.89 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.66/1.89 0 [] -apart_point_and_line(X,Y)|distinct_points(X,Z)|apart_point_and_line(Z,Y).
% 1.66/1.89 0 [] -apart_point_and_line(X,Y)|distinct_lines(Y,Z)|apart_point_and_line(X,Z).
% 1.66/1.89 0 [] -convergent_lines(X,Y)|distinct_lines(Y,Z)|convergent_lines(X,Z).
% 1.66/1.89 0 [] convergent_lines($c3,$c2).
% 1.66/1.89 0 [] convergent_lines($c1,$c2).
% 1.66/1.89 0 [] convergent_lines($c3,$c1).
% 1.66/1.89 0 [] -apart_point_and_line(intersection_point($c3,$c2),$c1).
% 1.66/1.89 0 [] apart_point_and_line(intersection_point($c2,$c3),$c1).
% 1.66/1.89 end_of_list.
% 1.66/1.89
% 1.66/1.89 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=6.
% 1.66/1.89
% 1.66/1.89 This is a non-Horn set without equality. The strategy will
% 1.66/1.89 be ordered hyper_res, unit deletion, and factoring, with
% 1.66/1.89 satellites in sos and with nuclei in usable.
% 1.66/1.89
% 1.66/1.89 dependent: set(hyper_res).
% 1.66/1.89 dependent: set(factor).
% 1.66/1.89 dependent: set(unit_deletion).
% 1.66/1.89
% 1.66/1.89 ------------> process usable:
% 1.66/1.89 ** KEPT (pick-wt=3): 1 [] -distinct_points(A,A).
% 1.66/1.89 ** KEPT (pick-wt=3): 2 [] -distinct_lines(A,A).
% 1.66/1.89 ** KEPT (pick-wt=3): 3 [] -convergent_lines(A,A).
% 1.66/1.89 ** KEPT (pick-wt=9): 4 [] -distinct_points(A,B)|distinct_points(A,C)|distinct_points(B,C).
% 1.66/1.89 ** KEPT (pick-wt=9): 5 [] -distinct_lines(A,B)|distinct_lines(A,C)|distinct_lines(B,C).
% 1.66/1.89 ** KEPT (pick-wt=9): 6 [] -convergent_lines(A,B)|convergent_lines(A,C)|convergent_lines(B,C).
% 1.66/1.89 ** KEPT (pick-wt=8): 7 [] -distinct_points(A,B)| -apart_point_and_line(A,line_connecting(A,B)).
% 1.66/1.89 ** KEPT (pick-wt=8): 8 [] -distinct_points(A,B)| -apart_point_and_line(B,line_connecting(A,B)).
% 271.91/272.16 ** KEPT (pick-wt=8): 9 [] -convergent_lines(A,B)| -apart_point_and_line(intersection_point(A,B),A).
% 271.91/272.16 ** KEPT (pick-wt=8): 10 [] -convergent_lines(A,B)| -apart_point_and_line(intersection_point(A,B),B).
% 271.91/272.16 ** 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).
% 271.91/272.16 ** KEPT (pick-wt=9): 12 [] -apart_point_and_line(A,B)|distinct_points(A,C)|apart_point_and_line(C,B).
% 271.91/272.16 ** KEPT (pick-wt=9): 13 [] -apart_point_and_line(A,B)|distinct_lines(B,C)|apart_point_and_line(A,C).
% 271.91/272.16 ** KEPT (pick-wt=9): 14 [] -convergent_lines(A,B)|distinct_lines(B,C)|convergent_lines(A,C).
% 271.91/272.16 ** KEPT (pick-wt=5): 15 [] -apart_point_and_line(intersection_point($c3,$c2),$c1).
% 271.91/272.16
% 271.91/272.16 ------------> process sos:
% 271.91/272.16 ** KEPT (pick-wt=3): 16 [] convergent_lines($c3,$c2).
% 271.91/272.16 ** KEPT (pick-wt=3): 17 [] convergent_lines($c1,$c2).
% 271.91/272.16 ** KEPT (pick-wt=3): 18 [] convergent_lines($c3,$c1).
% 271.91/272.16 ** KEPT (pick-wt=5): 19 [] apart_point_and_line(intersection_point($c2,$c3),$c1).
% 271.91/272.16
% 271.91/272.16 ======= end of input processing =======
% 271.91/272.16
% 271.91/272.16 =========== start of search ===========
% 271.91/272.16
% 271.91/272.16
% 271.91/272.16 Resetting weight limit to 15.
% 271.91/272.16
% 271.91/272.16
% 271.91/272.16 Resetting weight limit to 15.
% 271.91/272.16
% 271.91/272.16 sos_size=3405
% 271.91/272.16
% 271.91/272.16 -- HEY sandbox, WE HAVE A PROOF!! --
% 271.91/272.16
% 271.91/272.16 ----> UNIT CONFLICT at 270.28 sec ----> 4214 [binary,4213.1,3.1] $F.
% 271.91/272.16
% 271.91/272.16 Length of proof is 23. Level of proof is 10.
% 271.91/272.16
% 271.91/272.16 ---------------- PROOF ----------------
% 271.91/272.16 % SZS status Theorem
% 271.91/272.16 % SZS output start Refutation
% See solution above
% 271.91/272.16 ------------ end of proof -------------
% 271.91/272.16
% 271.91/272.16
% 271.91/272.16 Search stopped by max_proofs option.
% 271.91/272.16
% 271.91/272.16
% 271.91/272.16 Search stopped by max_proofs option.
% 271.91/272.16
% 271.91/272.16 ============ end of search ============
% 271.91/272.16
% 271.91/272.16 -------------- statistics -------------
% 271.91/272.16 clauses given 514
% 271.91/272.16 clauses generated 131740
% 271.91/272.16 clauses kept 4213
% 271.91/272.16 clauses forward subsumed 96477
% 271.91/272.16 clauses back subsumed 267
% 271.91/272.16 Kbytes malloced 4882
% 271.91/272.16
% 271.91/272.16 ----------- times (seconds) -----------
% 271.91/272.16 user CPU time 270.28 (0 hr, 4 min, 30 sec)
% 271.91/272.16 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 271.91/272.16 wall-clock time 272 (0 hr, 4 min, 32 sec)
% 271.91/272.16
% 271.91/272.16 That finishes the proof of the theorem.
% 271.91/272.16
% 271.91/272.16 Process 26635 finished Wed Jul 27 07:24:53 2022
% 271.91/272.16 Otter interrupted
% 271.91/272.16 PROOF FOUND
%------------------------------------------------------------------------------