%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP585-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n025.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:26 EDT 2022
% Result : Unsatisfiable 0.19s 0.44s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GRP585-1 : TPTP v8.1.0. Released v2.6.0.
% 0.12/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n025.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % 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 14:49: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 sandbox on n025.cluster.edu,
% 0.12/0.35 Mon Jun 13 14:49:09 2022
% 0.12/0.35 The command was "./sos". The process ID is 2623.
% 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 8 during input processing: 0 [copy,8,flip.1] {-} A=A.
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.12/0.39
% 0.12/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.39
% 0.12/0.39 Stopped by limit on number of solutions
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 -------------- Softie stats --------------
% 0.12/0.39
% 0.12/0.39 UPDATE_STOP: 300
% 0.12/0.39 SFINDER_TIME_LIMIT: 2
% 0.12/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.39 number of clauses in intial UL: 1
% 0.12/0.39 number of clauses initially in problem: 6
% 0.12/0.39 percentage of clauses intially in UL: 16
% 0.12/0.39 percentage of distinct symbols occuring in initial UL: 83
% 0.12/0.39 percent of all initial clauses that are short: 100
% 0.12/0.39 absolute distinct symbol count: 6
% 0.12/0.39 distinct predicate count: 1
% 0.12/0.39 distinct function count: 3
% 0.12/0.39 distinct constant count: 2
% 0.12/0.39
% 0.12/0.39 ---------- no more Softie stats ----------
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.39
% 0.12/0.39 Stopped by limit on number of solutions
% 0.12/0.39
% 0.12/0.39 =========== start of search ===========
% 0.19/0.44
% 0.19/0.44 -------- PROOF --------
% 0.19/0.44 % SZS status Unsatisfiable
% 0.19/0.44 % SZS output start Refutation
% 0.19/0.44
% 0.19/0.44 ----> UNIT CONFLICT at 0.06 sec ----> 504 [binary,503.1,155.1] {-} $F.
% 0.19/0.44
% 0.19/0.44 Length of proof is 19. Level of proof is 12.
% 0.19/0.44
% 0.19/0.44 ---------------- PROOF ----------------
% 0.19/0.44 % SZS status Unsatisfiable
% 0.19/0.44 % SZS output start Refutation
% 0.19/0.44
% 0.19/0.44 1 [] {-} multiply(inverse(a1),a1)!=multiply(inverse(b1),b1).
% 0.19/0.44 2 [copy,1,flip.1] {+} multiply(inverse(b1),b1)!=multiply(inverse(a1),a1).
% 0.19/0.44 3 [] {-} double_divide(A,inverse(double_divide(inverse(double_divide(double_divide(A,B),inverse(C))),B)))=C.
% 0.19/0.44 5 [] {-} multiply(A,B)=inverse(double_divide(B,A)).
% 0.19/0.44 7,6 [copy,5,flip.1] {+} inverse(double_divide(A,B))=multiply(B,A).
% 0.19/0.44 9 [back_demod,3,demod,7,7] {-} double_divide(A,multiply(B,multiply(inverse(C),double_divide(A,B))))=C.
% 0.19/0.44 11 [para_into,9.1.1.2.2.1,6.1.1] {-} double_divide(A,multiply(B,multiply(multiply(C,D),double_divide(A,B))))=double_divide(D,C).
% 0.19/0.44 13 [para_into,9.1.1.2.2.2,9.1.1] {-} double_divide(A,multiply(multiply(B,multiply(inverse(C),double_divide(A,B))),multiply(inverse(D),C)))=D.
% 0.19/0.45 15 [para_from,9.1.1,6.1.1.1,flip.1] {-} multiply(multiply(A,multiply(inverse(B),double_divide(C,A))),C)=inverse(B).
% 0.19/0.45 23 [para_into,11.1.1.2.2.2,9.1.1] {-} double_divide(A,multiply(multiply(B,multiply(inverse(C),double_divide(A,B))),multiply(multiply(D,E),C)))=double_divide(E,D).
% 0.19/0.45 37 [para_into,13.1.1.2,15.1.1] {-} double_divide(multiply(inverse(A),B),inverse(B))=A.
% 0.19/0.45 55 [para_from,37.1.1,6.1.1.1,flip.1] {-} multiply(inverse(A),multiply(inverse(B),A))=inverse(B).
% 0.19/0.45 61 [para_into,55.1.1.2,55.1.1] {-} multiply(inverse(multiply(inverse(A),B)),inverse(A))=inverse(B).
% 0.19/0.45 63 [para_from,55.1.1,37.1.1.1] {-} double_divide(inverse(A),inverse(multiply(inverse(A),B)))=B.
% 0.19/0.45 69 [para_into,63.1.1.2.1,55.1.1] {-} double_divide(inverse(A),inverse(inverse(B)))=multiply(inverse(B),A).
% 0.19/0.45 70 [copy,69,flip.1] {-} multiply(inverse(A),B)=double_divide(inverse(B),inverse(inverse(A))).
% 0.19/0.45 100,99 [para_from,61.1.1,13.1.1.2.2] {-} double_divide(A,multiply(multiply(B,multiply(inverse(inverse(C)),double_divide(A,B))),inverse(D)))=multiply(inverse(C),D).
% 0.19/0.45 129 [para_from,70.1.1,55.1.1.2] {-} multiply(inverse(A),double_divide(inverse(A),inverse(inverse(B))))=inverse(B).
% 0.19/0.45 155 [para_from,70.1.1,2.1.1] {+} double_divide(inverse(b1),inverse(inverse(b1)))!=multiply(inverse(a1),a1).
% 0.19/0.45 398 [para_from,129.1.1,15.1.1.1.2] {+} multiply(multiply(inverse(inverse(A)),inverse(A)),inverse(B))=inverse(B).
% 0.19/0.45 502 [para_from,398.1.1,23.1.1.2.2,demod,100] {-} multiply(inverse(A),A)=double_divide(inverse(B),inverse(inverse(B))).
% 0.19/0.45 503 [copy,502,flip.1] {-} double_divide(inverse(A),inverse(inverse(A)))=multiply(inverse(B),B).
% 0.19/0.45 504 [binary,503.1,155.1] {-} $F.
% 0.19/0.45
% 0.19/0.45 % SZS output end Refutation
% 0.19/0.45 ------------ end of proof -------------
% 0.19/0.45
% 0.19/0.45
% 0.19/0.45 Search stopped by max_proofs option.
% 0.19/0.45
% 0.19/0.45
% 0.19/0.45 Search stopped by max_proofs option.
% 0.19/0.45
% 0.19/0.45 ============ end of search ============
% 0.19/0.45
% 0.19/0.45 ----------- soft-scott stats ----------
% 0.19/0.45
% 0.19/0.45 true clauses given 3 (10.3%)
% 0.19/0.45 false clauses given 26
% 0.19/0.45
% 0.19/0.45 FALSE TRUE
% 0.19/0.45 13 10 0
% 0.19/0.45 14 19 0
% 0.19/0.45 15 4 0
% 0.19/0.45 16 17 0
% 0.19/0.45 17 16 0
% 0.19/0.45 18 11 0
% 0.19/0.45 19 32 0
% 0.19/0.45 20 19 0
% 0.19/0.45 21 14 0
% 0.19/0.45 22 18 0
% 0.19/0.45 23 6 0
% 0.19/0.45 24 10 0
% 0.19/0.45 25 11 0
% 0.19/0.45 26 2 0
% 0.19/0.45 27 15 0
% 0.19/0.45 28 8 0
% 0.19/0.45 29 2 0
% 0.19/0.45 30 5 0
% 0.19/0.45 31 3 0
% 0.19/0.45 33 3 0
% 0.19/0.45 34 1 0
% 0.19/0.45 36 2 0
% 0.19/0.45 39 1 0
% 0.19/0.45 tot: 229 0 (0.0% true)
% 0.19/0.45
% 0.19/0.45
% 0.19/0.45 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.45
% 0.19/0.45 That finishes the proof of the theorem.
% 0.19/0.45
% 0.19/0.45 Process 2623 finished Mon Jun 13 14:49:09 2022
%------------------------------------------------------------------------------