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

View Problem - Process Solution

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

% Computer : n019.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:53 EDT 2022

% Result   : Theorem 1.70s 1.90s
% Output   : Refutation 1.70s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   14 (   8 unt;   6 nHn;   8 RR)
%            Number of literals    :   23 (   0 equ;   6 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   12 (   0 sgn)

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

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

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

cnf(20,axiom,
    ~ convergent_lines(dollar_c3,dollar_c2),
    file('GEO218+1.p',unknown),
    [] ).

cnf(21,axiom,
    ~ unorthogonal_lines(dollar_c3,dollar_c1),
    file('GEO218+1.p',unknown),
    [] ).

cnf(22,axiom,
    ( convergent_lines(A,B)
    | unorthogonal_lines(A,B) ),
    file('GEO218+1.p',unknown),
    [] ).

cnf(23,axiom,
    unorthogonal_lines(dollar_c2,dollar_c1),
    file('GEO218+1.p',unknown),
    [] ).

cnf(24,plain,
    convergent_lines(dollar_c3,dollar_c1),
    inference(hyper,[status(thm)],[22,21]),
    [iquote('hyper,22,21')] ).

cnf(27,plain,
    ( convergent_lines(dollar_c3,A)
    | convergent_lines(dollar_c1,A) ),
    inference(hyper,[status(thm)],[24,6]),
    [iquote('hyper,24,6')] ).

cnf(30,plain,
    convergent_lines(dollar_c1,dollar_c2),
    inference(hyper,[status(thm)],[27,20]),
    [iquote('hyper,27,20')] ).

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

cnf(65,plain,
    ( convergent_lines(A,dollar_c2)
    | unorthogonal_lines(A,dollar_c1) ),
    inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[43,16,23]),3]),
    [iquote('hyper,43,16,23,unit_del,3')] ).

cnf(77,plain,
    convergent_lines(dollar_c3,dollar_c2),
    inference(hyper,[status(thm)],[65,21]),
    [iquote('hyper,65,21')] ).

cnf(78,plain,
    $false,
    inference(binary,[status(thm)],[77,20]),
    [iquote('binary,77.1,20.1')] ).

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