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

View Problem - Process Solution

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

% Computer : n004.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:40 EDT 2022

% Result   : Theorem 1.69s 1.88s
% Output   : Refutation 1.69s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    5
% Syntax   : Number of clauses     :    8 (   5 unt;   1 nHn;   8 RR)
%            Number of literals    :   13 (   0 equ;   5 neg)
%            Maximal clause size   :    3 (   1 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   :    6 (   0 sgn)

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

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

cnf(15,axiom,
    ~ distinct_points(dollar_c4,intersection_point(dollar_c2,dollar_c1)),
    file('GEO185+2.p',unknown),
    [] ).

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

cnf(18,axiom,
    ( apart_point_and_line(dollar_c4,dollar_c2)
    | apart_point_and_line(dollar_c4,dollar_c1) ),
    file('GEO185+2.p',unknown),
    [] ).

cnf(25,plain,
    apart_point_and_line(dollar_c4,dollar_c1),
    inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[18,9,17]),15]),
    [iquote('hyper,18,9,17,unit_del,15')] ).

cnf(31,plain,
    distinct_points(dollar_c4,intersection_point(dollar_c2,dollar_c1)),
    inference(hyper,[status(thm)],[25,10,17]),
    [iquote('hyper,25,10,17')] ).

cnf(32,plain,
    $false,
    inference(binary,[status(thm)],[31,15]),
    [iquote('binary,31.1,15.1')] ).

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