TSTP Solution File: GEO218+3 by SOS---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : GEO218+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n017.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:19:19 EDT 2022

% Result   : Theorem 9.11s 9.33s
% Output   : Refutation 9.11s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : GEO218+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13  % Command  : sos-script %s
% 0.12/0.34  % Computer : n017.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 03:47:12 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 sandbox2 on n017.cluster.edu,
% 0.12/0.36  Sat Jun 18 03:47:12 2022
% 0.12/0.36  The command was "./sos".  The process ID is 23642.
% 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=1, symmetry=0, max_lits=6.
% 0.12/0.36  
% 0.12/0.36  This ia a non-Horn set with equality.  The strategy will be
% 0.12/0.36  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.36  unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.36  clauses in usable.
% 0.12/0.36  
% 0.12/0.36     dependent: set(knuth_bendix).
% 0.12/0.36     dependent: set(para_from).
% 0.12/0.36     dependent: set(para_into).
% 0.12/0.36     dependent: clear(para_from_right).
% 0.12/0.36     dependent: clear(para_into_right).
% 0.12/0.36     dependent: set(para_from_vars).
% 0.12/0.36     dependent: set(eq_units_both_ways).
% 0.12/0.36     dependent: set(dynamic_demod_all).
% 0.12/0.36     dependent: set(dynamic_demod).
% 0.12/0.36     dependent: set(order_eq).
% 0.12/0.36     dependent: set(back_demod).
% 0.12/0.36     dependent: set(lrpo).
% 0.12/0.36     dependent: set(hyper_res).
% 0.12/0.36     dependent: set(unit_deletion).
% 0.12/0.36     dependent: set(factor).
% 0.12/0.36  
% 0.12/0.36  ------------> process usable:
% 0.12/0.36    Following clause subsumed by 15 during input processing: 0 [] {-} -distinct_lines(A,B)|apart_point_and_line(C,A)|apart_point_and_line(C,B)|convergent_lines(A,B).
% 0.12/0.36    Following clause subsumed by 6 during input processing: 0 [] {-} -convergent_lines(A,B)| -unorthogonal_lines(A,B)|convergent_lines(A,C)|convergent_lines(B,C).
% 0.12/0.36  28 back subsumes 27.
% 0.12/0.36  
% 0.12/0.36  ------------> process sos:
% 0.12/0.36    Following clause subsumed by 39 during input processing: 0 [] {-} convergent_lines(A,B)|unorthogonal_lines(A,B).
% 0.12/0.36  
% 0.12/0.36  ======= end of input processing =======
% 0.12/0.40  
% 0.12/0.40  Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.40  
% 0.12/0.40  Stopped by limit on number of solutions
% 0.12/0.40  
% 0.12/0.40  
% 0.12/0.40  -------------- Softie stats --------------
% 0.12/0.40  
% 0.12/0.40  UPDATE_STOP: 300
% 0.12/0.40  SFINDER_TIME_LIMIT: 2
% 0.12/0.40  SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.40  number of clauses in intial UL: 37
% 0.12/0.40  number of clauses initially in problem: 45
% 0.12/0.40  percentage of clauses intially in UL: 82
% 0.12/0.40  percentage of distinct symbols occuring in initial UL: 94
% 0.12/0.40  percent of all initial clauses that are short: 100
% 0.12/0.40  absolute distinct symbol count: 19
% 0.12/0.40     distinct predicate count: 12
% 0.12/0.40     distinct function count: 4
% 0.12/0.40     distinct constant count: 3
% 0.12/0.40  
% 0.12/0.40  ---------- no more Softie stats ----------
% 0.12/0.40  
% 0.12/0.40  
% 0.12/0.40  
% 0.12/0.40  Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.40  
% 0.12/0.40  Stopped by limit on number of solutions
% 0.12/0.40  
% 0.12/0.40  =========== start of search ===========
% 9.11/9.33  
% 9.11/9.33  -------- PROOF -------- 
% 9.11/9.33  % SZS status Theorem
% 9.11/9.33  % SZS output start Refutation
% 9.11/9.33  
% 9.11/9.33  Stopped by limit on insertions
% 9.11/9.33  
% 9.11/9.33  Model 3 [ 3 1 844 ] (0.00 seconds, 250000 Inserts)
% 9.11/9.33  
% 9.11/9.33  Model 4 (0.00 seconds, 250000 Inserts)
% 9.11/9.33  
% 9.11/9.33  Stopped by limit on number of solutions
% 9.11/9.33  
% 9.11/9.33  Stopped by limit on insertions
% 9.11/9.33  
% 9.11/9.33  Model 5 [ 5 1 269 ] (0.00 seconds, 250000 Inserts)
% 9.11/9.33  
% 9.11/9.33  Stopped by limit on insertions
% 9.11/9.33  
% 9.11/9.33  Model 6 [ 1 0 1043 ] (0.00 seconds, 250000 Inserts)
% 9.11/9.33  
% 9.11/9.33  Stopped by limit on insertions
% 9.11/9.33  
% 9.11/9.33  Model 7 [ 13 0 451 ] (0.00 seconds, 250000 Inserts)
% 9.11/9.33  
% 9.11/9.33  Stopped by limit on insertions
% 9.11/9.33  
% 9.11/9.33  Model 8 [ 13 0 851 ] (0.00 seconds, 250000 Inserts)
% 9.11/9.33  
% 9.11/9.33  Stopped by limit on insertions
% 9.11/9.33  
% 9.11/9.33  Model 9 [ 13 1 435 ] (0.00 seconds, 250000 Inserts)
% 9.11/9.33  
% 9.11/9.33  Stopped by limit on insertions
% 9.11/9.33  
% 9.11/9.33  Model 10 [ 5 1 358 ] (0.00 seconds, 250000 Inserts)
% 9.11/9.33  
% 9.11/9.33  Stopped by limit on insertions
% 9.11/9.33  
% 9.11/9.33  Model 11 [ 13 1 389 ] (0.00 seconds, 250000 Inserts)
% 9.11/9.33  
% 9.11/9.33  Stopped by limit on insertions
% 9.11/9.33  
% 9.11/9.33  Model 12 [ 14 0 357 ] (0.00 seconds, 250000 Inserts)
% 9.11/9.33  
% 9.11/9.33  Stopped by limit on insertions
% 9.11/9.33  
% 9.11/9.33  Model 13 [ 15 1 329 ] (0.00 seconds, 250000 Inserts)
% 9.11/9.33  
% 9.11/9.33  Stopped by limit on insertions
% 9.11/9.33  
% 9.11/9.33  Model 14 [ 13 0 242 ] (0.00 seconds, 250000 Inserts)
% 9.11/9.33  
% 9.11/9.33  Stopped by limit on insertions
% 9.11/9.33  
% 9.11/9.33  Model 15 [ 5 1 168 ] (0.00 seconds, 250000 Inserts)
% 9.11/9.33  
% 9.11/9.33  Stopped by limit on insertions
% 9.11/9.33  
% 9.11/9.33  Model 16 [ 17 0 244 ] (0.00 seconds, 250000 Inserts)
% 9.11/9.33  
% 9.11/9.33  Stopped by limit on insertions
% 9.11/9.33  
% 9.11/9.33  Model 17 [ 3 0 662 ] (0.00 seconds, 250000 Inserts)
% 9.11/9.33  
% 9.11/9.33  Stopped by limit on insertions
% 9.11/9.33  
% 9.11/9.33  Model 18 [ 21 0 318 ] (0.00 seconds, 250000 Inserts)
% 9.11/9.33  
% 9.11/9.33  Stopped by limit on insertions
% 9.11/9.33  
% 9.11/9.33  Model 19 [ 20 1 433 ] (0.00 seconds, 250000 Inserts)
% 9.11/9.33  
% 9.11/9.33  Stopped by limit on insertions
% 9.11/9.33  
% 9.11/9.33  Model 20 [ 29 0 1281 ] (0.00 seconds, 250000 Inserts)
% 9.11/9.33  
% 9.11/9.33  Stopped by limit on insertions
% 9.11/9.33  
% 9.11/9.33  Model 21 [ 36 0 436 ] (0.00 seconds, 250000 Inserts)
% 9.11/9.33  
% 9.11/9.33  Stopped by limit on insertions
% 9.11/9.33  
% 9.11/9.33  Model 22 [ 11 1 819 ] (0.00 seconds, 250000 Inserts)
% 9.11/9.33  
% 9.11/9.33  Stopped by limit on insertions
% 9.11/9.33  
% 9.11/9.33  Model 23 [ 63 0 283 ] (0.00 seconds, 250000 Inserts)
% 9.11/9.33  
% 9.11/9.33  Stopped by limit on insertions
% 9.11/9.33  
% 9.11/9.33  Model 24 [ 47 1 463 ] (0.00 seconds, 250000 Inserts)
% 9.11/9.33  
% 9.11/9.33  Stopped by limit on insertions
% 9.11/9.33  
% 9.11/9.33  Model 25 [ 63 0 276 ] (0.00 seconds, 250000 Inserts)
% 9.11/9.33  
% 9.11/9.33  Stopped by limit on insertions
% 9.11/9.33  
% 9.11/9.33  Model 26 [ 62 1 460 ] (0.00 seconds, 250000 Inserts)
% 9.11/9.33  
% 9.11/9.33  Stopped by limit on insertions
% 9.11/9.33  
% 9.11/9.33  Model 27 [ 16 0 1215 ] (0.00 seconds, 250000 Inserts)
% 9.11/9.33  
% 9.11/9.33  Stopped by limit on insertions
% 9.11/9.33  
% 9.11/9.33  Stopped by limit on insertions
% 9.11/9.33  
% 9.11/9.33  Model 28 [ 96 0 163 ] (0.00 seconds, 250000 Inserts)
% 9.11/9.33  
% 9.11/9.33  Stopped by limit on insertions
% 9.11/9.33  
% 9.11/9.33  Model 29 [ 20 1 239 ] (0.00 seconds, 250000 Inserts)
% 9.11/9.33  
% 9.11/9.33  Stopped by limit on insertions
% 9.11/9.33  
% 9.11/9.33  Model 30 [ 105 0 285 ] (0.00 seconds, 250000 Inserts)
% 9.11/9.33  
% 9.11/9.33  Stopped by limit on insertions
% 9.11/9.33  
% 9.11/9.33  Model 31 [ 91 1 761 ] (0.00 seconds, 250000 Inserts)
% 9.11/9.33  
% 9.11/9.33  Stopped by limit on insertions
% 9.11/9.33  
% 9.11/9.33  Model 32 [ 108 1 316 ] (0.00 seconds, 250000 Inserts)
% 9.11/9.33  
% 9.11/9.33  Stopped by limit on insertions
% 9.11/9.33  
% 9.11/9.33  Model 33 [ 104 0 322 ] (0.00 seconds, 250000 Inserts)
% 9.11/9.33  
% 9.11/9.33  Stopped by limit on insertions
% 9.11/9.33  
% 9.11/9.33  Model 34 [ 108 1 280 ] (0.00 seconds, 250000 Inserts)
% 9.11/9.33  
% 9.11/9.33  Stopped by limit on insertions
% 9.11/9.33  
% 9.11/9.33  Model 35 [ 106 1 357 ] (0.00 seconds, 250000 Inserts)
% 9.11/9.33  
% 9.11/9.33  Stopped by limit on insertions
% 9.11/9.33  
% 9.11/9.33  Model 36 [ 113 1 272 ] (0.00 seconds, 250000 Inserts)
% 9.11/9.33  
% 9.11/9.33  Stopped by limit on insertions
% 9.11/9.33  
% 9.11/9.33  Model 37 [ 93 0 727 ] (0.00 seconds, 250000 Inserts)
% 9.11/9.33  
% 9.11/9.33  Stopped by limit on insertions
% 9.11/9.33  
% 9.11/9.33  Model 38 [ 112 1 162 ] (0.00 seconds, 250000 Inserts)
% 9.11/9.33  
% 9.11/9.33  Stopped by limit on insertions
% 9.11/9.33  
% 9.11/9.33  Model 39 [ 48 1 1293 ] (0.00 seconds, 250000 Inserts)
% 9.11/9.33  
% 9.11/9.33  Stopped by limit on insertions
% 9.11/9.33  
% 9.11/9.33  Model 40 [ 46 1 169 ] (0.00 seconds, 250000 Inserts)
% 9.11/9.33  
% 9.11/9.33  Stopped by limit on insertions
% 9.11/9.33  
% 9.11/9.33  Model 41 [ 34 1 1037 ] (0.00 seconds, 250000 Inserts)
% 9.11/9.33  
% 9.11/9.33  Stopped by limit on insertions
% 9.11/9.33  
% 9.11/9.33  Model 42 [ 31 0 1294 ] (0.00 seconds, 250000 Inserts)
% 9.11/9.33  
% 9.11/9.33  Stopped by limit on insertions
% 9.11/9.33  
% 9.11/9.33  Model 43 [ 124 1 691 ] (0.00 seconds, 250000 Inserts)
% 9.11/9.33  
% 9.11/9.33  ----> UNIT CONFLICT at   8.94 sec ----> 598 [binary,597.1,2.1] {-} $F.
% 9.11/9.33  
% 9.11/9.33  Length of proof is 6.  Level of proof is 4.
% 9.11/9.33  
% 9.11/9.33  ---------------- PROOF ----------------
% 9.11/9.33  % SZS status Theorem
% 9.11/9.33  % SZS output start Refutation
% 9.11/9.33  
% 9.11/9.33  1 [] {+} -distinct_points(A,A).
% 9.11/9.33  2 [] {+} -distinct_lines(A,A).
% 9.11/9.33  15 [] {+} -distinct_lines(A,B)|convergent_lines(A,B).
% 9.11/9.33  35 [] {+} -parallel_lines(A,B)| -convergent_lines(A,B).
% 9.11/9.33  38 [] {+} -orthogonal_lines($c2,$c1).
% 9.11/9.33  40 [] {+} equal_points(A,B)|distinct_points(A,B).
% 9.11/9.33  41 [] {+} equal_lines(A,B)|distinct_lines(A,B).
% 9.11/9.33  45 [] {+} parallel_lines($c3,$c2).
% 9.11/9.33  46 [] {+} orthogonal_lines($c3,$c1).
% 9.11/9.33  60 [para_from,40.1.1,38.1.2] {+} -orthogonal_lines($c2,A)|distinct_points($c1,A).
% 9.11/9.33  77 [para_from,41.1.1,46.1.1] {+} orthogonal_lines(A,$c1)|distinct_lines($c3,A).
% 9.11/9.33  78 [para_from,41.1.1,45.1.1] {+} parallel_lines(A,$c2)|distinct_lines($c3,A).
% 9.11/9.33  542 [hyper,77,60,unit_del,1] {+} distinct_lines($c3,$c2).
% 9.11/9.33  554 [hyper,542,15] {+} convergent_lines($c3,$c2).
% 9.11/9.33  597 [hyper,554,35,78] {-} distinct_lines($c3,$c3).
% 9.11/9.33  598 [binary,597.1,2.1] {-} $F.
% 9.11/9.33  
% 9.11/9.33  % SZS output end Refutation
% 9.11/9.33  ------------ end of proof -------------
% 9.11/9.33  
% 9.11/9.33  
% 9.11/9.33  Search stopped by max_proofs option.
% 9.11/9.33  
% 9.11/9.33  
% 9.11/9.33  Search stopped by max_proofs option.
% 9.11/9.33  
% 9.11/9.33  ============ end of search ============
% 9.11/9.33  
% 9.11/9.33  ----------- soft-scott stats ----------
% 9.11/9.33  
% 9.11/9.33  true clauses given           6      (11.5%)
% 9.11/9.33  false clauses given         46
% 9.11/9.33  
% 9.11/9.33        FALSE     TRUE
% 9.11/9.33     3  1         0
% 9.11/9.33     5  1         1
% 9.11/9.33     6  33        9
% 9.11/9.33     7  6         0
% 9.11/9.33     8  73        13
% 9.11/9.33     9  55        16
% 9.11/9.33    10  4         1
% 9.11/9.33    11  27        17
% 9.11/9.33    12  3         14
% 9.11/9.33    13  8         9
% 9.11/9.33    14  10        4
% 9.11/9.33    15  19        5
% 9.11/9.33    16  19        7
% 9.11/9.33    17  4         0
% 9.11/9.33    18  9         0
% 9.11/9.33    19  15        0
% 9.11/9.33    20  7         0
% 9.11/9.33    21  6         0
% 9.11/9.33    22  2         0
% 9.11/9.33    23  1         0
% 9.11/9.33    24  1         0
% 9.11/9.33    25  1         0
% 9.11/9.33  tot:  305       96      (23.9% true)
% 9.11/9.33  
% 9.11/9.33  
% 9.11/9.33  Model 43 [ 124 1 691 ] (0.00 seconds, 250000 Inserts)
% 9.11/9.33  
% 9.11/9.33  That finishes the proof of the theorem.
% 9.11/9.33  
% 9.11/9.33  Process 23642 finished Sat Jun 18 03:47:21 2022
%------------------------------------------------------------------------------