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

View Problem - Process Solution

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

% Computer : n024.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:42 EDT 2022

% Result   : Unsatisfiable 0.18s 0.54s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : KRS073+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.12  % Command  : sos-script %s
% 0.12/0.33  % Computer : n024.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 12:02:19 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 n024.cluster.edu,
% 0.12/0.35  Tue Jun  7 12:02:19 2022
% 0.12/0.35  The command was "./sos".  The process ID is 22247.
% 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  19 back subsumes 2.
% 0.12/0.35  
% 0.12/0.35  ------------> process sos:
% 0.12/0.35  45 back subsumes 3.
% 0.12/0.35    Following clause subsumed by 48 during input processing: 0 [copy,48,flip.1] {-} A=A.
% 0.12/0.35  48 back subsumes 44.
% 0.12/0.35  48 back subsumes 43.
% 0.12/0.35  48 back subsumes 42.
% 0.12/0.35  
% 0.12/0.35  ======= end of input processing =======
% 0.18/0.54  
% 0.18/0.54  Stopped by limit on insertions
% 0.18/0.54  
% 0.18/0.54  
% 0.18/0.54  Failed to model usable list: disabling FINDER
% 0.18/0.54  
% 0.18/0.54  
% 0.18/0.54  
% 0.18/0.54  -------------- Softie stats --------------
% 0.18/0.54  
% 0.18/0.54  UPDATE_STOP: 300
% 0.18/0.54  SFINDER_TIME_LIMIT: 2
% 0.18/0.54  SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.54  number of clauses in intial UL: 39
% 0.18/0.54  number of clauses initially in problem: 43
% 0.18/0.54  percentage of clauses intially in UL: 90
% 0.18/0.54  percentage of distinct symbols occuring in initial UL: 88
% 0.18/0.54  percent of all initial clauses that are short: 100
% 0.18/0.54  absolute distinct symbol count: 18
% 0.18/0.54     distinct predicate count: 13
% 0.18/0.54     distinct function count: 4
% 0.18/0.54     distinct constant count: 1
% 0.18/0.54  
% 0.18/0.54  ---------- no more Softie stats ----------
% 0.18/0.54  
% 0.18/0.54  
% 0.18/0.54  
% 0.18/0.54  =========== start of search ===========
% 0.18/0.54  
% 0.18/0.54  -------- PROOF -------- 
% 0.18/0.54  % SZS status Theorem
% 0.18/0.54  % SZS output start Refutation
% 0.18/0.54  
% 0.18/0.54  -----> EMPTY CLAUSE at   0.17 sec ----> 187 [hyper,177,25,47] {-} $F.
% 0.18/0.54  
% 0.18/0.54  Length of proof is 8.  Level of proof is 7.
% 0.18/0.54  
% 0.18/0.54  ---------------- PROOF ----------------
% 0.18/0.54  % SZS status Theorem
% 0.18/0.54  % SZS output start Refutation
% 0.18/0.54  
% 0.18/0.54  21 [] {+} -cUnsatisfiable(A)|rf(A,$f2(A)).
% 0.18/0.54  22 [] {+} -cUnsatisfiable(A)| -rinvS($f2(A),B)|cp(B).
% 0.18/0.54  23 [] {+} -cUnsatisfiable(A)| -rinvF($f2(A),B)|rs(B,$f1(A,B)).
% 0.18/0.54  25 [] {+} -cUnsatisfiable(A)| -cp(A).
% 0.18/0.54  30 [] {+} -rf(A,B)| -rf(A,C)|B=C.
% 0.18/0.54  33 [] {+} rinvF(A,B)| -rf(B,A).
% 0.18/0.54  37 [] {+} rinvS(A,B)| -rs(B,A).
% 0.18/0.54  40 [] {+} -rs(A,B)|rf(A,B).
% 0.18/0.54  47 [] {-} cUnsatisfiable(i2003_11_14_17_18_54369).
% 0.18/0.54  49 [hyper,47,21] {-} rf(i2003_11_14_17_18_54369,$f2(i2003_11_14_17_18_54369)).
% 0.18/0.54  53 [hyper,49,33] {-} rinvF($f2(i2003_11_14_17_18_54369),i2003_11_14_17_18_54369).
% 0.18/0.54  67 [hyper,53,23,47] {-} rs(i2003_11_14_17_18_54369,$f1(i2003_11_14_17_18_54369,i2003_11_14_17_18_54369)).
% 0.18/0.54  86 [hyper,67,40] {-} rf(i2003_11_14_17_18_54369,$f1(i2003_11_14_17_18_54369,i2003_11_14_17_18_54369)).
% 0.18/0.54  88 [hyper,67,37] {-} rinvS($f1(i2003_11_14_17_18_54369,i2003_11_14_17_18_54369),i2003_11_14_17_18_54369).
% 0.18/0.54  102 [hyper,86,30,49] {-} $f2(i2003_11_14_17_18_54369)=$f1(i2003_11_14_17_18_54369,i2003_11_14_17_18_54369).
% 0.18/0.54  176 [para_from,102.1.1,22.2.1,unit_del,47] {-} -rinvS($f1(i2003_11_14_17_18_54369,i2003_11_14_17_18_54369),A)|cp(A).
% 0.18/0.54  177 [hyper,176,88] {-} cp(i2003_11_14_17_18_54369).
% 0.18/0.54  187 [hyper,177,25,47] {-} $F.
% 0.18/0.54  
% 0.18/0.54  % SZS output end Refutation
% 0.18/0.54  ------------ end of proof -------------
% 0.18/0.54  
% 0.18/0.54  
% 0.18/0.54  Search stopped by max_proofs option.
% 0.18/0.54  
% 0.18/0.54  
% 0.18/0.54  Search stopped by max_proofs option.
% 0.18/0.54  
% 0.18/0.54  ============ end of search ============
% 0.18/0.54  
% 0.18/0.54  That finishes the proof of the theorem.
% 0.18/0.54  
% 0.18/0.54  Process 22247 finished Tue Jun  7 12:02:20 2022
%------------------------------------------------------------------------------