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

View Problem - Process Solution

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

% Computer : n009.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:05 EDT 2022

% Result   : Theorem 0.20s 0.48s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GEO201+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13  % Command  : sos-script %s
% 0.13/0.34  % Computer : n009.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Fri Jun 17 17:02:37 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.13/0.36  ----- Otter 3.2, August 2001 -----
% 0.13/0.36  The process was started by sandbox on n009.cluster.edu,
% 0.13/0.36  Fri Jun 17 17:02:38 2022
% 0.13/0.36  The command was "./sos".  The process ID is 13104.
% 0.13/0.36  
% 0.13/0.36  set(prolog_style_variables).
% 0.13/0.36  set(auto).
% 0.13/0.36     dependent: set(auto1).
% 0.13/0.36     dependent: set(process_input).
% 0.13/0.36     dependent: clear(print_kept).
% 0.13/0.36     dependent: clear(print_new_demod).
% 0.13/0.36     dependent: clear(print_back_demod).
% 0.13/0.36     dependent: clear(print_back_sub).
% 0.13/0.36     dependent: set(control_memory).
% 0.13/0.36     dependent: assign(max_mem, 12000).
% 0.13/0.36     dependent: assign(pick_given_ratio, 4).
% 0.13/0.36     dependent: assign(stats_level, 1).
% 0.13/0.36     dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36     dependent: assign(sos_limit, 5000).
% 0.13/0.36     dependent: assign(max_weight, 60).
% 0.13/0.36  clear(print_given).
% 0.13/0.36  
% 0.13/0.36  formula_list(usable).
% 0.13/0.36  
% 0.13/0.36  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=6.
% 0.13/0.36  
% 0.13/0.36  This is a non-Horn set without equality.  The strategy
% 0.13/0.36  will be ordered hyper_res, ur_res, unit deletion, and
% 0.13/0.36  factoring, with satellites in sos and nuclei in usable.
% 0.13/0.36  
% 0.13/0.36     dependent: set(hyper_res).
% 0.13/0.36     dependent: set(factor).
% 0.13/0.36     dependent: set(unit_deletion).
% 0.13/0.36  
% 0.13/0.36  ------------> process usable:
% 0.13/0.36  
% 0.13/0.36  ------------> process sos:
% 0.13/0.36  
% 0.13/0.36  ======= end of input processing =======
% 0.20/0.39  
% 0.20/0.39  Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.39  
% 0.20/0.39  Stopped by limit on number of solutions
% 0.20/0.39  
% 0.20/0.39  
% 0.20/0.39  -------------- Softie stats --------------
% 0.20/0.39  
% 0.20/0.39  UPDATE_STOP: 300
% 0.20/0.39  SFINDER_TIME_LIMIT: 2
% 0.20/0.39  SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.39  number of clauses in intial UL: 14
% 0.20/0.39  number of clauses initially in problem: 16
% 0.20/0.39  percentage of clauses intially in UL: 87
% 0.20/0.39  percentage of distinct symbols occuring in initial UL: 75
% 0.20/0.39  percent of all initial clauses that are short: 100
% 0.20/0.39  absolute distinct symbol count: 8
% 0.20/0.39     distinct predicate count: 4
% 0.20/0.39     distinct function count: 2
% 0.20/0.39     distinct constant count: 2
% 0.20/0.39  
% 0.20/0.39  ---------- no more Softie stats ----------
% 0.20/0.39  
% 0.20/0.39  
% 0.20/0.39  
% 0.20/0.39  Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.39  
% 0.20/0.39  Stopped by limit on number of solutions
% 0.20/0.39  
% 0.20/0.39  =========== start of search ===========
% 0.20/0.48  
% 0.20/0.48  -------- PROOF -------- 
% 0.20/0.48  % SZS status Theorem
% 0.20/0.48  % SZS output start Refutation
% 0.20/0.48  
% 0.20/0.48  Stopped by limit on insertions
% 0.20/0.48  
% 0.20/0.48  Model 3 [ 1 0 63 ] (0.00 seconds, 250000 Inserts)
% 0.20/0.48  
% 0.20/0.48  -----> EMPTY CLAUSE at   0.09 sec ----> 119 [hyper,113,10,18,unit_del,1,3] {-} $F.
% 0.20/0.48  
% 0.20/0.48  Length of proof is 9.  Level of proof is 6.
% 0.20/0.48  
% 0.20/0.48  ---------------- PROOF ----------------
% 0.20/0.48  % SZS status Theorem
% 0.20/0.48  % SZS output start Refutation
% 0.20/0.48  
% 0.20/0.48  1 [] {+} -distinct_points(A,A).
% 0.20/0.48  3 [] {+} -convergent_lines(A,A).
% 0.20/0.48  4 [] {+} -distinct_points(A,B)|distinct_points(A,C)|distinct_points(B,C).
% 0.20/0.48  6 [] {+} -convergent_lines(A,B)|convergent_lines(A,C)|convergent_lines(B,C).
% 0.20/0.48  9 [] {+} -convergent_lines(A,B)| -apart_point_and_line(C,A)|distinct_points(C,intersection_point(A,B)).
% 0.20/0.48  10 [] {+} -convergent_lines(A,B)| -apart_point_and_line(C,B)|distinct_points(C,intersection_point(A,B)).
% 0.20/0.48  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.20/0.48  14 [] {+} -convergent_lines(A,B)|distinct_lines(A,B).
% 0.20/0.48  15 [] {+} convergent_lines($c2,$c1).
% 0.20/0.48  16 [] {-} distinct_points(intersection_point($c2,$c1),intersection_point($c1,$c2)).
% 0.20/0.48  17 [hyper,15,14] {+} distinct_lines($c2,$c1).
% 0.20/0.48  18 [hyper,15,6] {+} convergent_lines($c2,A)|convergent_lines($c1,A).
% 0.20/0.48  19 [hyper,16,4] {-} distinct_points(intersection_point($c2,$c1),A)|distinct_points(intersection_point($c1,$c2),A).
% 0.20/0.48  21 [hyper,19,1] {-} distinct_points(intersection_point($c1,$c2),intersection_point($c2,$c1)).
% 0.20/0.48  23 [hyper,17,11,21] {-} apart_point_and_line(intersection_point($c1,$c2),$c2)|apart_point_and_line(intersection_point($c1,$c2),$c1)|apart_point_and_line(intersection_point($c2,$c1),$c2)|apart_point_and_line(intersection_point($c2,$c1),$c1).
% 0.20/0.48  29 [hyper,18,3] {+} convergent_lines($c1,$c2).
% 0.20/0.48  59 [hyper,23,10,29,unit_del,1] {-} apart_point_and_line(intersection_point($c1,$c2),$c1)|apart_point_and_line(intersection_point($c2,$c1),$c2)|apart_point_and_line(intersection_point($c2,$c1),$c1).
% 0.20/0.48  102 [hyper,59,9,29,unit_del,1] {-} apart_point_and_line(intersection_point($c2,$c1),$c2)|apart_point_and_line(intersection_point($c2,$c1),$c1).
% 0.20/0.48  113 [hyper,102,9,15,unit_del,1] {+} apart_point_and_line(intersection_point($c2,$c1),$c1).
% 0.20/0.48  119 [hyper,113,10,18,unit_del,1,3] {-} $F.
% 0.20/0.48  
% 0.20/0.48  % SZS output end Refutation
% 0.20/0.48  ------------ end of proof -------------
% 0.20/0.48  
% 0.20/0.48  
% 0.20/0.48  Search stopped by max_proofs option.
% 0.20/0.48  
% 0.20/0.48  
% 0.20/0.48  Search stopped by max_proofs option.
% 0.20/0.48  
% 0.20/0.48  ============ end of search ============
% 0.20/0.48  
% 0.20/0.48  ----------- soft-scott stats ----------
% 0.20/0.48  
% 0.20/0.48  true clauses given           5      (25.0%)
% 0.20/0.48  false clauses given         15
% 0.20/0.48  
% 0.20/0.48        FALSE     TRUE
% 0.20/0.48     5  0         1
% 0.20/0.48     6  2         0
% 0.20/0.48     9  4         0
% 0.20/0.48    16  8         0
% 0.20/0.48    21  0         2
% 0.20/0.48    22  0         3
% 0.20/0.48    24  0         7
% 0.20/0.48    25  0         6
% 0.20/0.48    27  0         6
% 0.20/0.48  tot:  14        25      (64.1% true)
% 0.20/0.48  
% 0.20/0.48  
% 0.20/0.48  Model 3 [ 1 0 63 ] (0.00 seconds, 250000 Inserts)
% 0.20/0.48  
% 0.20/0.48  That finishes the proof of the theorem.
% 0.20/0.48  
% 0.20/0.48  Process 13104 finished Fri Jun 17 17:02:38 2022
%------------------------------------------------------------------------------