TSTP Solution File: GEO015-3 by SOS---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : GEO015-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

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

% Result   : Unsatisfiable 0.23s 0.53s
% Output   : Refutation 0.23s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14  % Problem  : GEO015-3 : TPTP v8.1.0. Released v1.0.0.
% 0.08/0.15  % Command  : sos-script %s
% 0.16/0.37  % Computer : n014.cluster.edu
% 0.16/0.37  % Model    : x86_64 x86_64
% 0.16/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37  % Memory   : 8042.1875MB
% 0.16/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37  % CPULimit : 300
% 0.16/0.37  % WCLimit  : 600
% 0.16/0.37  % DateTime : Sat Jun 18 01:39:34 EDT 2022
% 0.16/0.37  % CPUTime  : 
% 0.16/0.39  ----- Otter 3.2, August 2001 -----
% 0.16/0.39  The process was started by sandbox on n014.cluster.edu,
% 0.16/0.39  Sat Jun 18 01:39:34 2022
% 0.16/0.39  The command was "./sos".  The process ID is 23383.
% 0.16/0.39  
% 0.16/0.39  set(prolog_style_variables).
% 0.16/0.39  set(auto).
% 0.16/0.39     dependent: set(auto1).
% 0.16/0.39     dependent: set(process_input).
% 0.16/0.39     dependent: clear(print_kept).
% 0.16/0.39     dependent: clear(print_new_demod).
% 0.16/0.39     dependent: clear(print_back_demod).
% 0.16/0.39     dependent: clear(print_back_sub).
% 0.16/0.39     dependent: set(control_memory).
% 0.16/0.39     dependent: assign(max_mem, 12000).
% 0.16/0.39     dependent: assign(pick_given_ratio, 4).
% 0.16/0.39     dependent: assign(stats_level, 1).
% 0.16/0.39     dependent: assign(pick_semantic_ratio, 3).
% 0.16/0.39     dependent: assign(sos_limit, 5000).
% 0.16/0.39     dependent: assign(max_weight, 60).
% 0.16/0.39  clear(print_given).
% 0.16/0.39  
% 0.16/0.39  list(usable).
% 0.16/0.39  
% 0.16/0.39  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 0.16/0.39  
% 0.16/0.39  This ia a non-Horn set with equality.  The strategy will be
% 0.16/0.39  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.16/0.39  unit deletion, with positive clauses in sos and nonpositive
% 0.16/0.39  clauses in usable.
% 0.16/0.39  
% 0.16/0.39     dependent: set(knuth_bendix).
% 0.16/0.39     dependent: set(para_from).
% 0.16/0.39     dependent: set(para_into).
% 0.16/0.39     dependent: clear(para_from_right).
% 0.16/0.39     dependent: clear(para_into_right).
% 0.16/0.39     dependent: set(para_from_vars).
% 0.16/0.39     dependent: set(eq_units_both_ways).
% 0.16/0.39     dependent: set(dynamic_demod_all).
% 0.16/0.39     dependent: set(dynamic_demod).
% 0.16/0.39     dependent: set(order_eq).
% 0.16/0.39     dependent: set(back_demod).
% 0.16/0.39     dependent: set(lrpo).
% 0.16/0.39     dependent: set(hyper_res).
% 0.16/0.39     dependent: set(unit_deletion).
% 0.16/0.39     dependent: set(factor).
% 0.16/0.39  
% 0.16/0.39  ------------> process usable:
% 0.16/0.39  
% 0.16/0.39  ------------> process sos:
% 0.16/0.39  35 back subsumes 32.
% 0.16/0.39  38 back subsumes 31.
% 0.16/0.39  38 back subsumes 17.
% 0.16/0.39    Following clause subsumed by 40 during input processing: 0 [copy,40,flip.1] {-} A=A.
% 0.16/0.39  
% 0.16/0.39  ======= end of input processing =======
% 0.23/0.51  
% 0.23/0.51  Model 1 (0.00 seconds, 0 Inserts)
% 0.23/0.51  
% 0.23/0.51  Stopped by limit on number of solutions
% 0.23/0.51  
% 0.23/0.51  
% 0.23/0.51  -------------- Softie stats --------------
% 0.23/0.51  
% 0.23/0.51  UPDATE_STOP: 300
% 0.23/0.51  SFINDER_TIME_LIMIT: 2
% 0.23/0.51  SHORT_CLAUSE_CUTOFF: 4
% 0.23/0.51  number of clauses in intial UL: 31
% 0.23/0.51  number of clauses initially in problem: 37
% 0.23/0.51  percentage of clauses intially in UL: 83
% 0.23/0.51  percentage of distinct symbols occuring in initial UL: 93
% 0.23/0.51  percent of all initial clauses that are short: 100
% 0.23/0.51  absolute distinct symbol count: 15
% 0.23/0.51     distinct predicate count: 3
% 0.23/0.51     distinct function count: 5
% 0.23/0.51     distinct constant count: 7
% 0.23/0.51  
% 0.23/0.51  ---------- no more Softie stats ----------
% 0.23/0.51  
% 0.23/0.51  
% 0.23/0.51  
% 0.23/0.51  Model 2 (0.00 seconds, 0 Inserts)
% 0.23/0.51  
% 0.23/0.51  Stopped by limit on number of solutions
% 0.23/0.51  
% 0.23/0.51  =========== start of search ===========
% 0.23/0.53  
% 0.23/0.53  -------- PROOF -------- 
% 0.23/0.53  % SZS status Unsatisfiable
% 0.23/0.53  % SZS output start Refutation
% 0.23/0.53  
% 0.23/0.53  ----> UNIT CONFLICT at   0.11 sec ----> 112 [binary,111.1,16.1] {+} $F.
% 0.23/0.53  
% 0.23/0.53  Length of proof is 2.  Level of proof is 2.
% 0.23/0.53  
% 0.23/0.53  ---------------- PROOF ----------------
% 0.23/0.53  % SZS status Unsatisfiable
% 0.23/0.53  % SZS output start Refutation
% 0.23/0.53  
% 0.23/0.53  1 [] {+} -equidistant(A,B,C,D)| -equidistant(A,B,E,F)|equidistant(C,D,E,F).
% 0.23/0.53  16 [] {+} -equidistant(w,x,u,v).
% 0.23/0.53  35 [] {+} equidistant(A,B,B,A).
% 0.23/0.53  39 [] {-} equidistant(u,v,w,x).
% 0.23/0.53  41 [hyper,39,1,35] {-} equidistant(v,u,w,x).
% 0.23/0.53  111 [hyper,41,1,35] {-} equidistant(w,x,u,v).
% 0.23/0.53  112 [binary,111.1,16.1] {+} $F.
% 0.23/0.53  
% 0.23/0.53  % SZS output end Refutation
% 0.23/0.53  ------------ end of proof -------------
% 0.23/0.53  
% 0.23/0.53  
% 0.23/0.53  Search stopped by max_proofs option.
% 0.23/0.53  
% 0.23/0.53  
% 0.23/0.53  Search stopped by max_proofs option.
% 0.23/0.53  
% 0.23/0.53  ============ end of search ============
% 0.23/0.53  
% 0.23/0.53  ----------- soft-scott stats ----------
% 0.23/0.53  
% 0.23/0.53  true clauses given           0      (0.0%)
% 0.23/0.53  false clauses given          3
% 0.23/0.53  
% 0.23/0.53        FALSE     TRUE
% 0.23/0.53     3  0         1
% 0.23/0.53     5  1         1
% 0.23/0.53     8  1         0
% 0.23/0.53     9  2         3
% 0.23/0.53    10  4         0
% 0.23/0.53    14  4         0
% 0.23/0.53    18  1         7
% 0.23/0.53    22  2         6
% 0.23/0.53    23  1         4
% 0.23/0.53    24  0         4
% 0.23/0.53    27  5         3
% 0.23/0.53    28  0         3
% 0.23/0.53    32  4         0
% 0.23/0.53    33  0         12
% 0.23/0.53    38  0         4
% 0.23/0.53  tot:  25        48      (65.8% true)
% 0.23/0.53  
% 0.23/0.53  
% 0.23/0.53  Model 2 (0.00 seconds, 0 Inserts)
% 0.23/0.53  
% 0.23/0.53  That finishes the proof of the theorem.
% 0.23/0.53  
% 0.23/0.53  Process 23383 finished Sat Jun 18 01:39:34 2022
%------------------------------------------------------------------------------