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

View Problem - Process Solution

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

% Computer : n025.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:38 EDT 2022

% Result   : Theorem 1.89s 2.08s
% Output   : Refutation 1.89s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   19 (   7 unt;   9 nHn;  11 RR)
%            Number of literals    :   38 (   0 equ;   9 neg)
%            Maximal clause size   :    4 (   2 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   :   22 (   0 sgn)

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

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

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

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

cnf(13,axiom,
    ( ~ apart_point_and_line(A,B)
    | distinct_lines(B,C)
    | apart_point_and_line(A,C) ),
    file('GEO179+2.p',unknown),
    [] ).

cnf(15,axiom,
    ( ~ distinct_lines(line_connecting(dollar_c3,dollar_c2),line_connecting(dollar_c1,dollar_c3))
    | ~ distinct_lines(line_connecting(dollar_c3,dollar_c2),line_connecting(dollar_c1,dollar_c2)) ),
    file('GEO179+2.p',unknown),
    [] ).

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

cnf(17,axiom,
    apart_point_and_line(dollar_c1,line_connecting(dollar_c3,dollar_c2)),
    file('GEO179+2.p',unknown),
    [] ).

cnf(19,plain,
    ( distinct_lines(line_connecting(dollar_c3,dollar_c2),A)
    | apart_point_and_line(dollar_c1,A) ),
    inference(hyper,[status(thm)],[17,13]),
    [iquote('hyper,17,13')] ).

cnf(21,plain,
    distinct_points(dollar_c1,dollar_c2),
    inference(hyper,[status(thm)],[17,8,16]),
    [iquote('hyper,17,8,16')] ).

cnf(22,plain,
    distinct_points(dollar_c1,dollar_c3),
    inference(hyper,[status(thm)],[17,7,16]),
    [iquote('hyper,17,7,16')] ).

cnf(23,plain,
    ( distinct_points(dollar_c1,A)
    | distinct_points(dollar_c2,A) ),
    inference(hyper,[status(thm)],[21,4]),
    [iquote('hyper,21,4')] ).

cnf(24,plain,
    ( distinct_points(dollar_c1,A)
    | distinct_points(dollar_c3,A) ),
    inference(hyper,[status(thm)],[22,4]),
    [iquote('hyper,22,4')] ).

cnf(28,plain,
    ( apart_point_and_line(dollar_c1,line_connecting(dollar_c1,dollar_c2))
    | apart_point_and_line(dollar_c1,line_connecting(dollar_c1,dollar_c3)) ),
    inference(hyper,[status(thm)],[19,15,19]),
    [iquote('hyper,19,15,19')] ).

cnf(33,plain,
    ( distinct_points(dollar_c2,A)
    | distinct_points(dollar_c1,B)
    | distinct_points(A,B) ),
    inference(hyper,[status(thm)],[23,4]),
    [iquote('hyper,23,4')] ).

cnf(58,plain,
    ( distinct_points(dollar_c2,A)
    | distinct_points(dollar_c1,B)
    | distinct_points(A,C)
    | distinct_points(B,C) ),
    inference(hyper,[status(thm)],[33,4]),
    [iquote('hyper,33,4')] ).

cnf(59,plain,
    ( distinct_points(dollar_c1,A)
    | distinct_points(A,dollar_c2) ),
    inference(unit_del,[status(thm)],[inference(factor,[status(thm)],[58]),1]),
    [iquote('factor,58.1.3,unit_del,1')] ).

cnf(67,plain,
    apart_point_and_line(dollar_c1,line_connecting(dollar_c1,dollar_c3)),
    inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[28,7,59]),1,1]),
    [iquote('hyper,28,7,59,unit_del,1,1')] ).

cnf(73,plain,
    $false,
    inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[67,7,24]),1,1]),
    [iquote('hyper,67,7,24,unit_del,1,1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : GEO179+2 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.12  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n025.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:10:15 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.87/2.08  ----- Otter 3.3f, August 2004 -----
% 1.87/2.08  The process was started by sandbox on n025.cluster.edu,
% 1.87/2.08  Wed Jul 27 07:10:15 2022
% 1.87/2.08  The command was "./otter".  The process ID is 23185.
% 1.87/2.08  
% 1.87/2.08  set(prolog_style_variables).
% 1.87/2.08  set(auto).
% 1.87/2.08     dependent: set(auto1).
% 1.87/2.08     dependent: set(process_input).
% 1.87/2.08     dependent: clear(print_kept).
% 1.87/2.08     dependent: clear(print_new_demod).
% 1.87/2.08     dependent: clear(print_back_demod).
% 1.87/2.08     dependent: clear(print_back_sub).
% 1.87/2.08     dependent: set(control_memory).
% 1.87/2.08     dependent: assign(max_mem, 12000).
% 1.87/2.08     dependent: assign(pick_given_ratio, 4).
% 1.87/2.08     dependent: assign(stats_level, 1).
% 1.87/2.08     dependent: assign(max_seconds, 10800).
% 1.87/2.08  clear(print_given).
% 1.87/2.08  
% 1.87/2.08  formula_list(usable).
% 1.87/2.08  all X (-distinct_points(X,X)).
% 1.87/2.08  all X (-distinct_lines(X,X)).
% 1.87/2.08  all X (-convergent_lines(X,X)).
% 1.87/2.08  all X Y Z (distinct_points(X,Y)->distinct_points(X,Z)|distinct_points(Y,Z)).
% 1.87/2.08  all X Y Z (distinct_lines(X,Y)->distinct_lines(X,Z)|distinct_lines(Y,Z)).
% 1.87/2.08  all X Y Z (convergent_lines(X,Y)->convergent_lines(X,Z)|convergent_lines(Y,Z)).
% 1.87/2.08  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.87/2.08  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.87/2.08  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.87/2.08  all X Y Z (apart_point_and_line(X,Y)->distinct_points(X,Z)|apart_point_and_line(Z,Y)).
% 1.87/2.08  all X Y Z (apart_point_and_line(X,Y)->distinct_lines(Y,Z)|apart_point_and_line(X,Z)).
% 1.87/2.08  all X Y (convergent_lines(X,Y)->distinct_lines(X,Y)).
% 1.87/2.08  -(all X Y Z (distinct_points(X,Y)&apart_point_and_line(Z,line_connecting(X,Y))->distinct_lines(line_connecting(X,Y),line_connecting(Z,X))&distinct_lines(line_connecting(X,Y),line_connecting(Z,Y)))).
% 1.87/2.08  end_of_list.
% 1.87/2.08  
% 1.87/2.08  -------> usable clausifies to:
% 1.87/2.08  
% 1.87/2.08  list(usable).
% 1.87/2.08  0 [] -distinct_points(X,X).
% 1.87/2.08  0 [] -distinct_lines(X,X).
% 1.87/2.08  0 [] -convergent_lines(X,X).
% 1.87/2.08  0 [] -distinct_points(X,Y)|distinct_points(X,Z)|distinct_points(Y,Z).
% 1.87/2.08  0 [] -distinct_lines(X,Y)|distinct_lines(X,Z)|distinct_lines(Y,Z).
% 1.87/2.08  0 [] -convergent_lines(X,Y)|convergent_lines(X,Z)|convergent_lines(Y,Z).
% 1.87/2.08  0 [] -distinct_points(X,Y)| -apart_point_and_line(Z,line_connecting(X,Y))|distinct_points(Z,X).
% 1.87/2.08  0 [] -distinct_points(X,Y)| -apart_point_and_line(Z,line_connecting(X,Y))|distinct_points(Z,Y).
% 1.87/2.08  0 [] -convergent_lines(X,Y)| -apart_point_and_line(Z,X)|distinct_points(Z,intersection_point(X,Y)).
% 1.87/2.08  0 [] -convergent_lines(X,Y)| -apart_point_and_line(Z,Y)|distinct_points(Z,intersection_point(X,Y)).
% 1.87/2.08  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.87/2.08  0 [] -apart_point_and_line(X,Y)|distinct_points(X,Z)|apart_point_and_line(Z,Y).
% 1.87/2.08  0 [] -apart_point_and_line(X,Y)|distinct_lines(Y,Z)|apart_point_and_line(X,Z).
% 1.87/2.08  0 [] -convergent_lines(X,Y)|distinct_lines(X,Y).
% 1.87/2.08  0 [] distinct_points($c3,$c2).
% 1.87/2.08  0 [] apart_point_and_line($c1,line_connecting($c3,$c2)).
% 1.87/2.08  0 [] -distinct_lines(line_connecting($c3,$c2),line_connecting($c1,$c3))| -distinct_lines(line_connecting($c3,$c2),line_connecting($c1,$c2)).
% 1.87/2.08  end_of_list.
% 1.87/2.08  
% 1.87/2.08  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=6.
% 1.87/2.08  
% 1.87/2.08  This is a non-Horn set without equality.  The strategy will
% 1.87/2.08  be ordered hyper_res, unit deletion, and factoring, with
% 1.87/2.08  satellites in sos and with nuclei in usable.
% 1.87/2.08  
% 1.87/2.08     dependent: set(hyper_res).
% 1.87/2.08     dependent: set(factor).
% 1.87/2.08     dependent: set(unit_deletion).
% 1.87/2.08  
% 1.87/2.08  ------------> process usable:
% 1.87/2.08  ** KEPT (pick-wt=3): 1 [] -distinct_points(A,A).
% 1.87/2.08  ** KEPT (pick-wt=3): 2 [] -distinct_lines(A,A).
% 1.87/2.08  ** KEPT (pick-wt=3): 3 [] -convergent_lines(A,A).
% 1.87/2.08  ** KEPT (pick-wt=9): 4 [] -distinct_points(A,B)|distinct_points(A,C)|distinct_points(B,C).
% 1.87/2.08  ** KEPT (pick-wt=9): 5 [] -distinct_lines(A,B)|distinct_lines(A,C)|distinct_lines(B,C).
% 1.87/2.08  ** KEPT (pick-wt=9): 6 [] -convergent_lines(A,B)|convergent_lines(A,C)|convergent_lines(B,C).
% 1.87/2.08  ** KEPT (pick-wt=11): 7 [] -distinct_points(A,B)| -apart_point_and_line(C,line_connecting(A,B))|distinct_points(C,A).
% 1.87/2.08  ** KEPT (pick-wt=11): 8 [] -distinct_points(A,B)| -apart_point_and_line(C,line_connecting(A,B))|distinct_points(C,B).
% 1.89/2.08  ** KEPT (pick-wt=11): 9 [] -convergent_lines(A,B)| -apart_point_and_line(C,A)|distinct_points(C,intersection_point(A,B)).
% 1.89/2.08  ** KEPT (pick-wt=11): 10 [] -convergent_lines(A,B)| -apart_point_and_line(C,B)|distinct_points(C,intersection_point(A,B)).
% 1.89/2.08  ** 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.89/2.08  ** KEPT (pick-wt=9): 12 [] -apart_point_and_line(A,B)|distinct_points(A,C)|apart_point_and_line(C,B).
% 1.89/2.08  ** KEPT (pick-wt=9): 13 [] -apart_point_and_line(A,B)|distinct_lines(B,C)|apart_point_and_line(A,C).
% 1.89/2.08  ** KEPT (pick-wt=6): 14 [] -convergent_lines(A,B)|distinct_lines(A,B).
% 1.89/2.08  ** KEPT (pick-wt=14): 15 [] -distinct_lines(line_connecting($c3,$c2),line_connecting($c1,$c3))| -distinct_lines(line_connecting($c3,$c2),line_connecting($c1,$c2)).
% 1.89/2.08  
% 1.89/2.08  ------------> process sos:
% 1.89/2.08  ** KEPT (pick-wt=3): 16 [] distinct_points($c3,$c2).
% 1.89/2.08  ** KEPT (pick-wt=5): 17 [] apart_point_and_line($c1,line_connecting($c3,$c2)).
% 1.89/2.08  
% 1.89/2.08  ======= end of input processing =======
% 1.89/2.08  
% 1.89/2.08  =========== start of search ===========
% 1.89/2.08  
% 1.89/2.08  -------- PROOF -------- 
% 1.89/2.08  
% 1.89/2.08  -----> EMPTY CLAUSE at   0.00 sec ----> 73 [hyper,67,7,24,unit_del,1,1] $F.
% 1.89/2.08  
% 1.89/2.08  Length of proof is 10.  Level of proof is 6.
% 1.89/2.08  
% 1.89/2.08  ---------------- PROOF ----------------
% 1.89/2.08  % SZS status Theorem
% 1.89/2.08  % SZS output start Refutation
% See solution above
% 1.89/2.08  ------------ end of proof -------------
% 1.89/2.08  
% 1.89/2.08  
% 1.89/2.08  Search stopped by max_proofs option.
% 1.89/2.08  
% 1.89/2.08  
% 1.89/2.08  Search stopped by max_proofs option.
% 1.89/2.08  
% 1.89/2.08  ============ end of search ============
% 1.89/2.08  
% 1.89/2.08  -------------- statistics -------------
% 1.89/2.08  clauses given                 22
% 1.89/2.08  clauses generated            374
% 1.89/2.08  clauses kept                  72
% 1.89/2.08  clauses forward subsumed     318
% 1.89/2.08  clauses back subsumed          5
% 1.89/2.08  Kbytes malloced              976
% 1.89/2.08  
% 1.89/2.08  ----------- times (seconds) -----------
% 1.89/2.08  user CPU time          0.01          (0 hr, 0 min, 0 sec)
% 1.89/2.08  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.89/2.08  wall-clock time        2             (0 hr, 0 min, 2 sec)
% 1.89/2.08  
% 1.89/2.08  That finishes the proof of the theorem.
% 1.89/2.08  
% 1.89/2.08  Process 23185 finished Wed Jul 27 07:10:17 2022
% 1.89/2.08  Otter interrupted
% 1.89/2.08  PROOF FOUND
%------------------------------------------------------------------------------