%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : ALG176+1 : TPTP v8.1.0. Released v2.7.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 : Thu Jul 14 18:01:12 EDT 2022
% Result : Theorem 0.72s 0.89s
% Output : Refutation 0.72s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : ALG176+1 : TPTP v8.1.0. Released v2.7.0.
% 0.00/0.12 % Command : sos-script %s
% 0.13/0.33 % Computer : n018.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Wed Jun 8 08:16:51 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.20/0.35 ----- Otter 3.2, August 2001 -----
% 0.20/0.35 The process was started by sandbox2 on n018.cluster.edu,
% 0.20/0.35 Wed Jun 8 08:16:51 2022
% 0.20/0.35 The command was "./sos". The process ID is 26701.
% 0.20/0.35
% 0.20/0.35 set(prolog_style_variables).
% 0.20/0.35 set(auto).
% 0.20/0.35 dependent: set(auto1).
% 0.20/0.35 dependent: set(process_input).
% 0.20/0.35 dependent: clear(print_kept).
% 0.20/0.35 dependent: clear(print_new_demod).
% 0.20/0.35 dependent: clear(print_back_demod).
% 0.20/0.35 dependent: clear(print_back_sub).
% 0.20/0.35 dependent: set(control_memory).
% 0.20/0.35 dependent: assign(max_mem, 12000).
% 0.20/0.35 dependent: assign(pick_given_ratio, 4).
% 0.20/0.35 dependent: assign(stats_level, 1).
% 0.20/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.35 dependent: assign(sos_limit, 5000).
% 0.20/0.35 dependent: assign(max_weight, 60).
% 0.20/0.35 clear(print_given).
% 0.20/0.35
% 0.20/0.35 formula_list(usable).
% 0.20/0.35
% 0.20/0.35 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 0.20/0.35
% 0.20/0.35 This is a Horn set with equality. The strategy will be
% 0.20/0.35 Knuth-Bendix and hyper_res, with positive clauses in
% 0.20/0.35 sos and nonpositive clauses in usable.
% 0.20/0.35
% 0.20/0.35 dependent: set(knuth_bendix).
% 0.20/0.35 dependent: set(para_from).
% 0.20/0.35 dependent: set(para_into).
% 0.20/0.35 dependent: clear(para_from_right).
% 0.20/0.35 dependent: clear(para_into_right).
% 0.20/0.35 dependent: set(para_from_vars).
% 0.20/0.35 dependent: set(eq_units_both_ways).
% 0.20/0.35 dependent: set(dynamic_demod_all).
% 0.20/0.35 dependent: set(dynamic_demod).
% 0.20/0.35 dependent: set(order_eq).
% 0.20/0.35 dependent: set(back_demod).
% 0.20/0.35 dependent: set(lrpo).
% 0.20/0.35 dependent: set(hyper_res).
% 0.20/0.35 dependent: clear(order_hyper).
% 0.20/0.35
% 0.20/0.35 ------------> process usable:
% 0.20/0.35
% 0.20/0.35 ------------> process sos:
% 0.20/0.35 Following clause subsumed by 13 during input processing: 0 [copy,13,flip.1] {-} A=A.
% 0.20/0.35
% 0.20/0.35 ======= end of input processing =======
% 0.69/0.87
% 0.69/0.87 Stopped by limit on insertions
% 0.69/0.87
% 0.69/0.87
% 0.69/0.87 Failed to model usable list: disabling FINDER
% 0.69/0.87
% 0.69/0.87
% 0.69/0.87
% 0.69/0.87 -------------- Softie stats --------------
% 0.69/0.87
% 0.69/0.87 UPDATE_STOP: 300
% 0.69/0.87 SFINDER_TIME_LIMIT: 2
% 0.69/0.87 SHORT_CLAUSE_CUTOFF: 4
% 0.69/0.87 number of clauses in intial UL: 11
% 0.69/0.87 number of clauses initially in problem: 13
% 0.69/0.87 percentage of clauses intially in UL: 84
% 0.69/0.87 percentage of distinct symbols occuring in initial UL: 100
% 0.69/0.87 percent of all initial clauses that are short: 100
% 0.69/0.87 absolute distinct symbol count: 9
% 0.69/0.87 distinct predicate count: 3
% 0.69/0.87 distinct function count: 5
% 0.69/0.87 distinct constant count: 1
% 0.69/0.87
% 0.69/0.87 ---------- no more Softie stats ----------
% 0.69/0.87
% 0.69/0.87
% 0.69/0.87
% 0.69/0.87 =========== start of search ===========
% 0.72/0.89
% 0.72/0.89 -------- PROOF --------
% 0.72/0.89 % SZS status Theorem
% 0.72/0.89 % SZS output start Refutation
% 0.72/0.89
% 0.72/0.89 -----> EMPTY CLAUSE at 0.51 sec ----> 2358 [hyper,41,3,43] {-} $F.
% 0.72/0.89
% 0.72/0.89 Length of proof is 6. Level of proof is 3.
% 0.72/0.89
% 0.72/0.89 ---------------- PROOF ----------------
% 0.72/0.89 % SZS status Theorem
% 0.72/0.89 % SZS output start Refutation
% 0.72/0.89
% 0.72/0.89 3 [] {+} -sorti1(A)|op1(A,$c1)!=A.
% 0.72/0.89 4 [] {+} -sorti2(A)|sorti2($f1(A)).
% 0.72/0.89 5 [] {+} -sorti2(A)|op2($f1(A),A)=$f1(A).
% 0.72/0.89 6 [] {+} -sorti1(A)|sorti2(h(A)).
% 0.72/0.89 7 [] {+} -sorti2(A)|sorti1(j(A)).
% 0.72/0.89 9 [] {+} -sorti2(A)| -sorti2(B)|j(op2(A,B))=op1(j(A),j(B)).
% 0.72/0.89 11 [] {+} -sorti1(A)|j(h(A))=A.
% 0.72/0.89 12 [] {-} sorti1($c1).
% 0.72/0.89 15,14 [hyper,12,11] {-} j(h($c1))=$c1.
% 0.72/0.89 18 [hyper,12,6] {-} sorti2(h($c1)).
% 0.72/0.89 23,22 [hyper,18,5] {-} op2($f1(h($c1)),h($c1))=$f1(h($c1)).
% 0.72/0.89 24 [hyper,18,4] {-} sorti2($f1(h($c1))).
% 0.72/0.89 41 [hyper,24,9,18,demod,23,15,flip.1] {-} op1(j($f1(h($c1))),$c1)=j($f1(h($c1))).
% 0.72/0.89 43 [hyper,24,7] {-} sorti1(j($f1(h($c1)))).
% 0.72/0.89 2358 [hyper,41,3,43] {-} $F.
% 0.72/0.89
% 0.72/0.89 % SZS output end Refutation
% 0.72/0.89 ------------ end of proof -------------
% 0.72/0.89
% 0.72/0.89
% 0.72/0.89 Search stopped by max_proofs option.
% 0.72/0.89
% 0.72/0.89
% 0.72/0.89 Search stopped by max_proofs option.
% 0.72/0.89
% 0.72/0.89 ============ end of search ============
% 0.72/0.89
% 0.72/0.89 That finishes the proof of the theorem.
% 0.72/0.89
% 0.72/0.89 Process 26701 finished Wed Jun 8 08:16:52 2022
%------------------------------------------------------------------------------