TSTP Solution File: GEO172+1 by Otter---3.3

View Problem - Process Solution

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

% Computer : n024.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:35 EDT 2022

% Result   : Theorem 2.13s 2.31s
% Output   : Refutation 2.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   21 (   8 unt;  11 nHn;  12 RR)
%            Number of literals    :   44 (   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   :   24 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(3,axiom,
    ~ convergent_lines(A,A),
    file('GEO172+1.p',unknown),
    [] ).

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

cnf(9,axiom,
    ( ~ convergent_lines(A,B)
    | ~ apart_point_and_line(intersection_point(A,B),A) ),
    file('GEO172+1.p',unknown),
    [] ).

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

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

cnf(15,axiom,
    ~ apart_point_and_line(dollar_c1,dollar_c3),
    file('GEO172+1.p',unknown),
    [] ).

cnf(16,axiom,
    ~ apart_point_and_line(dollar_c1,dollar_c2),
    file('GEO172+1.p',unknown),
    [] ).

cnf(17,axiom,
    convergent_lines(dollar_c3,dollar_c2),
    file('GEO172+1.p',unknown),
    [] ).

cnf(18,axiom,
    distinct_points(dollar_c1,intersection_point(dollar_c3,dollar_c2)),
    file('GEO172+1.p',unknown),
    [] ).

cnf(19,plain,
    ( distinct_lines(dollar_c2,A)
    | convergent_lines(dollar_c3,A) ),
    inference(hyper,[status(thm)],[17,14]),
    [iquote('hyper,17,14')] ).

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

cnf(22,plain,
    ( convergent_lines(dollar_c3,A)
    | apart_point_and_line(dollar_c1,A)
    | apart_point_and_line(intersection_point(dollar_c3,dollar_c2),dollar_c2)
    | apart_point_and_line(intersection_point(dollar_c3,dollar_c2),A) ),
    inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[19,11,18]),16]),
    [iquote('hyper,19,11,18,unit_del,16')] ).

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

cnf(50,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) ),
    inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[22,3]),15]),
    [iquote('hyper,22,3,unit_del,15')] ).

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

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

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

cnf(447,plain,
    apart_point_and_line(intersection_point(dollar_c3,dollar_c2),dollar_c3),
    inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[50,10,120]),3]),
    [iquote('hyper,50,10,120,unit_del,3')] ).

cnf(453,plain,
    convergent_lines(dollar_c3,dollar_c3),
    inference(hyper,[status(thm)],[447,9,120]),
    [iquote('hyper,447,9,120')] ).

cnf(454,plain,
    $false,
    inference(binary,[status(thm)],[453,3]),
    [iquote('binary,453.1,3.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GEO172+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12  % Command  : otter-tptp-script %s
% 0.13/0.33  % Computer : n024.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 300
% 0.13/0.33  % DateTime : Wed Jul 27 07:08:25 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 1.78/1.97  ----- Otter 3.3f, August 2004 -----
% 1.78/1.97  The process was started by sandbox on n024.cluster.edu,
% 1.78/1.97  Wed Jul 27 07:08:25 2022
% 1.78/1.97  The command was "./otter".  The process ID is 32536.
% 1.78/1.97  
% 1.78/1.97  set(prolog_style_variables).
% 1.78/1.97  set(auto).
% 1.78/1.97     dependent: set(auto1).
% 1.78/1.97     dependent: set(process_input).
% 1.78/1.97     dependent: clear(print_kept).
% 1.78/1.97     dependent: clear(print_new_demod).
% 1.78/1.97     dependent: clear(print_back_demod).
% 1.78/1.97     dependent: clear(print_back_sub).
% 1.78/1.97     dependent: set(control_memory).
% 1.78/1.97     dependent: assign(max_mem, 12000).
% 1.78/1.97     dependent: assign(pick_given_ratio, 4).
% 1.78/1.97     dependent: assign(stats_level, 1).
% 1.78/1.97     dependent: assign(max_seconds, 10800).
% 1.78/1.97  clear(print_given).
% 1.78/1.97  
% 1.78/1.97  formula_list(usable).
% 1.78/1.97  all X (-distinct_points(X,X)).
% 1.78/1.97  all X (-distinct_lines(X,X)).
% 1.78/1.97  all X (-convergent_lines(X,X)).
% 1.78/1.97  all X Y Z (distinct_points(X,Y)->distinct_points(X,Z)|distinct_points(Y,Z)).
% 1.78/1.97  all X Y Z (distinct_lines(X,Y)->distinct_lines(X,Z)|distinct_lines(Y,Z)).
% 1.78/1.97  all X Y Z (convergent_lines(X,Y)->convergent_lines(X,Z)|convergent_lines(Y,Z)).
% 1.78/1.97  all X Y (distinct_points(X,Y)-> -apart_point_and_line(X,line_connecting(X,Y))).
% 1.78/1.97  all X Y (distinct_points(X,Y)-> -apart_point_and_line(Y,line_connecting(X,Y))).
% 1.78/1.97  all X Y (convergent_lines(X,Y)-> -apart_point_and_line(intersection_point(X,Y),X)).
% 1.78/1.97  all X Y (convergent_lines(X,Y)-> -apart_point_and_line(intersection_point(X,Y),Y)).
% 1.78/1.97  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.78/1.97  all X Y Z (apart_point_and_line(X,Y)->distinct_points(X,Z)|apart_point_and_line(Z,Y)).
% 1.78/1.97  all X Y Z (apart_point_and_line(X,Y)->distinct_lines(Y,Z)|apart_point_and_line(X,Z)).
% 1.78/1.97  all X Y Z (convergent_lines(X,Y)->distinct_lines(Y,Z)|convergent_lines(X,Z)).
% 1.78/1.97  -(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.78/1.97  end_of_list.
% 1.78/1.97  
% 1.78/1.97  -------> usable clausifies to:
% 1.78/1.97  
% 1.78/1.97  list(usable).
% 1.78/1.97  0 [] -distinct_points(X,X).
% 1.78/1.97  0 [] -distinct_lines(X,X).
% 1.78/1.97  0 [] -convergent_lines(X,X).
% 1.78/1.97  0 [] -distinct_points(X,Y)|distinct_points(X,Z)|distinct_points(Y,Z).
% 1.78/1.97  0 [] -distinct_lines(X,Y)|distinct_lines(X,Z)|distinct_lines(Y,Z).
% 1.78/1.97  0 [] -convergent_lines(X,Y)|convergent_lines(X,Z)|convergent_lines(Y,Z).
% 1.78/1.97  0 [] -distinct_points(X,Y)| -apart_point_and_line(X,line_connecting(X,Y)).
% 1.78/1.97  0 [] -distinct_points(X,Y)| -apart_point_and_line(Y,line_connecting(X,Y)).
% 1.78/1.97  0 [] -convergent_lines(X,Y)| -apart_point_and_line(intersection_point(X,Y),X).
% 1.78/1.97  0 [] -convergent_lines(X,Y)| -apart_point_and_line(intersection_point(X,Y),Y).
% 1.78/1.97  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.78/1.97  0 [] -apart_point_and_line(X,Y)|distinct_points(X,Z)|apart_point_and_line(Z,Y).
% 1.78/1.97  0 [] -apart_point_and_line(X,Y)|distinct_lines(Y,Z)|apart_point_and_line(X,Z).
% 1.78/1.97  0 [] -convergent_lines(X,Y)|distinct_lines(Y,Z)|convergent_lines(X,Z).
% 1.78/1.97  0 [] convergent_lines($c3,$c2).
% 1.78/1.97  0 [] -apart_point_and_line($c1,$c3).
% 1.78/1.97  0 [] -apart_point_and_line($c1,$c2).
% 1.78/1.97  0 [] distinct_points($c1,intersection_point($c3,$c2)).
% 1.78/1.97  end_of_list.
% 1.78/1.97  
% 1.78/1.97  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=6.
% 1.78/1.97  
% 1.78/1.97  This is a non-Horn set without equality.  The strategy will
% 1.78/1.97  be ordered hyper_res, unit deletion, and factoring, with
% 1.78/1.97  satellites in sos and with nuclei in usable.
% 1.78/1.97  
% 1.78/1.97     dependent: set(hyper_res).
% 1.78/1.97     dependent: set(factor).
% 1.78/1.97     dependent: set(unit_deletion).
% 1.78/1.97  
% 1.78/1.97  ------------> process usable:
% 1.78/1.97  ** KEPT (pick-wt=3): 1 [] -distinct_points(A,A).
% 1.78/1.97  ** KEPT (pick-wt=3): 2 [] -distinct_lines(A,A).
% 1.78/1.97  ** KEPT (pick-wt=3): 3 [] -convergent_lines(A,A).
% 1.78/1.97  ** KEPT (pick-wt=9): 4 [] -distinct_points(A,B)|distinct_points(A,C)|distinct_points(B,C).
% 1.78/1.97  ** KEPT (pick-wt=9): 5 [] -distinct_lines(A,B)|distinct_lines(A,C)|distinct_lines(B,C).
% 1.78/1.97  ** KEPT (pick-wt=9): 6 [] -convergent_lines(A,B)|convergent_lines(A,C)|convergent_lines(B,C).
% 1.78/1.97  ** KEPT (pick-wt=8): 7 [] -distinct_points(A,B)| -apart_point_and_line(A,line_connecting(A,B)).
% 1.78/1.97  ** KEPT (pick-wt=8): 8 [] -distinct_points(A,B)| -apart_point_and_line(B,line_connecting(A,B)).
% 1.78/1.97  ** KEPT (pick-wt=8): 9 [] -convergent_lines(A,B)| -apart_point_and_line(intersection_point(A,B),A).
% 2.13/2.31  ** KEPT (pick-wt=8): 10 [] -convergent_lines(A,B)| -apart_point_and_line(intersection_point(A,B),B).
% 2.13/2.31  ** 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).
% 2.13/2.31  ** KEPT (pick-wt=9): 12 [] -apart_point_and_line(A,B)|distinct_points(A,C)|apart_point_and_line(C,B).
% 2.13/2.31  ** KEPT (pick-wt=9): 13 [] -apart_point_and_line(A,B)|distinct_lines(B,C)|apart_point_and_line(A,C).
% 2.13/2.31  ** KEPT (pick-wt=9): 14 [] -convergent_lines(A,B)|distinct_lines(B,C)|convergent_lines(A,C).
% 2.13/2.31  ** KEPT (pick-wt=3): 15 [] -apart_point_and_line($c1,$c3).
% 2.13/2.31  ** KEPT (pick-wt=3): 16 [] -apart_point_and_line($c1,$c2).
% 2.13/2.31  
% 2.13/2.31  ------------> process sos:
% 2.13/2.31  ** KEPT (pick-wt=3): 17 [] convergent_lines($c3,$c2).
% 2.13/2.31  ** KEPT (pick-wt=5): 18 [] distinct_points($c1,intersection_point($c3,$c2)).
% 2.13/2.31  
% 2.13/2.31  ======= end of input processing =======
% 2.13/2.31  
% 2.13/2.31  =========== start of search ===========
% 2.13/2.31  
% 2.13/2.31  -------- PROOF -------- 
% 2.13/2.31  
% 2.13/2.31  ----> UNIT CONFLICT at   0.34 sec ----> 454 [binary,453.1,3.1] $F.
% 2.13/2.31  
% 2.13/2.31  Length of proof is 10.  Level of proof is 7.
% 2.13/2.31  
% 2.13/2.31  ---------------- PROOF ----------------
% 2.13/2.31  % SZS status Theorem
% 2.13/2.31  % SZS output start Refutation
% See solution above
% 2.13/2.31  ------------ end of proof -------------
% 2.13/2.31  
% 2.13/2.31  
% 2.13/2.31  Search stopped by max_proofs option.
% 2.13/2.31  
% 2.13/2.31  
% 2.13/2.31  Search stopped by max_proofs option.
% 2.13/2.31  
% 2.13/2.31  ============ end of search ============
% 2.13/2.31  
% 2.13/2.31  -------------- statistics -------------
% 2.13/2.31  clauses given                 48
% 2.13/2.31  clauses generated           3602
% 2.13/2.31  clauses kept                 453
% 2.13/2.31  clauses forward subsumed    3167
% 2.13/2.31  clauses back subsumed        160
% 2.13/2.31  Kbytes malloced              976
% 2.13/2.31  
% 2.13/2.31  ----------- times (seconds) -----------
% 2.13/2.31  user CPU time          0.34          (0 hr, 0 min, 0 sec)
% 2.13/2.31  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 2.13/2.31  wall-clock time        2             (0 hr, 0 min, 2 sec)
% 2.13/2.31  
% 2.13/2.31  That finishes the proof of the theorem.
% 2.13/2.31  
% 2.13/2.31  Process 32536 finished Wed Jul 27 07:08:27 2022
% 2.13/2.31  Otter interrupted
% 2.13/2.31  PROOF FOUND
%------------------------------------------------------------------------------