%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP195-1 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n026.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:14 EDT 2022
% Result : Unsatisfiable 0.20s 0.48s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : GRP195-1 : TPTP v8.1.0. Released v2.2.0.
% 0.04/0.14 % Command : sos-script %s
% 0.14/0.35 % Computer : n026.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Mon Jun 13 10:22:50 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.20/0.37 ----- Otter 3.2, August 2001 -----
% 0.20/0.37 The process was started by sandbox on n026.cluster.edu,
% 0.20/0.37 Mon Jun 13 10:22:50 2022
% 0.20/0.37 The command was "./sos". The process ID is 30982.
% 0.20/0.37
% 0.20/0.37 set(prolog_style_variables).
% 0.20/0.37 set(auto).
% 0.20/0.37 dependent: set(auto1).
% 0.20/0.37 dependent: set(process_input).
% 0.20/0.37 dependent: clear(print_kept).
% 0.20/0.37 dependent: clear(print_new_demod).
% 0.20/0.37 dependent: clear(print_back_demod).
% 0.20/0.37 dependent: clear(print_back_sub).
% 0.20/0.37 dependent: set(control_memory).
% 0.20/0.37 dependent: assign(max_mem, 12000).
% 0.20/0.37 dependent: assign(pick_given_ratio, 4).
% 0.20/0.37 dependent: assign(stats_level, 1).
% 0.20/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.37 dependent: assign(sos_limit, 5000).
% 0.20/0.37 dependent: assign(max_weight, 60).
% 0.20/0.37 clear(print_given).
% 0.20/0.37
% 0.20/0.37 list(usable).
% 0.20/0.37
% 0.20/0.37 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 0.20/0.37
% 0.20/0.37 All clauses are units, and equality is present; the
% 0.20/0.37 strategy will be Knuth-Bendix with positive clauses in sos.
% 0.20/0.37
% 0.20/0.37 dependent: set(knuth_bendix).
% 0.20/0.37 dependent: set(para_from).
% 0.20/0.37 dependent: set(para_into).
% 0.20/0.37 dependent: clear(para_from_right).
% 0.20/0.37 dependent: clear(para_into_right).
% 0.20/0.37 dependent: set(para_from_vars).
% 0.20/0.37 dependent: set(eq_units_both_ways).
% 0.20/0.37 dependent: set(dynamic_demod_all).
% 0.20/0.37 dependent: set(dynamic_demod).
% 0.20/0.37 dependent: set(order_eq).
% 0.20/0.37 dependent: set(back_demod).
% 0.20/0.37 dependent: set(lrpo).
% 0.20/0.37
% 0.20/0.37 ------------> process usable:
% 0.20/0.37
% 0.20/0.37 ------------> process sos:
% 0.20/0.37 Following clause subsumed by 5 during input processing: 0 [copy,5,flip.1] {-} A=A.
% 0.20/0.37 Following clause subsumed by 4 during input processing: 0 [copy,6,flip.1] {-} multiply(A,multiply(B,B))=multiply(B,multiply(B,A)).
% 0.20/0.37
% 0.20/0.37 ======= end of input processing =======
% 0.20/0.39
% 0.20/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.39
% 0.20/0.39 Stopped by limit on number of solutions
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39 -------------- Softie stats --------------
% 0.20/0.39
% 0.20/0.39 UPDATE_STOP: 300
% 0.20/0.39 SFINDER_TIME_LIMIT: 2
% 0.20/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.39 number of clauses in intial UL: 1
% 0.20/0.39 number of clauses initially in problem: 6
% 0.20/0.39 percentage of clauses intially in UL: 16
% 0.20/0.39 percentage of distinct symbols occuring in initial UL: 100
% 0.20/0.39 percent of all initial clauses that are short: 100
% 0.20/0.39 absolute distinct symbol count: 4
% 0.20/0.39 distinct predicate count: 1
% 0.20/0.39 distinct function count: 1
% 0.20/0.39 distinct constant count: 2
% 0.20/0.39
% 0.20/0.39 ---------- no more Softie stats ----------
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39 =========== start of search ===========
% 0.20/0.48
% 0.20/0.48 -------- PROOF --------
% 0.20/0.48 % SZS status Unsatisfiable
% 0.20/0.48 % SZS output start Refutation
% 0.20/0.48
% 0.20/0.48 ----> UNIT CONFLICT at 0.09 sec ----> 580 [binary,579.1,48.1] {-} $F.
% 0.20/0.48
% 0.20/0.48 Length of proof is 6. Level of proof is 4.
% 0.20/0.48
% 0.20/0.48 ---------------- PROOF ----------------
% 0.20/0.48 % SZS status Unsatisfiable
% 0.20/0.48 % SZS output start Refutation
% 0.20/0.48
% 0.20/0.48 1 [] {+} multiply(a,multiply(b,multiply(a,multiply(b,multiply(a,multiply(b,multiply(a,b)))))))!=multiply(a,multiply(a,multiply(a,multiply(a,multiply(b,multiply(b,multiply(b,b))))))).
% 0.20/0.48 3,2 [] {-} multiply(multiply(A,B),C)=multiply(A,multiply(B,C)).
% 0.20/0.48 4 [] {-} multiply(A,multiply(B,B))=multiply(B,multiply(B,A)).
% 0.20/0.48 8 [para_into,4.1.1.2,2.1.1,demod,3,3] {-} multiply(A,multiply(B,multiply(C,multiply(B,C))))=multiply(B,multiply(C,multiply(B,multiply(C,A)))).
% 0.20/0.48 9 [para_into,4.1.1,2.1.1] {-} multiply(A,multiply(B,multiply(C,C)))=multiply(C,multiply(C,multiply(A,B))).
% 0.20/0.48 28 [para_from,9.1.1,2.1.1.1,demod,3,3,3,3,3] {-} multiply(A,multiply(A,multiply(B,multiply(C,D))))=multiply(B,multiply(C,multiply(A,multiply(A,D)))).
% 0.20/0.48 48 [para_from,8.1.1,1.1.1.2.2.2] {-} multiply(a,multiply(b,multiply(a,multiply(a,multiply(b,multiply(a,multiply(b,b)))))))!=multiply(a,multiply(a,multiply(a,multiply(a,multiply(b,multiply(b,multiply(b,b))))))).
% 0.20/0.48 541 [para_into,28.1.1.2.2.2,28.1.1] {-} multiply(A,multiply(A,multiply(B,multiply(C,multiply(D,multiply(E,multiply(E,F)))))))=multiply(B,multiply(E,multiply(A,multiply(A,multiply(E,multiply(C,multiply(D,F))))))).
% 0.20/0.48 579 [copy,541,flip.1] {-} multiply(A,multiply(B,multiply(C,multiply(C,multiply(B,multiply(D,multiply(E,F)))))))=multiply(C,multiply(C,multiply(A,multiply(D,multiply(E,multiply(B,multiply(B,F))))))).
% 0.20/0.48 580 [binary,579.1,48.1] {-} $F.
% 0.20/0.48
% 0.20/0.48 % SZS output end Refutation
% 0.20/0.48 ------------ end of proof -------------
% 0.20/0.48
% 0.20/0.48
% 0.20/0.48 Search stopped by max_proofs option.
% 0.20/0.48
% 0.20/0.48
% 0.20/0.48 Search stopped by max_proofs option.
% 0.20/0.48
% 0.20/0.48 ============ end of search ============
% 0.20/0.48
% 0.20/0.48 ----------- soft-scott stats ----------
% 0.20/0.48
% 0.20/0.48 true clauses given 1 (5.6%)
% 0.20/0.48 false clauses given 17
% 0.20/0.48
% 0.20/0.48 FALSE TRUE
% 0.20/0.48 19 24 0
% 0.20/0.48 23 92 0
% 0.20/0.48 27 111 0
% 0.20/0.48 31 93 0
% 0.20/0.48 35 48 0
% 0.20/0.48 39 36 0
% 0.20/0.48 43 24 0
% 0.20/0.48 47 24 0
% 0.20/0.48 51 6 0
% 0.20/0.48 55 20 0
% 0.20/0.48 59 6 0
% 0.20/0.48 tot: 484 0 (0.0% true)
% 0.20/0.48
% 0.20/0.48
% 0.20/0.48 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.48
% 0.20/0.48 That finishes the proof of the theorem.
% 0.20/0.48
% 0.20/0.48 Process 30982 finished Mon Jun 13 10:22:51 2022
%------------------------------------------------------------------------------