TSTP Solution File: GEO179+2 by SOS---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : GEO179+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-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  : 600s
% DateTime : Sat Jul 16 06:18:46 EDT 2022

% Result   : Theorem 1.51s 1.75s
% Output   : Refutation 1.51s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GEO179+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13  % Command  : sos-script %s
% 0.12/0.34  % Computer : n019.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 01:02:09 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.12/0.35  ----- Otter 3.2, August 2001 -----
% 0.12/0.35  The process was started by sandbox2 on n019.cluster.edu,
% 0.12/0.35  Sat Jun 18 01:02:09 2022
% 0.12/0.35  The command was "./sos".  The process ID is 4215.
% 0.12/0.35  
% 0.12/0.35  set(prolog_style_variables).
% 0.12/0.35  set(auto).
% 0.12/0.35     dependent: set(auto1).
% 0.12/0.35     dependent: set(process_input).
% 0.12/0.35     dependent: clear(print_kept).
% 0.12/0.35     dependent: clear(print_new_demod).
% 0.12/0.35     dependent: clear(print_back_demod).
% 0.12/0.35     dependent: clear(print_back_sub).
% 0.12/0.35     dependent: set(control_memory).
% 0.12/0.35     dependent: assign(max_mem, 12000).
% 0.12/0.35     dependent: assign(pick_given_ratio, 4).
% 0.12/0.35     dependent: assign(stats_level, 1).
% 0.12/0.35     dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35     dependent: assign(sos_limit, 5000).
% 0.12/0.35     dependent: assign(max_weight, 60).
% 0.12/0.35  clear(print_given).
% 0.12/0.35  
% 0.12/0.35  formula_list(usable).
% 0.12/0.35  
% 0.12/0.35  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=6.
% 0.12/0.35  
% 0.12/0.35  This is a non-Horn set without equality.  The strategy
% 0.12/0.35  will be ordered hyper_res, ur_res, unit deletion, and
% 0.12/0.35  factoring, with satellites in sos and nuclei in usable.
% 0.12/0.35  
% 0.12/0.35     dependent: set(hyper_res).
% 0.12/0.35     dependent: set(factor).
% 0.12/0.35     dependent: set(unit_deletion).
% 0.12/0.35  
% 0.12/0.35  ------------> process usable:
% 0.12/0.35  
% 0.12/0.35  ------------> process sos:
% 0.12/0.35  
% 0.12/0.35  ======= end of input processing =======
% 0.19/0.39  
% 0.19/0.39  Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.39  
% 0.19/0.39  Stopped by limit on number of solutions
% 0.19/0.39  
% 0.19/0.39  
% 0.19/0.39  -------------- Softie stats --------------
% 0.19/0.39  
% 0.19/0.39  UPDATE_STOP: 300
% 0.19/0.39  SFINDER_TIME_LIMIT: 2
% 0.19/0.39  SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.39  number of clauses in intial UL: 15
% 0.19/0.39  number of clauses initially in problem: 17
% 0.19/0.39  percentage of clauses intially in UL: 88
% 0.19/0.39  percentage of distinct symbols occuring in initial UL: 100
% 0.19/0.39  percent of all initial clauses that are short: 100
% 0.19/0.39  absolute distinct symbol count: 9
% 0.19/0.39     distinct predicate count: 4
% 0.19/0.39     distinct function count: 2
% 0.19/0.39     distinct constant count: 3
% 0.19/0.39  
% 0.19/0.39  ---------- no more Softie stats ----------
% 0.19/0.39  
% 0.19/0.39  
% 0.19/0.39  
% 0.19/0.39  Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.39  
% 0.19/0.39  Stopped by limit on number of solutions
% 0.19/0.39  
% 0.19/0.39  =========== start of search ===========
% 1.51/1.75  
% 1.51/1.75  -------- PROOF -------- 
% 1.51/1.75  % SZS status Theorem
% 1.51/1.75  % SZS output start Refutation
% 1.51/1.75  
% 1.51/1.75  Model 3 (0.00 seconds, 0 Inserts)
% 1.51/1.75  
% 1.51/1.75  Stopped by limit on number of solutions
% 1.51/1.75  
% 1.51/1.75  Stopped by limit on insertions
% 1.51/1.75  
% 1.51/1.75  Model 4 [ 1 1 64 ] (0.00 seconds, 250000 Inserts)
% 1.51/1.75  
% 1.51/1.75  Stopped by limit on insertions
% 1.51/1.75  
% 1.51/1.75  Model 5 [ 1 1 64 ] (0.00 seconds, 250000 Inserts)
% 1.51/1.75  
% 1.51/1.75  Stopped by limit on insertions
% 1.51/1.75  
% 1.51/1.75  Model 6 [ 1 0 71 ] (0.00 seconds, 250000 Inserts)
% 1.51/1.75  
% 1.51/1.75  Stopped by limit on insertions
% 1.51/1.75  
% 1.51/1.75  Model 7 [ 2 1 127 ] (0.00 seconds, 250000 Inserts)
% 1.51/1.75  
% 1.51/1.75  Stopped by limit on insertions
% 1.51/1.75  
% 1.51/1.75  Model 8 [ 2 1 63 ] (0.00 seconds, 250000 Inserts)
% 1.51/1.75  
% 1.51/1.75  Stopped by limit on insertions
% 1.51/1.75  
% 1.51/1.75  Model 9 [ 2 0 133 ] (0.00 seconds, 250000 Inserts)
% 1.51/1.75  
% 1.51/1.75  Stopped by limit on insertions
% 1.51/1.75  
% 1.51/1.75  Model 10 [ 3 1 229 ] (0.00 seconds, 250000 Inserts)
% 1.51/1.75  
% 1.51/1.75  Stopped by limit on insertions
% 1.51/1.75  
% 1.51/1.75  Model 11 [ 3 0 220 ] (0.00 seconds, 250000 Inserts)
% 1.51/1.75  
% 1.51/1.75  Stopped by limit on insertions
% 1.51/1.75  
% 1.51/1.75  Model 12 [ 3 1 2288 ] (0.00 seconds, 250000 Inserts)
% 1.51/1.75  
% 1.51/1.75  Stopped by limit on insertions
% 1.51/1.75  
% 1.51/1.75  Model 13 [ 4 1 63 ] (0.00 seconds, 250000 Inserts)
% 1.51/1.75  
% 1.51/1.75  Stopped by limit on insertions
% 1.51/1.75  
% 1.51/1.75  Model 14 [ 4 0 63 ] (0.00 seconds, 250000 Inserts)
% 1.51/1.75  
% 1.51/1.75  Stopped by limit on insertions
% 1.51/1.75  
% 1.51/1.75  Model 15 [ 5 1 65 ] (0.00 seconds, 250000 Inserts)
% 1.51/1.75  
% 1.51/1.75  Stopped by limit on insertions
% 1.51/1.75  
% 1.51/1.75  Model 16 [ 4 1 82 ] (0.00 seconds, 250000 Inserts)
% 1.51/1.75  
% 1.51/1.75  Stopped by limit on insertions
% 1.51/1.75  
% 1.51/1.75  Model 17 [ 5 1 63 ] (0.00 seconds, 250000 Inserts)
% 1.51/1.75  
% 1.51/1.75  Stopped by limit on insertions
% 1.51/1.75  
% 1.51/1.75  Model 18 [ 5 1 140 ] (0.00 seconds, 250000 Inserts)
% 1.51/1.75  
% 1.51/1.75  Stopped by limit on insertions
% 1.51/1.75  
% 1.51/1.75  Model 19 [ 39 1 468 ] (0.00 seconds, 250000 Inserts)
% 1.51/1.75  
% 1.51/1.75  -----> EMPTY CLAUSE at   1.37 sec ----> 98 [hyper,92,7,87,unit_del,1,1] {-} $F.
% 1.51/1.75  
% 1.51/1.75  Length of proof is 15.  Level of proof is 7.
% 1.51/1.75  
% 1.51/1.75  ---------------- PROOF ----------------
% 1.51/1.75  % SZS status Theorem
% 1.51/1.75  % SZS output start Refutation
% 1.51/1.75  
% 1.51/1.75  1 [] {+} -distinct_points(A,A).
% 1.51/1.75  4 [] {+} -distinct_points(A,B)|distinct_points(A,C)|distinct_points(B,C).
% 1.51/1.75  7 [] {+} -distinct_points(A,B)| -apart_point_and_line(C,line_connecting(A,B))|distinct_points(C,A).
% 1.51/1.75  8 [] {+} -distinct_points(A,B)| -apart_point_and_line(C,line_connecting(A,B))|distinct_points(C,B).
% 1.51/1.75  13 [] {+} -apart_point_and_line(A,B)|distinct_lines(B,C)|apart_point_and_line(A,C).
% 1.51/1.75  15 [] {+} -distinct_lines(line_connecting($c3,$c2),line_connecting($c1,$c3))| -distinct_lines(line_connecting($c3,$c2),line_connecting($c1,$c2)).
% 1.51/1.75  16 [] {+} distinct_points($c3,$c2).
% 1.51/1.75  17 [] {-} apart_point_and_line($c1,line_connecting($c3,$c2)).
% 1.51/1.75  19 [hyper,17,13] {-} distinct_lines(line_connecting($c3,$c2),A)|apart_point_and_line($c1,A).
% 1.51/1.75  21 [hyper,17,8,16] {+} distinct_points($c1,$c2).
% 1.51/1.75  22 [hyper,17,7,16] {+} distinct_points($c1,$c3).
% 1.51/1.75  23 [hyper,22,4] {+} distinct_points($c1,A)|distinct_points($c3,A).
% 1.51/1.75  24 [hyper,21,4] {+} distinct_points($c1,A)|distinct_points($c2,A).
% 1.51/1.75  25 [hyper,23,4] {+} distinct_points($c3,A)|distinct_points($c1,B)|distinct_points(A,B).
% 1.51/1.75  31 [hyper,24,4] {-} distinct_points($c2,A)|distinct_points($c1,B)|distinct_points(A,B).
% 1.51/1.75  34 [hyper,19,15,19] {-} apart_point_and_line($c1,line_connecting($c1,$c2))|apart_point_and_line($c1,line_connecting($c1,$c3)).
% 1.51/1.75  52 [hyper,31,1] {+} distinct_points($c2,A)|distinct_points(A,$c1).
% 1.51/1.75  57 [hyper,25,1] {+} distinct_points($c3,A)|distinct_points(A,$c1).
% 1.51/1.75  61 [hyper,52,4] {-} distinct_points(A,$c1)|distinct_points($c2,B)|distinct_points(A,B).
% 1.51/1.75  63 [hyper,57,4] {-} distinct_points(A,$c1)|distinct_points($c3,B)|distinct_points(A,B).
% 1.51/1.75  74 [hyper,61,1] {+} distinct_points(A,$c1)|distinct_points(A,$c2).
% 1.51/1.75  87 [hyper,63,1] {+} distinct_points(A,$c1)|distinct_points(A,$c3).
% 1.51/1.75  92 [hyper,34,7,74,unit_del,1,1] {+} apart_point_and_line($c1,line_connecting($c1,$c3)).
% 1.51/1.75  98 [hyper,92,7,87,unit_del,1,1] {-} $F.
% 1.51/1.75  
% 1.51/1.75  % SZS output end Refutation
% 1.51/1.75  ------------ end of proof -------------
% 1.51/1.75  
% 1.51/1.75  
% 1.51/1.75  Search stopped by max_proofs option.
% 1.51/1.75  
% 1.51/1.75  
% 1.51/1.75  Search stopped by max_proofs option.
% 1.51/1.75  
% 1.51/1.75  ============ end of search ============
% 1.51/1.75  
% 1.51/1.75  ----------- soft-scott stats ----------
% 1.51/1.75  
% 1.51/1.75  true clauses given           2      (6.2%)
% 1.51/1.75  false clauses given         30
% 1.51/1.75  
% 1.51/1.75        FALSE     TRUE
% 1.51/1.75     5  1         0
% 1.51/1.75     9  3         0
% 1.51/1.75    11  0         2
% 1.51/1.75    12  18        0
% 1.51/1.75    19  0         1
% 1.51/1.75    22  0         6
% 1.51/1.75    25  0         13
% 1.51/1.75  tot:  22        22      (50.0% true)
% 1.51/1.75  
% 1.51/1.75  
% 1.51/1.75  Model 19 [ 39 1 468 ] (0.00 seconds, 250000 Inserts)
% 1.51/1.75  
% 1.51/1.75  That finishes the proof of the theorem.
% 1.51/1.75  
% 1.51/1.75  Process 4215 finished Sat Jun 18 01:02:11 2022
%------------------------------------------------------------------------------