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

View Problem - Process Solution

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

% Computer : n022.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:24 EDT 2022

% Result   : Theorem 0.40s 0.59s
% Output   : Refutation 0.40s
% Verified : 
% SZS Type : -

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