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

View Problem - Process Solution

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

% Computer : n017.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:35 EDT 2022

% Result   : Unsatisfiable 1.37s 1.53s
% Output   : Refutation 1.37s
% Verified : 
% SZS Type : -

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