TSTP Solution File: GEO189+1 by SOS---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : GEO189+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n007.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  : 600s
% DateTime : Sat Jul 16 06:18:54 EDT 2022

% Result   : Theorem 5.36s 5.55s
% Output   : Refutation 5.36s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : GEO189+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12  % Command  : sos-script %s
% 0.12/0.34  % Computer : n007.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Sat Jun 18 04:35:58 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.12/0.36  ----- Otter 3.2, August 2001 -----
% 0.12/0.36  The process was started by sandbox on n007.cluster.edu,
% 0.12/0.36  Sat Jun 18 04:35:58 2022
% 0.12/0.36  The command was "./sos".  The process ID is 10054.
% 0.12/0.36  
% 0.12/0.36  set(prolog_style_variables).
% 0.12/0.36  set(auto).
% 0.12/0.36     dependent: set(auto1).
% 0.12/0.36     dependent: set(process_input).
% 0.12/0.36     dependent: clear(print_kept).
% 0.12/0.36     dependent: clear(print_new_demod).
% 0.12/0.36     dependent: clear(print_back_demod).
% 0.12/0.36     dependent: clear(print_back_sub).
% 0.12/0.36     dependent: set(control_memory).
% 0.12/0.36     dependent: assign(max_mem, 12000).
% 0.12/0.36     dependent: assign(pick_given_ratio, 4).
% 0.12/0.36     dependent: assign(stats_level, 1).
% 0.12/0.36     dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.36     dependent: assign(sos_limit, 5000).
% 0.12/0.36     dependent: assign(max_weight, 60).
% 0.12/0.36  clear(print_given).
% 0.12/0.36  
% 0.12/0.36  formula_list(usable).
% 0.12/0.36  
% 0.12/0.36  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=6.
% 0.12/0.36  
% 0.12/0.36  This is a non-Horn set without equality.  The strategy
% 0.12/0.36  will be ordered hyper_res, ur_res, unit deletion, and
% 0.12/0.36  factoring, with satellites in sos and nuclei in usable.
% 0.12/0.36  
% 0.12/0.36     dependent: set(hyper_res).
% 0.12/0.36     dependent: set(factor).
% 0.12/0.36     dependent: set(unit_deletion).
% 0.12/0.36  
% 0.12/0.36  ------------> process usable:
% 0.12/0.36  
% 0.12/0.36  ------------> process sos:
% 0.12/0.36  
% 0.12/0.36  ======= end of input processing =======
% 0.12/0.38  
% 0.12/0.38  Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.38  
% 0.12/0.38  Stopped by limit on number of solutions
% 0.12/0.38  
% 0.12/0.38  
% 0.12/0.38  -------------- Softie stats --------------
% 0.12/0.38  
% 0.12/0.38  UPDATE_STOP: 300
% 0.12/0.38  SFINDER_TIME_LIMIT: 2
% 0.12/0.38  SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.38  number of clauses in intial UL: 15
% 0.12/0.38  number of clauses initially in problem: 19
% 0.12/0.38  percentage of clauses intially in UL: 78
% 0.12/0.38  percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.38  percent of all initial clauses that are short: 100
% 0.12/0.38  absolute distinct symbol count: 9
% 0.12/0.38     distinct predicate count: 4
% 0.12/0.38     distinct function count: 2
% 0.12/0.38     distinct constant count: 3
% 0.12/0.38  
% 0.12/0.38  ---------- no more Softie stats ----------
% 0.12/0.38  
% 0.12/0.38  
% 0.12/0.38  
% 0.12/0.38  =========== start of search ===========
% 5.36/5.55  
% 5.36/5.55  -------- PROOF -------- 
% 5.36/5.55  % SZS status Theorem
% 5.36/5.55  % SZS output start Refutation
% 5.36/5.55  
% 5.36/5.55  Model 2 (0.00 seconds, 0 Inserts)
% 5.36/5.55  
% 5.36/5.55  Stopped by limit on number of solutions
% 5.36/5.55  
% 5.36/5.55  Model 3 (0.00 seconds, 0 Inserts)
% 5.36/5.55  
% 5.36/5.55  Stopped by limit on number of solutions
% 5.36/5.55  
% 5.36/5.55  Stopped by limit on insertions
% 5.36/5.55  
% 5.36/5.55  Model 4 [ 1 1 64 ] (0.00 seconds, 250000 Inserts)
% 5.36/5.55  
% 5.36/5.55  Stopped by limit on insertions
% 5.36/5.55  
% 5.36/5.55  Model 5 [ 1 1 67 ] (0.00 seconds, 250000 Inserts)
% 5.36/5.55  
% 5.36/5.55  Stopped by limit on insertions
% 5.36/5.55  
% 5.36/5.55  Model 6 [ 1 1 63 ] (0.00 seconds, 250000 Inserts)
% 5.36/5.55  
% 5.36/5.55  Stopped by limit on insertions
% 5.36/5.55  
% 5.36/5.55  Model 7 [ 2 0 119 ] (0.00 seconds, 250000 Inserts)
% 5.36/5.55  
% 5.36/5.55  Stopped by limit on insertions
% 5.36/5.55  
% 5.36/5.55  Model 8 [ 2 0 74 ] (0.00 seconds, 250000 Inserts)
% 5.36/5.55  
% 5.36/5.55  Stopped by limit on insertions
% 5.36/5.55  
% 5.36/5.55  Model 9 [ 2 0 82 ] (0.00 seconds, 250000 Inserts)
% 5.36/5.55  
% 5.36/5.55  Stopped by limit on insertions
% 5.36/5.55  
% 5.36/5.55  Stopped by limit on insertions
% 5.36/5.55  
% 5.36/5.55  Stopped by limit on insertions
% 5.36/5.55  
% 5.36/5.55  Model 10 [ 3 0 74 ] (0.00 seconds, 250000 Inserts)
% 5.36/5.55  
% 5.36/5.55  Stopped by limit on insertions
% 5.36/5.55  
% 5.36/5.55  Model 11 [ 3 1 111 ] (0.00 seconds, 250000 Inserts)
% 5.36/5.55  
% 5.36/5.55  Stopped by limit on insertions
% 5.36/5.55  
% 5.36/5.55  Model 12 [ 4 1 78 ] (0.00 seconds, 250000 Inserts)
% 5.36/5.55  
% 5.36/5.55  Stopped by limit on insertions
% 5.36/5.55  
% 5.36/5.55  Model 13 [ 4 0 226 ] (0.00 seconds, 250000 Inserts)
% 5.36/5.55  
% 5.36/5.55  Stopped by limit on insertions
% 5.36/5.55  
% 5.36/5.55  Model 14 [ 5 1 63 ] (0.00 seconds, 250000 Inserts)
% 5.36/5.55  
% 5.36/5.55  Stopped by limit on insertions
% 5.36/5.55  
% 5.36/5.55  Model 15 [ 5 0 76 ] (0.00 seconds, 250000 Inserts)
% 5.36/5.55  
% 5.36/5.55  ----> UNIT CONFLICT at   5.17 sec ----> 1088 [binary,1087.1,1.1] {-} $F.
% 5.36/5.55  
% 5.36/5.55  Length of proof is 21.  Level of proof is 9.
% 5.36/5.55  
% 5.36/5.55  ---------------- PROOF ----------------
% 5.36/5.55  % SZS status Theorem
% 5.36/5.55  % SZS output start Refutation
% 5.36/5.55  
% 5.36/5.55  1 [] {+} -distinct_points(A,A).
% 5.36/5.55  4 [] {+} -distinct_points(A,B)|distinct_points(A,C)|distinct_points(B,C).
% 5.36/5.55  7 [] {+} -distinct_points(A,B)| -apart_point_and_line(A,line_connecting(A,B)).
% 5.36/5.55  8 [] {+} -distinct_points(A,B)| -apart_point_and_line(B,line_connecting(A,B)).
% 5.36/5.55  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).
% 5.36/5.55  13 [] {+} -apart_point_and_line(A,B)|distinct_lines(B,C)|apart_point_and_line(A,C).
% 5.36/5.55  15 [] {+} -apart_point_and_line($c1,line_connecting($c3,$c2)).
% 5.36/5.55  16 [] {+} distinct_points($c3,$c2).
% 5.36/5.55  17 [] {+} distinct_points($c3,$c1).
% 5.36/5.55  19 [] {-} apart_point_and_line($c2,line_connecting($c3,$c1)).
% 5.36/5.55  20 [hyper,16,4] {+} distinct_points($c3,A)|distinct_points($c2,A).
% 5.36/5.55  21 [hyper,17,4] {+} distinct_points($c3,A)|distinct_points($c1,A).
% 5.36/5.55  23 [hyper,19,13] {-} distinct_lines(line_connecting($c3,$c1),A)|apart_point_and_line($c2,A).
% 5.36/5.55  25 [hyper,20,4] {-} distinct_points($c2,A)|distinct_points($c3,B)|distinct_points(A,B).
% 5.36/5.55  28 [hyper,21,4] {-} distinct_points($c1,A)|distinct_points($c3,B)|distinct_points(A,B).
% 5.36/5.55  29 [hyper,21,1] {+} distinct_points($c1,$c3).
% 5.36/5.55  34 [hyper,23,11,29] {-} apart_point_and_line($c2,A)|apart_point_and_line($c1,line_connecting($c3,$c1))|apart_point_and_line($c1,A)|apart_point_and_line($c3,line_connecting($c3,$c1))|apart_point_and_line($c3,A).
% 5.36/5.55  43 [hyper,28,1] {+} distinct_points($c1,A)|distinct_points(A,$c3).
% 5.36/5.55  48 [hyper,43,4] {-} distinct_points(A,$c3)|distinct_points($c1,B)|distinct_points(A,B).
% 5.36/5.55  52 [hyper,25,1] {-} distinct_points($c2,A)|distinct_points(A,$c3).
% 5.36/5.55  53 [hyper,25,4] {-} distinct_points($c2,A)|distinct_points($c3,B)|distinct_points(A,C)|distinct_points(B,C).
% 5.36/5.55  54 [factor,53.1.3,unit_del,1] {-} distinct_points($c3,A)|distinct_points(A,$c2).
% 5.36/5.55  56 [hyper,52,4] {-} distinct_points(A,$c3)|distinct_points($c2,B)|distinct_points(A,B).
% 5.36/5.55  59 [hyper,56,4] {-} distinct_points(A,$c3)|distinct_points(A,B)|distinct_points($c2,C)|distinct_points(B,C).
% 5.36/5.55  79 [hyper,48,1] {+} distinct_points(A,$c3)|distinct_points(A,$c1).
% 5.36/5.55  155 [hyper,34,8,79,unit_del,1] {-} apart_point_and_line($c2,A)|apart_point_and_line($c1,A)|apart_point_and_line($c3,line_connecting($c3,$c1))|apart_point_and_line($c3,A).
% 5.36/5.55  266 [hyper,59,1] {-} distinct_points(A,$c3)|distinct_points(A,B)|distinct_points(B,$c2).
% 5.36/5.55  270 [hyper,266,4] {-} distinct_points(A,$c3)|distinct_points(B,$c2)|distinct_points(A,C)|distinct_points(B,C).
% 5.36/5.55  859 [hyper,155,7,79,unit_del,1] {-} apart_point_and_line($c2,A)|apart_point_and_line($c1,A)|apart_point_and_line($c3,A).
% 5.36/5.55  942 [hyper,859,8,54,unit_del,15,1] {+} apart_point_and_line($c3,line_connecting($c3,$c2)).
% 5.36/5.55  1087 [hyper,942,7,270,unit_del,1,factor_simp] {-} distinct_points(A,$c2).
% 5.36/5.55  1088 [binary,1087.1,1.1] {-} $F.
% 5.36/5.55  
% 5.36/5.55  % SZS output end Refutation
% 5.36/5.55  ------------ end of proof -------------
% 5.36/5.55  
% 5.36/5.55  
% 5.36/5.55  Search stopped by max_proofs option.
% 5.36/5.55  
% 5.36/5.55  
% 5.36/5.55  Search stopped by max_proofs option.
% 5.36/5.55  
% 5.36/5.55  ============ end of search ============
% 5.36/5.55  
% 5.36/5.55  ----------- soft-scott stats ----------
% 5.36/5.55  
% 5.36/5.55  true clauses given          10      (14.9%)
% 5.36/5.55  false clauses given         57
% 5.36/5.55  
% 5.36/5.55        FALSE     TRUE
% 5.36/5.55     5  0         1
% 5.36/5.55     9  0         1
% 5.36/5.55    10  6         2
% 5.36/5.55    12  6         14
% 5.36/5.55    13  16        8
% 5.36/5.55    14  4         0
% 5.36/5.55    15  24        6
% 5.36/5.55    16  17        16
% 5.36/5.55    17  4         0
% 5.36/5.55    18  1         0
% 5.36/5.55    19  4         22
% 5.36/5.55    22  3         0
% 5.36/5.55    23  13        0
% 5.36/5.55    25  24        0
% 5.36/5.55    26  66        0
% 5.36/5.55    28  59        0
% 5.36/5.55    29  128       0
% 5.36/5.55    31  65        0
% 5.36/5.55    32  88        0
% 5.36/5.55    33  5         0
% 5.36/5.55    34  34        0
% 5.36/5.55    36  18        0
% 5.36/5.55    39  24        0
% 5.36/5.55    41  3         0
% 5.36/5.55    42  30        0
% 5.36/5.55    44  8         0
% 5.36/5.55    45  18        0
% 5.36/5.55    47  4         0
% 5.36/5.55  tot:  672       70      (9.4% true)
% 5.36/5.55  
% 5.36/5.55  
% 5.36/5.55  Model 15 [ 5 0 76 ] (0.00 seconds, 250000 Inserts)
% 5.36/5.55  
% 5.36/5.55  That finishes the proof of the theorem.
% 5.36/5.55  
% 5.36/5.55  Process 10054 finished Sat Jun 18 04:36:03 2022
%------------------------------------------------------------------------------