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

View Problem - Process Solution

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

% Computer : n026.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 : Sun Jul 17 03:29:43 EDT 2022

% Result   : Unsatisfiable 0.39s 0.57s
% Output   : Refutation 0.39s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : KRS085+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.12  % Command  : sos-script %s
% 0.12/0.33  % Computer : n026.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 : Tue Jun  7 08:45:01 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.12/0.35  ----- Otter 3.2, August 2001 -----
% 0.12/0.35  The process was started by sandbox on n026.cluster.edu,
% 0.12/0.35  Tue Jun  7 08:45:01 2022
% 0.12/0.35  The command was "./sos".  The process ID is 18593.
% 0.12/0.35  
% 0.12/0.35  set(prolog_style_variables).
% 0.12/0.35  set(auto).
% 0.12/0.35     dependent: set(auto1).
% 0.12/0.35     dependent: set(process_input).
% 0.12/0.35     dependent: clear(print_kept).
% 0.12/0.35     dependent: clear(print_new_demod).
% 0.12/0.35     dependent: clear(print_back_demod).
% 0.12/0.35     dependent: clear(print_back_sub).
% 0.12/0.35     dependent: set(control_memory).
% 0.12/0.35     dependent: assign(max_mem, 12000).
% 0.12/0.35     dependent: assign(pick_given_ratio, 4).
% 0.12/0.35     dependent: assign(stats_level, 1).
% 0.12/0.35     dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35     dependent: assign(sos_limit, 5000).
% 0.12/0.35     dependent: assign(max_weight, 60).
% 0.12/0.35  clear(print_given).
% 0.12/0.35  
% 0.12/0.35  formula_list(usable).
% 0.12/0.35  
% 0.12/0.35  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 0.12/0.35  
% 0.12/0.35  This ia a non-Horn set with equality.  The strategy will be
% 0.12/0.35  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.35  unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.35  clauses in usable.
% 0.12/0.35  
% 0.12/0.35     dependent: set(knuth_bendix).
% 0.12/0.35     dependent: set(para_from).
% 0.12/0.35     dependent: set(para_into).
% 0.12/0.35     dependent: clear(para_from_right).
% 0.12/0.35     dependent: clear(para_into_right).
% 0.12/0.35     dependent: set(para_from_vars).
% 0.12/0.35     dependent: set(eq_units_both_ways).
% 0.12/0.35     dependent: set(dynamic_demod_all).
% 0.12/0.35     dependent: set(dynamic_demod).
% 0.12/0.35     dependent: set(order_eq).
% 0.12/0.35     dependent: set(back_demod).
% 0.12/0.35     dependent: set(lrpo).
% 0.12/0.35     dependent: set(hyper_res).
% 0.12/0.35     dependent: set(unit_deletion).
% 0.12/0.35     dependent: set(factor).
% 0.12/0.35  
% 0.12/0.35  ------------> process usable:
% 0.12/0.35  15 back subsumes 2.
% 0.12/0.35  
% 0.12/0.35  ------------> process sos:
% 0.12/0.35  35 back subsumes 3.
% 0.12/0.35    Following clause subsumed by 38 during input processing: 0 [copy,38,flip.1] {-} A=A.
% 0.12/0.35  38 back subsumes 34.
% 0.12/0.35  
% 0.12/0.35  ======= 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: 31
% 0.19/0.39  number of clauses initially in problem: 35
% 0.19/0.39  percentage of clauses intially in UL: 88
% 0.19/0.39  percentage of distinct symbols occuring in initial UL: 93
% 0.19/0.39  percent of all initial clauses that are short: 100
% 0.19/0.39  absolute distinct symbol count: 15
% 0.19/0.39     distinct predicate count: 11
% 0.19/0.39     distinct function count: 3
% 0.19/0.39     distinct constant count: 1
% 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.39/0.57  
% 0.39/0.57  -------- PROOF -------- 
% 0.39/0.57  % SZS status Theorem
% 0.39/0.57  % SZS output start Refutation
% 0.39/0.57  
% 0.39/0.57  Model 3 [ 1 0 294 ] (0.00 seconds, 5909 Inserts)
% 0.39/0.57  
% 0.39/0.57  Model 4 [ 1 0 232 ] (0.00 seconds, 15841 Inserts)
% 0.39/0.57  
% 0.39/0.57  Stopped by limit on insertions
% 0.39/0.57  
% 0.39/0.57  -----> EMPTY CLAUSE at   0.20 sec ----> 65 [hyper,60,20,37,39] {-} $F.
% 0.39/0.57  
% 0.39/0.57  Length of proof is 5.  Level of proof is 3.
% 0.39/0.57  
% 0.39/0.57  ---------------- PROOF ----------------
% 0.39/0.57  % SZS status Theorem
% 0.39/0.57  % SZS output start Refutation
% 0.39/0.57  
% 0.39/0.57  17 [] {+} -cUnsatisfiable(A)|rr(A,$f2(A)).
% 0.39/0.57  18 [] {+} -cUnsatisfiable(A)|rr($f2(A),$f1(A)).
% 0.39/0.57  20 [] {+} -cUnsatisfiable(A)| -rinvR($f1(A),B)| -cp1(B).
% 0.39/0.57  21 [] {+} -cUnsatisfiable(A)|cp1(A).
% 0.39/0.57  28 [] {+} rinvR(A,B)| -rr(B,A).
% 0.39/0.57  29 [] {+} -rr(A,B)| -rr(B,C)|rr(A,C).
% 0.39/0.57  37 [] {-} cUnsatisfiable(i2003_11_14_17_19_39537).
% 0.39/0.57  39 [hyper,37,21] {+} cp1(i2003_11_14_17_19_39537).
% 0.39/0.57  41 [hyper,37,18] {+} rr($f2(i2003_11_14_17_19_39537),$f1(i2003_11_14_17_19_39537)).
% 0.39/0.57  42 [hyper,37,17] {+} rr(i2003_11_14_17_19_39537,$f2(i2003_11_14_17_19_39537)).
% 0.39/0.57  54 [hyper,41,29,42] {+} rr(i2003_11_14_17_19_39537,$f1(i2003_11_14_17_19_39537)).
% 0.39/0.57  60 [hyper,54,28] {+} rinvR($f1(i2003_11_14_17_19_39537),i2003_11_14_17_19_39537).
% 0.39/0.57  65 [hyper,60,20,37,39] {-} $F.
% 0.39/0.57  
% 0.39/0.57  % SZS output end Refutation
% 0.39/0.57  ------------ end of proof -------------
% 0.39/0.57  
% 0.39/0.57  
% 0.39/0.57  Search stopped by max_proofs option.
% 0.39/0.57  
% 0.39/0.57  
% 0.39/0.57  Search stopped by max_proofs option.
% 0.39/0.57  
% 0.39/0.57  ============ end of search ============
% 0.39/0.57  
% 0.39/0.57  ----------- soft-scott stats ----------
% 0.39/0.57  
% 0.39/0.57  true clauses given           7      (58.3%)
% 0.39/0.57  false clauses given          5
% 0.39/0.57  
% 0.39/0.57        FALSE     TRUE
% 0.39/0.57     5  0         1
% 0.39/0.57     8  0         1
% 0.39/0.57     9  0         2
% 0.39/0.57    10  0         9
% 0.39/0.57    11  0         4
% 0.39/0.57    14  0         1
% 0.39/0.57  tot:  0         18      (100.0% true)
% 0.39/0.57  
% 0.39/0.57  
% 0.39/0.57  Model 4 [ 1 -2 232 ] (0.00 seconds, 15841 Inserts)
% 0.39/0.57  
% 0.39/0.57  That finishes the proof of the theorem.
% 0.39/0.57  
% 0.39/0.57  Process 18593 finished Tue Jun  7 08:45:01 2022
%------------------------------------------------------------------------------