TSTP Solution File: RNG037-2 by SOS---2.0

View Problem - Process Solution

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

% Computer : n020.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 : Mon Jul 18 20:40:59 EDT 2022

% Result   : Unsatisfiable 0.84s 1.05s
% Output   : Refutation 0.84s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : RNG037-2 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12  % Command  : sos-script %s
% 0.12/0.33  % Computer : n020.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 : Mon May 30 22:06:23 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.35  ----- Otter 3.2, August 2001 -----
% 0.18/0.35  The process was started by sandbox2 on n020.cluster.edu,
% 0.18/0.35  Mon May 30 22:06:23 2022
% 0.18/0.35  The command was "./sos".  The process ID is 9908.
% 0.18/0.35  
% 0.18/0.35  set(prolog_style_variables).
% 0.18/0.35  set(auto).
% 0.18/0.35     dependent: set(auto1).
% 0.18/0.35     dependent: set(process_input).
% 0.18/0.35     dependent: clear(print_kept).
% 0.18/0.35     dependent: clear(print_new_demod).
% 0.18/0.35     dependent: clear(print_back_demod).
% 0.18/0.35     dependent: clear(print_back_sub).
% 0.18/0.35     dependent: set(control_memory).
% 0.18/0.35     dependent: assign(max_mem, 12000).
% 0.18/0.35     dependent: assign(pick_given_ratio, 4).
% 0.18/0.35     dependent: assign(stats_level, 1).
% 0.18/0.35     dependent: assign(pick_semantic_ratio, 3).
% 0.18/0.35     dependent: assign(sos_limit, 5000).
% 0.18/0.35     dependent: assign(max_weight, 60).
% 0.18/0.35  clear(print_given).
% 0.18/0.35  
% 0.18/0.35  list(usable).
% 0.18/0.35  
% 0.18/0.35  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=5.
% 0.18/0.35  
% 0.18/0.35  This is a Horn set with equality.  The strategy will be
% 0.18/0.35  Knuth-Bendix and hyper_res, with positive clauses in
% 0.18/0.35  sos and nonpositive clauses in usable.
% 0.18/0.35  
% 0.18/0.35     dependent: set(knuth_bendix).
% 0.18/0.35     dependent: set(para_from).
% 0.18/0.35     dependent: set(para_into).
% 0.18/0.35     dependent: clear(para_from_right).
% 0.18/0.35     dependent: clear(para_into_right).
% 0.18/0.35     dependent: set(para_from_vars).
% 0.18/0.35     dependent: set(eq_units_both_ways).
% 0.18/0.35     dependent: set(dynamic_demod_all).
% 0.18/0.35     dependent: set(dynamic_demod).
% 0.18/0.35     dependent: set(order_eq).
% 0.18/0.35     dependent: set(back_demod).
% 0.18/0.35     dependent: set(lrpo).
% 0.18/0.35     dependent: set(hyper_res).
% 0.18/0.35     dependent: clear(order_hyper).
% 0.18/0.35  
% 0.18/0.35  ------------> process usable:
% 0.18/0.35  
% 0.18/0.35  ------------> process sos:
% 0.18/0.35  
% 0.18/0.35  ======= end of input processing =======
% 0.18/0.43  
% 0.18/0.43  Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.43  
% 0.18/0.43  Stopped by limit on number of solutions
% 0.18/0.43  
% 0.18/0.43  
% 0.18/0.43  -------------- Softie stats --------------
% 0.18/0.43  
% 0.18/0.43  UPDATE_STOP: 300
% 0.18/0.43  SFINDER_TIME_LIMIT: 2
% 0.18/0.43  SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.43  number of clauses in intial UL: 21
% 0.18/0.43  number of clauses initially in problem: 29
% 0.18/0.43  percentage of clauses intially in UL: 72
% 0.18/0.43  percentage of distinct symbols occuring in initial UL: 81
% 0.18/0.43  percent of all initial clauses that are short: 100
% 0.18/0.43  absolute distinct symbol count: 11
% 0.18/0.43     distinct predicate count: 3
% 0.18/0.43     distinct function count: 3
% 0.18/0.43     distinct constant count: 5
% 0.18/0.43  
% 0.18/0.43  ---------- no more Softie stats ----------
% 0.18/0.43  
% 0.18/0.43  
% 0.18/0.43  
% 0.18/0.43  Model 2 (0.00 seconds, 0 Inserts)
% 0.18/0.43  
% 0.18/0.43  Stopped by limit on number of solutions
% 0.18/0.43  
% 0.18/0.43  =========== start of search ===========
% 0.84/1.05  
% 0.84/1.05  -------- PROOF -------- 
% 0.84/1.05  % SZS status Unsatisfiable
% 0.84/1.05  % SZS output start Refutation
% 0.84/1.05  
% 0.84/1.05  Model 3 (0.00 seconds, 0 Inserts)
% 0.84/1.05  
% 0.84/1.05  Stopped by limit on number of solutions
% 0.84/1.05  
% 0.84/1.05  Stopped by limit on insertions
% 0.84/1.05  
% 0.84/1.05  Model 4 [ 3 2 244 ] (0.00 seconds, 250000 Inserts)
% 0.84/1.05  
% 0.84/1.05  Model 5 (0.00 seconds, 250000 Inserts)
% 0.84/1.05  
% 0.84/1.05  Stopped by limit on number of solutions
% 0.84/1.05  
% 0.84/1.05  Stopped by limit on insertions
% 0.84/1.05  
% 0.84/1.05  Model 6 [ 3 1 347 ] (0.00 seconds, 250000 Inserts)
% 0.84/1.05  
% 0.84/1.05  Stopped by limit on insertions
% 0.84/1.05  
% 0.84/1.05  Model 7 [ 8 1 451 ] (0.00 seconds, 250000 Inserts)
% 0.84/1.05  
% 0.84/1.05  Model 8 (0.00 seconds, 250000 Inserts)
% 0.84/1.05  
% 0.84/1.05  Stopped by limit on number of solutions
% 0.84/1.05  
% 0.84/1.05  Stopped by limit on insertions
% 0.84/1.05  
% 0.84/1.05  ----> UNIT CONFLICT at   0.66 sec ----> 99 [binary,98.1,21.1] {-} $F.
% 0.84/1.05  
% 0.84/1.05  Length of proof is 2.  Level of proof is 2.
% 0.84/1.05  
% 0.84/1.05  ---------------- PROOF ----------------
% 0.84/1.05  % SZS status Unsatisfiable
% 0.84/1.05  % SZS output start Refutation
% 0.84/1.05  
% 0.84/1.05  12 [] {+} -sum(A,B,C)|sum(B,A,C).
% 0.84/1.05  15 [] {+} -product(A,B,C)| -product(A,D,E)| -sum(B,D,F)| -product(A,F,G)|sum(C,E,G).
% 0.84/1.05  21 [] {+} -sum(c,d,additive_identity).
% 0.84/1.05  25 [] {+} sum(A,additive_inverse(A),additive_identity).
% 0.84/1.05  27 [] {+} product(A,additive_identity,additive_identity).
% 0.84/1.05  28 [] {+} product(a,b,d).
% 0.84/1.05  29 [] {-} product(a,additive_inverse(b),c).
% 0.84/1.05  86 [hyper,25,15,28,29,27] {-} sum(d,c,additive_identity).
% 0.84/1.05  98 [hyper,86,12] {-} sum(c,d,additive_identity).
% 0.84/1.05  99 [binary,98.1,21.1] {-} $F.
% 0.84/1.05  
% 0.84/1.05  % SZS output end Refutation
% 0.84/1.05  ------------ end of proof -------------
% 0.84/1.05  
% 0.84/1.05  
% 0.84/1.05  Search stopped by max_proofs option.
% 0.84/1.05  
% 0.84/1.05  
% 0.84/1.05  Search stopped by max_proofs option.
% 0.84/1.05  
% 0.84/1.05  ============ end of search ============
% 0.84/1.05  
% 0.84/1.05  ----------- soft-scott stats ----------
% 0.84/1.05  
% 0.84/1.05  true clauses given           1      (10.0%)
% 0.84/1.05  false clauses given          9
% 0.84/1.05  
% 0.84/1.05        FALSE     TRUE
% 0.84/1.05     4  0         1
% 0.84/1.05     5  0         4
% 0.84/1.05     6  2         2
% 0.84/1.05     7  0         1
% 0.84/1.05     8  3         5
% 0.84/1.05     9  4         3
% 0.84/1.05    10  0         2
% 0.84/1.05    12  0         18
% 0.84/1.05    13  8         4
% 0.84/1.05    14  0         2
% 0.84/1.05  tot:  17        42      (71.2% true)
% 0.84/1.05  
% 0.84/1.05  
% 0.84/1.05  Model 8 (0.00 seconds, 250000 Inserts)
% 0.84/1.05  
% 0.84/1.05  That finishes the proof of the theorem.
% 0.84/1.05  
% 0.84/1.05  Process 9908 finished Mon May 30 22:06:24 2022
%------------------------------------------------------------------------------