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

View Problem - Process Solution

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

% Computer : n006.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:44 EDT 2022

% Result   : Theorem 31.73s 31.97s
% Output   : Refutation 31.73s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   28 (  10 unt;  15 nHn;  14 RR)
%            Number of literals    :   64 (   0 equ;  12 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   :   36 (   1 sgn)

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

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

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

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

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

cnf(12,axiom,
    ( ~ apart_point_and_line(A,B)
    | distinct_points(A,C)
    | apart_point_and_line(C,B) ),
    file('GEO195+2.p',unknown),
    [] ).

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

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

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

cnf(19,axiom,
    apart_point_and_line(intersection_point(dollar_c3,dollar_c2),dollar_c1),
    file('GEO195+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(29,plain,
    ( distinct_points(intersection_point(dollar_c3,dollar_c2),A)
    | apart_point_and_line(A,dollar_c1) ),
    inference(hyper,[status(thm)],[19,12]),
    [iquote('hyper,19,12')] ).

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(70,plain,
    ( apart_point_and_line(A,dollar_c1)
    | 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(A,dollar_c2)
    | apart_point_and_line(A,dollar_c3) ),
    inference(hyper,[status(thm)],[29,11,38]),
    [iquote('hyper,29,11,38')] ).

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(433,plain,
    ( convergent_lines(A,dollar_c3)
    | convergent_lines(A,dollar_c2) ),
    inference(hyper,[status(thm)],[110,3]),
    [iquote('hyper,110,3')] ).

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

cnf(5524,plain,
    ( apart_point_and_line(A,dollar_c1)
    | apart_point_and_line(A,dollar_c2)
    | apart_point_and_line(A,dollar_c3) ),
    inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[505,9,433]),1,3]),
    [iquote('hyper,505,9,433,unit_del,1,3')] ).

cnf(5525,plain,
    ( apart_point_and_line(intersection_point(dollar_c2,dollar_c3),dollar_c2)
    | apart_point_and_line(intersection_point(dollar_c2,dollar_c3),dollar_c3) ),
    inference(hyper,[status(thm)],[5524,15]),
    [iquote('hyper,5524,15')] ).

cnf(5592,plain,
    apart_point_and_line(intersection_point(dollar_c2,dollar_c3),dollar_c3),
    inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[5525,9,433]),1,3]),
    [iquote('hyper,5525,9,433,unit_del,1,3')] ).

cnf(5633,plain,
    convergent_lines(A,dollar_c3),
    inference(factor_simp,[status(thm)],[inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[5592,10,110]),1])]),
    [iquote('hyper,5592,10,110,unit_del,1,factor_simp')] ).

cnf(5634,plain,
    $false,
    inference(binary,[status(thm)],[5633,3]),
    [iquote('binary,5633.1,3.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : GEO195+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n006.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 06:59:46 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.82/2.03  ----- Otter 3.3f, August 2004 -----
% 1.82/2.03  The process was started by sandbox2 on n006.cluster.edu,
% 1.82/2.03  Wed Jul 27 06:59:47 2022
% 1.82/2.03  The command was "./otter".  The process ID is 24695.
% 1.82/2.03  
% 1.82/2.03  set(prolog_style_variables).
% 1.82/2.03  set(auto).
% 1.82/2.03     dependent: set(auto1).
% 1.82/2.03     dependent: set(process_input).
% 1.82/2.03     dependent: clear(print_kept).
% 1.82/2.03     dependent: clear(print_new_demod).
% 1.82/2.03     dependent: clear(print_back_demod).
% 1.82/2.03     dependent: clear(print_back_sub).
% 1.82/2.03     dependent: set(control_memory).
% 1.82/2.03     dependent: assign(max_mem, 12000).
% 1.82/2.03     dependent: assign(pick_given_ratio, 4).
% 1.82/2.03     dependent: assign(stats_level, 1).
% 1.82/2.03     dependent: assign(max_seconds, 10800).
% 1.82/2.03  clear(print_given).
% 1.82/2.03  
% 1.82/2.03  formula_list(usable).
% 1.82/2.03  all X (-distinct_points(X,X)).
% 1.82/2.03  all X (-distinct_lines(X,X)).
% 1.82/2.03  all X (-convergent_lines(X,X)).
% 1.82/2.03  all X Y Z (distinct_points(X,Y)->distinct_points(X,Z)|distinct_points(Y,Z)).
% 1.82/2.03  all X Y Z (distinct_lines(X,Y)->distinct_lines(X,Z)|distinct_lines(Y,Z)).
% 1.82/2.03  all X Y Z (convergent_lines(X,Y)->convergent_lines(X,Z)|convergent_lines(Y,Z)).
% 1.82/2.03  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/2.03  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/2.03  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/2.03  all X Y Z (apart_point_and_line(X,Y)->distinct_points(X,Z)|apart_point_and_line(Z,Y)).
% 1.82/2.03  all X Y Z (apart_point_and_line(X,Y)->distinct_lines(Y,Z)|apart_point_and_line(X,Z)).
% 1.82/2.03  all X Y (convergent_lines(X,Y)->distinct_lines(X,Y)).
% 1.82/2.03  -(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.82/2.03  end_of_list.
% 1.82/2.03  
% 1.82/2.03  -------> usable clausifies to:
% 1.82/2.03  
% 1.82/2.03  list(usable).
% 1.82/2.03  0 [] -distinct_points(X,X).
% 1.82/2.03  0 [] -distinct_lines(X,X).
% 1.82/2.03  0 [] -convergent_lines(X,X).
% 1.82/2.03  0 [] -distinct_points(X,Y)|distinct_points(X,Z)|distinct_points(Y,Z).
% 1.82/2.03  0 [] -distinct_lines(X,Y)|distinct_lines(X,Z)|distinct_lines(Y,Z).
% 1.82/2.03  0 [] -convergent_lines(X,Y)|convergent_lines(X,Z)|convergent_lines(Y,Z).
% 1.82/2.03  0 [] -distinct_points(X,Y)| -apart_point_and_line(Z,line_connecting(X,Y))|distinct_points(Z,X).
% 1.82/2.03  0 [] -distinct_points(X,Y)| -apart_point_and_line(Z,line_connecting(X,Y))|distinct_points(Z,Y).
% 1.82/2.03  0 [] -convergent_lines(X,Y)| -apart_point_and_line(Z,X)|distinct_points(Z,intersection_point(X,Y)).
% 1.82/2.03  0 [] -convergent_lines(X,Y)| -apart_point_and_line(Z,Y)|distinct_points(Z,intersection_point(X,Y)).
% 1.82/2.03  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/2.03  0 [] -apart_point_and_line(X,Y)|distinct_points(X,Z)|apart_point_and_line(Z,Y).
% 1.82/2.03  0 [] -apart_point_and_line(X,Y)|distinct_lines(Y,Z)|apart_point_and_line(X,Z).
% 1.82/2.03  0 [] -convergent_lines(X,Y)|distinct_lines(X,Y).
% 1.82/2.03  0 [] convergent_lines($c3,$c2).
% 1.82/2.03  0 [] convergent_lines($c1,$c2).
% 1.82/2.03  0 [] convergent_lines($c3,$c1).
% 1.82/2.03  0 [] apart_point_and_line(intersection_point($c3,$c2),$c1).
% 1.82/2.03  0 [] -apart_point_and_line(intersection_point($c2,$c3),$c1).
% 1.82/2.03  end_of_list.
% 1.82/2.03  
% 1.82/2.03  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=6.
% 1.82/2.03  
% 1.82/2.03  This is a non-Horn set without equality.  The strategy will
% 1.82/2.03  be ordered hyper_res, unit deletion, and factoring, with
% 1.82/2.03  satellites in sos and with nuclei in usable.
% 1.82/2.03  
% 1.82/2.03     dependent: set(hyper_res).
% 1.82/2.03     dependent: set(factor).
% 1.82/2.03     dependent: set(unit_deletion).
% 1.82/2.03  
% 1.82/2.03  ------------> process usable:
% 1.82/2.03  ** KEPT (pick-wt=3): 1 [] -distinct_points(A,A).
% 1.82/2.03  ** KEPT (pick-wt=3): 2 [] -distinct_lines(A,A).
% 1.82/2.03  ** KEPT (pick-wt=3): 3 [] -convergent_lines(A,A).
% 1.82/2.03  ** KEPT (pick-wt=9): 4 [] -distinct_points(A,B)|distinct_points(A,C)|distinct_points(B,C).
% 1.82/2.03  ** KEPT (pick-wt=9): 5 [] -distinct_lines(A,B)|distinct_lines(A,C)|distinct_lines(B,C).
% 1.82/2.03  ** KEPT (pick-wt=9): 6 [] -convergent_lines(A,B)|convergent_lines(A,C)|convergent_lines(B,C).
% 1.82/2.03  ** KEPT (pick-wt=11): 7 [] -distinct_points(A,B)| -apart_point_and_line(C,line_connecting(A,B))|distinct_points(C,A).
% 1.82/2.03  ** KEPT (pick-wt=11): 8 [] -distinct_points(A,B)| -apart_point_and_line(C,line_connecting(A,B))|distinct_points(C,B).
% 31.73/31.97  ** KEPT (pick-wt=11): 9 [] -convergent_lines(A,B)| -apart_point_and_line(C,A)|distinct_points(C,intersection_point(A,B)).
% 31.73/31.97  ** KEPT (pick-wt=11): 10 [] -convergent_lines(A,B)| -apart_point_and_line(C,B)|distinct_points(C,intersection_point(A,B)).
% 31.73/31.97  ** 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).
% 31.73/31.97  ** KEPT (pick-wt=9): 12 [] -apart_point_and_line(A,B)|distinct_points(A,C)|apart_point_and_line(C,B).
% 31.73/31.97  ** KEPT (pick-wt=9): 13 [] -apart_point_and_line(A,B)|distinct_lines(B,C)|apart_point_and_line(A,C).
% 31.73/31.97  ** KEPT (pick-wt=6): 14 [] -convergent_lines(A,B)|distinct_lines(A,B).
% 31.73/31.97  ** KEPT (pick-wt=5): 15 [] -apart_point_and_line(intersection_point($c2,$c3),$c1).
% 31.73/31.97  
% 31.73/31.97  ------------> process sos:
% 31.73/31.97  ** KEPT (pick-wt=3): 16 [] convergent_lines($c3,$c2).
% 31.73/31.97  ** KEPT (pick-wt=3): 17 [] convergent_lines($c1,$c2).
% 31.73/31.97  ** KEPT (pick-wt=3): 18 [] convergent_lines($c3,$c1).
% 31.73/31.97  ** KEPT (pick-wt=5): 19 [] apart_point_and_line(intersection_point($c3,$c2),$c1).
% 31.73/31.97  
% 31.73/31.97  ======= end of input processing =======
% 31.73/31.97  
% 31.73/31.97  =========== start of search ===========
% 31.73/31.97  
% 31.73/31.97  
% 31.73/31.97  Resetting weight limit to 15.
% 31.73/31.97  
% 31.73/31.97  
% 31.73/31.97  Resetting weight limit to 15.
% 31.73/31.97  
% 31.73/31.97  sos_size=4518
% 31.73/31.97  
% 31.73/31.97  -- HEY sandbox2, WE HAVE A PROOF!! -- 
% 31.73/31.97  
% 31.73/31.97  ----> UNIT CONFLICT at  29.91 sec ----> 5634 [binary,5633.1,3.1] $F.
% 31.73/31.97  
% 31.73/31.97  Length of proof is 16.  Level of proof is 9.
% 31.73/31.97  
% 31.73/31.97  ---------------- PROOF ----------------
% 31.73/31.97  % SZS status Theorem
% 31.73/31.97  % SZS output start Refutation
% See solution above
% 31.73/31.97  ------------ end of proof -------------
% 31.73/31.97  
% 31.73/31.97  
% 31.73/31.97  Search stopped by max_proofs option.
% 31.73/31.97  
% 31.73/31.97  
% 31.73/31.97  Search stopped by max_proofs option.
% 31.73/31.97  
% 31.73/31.97  ============ end of search ============
% 31.73/31.97  
% 31.73/31.97  -------------- statistics -------------
% 31.73/31.97  clauses given                727
% 31.73/31.97  clauses generated         160483
% 31.73/31.97  clauses kept                5633
% 31.73/31.97  clauses forward subsumed   38300
% 31.73/31.97  clauses back subsumed        532
% 31.73/31.97  Kbytes malloced             4882
% 31.73/31.97  
% 31.73/31.97  ----------- times (seconds) -----------
% 31.73/31.97  user CPU time         29.91          (0 hr, 0 min, 29 sec)
% 31.73/31.97  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 31.73/31.97  wall-clock time       31             (0 hr, 0 min, 31 sec)
% 31.73/31.97  
% 31.73/31.97  That finishes the proof of the theorem.
% 31.73/31.97  
% 31.73/31.97  Process 24695 finished Wed Jul 27 07:00:18 2022
% 31.73/31.97  Otter interrupted
% 31.73/31.97  PROOF FOUND
%------------------------------------------------------------------------------