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

View Problem - Process Solution

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

% Computer : n013.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:25 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : GEO226+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.13  % Command  : sos-script %s
% 0.13/0.34  % Computer : n013.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 : Sat Jun 18 10:19:59 EDT 2022
% 0.19/0.34  % CPUTime  : 
% 0.19/0.36  ----- Otter 3.2, August 2001 -----
% 0.19/0.36  The process was started by sandbox2 on n013.cluster.edu,
% 0.19/0.36  Sat Jun 18 10:19:59 2022
% 0.19/0.36  The command was "./sos".  The process ID is 28593.
% 0.19/0.36  
% 0.19/0.36  set(prolog_style_variables).
% 0.19/0.36  set(auto).
% 0.19/0.36     dependent: set(auto1).
% 0.19/0.36     dependent: set(process_input).
% 0.19/0.36     dependent: clear(print_kept).
% 0.19/0.36     dependent: clear(print_new_demod).
% 0.19/0.36     dependent: clear(print_back_demod).
% 0.19/0.36     dependent: clear(print_back_sub).
% 0.19/0.36     dependent: set(control_memory).
% 0.19/0.36     dependent: assign(max_mem, 12000).
% 0.19/0.36     dependent: assign(pick_given_ratio, 4).
% 0.19/0.36     dependent: assign(stats_level, 1).
% 0.19/0.36     dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.36     dependent: assign(sos_limit, 5000).
% 0.19/0.36     dependent: assign(max_weight, 60).
% 0.19/0.36  clear(print_given).
% 0.19/0.36  
% 0.19/0.36  formula_list(usable).
% 0.19/0.36  
% 0.19/0.36  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=6.
% 0.19/0.36  
% 0.19/0.36  This is a non-Horn set without equality.  The strategy
% 0.19/0.36  will be ordered hyper_res, ur_res, unit deletion, and
% 0.19/0.36  factoring, with satellites in sos and nuclei in usable.
% 0.19/0.36  
% 0.19/0.36     dependent: set(hyper_res).
% 0.19/0.36     dependent: set(factor).
% 0.19/0.36     dependent: set(unit_deletion).
% 0.19/0.36  
% 0.19/0.36  ------------> process usable:
% 0.19/0.36  
% 0.19/0.36  ------------> process sos:
% 0.19/0.36  22 back subsumes 16.
% 0.19/0.36  
% 0.19/0.36  ======= 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: 17
% 0.19/0.39  number of clauses initially in problem: 22
% 0.19/0.39  percentage of clauses intially in UL: 77
% 0.19/0.39  percentage of distinct symbols occuring in initial UL: 83
% 0.19/0.39  percent of all initial clauses that are short: 100
% 0.19/0.39  absolute distinct symbol count: 12
% 0.19/0.39     distinct predicate count: 6
% 0.19/0.39     distinct function count: 4
% 0.19/0.39     distinct constant count: 2
% 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 ===========
% 0.46/0.68  
% 0.46/0.68  -------- PROOF -------- 
% 0.46/0.68  % SZS status Theorem
% 0.46/0.68  % SZS output start Refutation
% 0.46/0.68  
% 0.46/0.68  Model 3 (0.00 seconds, 0 Inserts)
% 0.46/0.68  
% 0.46/0.68  Stopped by limit on number of solutions
% 0.46/0.68  
% 0.46/0.68  Model 4 (0.00 seconds, 0 Inserts)
% 0.46/0.68  
% 0.46/0.68  Stopped by limit on number of solutions
% 0.46/0.68  
% 0.46/0.68  Model 5 (0.00 seconds, 0 Inserts)
% 0.46/0.68  
% 0.46/0.68  Stopped by limit on number of solutions
% 0.46/0.68  
% 0.46/0.68  Stopped by limit on insertions
% 0.46/0.68  
% 0.46/0.68  Model 6 [ 2 0 91 ] (0.00 seconds, 250000 Inserts)
% 0.46/0.68  
% 0.46/0.68  Stopped by limit on insertions
% 0.46/0.68  
% 0.46/0.68  Model 7 [ 2 0 91 ] (0.00 seconds, 250000 Inserts)
% 0.46/0.68  
% 0.46/0.68  Stopped by limit on insertions
% 0.46/0.68  
% 0.46/0.68  Model 8 [ 3 0 469 ] (0.00 seconds, 250000 Inserts)
% 0.46/0.68  
% 0.46/0.68  -----> EMPTY CLAUSE at   0.30 sec ----> 44 [hyper,37,9,21] {-} $F.
% 0.46/0.68  
% 0.46/0.68  Length of proof is 1.  Level of proof is 1.
% 0.46/0.68  
% 0.46/0.68  ---------------- PROOF ----------------
% 0.46/0.68  % SZS status Theorem
% 0.46/0.68  % SZS output start Refutation
% 0.46/0.68  
% 0.46/0.68  9 [] {+} -convergent_lines(A,B)| -apart_point_and_line(intersection_point(A,B),A).
% 0.46/0.68  10 [] {+} -convergent_lines(A,B)| -apart_point_and_line(intersection_point(A,B),B).
% 0.46/0.68  21 [] {+} convergent_lines($c2,$c1).
% 0.46/0.68  23 [] {+} apart_point_and_line(A,$c2)|apart_point_and_line(A,$c1).
% 0.46/0.68  37 [hyper,23,10,21] {+} apart_point_and_line(intersection_point($c2,$c1),$c2).
% 0.46/0.68  44 [hyper,37,9,21] {-} $F.
% 0.46/0.68  
% 0.46/0.68  % SZS output end Refutation
% 0.46/0.68  ------------ end of proof -------------
% 0.46/0.68  
% 0.46/0.68  
% 0.46/0.68  Search stopped by max_proofs option.
% 0.46/0.68  
% 0.46/0.68  
% 0.46/0.68  Search stopped by max_proofs option.
% 0.46/0.68  
% 0.46/0.68  ============ end of search ============
% 0.46/0.68  
% 0.46/0.68  ----------- soft-scott stats ----------
% 0.46/0.68  
% 0.46/0.68  true clauses given           1      (12.5%)
% 0.46/0.68  false clauses given          7
% 0.46/0.68  
% 0.46/0.68        FALSE     TRUE
% 0.46/0.68     4  0         2
% 0.46/0.68     5  0         1
% 0.46/0.68     6  4         4
% 0.46/0.68     9  4         0
% 0.46/0.68  tot:  8         7      (46.7% true)
% 0.46/0.68  
% 0.46/0.68  
% 0.46/0.68  Model 8 [ 3 0 469 ] (0.00 seconds, 250000 Inserts)
% 0.46/0.68  
% 0.46/0.68  That finishes the proof of the theorem.
% 0.46/0.68  
% 0.46/0.68  Process 28593 finished Sat Jun 18 10:19:59 2022
%------------------------------------------------------------------------------