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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : GRP481-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n010.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:43:06 EDT 2022

% Result   : Unsatisfiable 0.19s 0.40s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : GRP481-1 : TPTP v8.1.0. Released v2.6.0.
% 0.06/0.13  % Command  : sos-script %s
% 0.12/0.33  % Computer : n010.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.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Mon Jun 13 09:39:09 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.12/0.35  ----- Otter 3.2, August 2001 -----
% 0.12/0.35  The process was started by sandbox2 on n010.cluster.edu,
% 0.12/0.35  Mon Jun 13 09:39:09 2022
% 0.12/0.35  The command was "./sos".  The process ID is 2942.
% 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  list(usable).
% 0.12/0.35  
% 0.12/0.35  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 0.12/0.35  
% 0.12/0.35  All clauses are units, and equality is present; the
% 0.12/0.35  strategy will be Knuth-Bendix with positive clauses in sos.
% 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  
% 0.12/0.35  ------------> process usable:
% 0.12/0.35  
% 0.12/0.35  ------------> process sos:
% 0.12/0.35    Following clause subsumed by 11 during input processing: 0 [copy,11,flip.1] {-} A=A.
% 0.12/0.35  
% 0.12/0.35  ======= end of input processing =======
% 0.12/0.38  
% 0.12/0.38  Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.38  
% 0.12/0.38  Stopped by limit on number of solutions
% 0.12/0.38  
% 0.12/0.38  
% 0.12/0.38  -------------- Softie stats --------------
% 0.12/0.38  
% 0.12/0.38  UPDATE_STOP: 300
% 0.12/0.38  SFINDER_TIME_LIMIT: 2
% 0.12/0.38  SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.38  number of clauses in intial UL: 0
% 0.12/0.38  number of clauses initially in problem: 10
% 0.12/0.38  percentage of clauses intially in UL: 0
% 0.12/0.38  percentage of distinct symbols occuring in initial UL: 0
% 0.12/0.38  percent of all initial clauses that are short: 100
% 0.12/0.38  absolute distinct symbol count: 5
% 0.12/0.38     distinct predicate count: 1
% 0.12/0.38     distinct function count: 3
% 0.12/0.38     distinct constant count: 1
% 0.12/0.38  
% 0.12/0.38  ---------- no more Softie stats ----------
% 0.12/0.38  
% 0.12/0.38  
% 0.12/0.38  
% 0.12/0.38  =========== start of search ===========
% 0.19/0.40  
% 0.19/0.40  -------- PROOF -------- 
% 0.19/0.40  % SZS status Unsatisfiable
% 0.19/0.40  % SZS output start Refutation
% 0.19/0.40  
% 0.19/0.40  Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.40  
% 0.19/0.40  Stopped by limit on number of solutions
% 0.19/0.40  
% 0.19/0.40  Model 3 (0.00 seconds, 0 Inserts)
% 0.19/0.40  
% 0.19/0.40  Stopped by limit on number of solutions
% 0.19/0.40  
% 0.19/0.40  Model 4 (0.00 seconds, 0 Inserts)
% 0.19/0.40  
% 0.19/0.40  Stopped by limit on number of solutions
% 0.19/0.40  
% 0.19/0.40  ----> UNIT CONFLICT at   0.02 sec ----> 53 [binary,51.1,12.1] {-} $F.
% 0.19/0.40  
% 0.19/0.40  Length of proof is 6.  Level of proof is 5.
% 0.19/0.40  
% 0.19/0.40  ---------------- PROOF ----------------
% 0.19/0.40  % SZS status Unsatisfiable
% 0.19/0.40  % SZS output start Refutation
% 0.19/0.40  
% 0.19/0.40  1 [] {-} multiply(inverse(a1),a1)!=identity.
% 0.19/0.40  2 [] {-} double_divide(double_divide(double_divide(A,double_divide(B,identity)),double_divide(double_divide(C,double_divide(D,double_divide(D,identity))),double_divide(A,identity))),B)=C.
% 0.19/0.40  5,4 [] {-} multiply(A,B)=double_divide(double_divide(B,A),identity).
% 0.19/0.40  7,6 [] {+} inverse(A)=double_divide(A,identity).
% 0.19/0.40  8 [] {-} identity=double_divide(A,inverse(A)).
% 0.19/0.40  10,9 [copy,8,demod,7,flip.1] {+} double_divide(A,double_divide(A,identity))=identity.
% 0.19/0.40  12 [back_demod,1,demod,7,5,10] {+} double_divide(identity,identity)!=identity.
% 0.19/0.40  13 [back_demod,2,demod,10] {-} double_divide(double_divide(double_divide(A,double_divide(B,identity)),double_divide(double_divide(C,identity),double_divide(A,identity))),B)=C.
% 0.19/0.40  19 [para_into,13.1.1.1.1,9.1.1] {-} double_divide(double_divide(identity,double_divide(double_divide(A,identity),double_divide(B,identity))),B)=A.
% 0.19/0.40  36 [para_into,19.1.1.1.2,9.1.1] {-} double_divide(double_divide(identity,identity),double_divide(A,identity))=A.
% 0.19/0.40  51 [para_into,36.1.1,9.1.1,flip.1] {-} double_divide(identity,identity)=identity.
% 0.19/0.40  53 [binary,51.1,12.1] {-} $F.
% 0.19/0.40  
% 0.19/0.40  % SZS output end Refutation
% 0.19/0.40  ------------ end of proof -------------
% 0.19/0.40  
% 0.19/0.40  
% 0.19/0.40  Search stopped by max_proofs option.
% 0.19/0.40  
% 0.19/0.40  
% 0.19/0.40  Search stopped by max_proofs option.
% 0.19/0.40  
% 0.19/0.40  ============ end of search ============
% 0.19/0.40  
% 0.19/0.40  ----------- soft-scott stats ----------
% 0.19/0.40  
% 0.19/0.40  true clauses given           1      (12.5%)
% 0.19/0.40  false clauses given          7
% 0.19/0.40  
% 0.19/0.40        FALSE     TRUE
% 0.19/0.40    13  3         0
% 0.19/0.40    17  1         0
% 0.19/0.40    19  2         0
% 0.19/0.40    23  7         0
% 0.19/0.40    27  5         0
% 0.19/0.40  tot:  18        0      (0.0% true)
% 0.19/0.40  
% 0.19/0.40  
% 0.19/0.40  Model 4 (0.00 seconds, 0 Inserts)
% 0.19/0.40  
% 0.19/0.40  That finishes the proof of the theorem.
% 0.19/0.40  
% 0.19/0.40  Process 2942 finished Mon Jun 13 09:39:09 2022
%------------------------------------------------------------------------------