TSTP Solution File: GEO193+2 by Otter---3.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : GEO193+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n020.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:43 EDT 2022

% Result   : Theorem 5.35s 5.54s
% Output   : Refutation 5.35s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   31 (  12 unt;  16 nHn;  17 RR)
%            Number of literals    :   66 (   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   :   38 (   1 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ~ distinct_points(A,A),
    file('GEO193+2.p',unknown),
    [] ).

cnf(3,axiom,
    ~ convergent_lines(A,A),
    file('GEO193+2.p',unknown),
    [] ).

cnf(6,axiom,
    ( ~ convergent_lines(A,B)
    | convergent_lines(A,C)
    | convergent_lines(B,C) ),
    file('GEO193+2.p',unknown),
    [] ).

cnf(9,axiom,
    ( ~ convergent_lines(A,B)
    | ~ apart_point_and_line(C,A)
    | distinct_points(C,intersection_point(A,B)) ),
    file('GEO193+2.p',unknown),
    [] ).

cnf(10,axiom,
    ( ~ convergent_lines(A,B)
    | ~ apart_point_and_line(C,B)
    | distinct_points(C,intersection_point(A,B)) ),
    file('GEO193+2.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('GEO193+2.p',unknown),
    [] ).

cnf(14,axiom,
    ( ~ convergent_lines(A,B)
    | distinct_lines(A,B) ),
    file('GEO193+2.p',unknown),
    [] ).

cnf(15,axiom,
    ~ apart_point_and_line(intersection_point(dollar_c1,dollar_c2),dollar_c3),
    file('GEO193+2.p',unknown),
    [] ).

cnf(16,axiom,
    convergent_lines(dollar_c3,dollar_c2),
    file('GEO193+2.p',unknown),
    [] ).

cnf(17,axiom,
    convergent_lines(dollar_c1,dollar_c2),
    file('GEO193+2.p',unknown),
    [] ).

cnf(19,axiom,
    apart_point_and_line(intersection_point(dollar_c3,dollar_c2),dollar_c1),
    file('GEO193+2.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(23,plain,
    ( convergent_lines(dollar_c1,A)
    | convergent_lines(dollar_c2,A) ),
    inference(hyper,[status(thm)],[17,6]),
    [iquote('hyper,17,6')] ).

cnf(31,plain,
    distinct_points(intersection_point(dollar_c3,dollar_c2),intersection_point(dollar_c1,dollar_c2)),
    inference(hyper,[status(thm)],[19,9,17]),
    [iquote('hyper,19,9,17')] ).

cnf(34,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(35,plain,
    convergent_lines(dollar_c2,dollar_c3),
    inference(hyper,[status(thm)],[21,3]),
    [iquote('hyper,21,3')] ).

cnf(38,plain,
    distinct_lines(dollar_c2,dollar_c3),
    inference(hyper,[status(thm)],[35,14]),
    [iquote('hyper,35,14')] ).

cnf(42,plain,
    ( convergent_lines(dollar_c2,A)
    | convergent_lines(dollar_c1,B)
    | convergent_lines(A,B) ),
    inference(hyper,[status(thm)],[23,6]),
    [iquote('hyper,23,6')] ).

cnf(87,plain,
    ( apart_point_and_line(intersection_point(dollar_c3,dollar_c2),dollar_c2)
    | apart_point_and_line(intersection_point(dollar_c3,dollar_c2),dollar_c3)
    | apart_point_and_line(intersection_point(dollar_c1,dollar_c2),dollar_c2) ),
    inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[31,11,38]),15]),
    [iquote('hyper,31,11,38,unit_del,15')] ).

cnf(105,plain,
    ( convergent_lines(dollar_c2,A)
    | convergent_lines(A,dollar_c3) ),
    inference(hyper,[status(thm)],[34,3]),
    [iquote('hyper,34,3')] ).

cnf(107,plain,
    ( convergent_lines(dollar_c2,A)
    | convergent_lines(dollar_c3,B)
    | convergent_lines(A,C)
    | convergent_lines(B,C) ),
    inference(hyper,[status(thm)],[34,6]),
    [iquote('hyper,34,6')] ).

cnf(108,plain,
    ( convergent_lines(dollar_c3,A)
    | convergent_lines(A,dollar_c2) ),
    inference(unit_del,[status(thm)],[inference(factor,[status(thm)],[107]),3]),
    [iquote('factor,107.1.3,unit_del,3')] ).

cnf(110,plain,
    ( convergent_lines(A,dollar_c3)
    | convergent_lines(dollar_c2,B)
    | convergent_lines(A,B) ),
    inference(hyper,[status(thm)],[105,6]),
    [iquote('hyper,105,6')] ).

cnf(148,plain,
    ( convergent_lines(dollar_c2,A)
    | convergent_lines(dollar_c1,B)
    | convergent_lines(A,C)
    | convergent_lines(B,C) ),
    inference(hyper,[status(thm)],[42,6]),
    [iquote('hyper,42,6')] ).

cnf(149,plain,
    ( convergent_lines(dollar_c1,A)
    | convergent_lines(A,dollar_c2) ),
    inference(unit_del,[status(thm)],[inference(factor,[status(thm)],[148]),3]),
    [iquote('factor,148.1.3,unit_del,3')] ).

cnf(166,plain,
    ( convergent_lines(A,dollar_c2)
    | convergent_lines(dollar_c1,B)
    | convergent_lines(A,B) ),
    inference(hyper,[status(thm)],[149,6]),
    [iquote('hyper,149,6')] ).

cnf(433,plain,
    ( convergent_lines(A,dollar_c3)
    | convergent_lines(A,dollar_c2) ),
    inference(hyper,[status(thm)],[110,3]),
    [iquote('hyper,110,3')] ).

cnf(1761,plain,
    ( apart_point_and_line(intersection_point(dollar_c3,dollar_c2),dollar_c3)
    | apart_point_and_line(intersection_point(dollar_c1,dollar_c2),dollar_c2) ),
    inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[87,10,108]),1,3]),
    [iquote('hyper,87,10,108,unit_del,1,3')] ).

cnf(2139,plain,
    apart_point_and_line(intersection_point(dollar_c1,dollar_c2),dollar_c2),
    inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[1761,9,433]),1,3]),
    [iquote('hyper,1761,9,433,unit_del,1,3')] ).

cnf(2152,plain,
    convergent_lines(A,dollar_c2),
    inference(factor_simp,[status(thm)],[inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[2139,10,166]),1])]),
    [iquote('hyper,2139,10,166,unit_del,1,factor_simp')] ).

cnf(2153,plain,
    $false,
    inference(binary,[status(thm)],[2152,3]),
    [iquote('binary,2152.1,3.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GEO193+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13  % Command  : otter-tptp-script %s
% 0.12/0.32  % Computer : n020.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 06:57:38 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.80/2.02  ----- Otter 3.3f, August 2004 -----
% 1.80/2.02  The process was started by sandbox on n020.cluster.edu,
% 1.80/2.02  Wed Jul 27 06:57:38 2022
% 1.80/2.02  The command was "./otter".  The process ID is 9120.
% 1.80/2.02  
% 1.80/2.02  set(prolog_style_variables).
% 1.80/2.02  set(auto).
% 1.80/2.02     dependent: set(auto1).
% 1.80/2.02     dependent: set(process_input).
% 1.80/2.02     dependent: clear(print_kept).
% 1.80/2.02     dependent: clear(print_new_demod).
% 1.80/2.02     dependent: clear(print_back_demod).
% 1.80/2.02     dependent: clear(print_back_sub).
% 1.80/2.02     dependent: set(control_memory).
% 1.80/2.02     dependent: assign(max_mem, 12000).
% 1.80/2.02     dependent: assign(pick_given_ratio, 4).
% 1.80/2.02     dependent: assign(stats_level, 1).
% 1.80/2.02     dependent: assign(max_seconds, 10800).
% 1.80/2.02  clear(print_given).
% 1.80/2.02  
% 1.80/2.02  formula_list(usable).
% 1.80/2.02  all X (-distinct_points(X,X)).
% 1.80/2.02  all X (-distinct_lines(X,X)).
% 1.80/2.02  all X (-convergent_lines(X,X)).
% 1.80/2.02  all X Y Z (distinct_points(X,Y)->distinct_points(X,Z)|distinct_points(Y,Z)).
% 1.80/2.02  all X Y Z (distinct_lines(X,Y)->distinct_lines(X,Z)|distinct_lines(Y,Z)).
% 1.80/2.02  all X Y Z (convergent_lines(X,Y)->convergent_lines(X,Z)|convergent_lines(Y,Z)).
% 1.80/2.02  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.80/2.02  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.80/2.02  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.02  all X Y Z (apart_point_and_line(X,Y)->distinct_points(X,Z)|apart_point_and_line(Z,Y)).
% 1.80/2.02  all X Y Z (apart_point_and_line(X,Y)->distinct_lines(Y,Z)|apart_point_and_line(X,Z)).
% 1.80/2.02  all X Y (convergent_lines(X,Y)->distinct_lines(X,Y)).
% 1.80/2.02  -(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(Z,Y),X)))).
% 1.80/2.02  end_of_list.
% 1.80/2.02  
% 1.80/2.02  -------> usable clausifies to:
% 1.80/2.02  
% 1.80/2.02  list(usable).
% 1.80/2.02  0 [] -distinct_points(X,X).
% 1.80/2.02  0 [] -distinct_lines(X,X).
% 1.80/2.02  0 [] -convergent_lines(X,X).
% 1.80/2.02  0 [] -distinct_points(X,Y)|distinct_points(X,Z)|distinct_points(Y,Z).
% 1.80/2.02  0 [] -distinct_lines(X,Y)|distinct_lines(X,Z)|distinct_lines(Y,Z).
% 1.80/2.02  0 [] -convergent_lines(X,Y)|convergent_lines(X,Z)|convergent_lines(Y,Z).
% 1.80/2.02  0 [] -distinct_points(X,Y)| -apart_point_and_line(Z,line_connecting(X,Y))|distinct_points(Z,X).
% 1.80/2.02  0 [] -distinct_points(X,Y)| -apart_point_and_line(Z,line_connecting(X,Y))|distinct_points(Z,Y).
% 1.80/2.02  0 [] -convergent_lines(X,Y)| -apart_point_and_line(Z,X)|distinct_points(Z,intersection_point(X,Y)).
% 1.80/2.02  0 [] -convergent_lines(X,Y)| -apart_point_and_line(Z,Y)|distinct_points(Z,intersection_point(X,Y)).
% 1.80/2.02  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.02  0 [] -apart_point_and_line(X,Y)|distinct_points(X,Z)|apart_point_and_line(Z,Y).
% 1.80/2.02  0 [] -apart_point_and_line(X,Y)|distinct_lines(Y,Z)|apart_point_and_line(X,Z).
% 1.80/2.02  0 [] -convergent_lines(X,Y)|distinct_lines(X,Y).
% 1.80/2.02  0 [] convergent_lines($c3,$c2).
% 1.80/2.02  0 [] convergent_lines($c1,$c2).
% 1.80/2.02  0 [] convergent_lines($c3,$c1).
% 1.80/2.02  0 [] apart_point_and_line(intersection_point($c3,$c2),$c1).
% 1.80/2.02  0 [] -apart_point_and_line(intersection_point($c1,$c2),$c3).
% 1.80/2.02  end_of_list.
% 1.80/2.02  
% 1.80/2.02  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=6.
% 1.80/2.02  
% 1.80/2.02  This is a non-Horn set without equality.  The strategy will
% 1.80/2.02  be ordered hyper_res, unit deletion, and factoring, with
% 1.80/2.02  satellites in sos and with nuclei in usable.
% 1.80/2.02  
% 1.80/2.02     dependent: set(hyper_res).
% 1.80/2.02     dependent: set(factor).
% 1.80/2.02     dependent: set(unit_deletion).
% 1.80/2.02  
% 1.80/2.02  ------------> process usable:
% 1.80/2.02  ** KEPT (pick-wt=3): 1 [] -distinct_points(A,A).
% 1.80/2.02  ** KEPT (pick-wt=3): 2 [] -distinct_lines(A,A).
% 1.80/2.02  ** KEPT (pick-wt=3): 3 [] -convergent_lines(A,A).
% 1.80/2.02  ** KEPT (pick-wt=9): 4 [] -distinct_points(A,B)|distinct_points(A,C)|distinct_points(B,C).
% 1.80/2.02  ** KEPT (pick-wt=9): 5 [] -distinct_lines(A,B)|distinct_lines(A,C)|distinct_lines(B,C).
% 1.80/2.02  ** KEPT (pick-wt=9): 6 [] -convergent_lines(A,B)|convergent_lines(A,C)|convergent_lines(B,C).
% 1.80/2.02  ** KEPT (pick-wt=11): 7 [] -distinct_points(A,B)| -apart_point_and_line(C,line_connecting(A,B))|distinct_points(C,A).
% 1.80/2.02  ** KEPT (pick-wt=11): 8 [] -distinct_points(A,B)| -apart_point_and_line(C,line_connecting(A,B))|distinct_points(C,B).
% 5.35/5.54  ** KEPT (pick-wt=11): 9 [] -convergent_lines(A,B)| -apart_point_and_line(C,A)|distinct_points(C,intersection_point(A,B)).
% 5.35/5.54  ** KEPT (pick-wt=11): 10 [] -convergent_lines(A,B)| -apart_point_and_line(C,B)|distinct_points(C,intersection_point(A,B)).
% 5.35/5.54  ** 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).
% 5.35/5.54  ** KEPT (pick-wt=9): 12 [] -apart_point_and_line(A,B)|distinct_points(A,C)|apart_point_and_line(C,B).
% 5.35/5.54  ** KEPT (pick-wt=9): 13 [] -apart_point_and_line(A,B)|distinct_lines(B,C)|apart_point_and_line(A,C).
% 5.35/5.54  ** KEPT (pick-wt=6): 14 [] -convergent_lines(A,B)|distinct_lines(A,B).
% 5.35/5.54  ** KEPT (pick-wt=5): 15 [] -apart_point_and_line(intersection_point($c1,$c2),$c3).
% 5.35/5.54  
% 5.35/5.54  ------------> process sos:
% 5.35/5.54  ** KEPT (pick-wt=3): 16 [] convergent_lines($c3,$c2).
% 5.35/5.54  ** KEPT (pick-wt=3): 17 [] convergent_lines($c1,$c2).
% 5.35/5.54  ** KEPT (pick-wt=3): 18 [] convergent_lines($c3,$c1).
% 5.35/5.54  ** KEPT (pick-wt=5): 19 [] apart_point_and_line(intersection_point($c3,$c2),$c1).
% 5.35/5.54  
% 5.35/5.54  ======= end of input processing =======
% 5.35/5.54  
% 5.35/5.54  =========== start of search ===========
% 5.35/5.54  
% 5.35/5.54  -------- PROOF -------- 
% 5.35/5.54  
% 5.35/5.54  ----> UNIT CONFLICT at   3.52 sec ----> 2153 [binary,2152.1,3.1] $F.
% 5.35/5.54  
% 5.35/5.54  Length of proof is 19.  Level of proof is 7.
% 5.35/5.54  
% 5.35/5.54  ---------------- PROOF ----------------
% 5.35/5.54  % SZS status Theorem
% 5.35/5.54  % SZS output start Refutation
% See solution above
% 5.35/5.54  ------------ end of proof -------------
% 5.35/5.54  
% 5.35/5.54  
% 5.35/5.54  Search stopped by max_proofs option.
% 5.35/5.54  
% 5.35/5.54  
% 5.35/5.54  Search stopped by max_proofs option.
% 5.35/5.54  
% 5.35/5.54  ============ end of search ============
% 5.35/5.54  
% 5.35/5.54  -------------- statistics -------------
% 5.35/5.54  clauses given                179
% 5.35/5.54  clauses generated          15966
% 5.35/5.54  clauses kept                2152
% 5.35/5.54  clauses forward subsumed   13833
% 5.35/5.54  clauses back subsumed        693
% 5.35/5.54  Kbytes malloced             1953
% 5.35/5.54  
% 5.35/5.54  ----------- times (seconds) -----------
% 5.35/5.54  user CPU time          3.52          (0 hr, 0 min, 3 sec)
% 5.35/5.54  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 5.35/5.54  wall-clock time        5             (0 hr, 0 min, 5 sec)
% 5.35/5.54  
% 5.35/5.54  That finishes the proof of the theorem.
% 5.35/5.54  
% 5.35/5.54  Process 9120 finished Wed Jul 27 06:57:43 2022
% 5.35/5.54  Otter interrupted
% 5.35/5.54  PROOF FOUND
%------------------------------------------------------------------------------