TSTP Solution File: GRP605-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP605-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n021.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:30 EDT 2022
% Result : Unsatisfiable 0.18s 0.43s
% Output : Refutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : GRP605-1 : TPTP v8.1.0. Released v2.6.0.
% 0.11/0.12 % Command : sos-script %s
% 0.11/0.33 % Computer : n021.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Mon Jun 13 07:25:41 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.34 ----- Otter 3.2, August 2001 -----
% 0.18/0.34 The process was started by sandbox on n021.cluster.edu,
% 0.18/0.34 Mon Jun 13 07:25:41 2022
% 0.18/0.34 The command was "./sos". The process ID is 31366.
% 0.18/0.34
% 0.18/0.34 set(prolog_style_variables).
% 0.18/0.34 set(auto).
% 0.18/0.34 dependent: set(auto1).
% 0.18/0.34 dependent: set(process_input).
% 0.18/0.34 dependent: clear(print_kept).
% 0.18/0.34 dependent: clear(print_new_demod).
% 0.18/0.34 dependent: clear(print_back_demod).
% 0.18/0.34 dependent: clear(print_back_sub).
% 0.18/0.34 dependent: set(control_memory).
% 0.18/0.34 dependent: assign(max_mem, 12000).
% 0.18/0.34 dependent: assign(pick_given_ratio, 4).
% 0.18/0.34 dependent: assign(stats_level, 1).
% 0.18/0.34 dependent: assign(pick_semantic_ratio, 3).
% 0.18/0.34 dependent: assign(sos_limit, 5000).
% 0.18/0.34 dependent: assign(max_weight, 60).
% 0.18/0.34 clear(print_given).
% 0.18/0.34
% 0.18/0.34 list(usable).
% 0.18/0.34
% 0.18/0.34 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 0.18/0.34
% 0.18/0.34 All clauses are units, and equality is present; the
% 0.18/0.34 strategy will be Knuth-Bendix with positive clauses in sos.
% 0.18/0.34
% 0.18/0.34 dependent: set(knuth_bendix).
% 0.18/0.34 dependent: set(para_from).
% 0.18/0.34 dependent: set(para_into).
% 0.18/0.34 dependent: clear(para_from_right).
% 0.18/0.34 dependent: clear(para_into_right).
% 0.18/0.34 dependent: set(para_from_vars).
% 0.18/0.34 dependent: set(eq_units_both_ways).
% 0.18/0.34 dependent: set(dynamic_demod_all).
% 0.18/0.34 dependent: set(dynamic_demod).
% 0.18/0.34 dependent: set(order_eq).
% 0.18/0.34 dependent: set(back_demod).
% 0.18/0.34 dependent: set(lrpo).
% 0.18/0.34
% 0.18/0.34 ------------> process usable:
% 0.18/0.34
% 0.18/0.34 ------------> process sos:
% 0.18/0.34 Following clause subsumed by 8 during input processing: 0 [copy,8,flip.1] {-} A=A.
% 0.18/0.34
% 0.18/0.34 ======= end of input processing =======
% 0.18/0.38
% 0.18/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.38
% 0.18/0.38 Stopped by limit on number of solutions
% 0.18/0.38
% 0.18/0.38
% 0.18/0.38 -------------- Softie stats --------------
% 0.18/0.38
% 0.18/0.38 UPDATE_STOP: 300
% 0.18/0.38 SFINDER_TIME_LIMIT: 2
% 0.18/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.38 number of clauses in intial UL: 1
% 0.18/0.38 number of clauses initially in problem: 6
% 0.18/0.38 percentage of clauses intially in UL: 16
% 0.18/0.38 percentage of distinct symbols occuring in initial UL: 83
% 0.18/0.38 percent of all initial clauses that are short: 100
% 0.18/0.38 absolute distinct symbol count: 6
% 0.18/0.38 distinct predicate count: 1
% 0.18/0.38 distinct function count: 3
% 0.18/0.38 distinct constant count: 2
% 0.18/0.38
% 0.18/0.38 ---------- no more Softie stats ----------
% 0.18/0.38
% 0.18/0.38
% 0.18/0.38
% 0.18/0.38 Model 2 (0.00 seconds, 0 Inserts)
% 0.18/0.38
% 0.18/0.38 Stopped by limit on number of solutions
% 0.18/0.38
% 0.18/0.38 =========== start of search ===========
% 0.18/0.43
% 0.18/0.43 -------- PROOF --------
% 0.18/0.43 % SZS status Unsatisfiable
% 0.18/0.43 % SZS output start Refutation
% 0.18/0.43
% 0.18/0.43 ----> UNIT CONFLICT at 0.06 sec ----> 469 [binary,468.1,2.1] {+} $F.
% 0.18/0.43
% 0.18/0.43 Length of proof is 22. Level of proof is 14.
% 0.18/0.43
% 0.18/0.43 ---------------- PROOF ----------------
% 0.18/0.43 % SZS status Unsatisfiable
% 0.18/0.43 % SZS output start Refutation
% 0.18/0.43
% 0.18/0.43 1 [] {-} multiply(inverse(a1),a1)!=multiply(inverse(b1),b1).
% 0.18/0.43 2 [copy,1,flip.1] {+} multiply(inverse(b1),b1)!=multiply(inverse(a1),a1).
% 0.18/0.43 3 [] {-} double_divide(inverse(double_divide(A,inverse(double_divide(inverse(B),double_divide(A,C))))),C)=B.
% 0.18/0.43 5 [] {-} multiply(A,B)=inverse(double_divide(B,A)).
% 0.18/0.43 7,6 [copy,5,flip.1] {+} inverse(double_divide(A,B))=multiply(B,A).
% 0.18/0.43 9 [back_demod,3,demod,7,7] {-} double_divide(multiply(multiply(double_divide(A,B),inverse(C)),A),B)=C.
% 0.18/0.43 11 [para_into,9.1.1.1.1.1,9.1.1] {-} double_divide(multiply(multiply(A,inverse(B)),multiply(multiply(double_divide(C,D),inverse(A)),C)),D)=B.
% 0.18/0.43 15 [para_from,9.1.1,6.1.1.1,flip.1] {-} multiply(A,multiply(multiply(double_divide(B,A),inverse(C)),B))=inverse(C).
% 0.18/0.43 37 [para_into,11.1.1.1,15.1.1] {-} double_divide(inverse(A),multiply(A,inverse(B)))=B.
% 0.18/0.43 53 [para_from,37.1.1,6.1.1.1,flip.1] {-} multiply(multiply(A,inverse(B)),inverse(A))=inverse(B).
% 0.18/0.43 57 [para_into,53.1.1.1.2,6.1.1,demod,7] {-} multiply(multiply(A,multiply(B,C)),inverse(A))=multiply(B,C).
% 0.18/0.43 59 [para_into,53.1.1.1,53.1.1] {-} multiply(inverse(A),inverse(multiply(B,inverse(A))))=inverse(B).
% 0.18/0.43 63 [para_from,53.1.1,37.1.1.2] {-} double_divide(inverse(multiply(A,inverse(B))),inverse(B))=A.
% 0.18/0.43 69 [para_into,63.1.1.1.1,53.1.1] {-} double_divide(inverse(inverse(A)),inverse(B))=multiply(B,inverse(A)).
% 0.18/0.43 70 [copy,69,flip.1] {-} multiply(A,inverse(B))=double_divide(inverse(inverse(B)),inverse(A)).
% 0.18/0.43 84,83 [para_into,59.1.1.2.1,53.1.1,flip.1] {+} inverse(multiply(A,inverse(B)))=multiply(inverse(A),inverse(inverse(B))).
% 0.18/0.43 95 [back_demod,63,demod,84] {-} double_divide(multiply(inverse(A),inverse(inverse(B))),inverse(B))=A.
% 0.18/0.43 145 [para_from,70.1.1,53.1.1.1] {-} multiply(double_divide(inverse(inverse(A)),inverse(B)),inverse(B))=inverse(A).
% 0.18/0.43 344 [para_from,145.1.1,15.1.1.2.1] {-} multiply(inverse(A),multiply(inverse(B),inverse(inverse(B))))=inverse(A).
% 0.18/0.43 346 [para_from,145.1.1,11.1.1.1.2.1] {-} double_divide(multiply(multiply(A,inverse(B)),multiply(inverse(C),inverse(inverse(C)))),inverse(A))=B.
% 0.18/0.43 367,366 [para_into,344.1.1.1,6.1.1,demod,7] {-} multiply(multiply(A,B),multiply(inverse(C),inverse(inverse(C))))=multiply(A,B).
% 0.18/0.43 382 [back_demod,346,demod,367] {-} double_divide(multiply(A,inverse(B)),inverse(A))=B.
% 0.18/0.43 388 [para_from,344.1.1,57.1.1.1] {-} multiply(inverse(A),inverse(inverse(A)))=multiply(inverse(B),inverse(inverse(B))).
% 0.18/0.43 449,448 [para_into,382.1.1,95.1.1,flip.1] {-} inverse(inverse(A))=A.
% 0.18/0.43 468 [back_demod,388,demod,449,449] {-} multiply(inverse(A),A)=multiply(inverse(B),B).
% 0.18/0.43 469 [binary,468.1,2.1] {+} $F.
% 0.18/0.43
% 0.18/0.43 % SZS output end Refutation
% 0.18/0.43 ------------ end of proof -------------
% 0.18/0.43
% 0.18/0.43
% 0.18/0.43 Search stopped by max_proofs option.
% 0.18/0.43
% 0.18/0.43
% 0.18/0.43 Search stopped by max_proofs option.
% 0.18/0.43
% 0.18/0.43 ============ end of search ============
% 0.18/0.43
% 0.18/0.43 ----------- soft-scott stats ----------
% 0.18/0.43
% 0.18/0.43 true clauses given 1 (3.7%)
% 0.18/0.43 false clauses given 26
% 0.18/0.43
% 0.18/0.43 FALSE TRUE
% 0.18/0.43 10 0 1
% 0.18/0.43 11 2 0
% 0.18/0.43 12 1 2
% 0.18/0.43 13 14 0
% 0.18/0.43 14 22 0
% 0.18/0.43 15 5 0
% 0.18/0.43 16 17 0
% 0.18/0.43 17 14 0
% 0.18/0.43 18 10 0
% 0.18/0.43 19 25 0
% 0.18/0.43 20 14 0
% 0.18/0.43 21 8 0
% 0.18/0.43 22 15 0
% 0.18/0.43 23 5 0
% 0.18/0.43 24 7 0
% 0.18/0.43 25 11 0
% 0.18/0.43 26 5 0
% 0.18/0.43 27 14 0
% 0.18/0.43 28 8 0
% 0.18/0.43 29 1 0
% 0.18/0.43 30 2 0
% 0.18/0.43 31 3 0
% 0.18/0.43 33 3 0
% 0.18/0.43 34 1 0
% 0.18/0.43 36 2 0
% 0.18/0.43 39 1 0
% 0.18/0.43 tot: 210 3 (1.4% true)
% 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 That finishes the proof of the theorem.
% 0.18/0.43
% 0.18/0.43 Process 31366 finished Mon Jun 13 07:25:42 2022
%------------------------------------------------------------------------------