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

View Problem - Process Solution

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

% Computer : n021.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:52 EDT 2022

% Result   : Theorem 0.18s 0.46s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11  % Problem  : GEO186+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12  % Command  : sos-script %s
% 0.12/0.33  % Computer : n021.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  : 600
% 0.12/0.33  % DateTime : Fri Jun 17 16:53:16 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.12/0.35  ----- Otter 3.2, August 2001 -----
% 0.12/0.35  The process was started by sandbox on n021.cluster.edu,
% 0.12/0.35  Fri Jun 17 16:53:16 2022
% 0.12/0.35  The command was "./sos".  The process ID is 12746.
% 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.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: 16
% 0.12/0.38  number of clauses initially in problem: 19
% 0.12/0.38  percentage of clauses intially in UL: 84
% 0.12/0.38  percentage of distinct symbols occuring in initial UL: 90
% 0.12/0.38  percent of all initial clauses that are short: 100
% 0.12/0.38  absolute distinct symbol count: 10
% 0.12/0.38     distinct predicate count: 4
% 0.12/0.38     distinct function count: 2
% 0.12/0.38     distinct constant count: 4
% 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  Model 2 (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  =========== start of search ===========
% 0.18/0.46  
% 0.18/0.46  -------- PROOF -------- 
% 0.18/0.46  % SZS status Theorem
% 0.18/0.46  % SZS output start Refutation
% 0.18/0.46  
% 0.18/0.46  Model 3 (0.00 seconds, 0 Inserts)
% 0.18/0.46  
% 0.18/0.46  Stopped by limit on number of solutions
% 0.18/0.46  
% 0.18/0.46  ----> UNIT CONFLICT at   0.09 sec ----> 191 [binary,190.1,3.1] {-} $F.
% 0.18/0.46  
% 0.18/0.46  Length of proof is 15.  Level of proof is 11.
% 0.18/0.46  
% 0.18/0.46  ---------------- PROOF ----------------
% 0.18/0.46  % SZS status Theorem
% 0.18/0.46  % SZS output start Refutation
% 0.18/0.46  
% 0.18/0.46  1 [] {+} -distinct_points(A,A).
% 0.18/0.46  3 [] {+} -convergent_lines(A,A).
% 0.18/0.46  4 [] {+} -distinct_points(A,B)|distinct_points(A,C)|distinct_points(B,C).
% 0.18/0.46  6 [] {+} -convergent_lines(A,B)|convergent_lines(A,C)|convergent_lines(B,C).
% 0.18/0.46  9 [] {+} -convergent_lines(A,B)| -apart_point_and_line(intersection_point(A,B),A).
% 0.18/0.46  10 [] {+} -convergent_lines(A,B)| -apart_point_and_line(intersection_point(A,B),B).
% 0.18/0.46  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).
% 0.18/0.46  14 [] {+} -convergent_lines(A,B)|distinct_lines(B,C)|convergent_lines(A,C).
% 0.18/0.46  15 [] {+} -apart_point_and_line($c4,$c2).
% 0.18/0.46  16 [] {+} -apart_point_and_line($c4,$c1).
% 0.18/0.46  18 [] {+} convergent_lines($c2,$c1).
% 0.18/0.46  19 [] {-} distinct_points($c4,intersection_point($c2,$c1)).
% 0.18/0.46  21 [hyper,19,4] {-} distinct_points($c4,A)|distinct_points(intersection_point($c2,$c1),A).
% 0.18/0.46  22 [hyper,21,4] {-} distinct_points(intersection_point($c2,$c1),A)|distinct_points($c4,B)|distinct_points(A,B).
% 0.18/0.46  25 [hyper,18,14] {+} distinct_lines($c1,A)|convergent_lines($c2,A).
% 0.18/0.46  26 [hyper,18,6] {+} convergent_lines($c2,A)|convergent_lines($c1,A).
% 0.18/0.46  32 [hyper,22,1] {-} distinct_points(intersection_point($c2,$c1),A)|distinct_points(A,$c4).
% 0.18/0.46  35 [hyper,32,4] {-} distinct_points(A,$c4)|distinct_points(intersection_point($c2,$c1),B)|distinct_points(A,B).
% 0.18/0.46  41 [hyper,25,11,35] {-} convergent_lines($c2,A)|apart_point_and_line(B,$c1)|apart_point_and_line(B,A)|apart_point_and_line(C,$c1)|apart_point_and_line(C,A)|distinct_points(B,$c4)|distinct_points(intersection_point($c2,$c1),C).
% 0.18/0.46  63 [hyper,26,3] {+} convergent_lines($c1,$c2).
% 0.18/0.46  66 [hyper,63,14] {+} distinct_lines($c2,A)|convergent_lines($c1,A).
% 0.18/0.46  162 [hyper,41,11,66,unit_del,15] {-} convergent_lines($c2,A)|apart_point_and_line(B,$c1)|apart_point_and_line(B,A)|apart_point_and_line(C,$c1)|apart_point_and_line(C,A)|distinct_points(intersection_point($c2,$c1),C)|apart_point_and_line(B,$c2)|apart_point_and_line(B,D)|apart_point_and_line($c4,D)|convergent_lines($c1,D).
% 0.18/0.46  166 [factor,162.2.8,unit_del,16,3] {+} convergent_lines($c2,A)|apart_point_and_line(B,$c1)|apart_point_and_line(B,A)|apart_point_and_line(C,$c1)|apart_point_and_line(C,A)|distinct_points(intersection_point($c2,$c1),C)|apart_point_and_line(B,$c2).
% 0.18/0.46  173 [factor,166.3.7,unit_del,3,factor_simp,factor_simp] {-} apart_point_and_line(A,$c1)|apart_point_and_line(A,$c2)|distinct_points(intersection_point($c2,$c1),A).
% 0.18/0.46  178 [hyper,173,1] {-} apart_point_and_line(intersection_point($c2,$c1),$c1)|apart_point_and_line(intersection_point($c2,$c1),$c2).
% 0.18/0.46  184 [hyper,178,10,26,unit_del,3] {+} apart_point_and_line(intersection_point($c2,$c1),$c2).
% 0.18/0.46  190 [hyper,184,9,26] {-} convergent_lines($c1,$c1).
% 0.18/0.46  191 [binary,190.1,3.1] {-} $F.
% 0.18/0.46  
% 0.18/0.46  % SZS output end Refutation
% 0.18/0.46  ------------ end of proof -------------
% 0.18/0.46  
% 0.18/0.46  
% 0.18/0.46  Search stopped by max_proofs option.
% 0.18/0.46  
% 0.18/0.46  
% 0.18/0.46  Search stopped by max_proofs option.
% 0.18/0.46  
% 0.18/0.46  ============ end of search ============
% 0.18/0.46  
% 0.18/0.46  ----------- soft-scott stats ----------
% 0.18/0.46  
% 0.18/0.46  true clauses given          11      (31.4%)
% 0.18/0.46  false clauses given         24
% 0.18/0.46  
% 0.18/0.46        FALSE     TRUE
% 0.18/0.46     5  0         1
% 0.18/0.46     9  6         2
% 0.18/0.46    12  0         6
% 0.18/0.46    14  0         6
% 0.18/0.46    15  0         4
% 0.18/0.46    17  0         16
% 0.18/0.46    18  0         8
% 0.18/0.46    20  0         8
% 0.18/0.46    21  0         6
% 0.18/0.46    23  0         16
% 0.18/0.46    26  0         14
% 0.18/0.46    29  0         1
% 0.18/0.46  tot:  6         88      (93.6% true)
% 0.18/0.46  
% 0.18/0.46  
% 0.18/0.46  Model 3 (0.00 seconds, 0 Inserts)
% 0.18/0.46  
% 0.18/0.46  That finishes the proof of the theorem.
% 0.18/0.46  
% 0.18/0.46  Process 12746 finished Fri Jun 17 16:53:16 2022
%------------------------------------------------------------------------------