TSTP Solution File: GRP020-1 by SOS---2.0

View Problem - Process Solution

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

% Computer : n018.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 11:41:01 EDT 2022

% Result   : Unsatisfiable 0.22s 0.46s
% Output   : Refutation 0.22s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : GRP020-1 : TPTP v8.1.0. Released v1.0.0.
% 0.08/0.14  % Command  : sos-script %s
% 0.14/0.36  % Computer : n018.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 600
% 0.14/0.36  % DateTime : Mon Jun 13 22:02:58 EDT 2022
% 0.14/0.36  % CPUTime  : 
% 0.14/0.38  ----- Otter 3.2, August 2001 -----
% 0.14/0.38  The process was started by sandbox on n018.cluster.edu,
% 0.14/0.38  Mon Jun 13 22:02:58 2022
% 0.14/0.38  The command was "./sos".  The process ID is 24147.
% 0.14/0.38  
% 0.14/0.38  set(prolog_style_variables).
% 0.14/0.38  set(auto).
% 0.14/0.38     dependent: set(auto1).
% 0.14/0.38     dependent: set(process_input).
% 0.14/0.38     dependent: clear(print_kept).
% 0.14/0.38     dependent: clear(print_new_demod).
% 0.14/0.38     dependent: clear(print_back_demod).
% 0.14/0.38     dependent: clear(print_back_sub).
% 0.14/0.38     dependent: set(control_memory).
% 0.14/0.38     dependent: assign(max_mem, 12000).
% 0.14/0.38     dependent: assign(pick_given_ratio, 4).
% 0.14/0.38     dependent: assign(stats_level, 1).
% 0.14/0.38     dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.38     dependent: assign(sos_limit, 5000).
% 0.14/0.38     dependent: assign(max_weight, 60).
% 0.14/0.38  clear(print_given).
% 0.14/0.38  
% 0.14/0.38  list(usable).
% 0.14/0.38  
% 0.14/0.38  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=4.
% 0.14/0.38  
% 0.14/0.38  This is a Horn set with equality.  The strategy will be
% 0.14/0.38  Knuth-Bendix and hyper_res, with positive clauses in
% 0.14/0.38  sos and nonpositive clauses in usable.
% 0.14/0.38  
% 0.14/0.38     dependent: set(knuth_bendix).
% 0.14/0.38     dependent: set(para_from).
% 0.14/0.38     dependent: set(para_into).
% 0.14/0.38     dependent: clear(para_from_right).
% 0.14/0.38     dependent: clear(para_into_right).
% 0.14/0.38     dependent: set(para_from_vars).
% 0.14/0.38     dependent: set(eq_units_both_ways).
% 0.14/0.38     dependent: set(dynamic_demod_all).
% 0.14/0.38     dependent: set(dynamic_demod).
% 0.14/0.38     dependent: set(order_eq).
% 0.14/0.38     dependent: set(back_demod).
% 0.14/0.38     dependent: set(lrpo).
% 0.14/0.38     dependent: set(hyper_res).
% 0.14/0.38     dependent: clear(order_hyper).
% 0.14/0.38  
% 0.14/0.38  ------------> process usable:
% 0.14/0.38  
% 0.14/0.38  ------------> process sos:
% 0.14/0.38    Following clause subsumed by 10 during input processing: 0 [copy,10,flip.1] {-} A=A.
% 0.14/0.38  
% 0.14/0.38  ======= end of input processing =======
% 0.22/0.43  
% 0.22/0.43  Model 1 (0.00 seconds, 0 Inserts)
% 0.22/0.43  
% 0.22/0.43  Stopped by limit on number of solutions
% 0.22/0.43  
% 0.22/0.43  
% 0.22/0.43  -------------- Softie stats --------------
% 0.22/0.43  
% 0.22/0.43  UPDATE_STOP: 300
% 0.22/0.43  SFINDER_TIME_LIMIT: 2
% 0.22/0.43  SHORT_CLAUSE_CUTOFF: 4
% 0.22/0.43  number of clauses in intial UL: 4
% 0.22/0.43  number of clauses initially in problem: 10
% 0.22/0.43  percentage of clauses intially in UL: 40
% 0.22/0.43  percentage of distinct symbols occuring in initial UL: 100
% 0.22/0.43  percent of all initial clauses that are short: 100
% 0.22/0.43  absolute distinct symbol count: 6
% 0.22/0.43     distinct predicate count: 2
% 0.22/0.43     distinct function count: 2
% 0.22/0.43     distinct constant count: 2
% 0.22/0.43  
% 0.22/0.43  ---------- no more Softie stats ----------
% 0.22/0.43  
% 0.22/0.43  
% 0.22/0.43  
% 0.22/0.43  Model 2 (0.00 seconds, 0 Inserts)
% 0.22/0.43  
% 0.22/0.43  Stopped by limit on number of solutions
% 0.22/0.43  
% 0.22/0.43  =========== start of search ===========
% 0.22/0.46  
% 0.22/0.46  -------- PROOF -------- 
% 0.22/0.46  % SZS status Unsatisfiable
% 0.22/0.46  % SZS output start Refutation
% 0.22/0.46  
% 0.22/0.46  Model 3 (0.00 seconds, 0 Inserts)
% 0.22/0.46  
% 0.22/0.46  Stopped by limit on number of solutions
% 0.22/0.46  
% 0.22/0.46  Model 4 [ 1 1 1309 ] (0.00 seconds, 4493 Inserts)
% 0.22/0.46  
% 0.22/0.46  ----> UNIT CONFLICT at   0.05 sec ----> 42 [binary,40.1,4.1] {+} $F.
% 0.22/0.46  
% 0.22/0.46  Length of proof is 1.  Level of proof is 1.
% 0.22/0.46  
% 0.22/0.46  ---------------- PROOF ----------------
% 0.22/0.46  % SZS status Unsatisfiable
% 0.22/0.46  % SZS output start Refutation
% 0.22/0.46  
% 0.22/0.46  1 [] {+} -product(A,B,C)| -product(A,B,D)|C=D.
% 0.22/0.46  4 [] {+} multiply(inverse(a),a)!=identity.
% 0.22/0.46  7 [] {+} product(inverse(A),A,identity).
% 0.22/0.46  9 [] {+} product(A,B,multiply(A,B)).
% 0.22/0.46  40 [hyper,9,1,7,flip.1] {-} multiply(inverse(A),A)=identity.
% 0.22/0.46  42 [binary,40.1,4.1] {+} $F.
% 0.22/0.46  
% 0.22/0.46  % SZS output end Refutation
% 0.22/0.46  ------------ end of proof -------------
% 0.22/0.46  
% 0.22/0.46  
% 0.22/0.46  Search stopped by max_proofs option.
% 0.22/0.46  
% 0.22/0.46  
% 0.22/0.46  Search stopped by max_proofs option.
% 0.22/0.46  
% 0.22/0.46  ============ end of search ============
% 0.22/0.46  
% 0.22/0.46  ----------- soft-scott stats ----------
% 0.22/0.46  
% 0.22/0.46  true clauses given           0      (0.0%)
% 0.22/0.46  false clauses given          3
% 0.22/0.46  
% 0.22/0.46        FALSE     TRUE
% 0.22/0.46     3  0         1
% 0.22/0.46     4  0         1
% 0.22/0.46     5  1         1
% 0.22/0.46     6  1         0
% 0.22/0.46    12  0         1
% 0.22/0.46    13  2         0
% 0.22/0.46  tot:  4         4      (50.0% true)
% 0.22/0.46  
% 0.22/0.46  
% 0.22/0.46  Model 4 [ 1 1 1309 ] (0.00 seconds, 4493 Inserts)
% 0.22/0.46  
% 0.22/0.46  That finishes the proof of the theorem.
% 0.22/0.46  
% 0.22/0.46  Process 24147 finished Mon Jun 13 22:02:58 2022
%------------------------------------------------------------------------------