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

View Problem - Process Solution

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

% Computer : n003.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:27 EDT 2022

% Result   : Unsatisfiable 0.49s 0.71s
% Output   : Refutation 0.49s
% Verified : 
% SZS Type : -

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