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

View Problem - Process Solution

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

% Computer : n027.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:44 EDT 2022

% Result   : Unsatisfiable 0.45s 0.64s
% Output   : Refutation 0.45s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : KRS090+1 : TPTP v8.1.0. Released v3.1.0.
% 0.06/0.12  % Command  : sos-script %s
% 0.11/0.33  % Computer : n027.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 600
% 0.11/0.33  % DateTime : Tue Jun  7 08:03:25 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.11/0.35  ----- Otter 3.2, August 2001 -----
% 0.11/0.35  The process was started by sandbox2 on n027.cluster.edu,
% 0.11/0.35  Tue Jun  7 08:03:25 2022
% 0.11/0.35  The command was "./sos".  The process ID is 4588.
% 0.11/0.35  
% 0.11/0.35  set(prolog_style_variables).
% 0.11/0.35  set(auto).
% 0.11/0.35     dependent: set(auto1).
% 0.11/0.35     dependent: set(process_input).
% 0.11/0.35     dependent: clear(print_kept).
% 0.11/0.35     dependent: clear(print_new_demod).
% 0.11/0.35     dependent: clear(print_back_demod).
% 0.11/0.35     dependent: clear(print_back_sub).
% 0.11/0.35     dependent: set(control_memory).
% 0.11/0.35     dependent: assign(max_mem, 12000).
% 0.11/0.35     dependent: assign(pick_given_ratio, 4).
% 0.11/0.35     dependent: assign(stats_level, 1).
% 0.11/0.35     dependent: assign(pick_semantic_ratio, 3).
% 0.11/0.35     dependent: assign(sos_limit, 5000).
% 0.11/0.35     dependent: assign(max_weight, 60).
% 0.11/0.35  clear(print_given).
% 0.11/0.35  
% 0.11/0.35  formula_list(usable).
% 0.11/0.35  
% 0.11/0.35  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 0.11/0.35  
% 0.11/0.35  This is a non-Horn set without equality.  The strategy
% 0.11/0.35  will be ordered hyper_res, ur_res, unit deletion, and
% 0.11/0.35  factoring, with satellites in sos and nuclei in usable.
% 0.11/0.35  
% 0.11/0.35     dependent: set(hyper_res).
% 0.11/0.35     dependent: set(factor).
% 0.11/0.35     dependent: set(unit_deletion).
% 0.11/0.35  
% 0.11/0.35  ------------> process usable:
% 0.11/0.35  
% 0.11/0.35  ------------> process sos:
% 0.11/0.35  
% 0.11/0.35  ======= end of input processing =======
% 0.18/0.39  
% 0.18/0.39  Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.39  
% 0.18/0.39  Stopped by limit on number of solutions
% 0.18/0.39  
% 0.18/0.39  
% 0.18/0.39  -------------- Softie stats --------------
% 0.18/0.39  
% 0.18/0.39  UPDATE_STOP: 300
% 0.18/0.39  SFINDER_TIME_LIMIT: 2
% 0.18/0.39  SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.39  number of clauses in intial UL: 44
% 0.18/0.39  number of clauses initially in problem: 47
% 0.18/0.39  percentage of clauses intially in UL: 93
% 0.18/0.39  percentage of distinct symbols occuring in initial UL: 97
% 0.18/0.39  percent of all initial clauses that are short: 100
% 0.18/0.39  absolute distinct symbol count: 79
% 0.18/0.39     distinct predicate count: 77
% 0.18/0.39     distinct function count: 1
% 0.18/0.39     distinct constant count: 1
% 0.18/0.39  
% 0.18/0.39  ---------- no more Softie stats ----------
% 0.18/0.39  
% 0.18/0.39  
% 0.18/0.39  
% 0.18/0.39  Model 2 (0.00 seconds, 0 Inserts)
% 0.18/0.39  
% 0.18/0.39  Stopped by limit on number of solutions
% 0.18/0.39  
% 0.18/0.39  =========== start of search ===========
% 0.45/0.64  
% 0.45/0.64  -------- PROOF -------- 
% 0.45/0.64  % SZS status Theorem
% 0.45/0.64  % SZS output start Refutation
% 0.45/0.64  
% 0.45/0.64  Model 3 [ 1 1 319 ] (0.00 seconds, 4907 Inserts)
% 0.45/0.64  
% 0.45/0.64  Model 4 [ 1 1 756 ] (0.00 seconds, 4423 Inserts)
% 0.45/0.64  
% 0.45/0.64  Stopped by limit on insertions
% 0.45/0.64  
% 0.45/0.64  Model 5 [ 3 0 319 ] (0.00 seconds, 250000 Inserts)
% 0.45/0.64  
% 0.45/0.64  Stopped by limit on insertions
% 0.45/0.64  
% 0.45/0.64  Model 6 [ 2 1 319 ] (0.00 seconds, 250000 Inserts)
% 0.45/0.64  
% 0.45/0.64  Stopped by limit on insertions
% 0.45/0.64  
% 0.45/0.64  Model 7 [ 2 0 400 ] (0.00 seconds, 250000 Inserts)
% 0.45/0.64  
% 0.45/0.64  Stopped by limit on insertions
% 0.45/0.64  
% 0.45/0.64  Model 8 [ 3 1 21259 ] (0.00 seconds, 250000 Inserts)
% 0.45/0.64  
% 0.45/0.64  -----> EMPTY CLAUSE at   0.27 sec ----> 89 [hyper,88,37,86,87] {-} $F.
% 0.45/0.64  
% 0.45/0.64  Length of proof is 8.  Level of proof is 5.
% 0.45/0.64  
% 0.45/0.64  ---------------- PROOF ----------------
% 0.45/0.64  % SZS status Theorem
% 0.45/0.64  % SZS output start Refutation
% 0.45/0.64  
% 0.45/0.64  35 [] {+} -cC2(A)| -cB(A)|cA(A).
% 0.45/0.64  36 [] {+} -cC2(A)|cB(A)|cA(A).
% 0.45/0.64  37 [] {+} -cC3(A)| -cB(A)| -cA(A).
% 0.45/0.64  38 [] {+} -cC3(A)|cB(A)| -cA(A).
% 0.45/0.64  39 [] {+} -cC4(A)|rR(A,$f1(A)).
% 0.45/0.64  40 [] {+} -cC4(A)|cC2($f1(A)).
% 0.45/0.64  41 [] {+} -cC5(A)| -rR(A,B)|cC3(B).
% 0.45/0.64  42 [] {+} -cTEST(A)|cC4(A).
% 0.45/0.64  44 [] {+} -cTEST(A)|cC5(A).
% 0.45/0.64  47 [] {-} cTEST(i2003_11_14_17_19_57994).
% 0.45/0.64  48 [hyper,47,44] {+} cC5(i2003_11_14_17_19_57994).
% 0.45/0.64  50 [hyper,47,42] {+} cC4(i2003_11_14_17_19_57994).
% 0.45/0.64  83 [hyper,50,40] {+} cC2($f1(i2003_11_14_17_19_57994)).
% 0.45/0.64  84 [hyper,50,39] {+} rR(i2003_11_14_17_19_57994,$f1(i2003_11_14_17_19_57994)).
% 0.45/0.64  85 [hyper,83,36] {+} cB($f1(i2003_11_14_17_19_57994))|cA($f1(i2003_11_14_17_19_57994)).
% 0.45/0.64  86 [hyper,84,41,48] {+} cC3($f1(i2003_11_14_17_19_57994)).
% 0.45/0.64  87 [hyper,85,35,83,factor_simp] {+} cA($f1(i2003_11_14_17_19_57994)).
% 0.45/0.64  88 [hyper,87,38,86] {+} cB($f1(i2003_11_14_17_19_57994)).
% 0.45/0.64  89 [hyper,88,37,86,87] {-} $F.
% 0.45/0.64  
% 0.45/0.64  % SZS output end Refutation
% 0.45/0.64  ------------ end of proof -------------
% 0.45/0.64  
% 0.45/0.64  
% 0.45/0.64  Search stopped by max_proofs option.
% 0.45/0.64  
% 0.45/0.64  
% 0.45/0.64  Search stopped by max_proofs option.
% 0.45/0.64  
% 0.45/0.64  ============ end of search ============
% 0.45/0.64  
% 0.45/0.64  ----------- soft-scott stats ----------
% 0.45/0.64  
% 0.45/0.64  true clauses given          36      (81.8%)
% 0.45/0.64  false clauses given          8
% 0.45/0.64  
% 0.45/0.64        FALSE     TRUE
% 0.45/0.64  tot:  0         0      (-nan% true)
% 0.45/0.64  
% 0.45/0.64  
% 0.45/0.64  Model 8 [ 3 1 21259 ] (0.00 seconds, 250000 Inserts)
% 0.45/0.64  
% 0.45/0.64  That finishes the proof of the theorem.
% 0.45/0.64  
% 0.45/0.64  Process 4588 finished Tue Jun  7 08:03:25 2022
%------------------------------------------------------------------------------