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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : GRP409-1 : TPTP v8.1.0. Released v2.6.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:42:52 EDT 2022

% Result   : Unsatisfiable 0.14s 0.42s
% Output   : Refutation 0.14s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : GRP409-1 : TPTP v8.1.0. Released v2.6.0.
% 0.13/0.13  % Command  : sos-script %s
% 0.14/0.34  % Computer : n018.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Mon Jun 13 13:43:12 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.14/0.36  ----- Otter 3.2, August 2001 -----
% 0.14/0.36  The process was started by sandbox2 on n018.cluster.edu,
% 0.14/0.36  Mon Jun 13 13:43:12 2022
% 0.14/0.36  The command was "./sos".  The process ID is 5684.
% 0.14/0.36  
% 0.14/0.36  set(prolog_style_variables).
% 0.14/0.36  set(auto).
% 0.14/0.36     dependent: set(auto1).
% 0.14/0.36     dependent: set(process_input).
% 0.14/0.36     dependent: clear(print_kept).
% 0.14/0.36     dependent: clear(print_new_demod).
% 0.14/0.36     dependent: clear(print_back_demod).
% 0.14/0.36     dependent: clear(print_back_sub).
% 0.14/0.36     dependent: set(control_memory).
% 0.14/0.36     dependent: assign(max_mem, 12000).
% 0.14/0.36     dependent: assign(pick_given_ratio, 4).
% 0.14/0.36     dependent: assign(stats_level, 1).
% 0.14/0.36     dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.36     dependent: assign(sos_limit, 5000).
% 0.14/0.36     dependent: assign(max_weight, 60).
% 0.14/0.36  clear(print_given).
% 0.14/0.36  
% 0.14/0.36  list(usable).
% 0.14/0.36  
% 0.14/0.36  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 0.14/0.36  
% 0.14/0.36  All clauses are units, and equality is present; the
% 0.14/0.36  strategy will be Knuth-Bendix with positive clauses in sos.
% 0.14/0.36  
% 0.14/0.36     dependent: set(knuth_bendix).
% 0.14/0.36     dependent: set(para_from).
% 0.14/0.36     dependent: set(para_into).
% 0.14/0.36     dependent: clear(para_from_right).
% 0.14/0.36     dependent: clear(para_into_right).
% 0.14/0.36     dependent: set(para_from_vars).
% 0.14/0.36     dependent: set(eq_units_both_ways).
% 0.14/0.36     dependent: set(dynamic_demod_all).
% 0.14/0.36     dependent: set(dynamic_demod).
% 0.14/0.36     dependent: set(order_eq).
% 0.14/0.36     dependent: set(back_demod).
% 0.14/0.36     dependent: set(lrpo).
% 0.14/0.36  
% 0.14/0.36  ------------> process usable:
% 0.14/0.36  
% 0.14/0.36  ------------> process sos:
% 0.14/0.36    Following clause subsumed by 5 during input processing: 0 [copy,5,flip.1] {-} A=A.
% 0.14/0.36  
% 0.14/0.36  ======= end of input processing =======
% 0.14/0.38  
% 0.14/0.38  Model 1 (0.00 seconds, 0 Inserts)
% 0.14/0.38  
% 0.14/0.38  Stopped by limit on number of solutions
% 0.14/0.38  
% 0.14/0.38  
% 0.14/0.38  -------------- Softie stats --------------
% 0.14/0.38  
% 0.14/0.38  UPDATE_STOP: 300
% 0.14/0.38  SFINDER_TIME_LIMIT: 2
% 0.14/0.38  SHORT_CLAUSE_CUTOFF: 4
% 0.14/0.38  number of clauses in intial UL: 1
% 0.14/0.38  number of clauses initially in problem: 4
% 0.14/0.38  percentage of clauses intially in UL: 25
% 0.14/0.38  percentage of distinct symbols occuring in initial UL: 100
% 0.14/0.38  percent of all initial clauses that are short: 100
% 0.14/0.38  absolute distinct symbol count: 5
% 0.14/0.38     distinct predicate count: 1
% 0.14/0.38     distinct function count: 2
% 0.14/0.38     distinct constant count: 2
% 0.14/0.38  
% 0.14/0.38  ---------- no more Softie stats ----------
% 0.14/0.38  
% 0.14/0.38  
% 0.14/0.38  
% 0.14/0.38  =========== start of search ===========
% 0.14/0.42  
% 0.14/0.42  -------- PROOF -------- 
% 0.14/0.42  % SZS status Unsatisfiable
% 0.14/0.42  % SZS output start Refutation
% 0.14/0.42  
% 0.14/0.42  ----> UNIT CONFLICT at   0.04 sec ----> 192 [binary,191.1,123.1] {-} $F.
% 0.14/0.42  
% 0.14/0.42  Length of proof is 11.  Level of proof is 7.
% 0.14/0.42  
% 0.14/0.42  ---------------- PROOF ----------------
% 0.14/0.42  % SZS status Unsatisfiable
% 0.14/0.42  % SZS output start Refutation
% 0.14/0.42  
% 0.14/0.42  1 [] {-} multiply(inverse(a1),a1)!=multiply(inverse(b1),b1).
% 0.14/0.42  2 [copy,1,flip.1] {+} multiply(inverse(b1),b1)!=multiply(inverse(a1),a1).
% 0.14/0.42  3 [] {-} multiply(multiply(inverse(multiply(A,inverse(multiply(B,C)))),multiply(A,inverse(C))),inverse(multiply(inverse(C),C)))=B.
% 0.14/0.42  6 [para_into,3.1.1.1.1.1.2.1,3.1.1] {-} multiply(multiply(inverse(multiply(A,inverse(B))),multiply(A,inverse(inverse(multiply(inverse(C),C))))),inverse(multiply(inverse(inverse(multiply(inverse(C),C))),inverse(multiply(inverse(C),C)))))=multiply(inverse(multiply(D,inverse(multiply(B,C)))),multiply(D,inverse(C))).
% 0.14/0.42  10,9 [para_into,3.1.1.1.2,3.1.1] {-} multiply(multiply(inverse(multiply(multiply(inverse(multiply(A,inverse(multiply(B,C)))),multiply(A,inverse(C))),inverse(multiply(D,multiply(inverse(C),C))))),B),inverse(multiply(inverse(multiply(inverse(C),C)),multiply(inverse(C),C))))=D.
% 0.14/0.42  17 [para_into,6.1.1,6.1.1] {-} multiply(inverse(multiply(A,inverse(multiply(B,C)))),multiply(A,inverse(C)))=multiply(inverse(multiply(D,inverse(multiply(B,C)))),multiply(D,inverse(C))).
% 0.14/0.42  19,18 [para_into,6.1.1,3.1.1,flip.1] {-} multiply(inverse(multiply(A,inverse(multiply(multiply(B,inverse(multiply(inverse(C),C))),C)))),multiply(A,inverse(C)))=B.
% 0.14/0.42  50 [para_into,17.1.1.1.1.2.1,18.1.1,demod,19] {-} multiply(inverse(multiply(A,inverse(B))),multiply(A,inverse(multiply(C,inverse(D)))))=multiply(inverse(multiply(E,inverse(B))),multiply(E,inverse(multiply(C,inverse(D))))).
% 0.14/0.42  69 [para_into,50.1.1.2.2.1,9.1.1,demod,10] {-} multiply(inverse(multiply(A,inverse(B))),multiply(A,inverse(C)))=multiply(inverse(multiply(D,inverse(B))),multiply(D,inverse(C))).
% 0.14/0.42  85 [para_into,69.1.1.1.1,3.1.1] {-} multiply(inverse(A),multiply(multiply(inverse(multiply(B,inverse(multiply(A,C)))),multiply(B,inverse(C))),inverse(D)))=multiply(inverse(multiply(E,inverse(multiply(inverse(C),C)))),multiply(E,inverse(D))).
% 0.14/0.42  116 [para_into,85.1.1.2,3.1.1] {-} multiply(inverse(A),A)=multiply(inverse(multiply(B,inverse(multiply(inverse(C),C)))),multiply(B,inverse(multiply(inverse(C),C)))).
% 0.14/0.42  123 [copy,116,flip.1] {-} multiply(inverse(multiply(A,inverse(multiply(inverse(B),B)))),multiply(A,inverse(multiply(inverse(B),B))))=multiply(inverse(C),C).
% 0.14/0.42  191 [para_from,116.1.1,2.1.1] {-} multiply(inverse(multiply(A,inverse(multiply(inverse(B),B)))),multiply(A,inverse(multiply(inverse(B),B))))!=multiply(inverse(a1),a1).
% 0.14/0.42  192 [binary,191.1,123.1] {-} $F.
% 0.14/0.42  
% 0.14/0.42  % SZS output end Refutation
% 0.14/0.42  ------------ end of proof -------------
% 0.14/0.42  
% 0.14/0.42  
% 0.14/0.42  Search stopped by max_proofs option.
% 0.14/0.42  
% 0.14/0.42  
% 0.14/0.42  Search stopped by max_proofs option.
% 0.14/0.42  
% 0.14/0.42  ============ end of search ============
% 0.14/0.42  
% 0.14/0.42  ----------- soft-scott stats ----------
% 0.14/0.42  
% 0.14/0.42  true clauses given           2      (16.7%)
% 0.14/0.42  false clauses given         10
% 0.14/0.42  
% 0.14/0.42        FALSE     TRUE
% 0.14/0.42    21  1         0
% 0.14/0.42    32  5         0
% 0.14/0.42    34  0         1
% 0.14/0.42    36  1         0
% 0.14/0.42    37  1         0
% 0.14/0.42    39  6         0
% 0.14/0.42    40  2         0
% 0.14/0.42    41  1         1
% 0.14/0.42    43  0         1
% 0.14/0.42    44  2         0
% 0.14/0.42    45  1         0
% 0.14/0.42    46  2         0
% 0.14/0.42    48  2         2
% 0.14/0.42    49  6         0
% 0.14/0.42    50  0         1
% 0.14/0.42    51  3         0
% 0.14/0.42    52  6         1
% 0.14/0.42    53  6         1
% 0.14/0.42    55  0         2
% 0.14/0.42    56  2         1
% 0.14/0.42    57  1         3
% 0.14/0.42    59  4         0
% 0.14/0.42    60  4         0
% 0.14/0.42  tot:  56        14      (20.0% true)
% 0.14/0.42  
% 0.14/0.42  
% 0.14/0.42  Model 1 (0.00 seconds, 0 Inserts)
% 0.14/0.42  
% 0.14/0.42  That finishes the proof of the theorem.
% 0.14/0.42  
% 0.14/0.42  Process 5684 finished Mon Jun 13 13:43:12 2022
%------------------------------------------------------------------------------