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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : GEO203+1 : 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:47 EDT 2022

% Result   : Theorem 157.24s 157.42s
% Output   : Refutation 157.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   36 (   9 unt;  24 nHn;  15 RR)
%            Number of literals    :   86 (   0 equ;  12 neg)
%            Maximal clause size   :    6 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   51 (   1 sgn)

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

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

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

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

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

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

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

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

cnf(16,axiom,
    convergent_lines(dollar_c3,dollar_c1),
    file('GEO203+1.p',unknown),
    [] ).

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

cnf(18,axiom,
    distinct_lines(line_connecting(intersection_point(dollar_c3,dollar_c2),intersection_point(dollar_c3,dollar_c1)),dollar_c3),
    file('GEO203+1.p',unknown),
    [] ).

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

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

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(31,plain,
    ( distinct_points(intersection_point(dollar_c3,dollar_c2),A)
    | distinct_points(intersection_point(dollar_c3,dollar_c1),A) ),
    inference(hyper,[status(thm)],[17,4]),
    [iquote('hyper,17,4')] ).

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

cnf(42,plain,
    ( apart_point_and_line(intersection_point(dollar_c3,dollar_c2),line_connecting(intersection_point(dollar_c3,dollar_c2),intersection_point(dollar_c3,dollar_c1)))
    | apart_point_and_line(intersection_point(dollar_c3,dollar_c2),dollar_c3)
    | apart_point_and_line(intersection_point(dollar_c3,dollar_c1),line_connecting(intersection_point(dollar_c3,dollar_c2),intersection_point(dollar_c3,dollar_c1)))
    | apart_point_and_line(intersection_point(dollar_c3,dollar_c1),dollar_c3) ),
    inference(hyper,[status(thm)],[18,11,17]),
    [iquote('hyper,18,11,17')] ).

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

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

cnf(93,plain,
    ( convergent_lines(dollar_c1,A)
    | convergent_lines(A,dollar_c3) ),
    inference(hyper,[status(thm)],[35,3]),
    [iquote('hyper,35,3')] ).

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

cnf(115,plain,
    ( distinct_points(intersection_point(dollar_c3,dollar_c1),A)
    | distinct_points(intersection_point(dollar_c3,dollar_c2),B)
    | distinct_points(A,B) ),
    inference(hyper,[status(thm)],[31,4]),
    [iquote('hyper,31,4')] ).

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

cnf(185,plain,
    ( apart_point_and_line(intersection_point(dollar_c3,dollar_c2),dollar_c3)
    | apart_point_and_line(intersection_point(dollar_c3,dollar_c1),line_connecting(intersection_point(dollar_c3,dollar_c2),intersection_point(dollar_c3,dollar_c1)))
    | apart_point_and_line(intersection_point(dollar_c3,dollar_c1),dollar_c3) ),
    inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[42,7,31]),1]),
    [iquote('hyper,42,7,31,unit_del,1')] ).

cnf(261,plain,
    ( convergent_lines(A,dollar_c3)
    | convergent_lines(A,B)
    | convergent_lines(dollar_c1,C)
    | convergent_lines(B,C) ),
    inference(hyper,[status(thm)],[98,6]),
    [iquote('hyper,98,6')] ).

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

cnf(3407,plain,
    ( convergent_lines(A,dollar_c3)
    | convergent_lines(A,B)
    | convergent_lines(B,dollar_c1) ),
    inference(hyper,[status(thm)],[261,3]),
    [iquote('hyper,261,3')] ).

cnf(3413,plain,
    ( convergent_lines(A,dollar_c3)
    | convergent_lines(B,dollar_c1)
    | convergent_lines(A,C)
    | convergent_lines(B,C) ),
    inference(hyper,[status(thm)],[3407,6]),
    [iquote('hyper,3407,6')] ).

cnf(3705,plain,
    ( distinct_points(intersection_point(dollar_c3,dollar_c1),A)
    | distinct_points(A,intersection_point(dollar_c3,dollar_c2)) ),
    inference(hyper,[status(thm)],[115,1]),
    [iquote('hyper,115,1')] ).

cnf(3706,plain,
    ( distinct_points(A,intersection_point(dollar_c3,dollar_c2))
    | distinct_points(intersection_point(dollar_c3,dollar_c1),B)
    | distinct_points(A,B) ),
    inference(hyper,[status(thm)],[3705,4]),
    [iquote('hyper,3705,4')] ).

cnf(3912,plain,
    ( distinct_points(A,intersection_point(dollar_c3,dollar_c2))
    | distinct_points(A,intersection_point(dollar_c3,dollar_c1)) ),
    inference(hyper,[status(thm)],[3706,1]),
    [iquote('hyper,3706,1')] ).

cnf(3976,plain,
    ( apart_point_and_line(intersection_point(dollar_c3,dollar_c2),dollar_c3)
    | apart_point_and_line(intersection_point(dollar_c3,dollar_c1),dollar_c3) ),
    inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[185,8,3912]),1]),
    [iquote('hyper,185,8,3912,unit_del,1')] ).

cnf(3985,plain,
    apart_point_and_line(intersection_point(dollar_c3,dollar_c1),dollar_c3),
    inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[3976,9,1538]),3,3]),
    [iquote('hyper,3976,9,1538,unit_del,3,3')] ).

cnf(3996,plain,
    convergent_lines(A,dollar_c1),
    inference(factor_simp,[status(thm)],[inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[3985,9,3413]),3])]),
    [iquote('hyper,3985,9,3413,unit_del,3,factor_simp')] ).

cnf(3997,plain,
    $false,
    inference(binary,[status(thm)],[3996,3]),
    [iquote('binary,3996.1,3.1')] ).

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