%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : NUM565+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n003.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 : Mon Jul 18 14:19:34 EDT 2022
% Result : Theorem 1.19s 1.41s
% Output : Refutation 1.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM565+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : sos-script %s
% 0.12/0.33 % Computer : n003.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Wed Jul 6 05:58:11 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.37 ----- Otter 3.2, August 2001 -----
% 0.12/0.37 The process was started by sandbox on n003.cluster.edu,
% 0.12/0.37 Wed Jul 6 05:58:11 2022
% 0.12/0.37 The command was "./sos". The process ID is 18448.
% 0.12/0.37
% 0.12/0.37 set(prolog_style_variables).
% 0.12/0.37 set(auto).
% 0.12/0.37 dependent: set(auto1).
% 0.12/0.37 dependent: set(process_input).
% 0.12/0.37 dependent: clear(print_kept).
% 0.12/0.37 dependent: clear(print_new_demod).
% 0.12/0.37 dependent: clear(print_back_demod).
% 0.12/0.37 dependent: clear(print_back_sub).
% 0.12/0.37 dependent: set(control_memory).
% 0.12/0.37 dependent: assign(max_mem, 12000).
% 0.12/0.37 dependent: assign(pick_given_ratio, 4).
% 0.12/0.37 dependent: assign(stats_level, 1).
% 0.12/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.37 dependent: assign(sos_limit, 5000).
% 0.12/0.37 dependent: assign(max_weight, 60).
% 0.12/0.37 clear(print_given).
% 0.12/0.37
% 0.12/0.37 formula_list(usable).
% 0.12/0.37
% 0.12/0.37 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=9.
% 0.12/0.37
% 0.12/0.37 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.37 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.37 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.37 clauses in usable.
% 0.12/0.37
% 0.12/0.37 dependent: set(knuth_bendix).
% 0.12/0.37 dependent: set(para_from).
% 0.12/0.37 dependent: set(para_into).
% 0.12/0.37 dependent: clear(para_from_right).
% 0.12/0.37 dependent: clear(para_into_right).
% 0.12/0.37 dependent: set(para_from_vars).
% 0.12/0.37 dependent: set(eq_units_both_ways).
% 0.12/0.37 dependent: set(dynamic_demod_all).
% 0.12/0.37 dependent: set(dynamic_demod).
% 0.12/0.37 dependent: set(order_eq).
% 0.12/0.37 dependent: set(back_demod).
% 0.12/0.37 dependent: set(lrpo).
% 0.12/0.37 dependent: set(hyper_res).
% 0.12/0.37 dependent: set(unit_deletion).
% 0.12/0.37 dependent: set(factor).
% 0.12/0.37
% 0.12/0.37 ------------> process usable:
% 0.12/0.37 149 back subsumes 148.
% 0.12/0.37
% 0.12/0.37 ------------> process sos:
% 0.12/0.37 Following clause subsumed by 194 during input processing: 0 [copy,194,flip.1] {-} A=A.
% 0.12/0.37 194 back subsumes 159.
% 0.12/0.37 194 back subsumes 154.
% 0.12/0.37 194 back subsumes 153.
% 0.12/0.37 194 back subsumes 151.
% 0.12/0.37 194 back subsumes 147.
% 0.12/0.37 194 back subsumes 141.
% 0.12/0.37
% 0.12/0.37 ======= end of input processing =======
% 0.58/0.79
% 0.58/0.79 Stopped by limit on insertions
% 0.58/0.79
% 0.58/0.79
% 0.58/0.79 Failed to model usable list: disabling FINDER
% 0.58/0.79
% 0.58/0.79
% 0.58/0.79
% 0.58/0.79 -------------- Softie stats --------------
% 0.58/0.79
% 0.58/0.79 UPDATE_STOP: 300
% 0.58/0.79 SFINDER_TIME_LIMIT: 2
% 0.58/0.79 SHORT_CLAUSE_CUTOFF: 4
% 0.58/0.79 number of clauses in intial UL: 159
% 0.58/0.79 number of clauses initially in problem: 182
% 0.58/0.79 percentage of clauses intially in UL: 87
% 0.58/0.79 percentage of distinct symbols occuring in initial UL: 90
% 0.58/0.79 percent of all initial clauses that are short: 100
% 0.58/0.79 absolute distinct symbol count: 53
% 0.58/0.79 distinct predicate count: 10
% 0.58/0.79 distinct function count: 35
% 0.58/0.79 distinct constant count: 8
% 0.58/0.79
% 0.58/0.79 ---------- no more Softie stats ----------
% 0.58/0.79
% 0.58/0.79
% 0.58/0.79
% 0.58/0.79 =========== start of search ===========
% 1.19/1.41
% 1.19/1.41 -------- PROOF --------
% 1.19/1.41 % SZS status Theorem
% 1.19/1.41 % SZS output start Refutation
% 1.19/1.41
% 1.19/1.41 ----> UNIT CONFLICT at 1.02 sec ----> 4790 [binary,4789.1,194.1] {-} $F.
% 1.19/1.41
% 1.19/1.41 Length of proof is 11. Level of proof is 7.
% 1.19/1.41
% 1.19/1.41 ---------------- PROOF ----------------
% 1.19/1.41 % SZS status Theorem
% 1.19/1.41 % SZS output start Refutation
% 1.19/1.41
% 1.19/1.41 2 [] {+} A!=slcrc0|aSet0(A).
% 1.19/1.41 7 [] {+} -aSet0(A)| -aSubsetOf0(B,A)|aSet0(B).
% 1.19/1.41 12 [] {+} -aSet0(A)|aSubsetOf0(A,A).
% 1.19/1.41 13 [] {+} -aSet0(A)| -aSet0(B)| -aSubsetOf0(A,B)| -aSubsetOf0(B,A)|A=B.
% 1.19/1.41 60 [] {+} -aSet0(A)|sbrdtbr0(A)!=sz00|A=slcrc0.
% 1.19/1.41 93 [] {+} -aSet0(A)| -aElementOf0(B,szNzAzT0)|C!=slbdtsldtrb0(A,B)| -aElementOf0(D,C)|aSubsetOf0(D,A).
% 1.19/1.41 94 [] {+} -aSet0(A)| -aElementOf0(B,szNzAzT0)|C!=slbdtsldtrb0(A,B)| -aElementOf0(D,C)|sbrdtbr0(D)=B.
% 1.19/1.41 139 [] {-} sdtlpdtrp0(xc,$c1)!=sdtlpdtrp0(xc,slcrc0).
% 1.19/1.41 140 [copy,139,flip.1] {+} sdtlpdtrp0(xc,slcrc0)!=sdtlpdtrp0(xc,$c1).
% 1.19/1.41 175 [] {-} aSet0(szNzAzT0).
% 1.19/1.41 177 [] {-} aElementOf0(sz00,szNzAzT0).
% 1.19/1.41 179,178 [] {-} slbdtrb0(sz00)=slcrc0.
% 1.19/1.41 183 [] {-} aSubsetOf0(xS,szNzAzT0).
% 1.19/1.41 193 [] {-} aElementOf0($c1,slbdtsldtrb0(xS,sz00)).
% 1.19/1.41 194 [] {-} A=A.
% 1.19/1.41 783 [hyper,183,7,175] {-} aSet0(xS).
% 1.19/1.41 894 [hyper,178,2,demod,179] {-} aSet0(slcrc0).
% 1.19/1.41 2049,2048 [hyper,193,94,783,177,194] {-} sbrdtbr0($c1)=sz00.
% 1.19/1.41 2050 [hyper,193,93,783,177,194] {-} aSubsetOf0($c1,xS).
% 1.19/1.41 3183 [hyper,2050,7,783] {-} aSet0($c1).
% 1.19/1.41 3468 [hyper,3183,12] {-} aSubsetOf0($c1,$c1).
% 1.19/1.41 3869 [para_into,3468.1.1,60.3.1,demod,2049,unit_del,3183,194] {-} aSubsetOf0(slcrc0,$c1).
% 1.19/1.41 3915 [para_into,3468.1.2,60.3.1,demod,2049,unit_del,3183,194] {-} aSubsetOf0($c1,slcrc0).
% 1.19/1.41 4031,4030 [hyper,3915,13,894,3183,3869] {-} slcrc0=$c1.
% 1.19/1.41 4789 [back_demod,140,demod,4031] {-} sdtlpdtrp0(xc,$c1)!=sdtlpdtrp0(xc,$c1).
% 1.19/1.41 4790 [binary,4789.1,194.1] {-} $F.
% 1.19/1.41
% 1.19/1.41 % SZS output end Refutation
% 1.19/1.41 ------------ end of proof -------------
% 1.19/1.41
% 1.19/1.41
% 1.19/1.41 Search stopped by max_proofs option.
% 1.19/1.41
% 1.19/1.41
% 1.19/1.41 Search stopped by max_proofs option.
% 1.19/1.41
% 1.19/1.41 ============ end of search ============
% 1.19/1.41
% 1.19/1.41 That finishes the proof of the theorem.
% 1.19/1.41
% 1.19/1.41 Process 18448 finished Wed Jul 6 05:58:12 2022
%------------------------------------------------------------------------------