%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : NUM539+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n019.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:16 EDT 2022
% Result : Theorem 5.57s 5.79s
% Output : Refutation 5.57s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : NUM539+1 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n019.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jul 7 01:33:53 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox on n019.cluster.edu,
% 0.13/0.36 Thu Jul 7 01:33:53 2022
% 0.13/0.36 The command was "./sos". The process ID is 14751.
% 0.13/0.36
% 0.13/0.36 set(prolog_style_variables).
% 0.13/0.36 set(auto).
% 0.13/0.36 dependent: set(auto1).
% 0.13/0.36 dependent: set(process_input).
% 0.13/0.36 dependent: clear(print_kept).
% 0.13/0.36 dependent: clear(print_new_demod).
% 0.13/0.36 dependent: clear(print_back_demod).
% 0.13/0.36 dependent: clear(print_back_sub).
% 0.13/0.36 dependent: set(control_memory).
% 0.13/0.36 dependent: assign(max_mem, 12000).
% 0.13/0.36 dependent: assign(pick_given_ratio, 4).
% 0.13/0.36 dependent: assign(stats_level, 1).
% 0.13/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36 dependent: assign(sos_limit, 5000).
% 0.13/0.36 dependent: assign(max_weight, 60).
% 0.13/0.36 clear(print_given).
% 0.13/0.36
% 0.13/0.36 formula_list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 0.13/0.36
% 0.13/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.36 clauses in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(knuth_bendix).
% 0.13/0.36 dependent: set(para_from).
% 0.13/0.36 dependent: set(para_into).
% 0.13/0.36 dependent: clear(para_from_right).
% 0.13/0.36 dependent: clear(para_into_right).
% 0.13/0.36 dependent: set(para_from_vars).
% 0.13/0.36 dependent: set(eq_units_both_ways).
% 0.13/0.36 dependent: set(dynamic_demod_all).
% 0.13/0.36 dependent: set(dynamic_demod).
% 0.13/0.36 dependent: set(order_eq).
% 0.13/0.36 dependent: set(back_demod).
% 0.13/0.36 dependent: set(lrpo).
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: set(unit_deletion).
% 0.13/0.36 dependent: set(factor).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36 87 back subsumes 86.
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36 Following clause subsumed by 100 during input processing: 0 [copy,100,flip.1] {-} A=A.
% 0.13/0.36 100 back subsumes 91.
% 0.13/0.36 100 back subsumes 89.
% 0.13/0.36 100 back subsumes 85.
% 0.13/0.36 100 back subsumes 79.
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.50/0.73
% 0.50/0.73 Stopped by limit on insertions
% 0.50/0.73
% 0.50/0.73
% 0.50/0.73 Failed to model usable list: disabling FINDER
% 0.50/0.73
% 0.50/0.73
% 0.50/0.73
% 0.50/0.73 -------------- Softie stats --------------
% 0.50/0.73
% 0.50/0.73 UPDATE_STOP: 300
% 0.50/0.73 SFINDER_TIME_LIMIT: 2
% 0.50/0.73 SHORT_CLAUSE_CUTOFF: 4
% 0.50/0.73 number of clauses in intial UL: 83
% 0.50/0.73 number of clauses initially in problem: 92
% 0.50/0.73 percentage of clauses intially in UL: 90
% 0.50/0.73 percentage of distinct symbols occuring in initial UL: 100
% 0.50/0.73 percent of all initial clauses that are short: 100
% 0.50/0.73 absolute distinct symbol count: 28
% 0.50/0.73 distinct predicate count: 9
% 0.50/0.73 distinct function count: 14
% 0.50/0.73 distinct constant count: 5
% 0.50/0.73
% 0.50/0.73 ---------- no more Softie stats ----------
% 0.50/0.73
% 0.50/0.73
% 0.50/0.73
% 0.50/0.73 =========== start of search ===========
% 3.50/3.70
% 3.50/3.70
% 3.50/3.70 Changing weight limit from 60 to 29.
% 3.50/3.70
% 3.50/3.70 Resetting weight limit to 29 after 45 givens.
% 3.50/3.70
% 3.89/4.09
% 3.89/4.09
% 3.89/4.09 Changing weight limit from 29 to 27.
% 3.89/4.09
% 3.89/4.09 Resetting weight limit to 27 after 50 givens.
% 3.89/4.09
% 4.30/4.48
% 4.30/4.48
% 4.30/4.48 Changing weight limit from 27 to 25.
% 4.30/4.48
% 4.30/4.48 Resetting weight limit to 25 after 55 givens.
% 4.30/4.48
% 4.61/4.80
% 4.61/4.80
% 4.61/4.80 Changing weight limit from 25 to 24.
% 4.61/4.80
% 4.61/4.80 Resetting weight limit to 24 after 65 givens.
% 4.61/4.80
% 4.81/4.98
% 4.81/4.98
% 4.81/4.98 Changing weight limit from 24 to 22.
% 4.81/4.98
% 4.81/4.98 Resetting weight limit to 22 after 70 givens.
% 4.81/4.98
% 5.20/5.40
% 5.20/5.40
% 5.20/5.40 Changing weight limit from 22 to 21.
% 5.20/5.40
% 5.20/5.40 Resetting weight limit to 21 after 80 givens.
% 5.20/5.40
% 5.57/5.79
% 5.57/5.79 -------- PROOF --------
% 5.57/5.79 % SZS status Theorem
% 5.57/5.79 % SZS output start Refutation
% 5.57/5.79
% 5.57/5.79 ----> UNIT CONFLICT at 5.38 sec ----> 11686 [binary,11684.1,78.1] {-} $F.
% 5.57/5.79
% 5.57/5.79 Length of proof is 6. Level of proof is 2.
% 5.57/5.79
% 5.57/5.79 ---------------- PROOF ----------------
% 5.57/5.79 % SZS status Theorem
% 5.57/5.79 % SZS output start Refutation
% 5.57/5.79
% 5.57/5.79 8 [] {+} -aSet0(A)| -aSubsetOf0(B,A)| -aElementOf0(C,B)|aElementOf0(C,A).
% 5.57/5.79 53 [] {+} -aElementOf0(A,szNzAzT0)| -aElementOf0(B,szNzAzT0)| -sdtlseqdt0(A,B)| -sdtlseqdt0(B,A)|A=B.
% 5.57/5.79 68 [] {+} -aSubsetOf0(A,szNzAzT0)|A=slcrc0|B!=szmzizndt0(A)| -aElementOf0(C,A)|sdtlseqdt0(B,C).
% 5.57/5.79 75 [] {+} xS!=slcrc0.
% 5.57/5.79 76 [] {+} xT!=slcrc0.
% 5.57/5.79 77 [] {-} szmzizndt0(xS)!=szmzizndt0(xT).
% 5.57/5.79 78 [copy,77,flip.1] {+} szmzizndt0(xT)!=szmzizndt0(xS).
% 5.57/5.79 93 [] {-} aSet0(szNzAzT0).
% 5.57/5.79 96 [] {-} aSubsetOf0(xS,szNzAzT0).
% 5.57/5.79 97 [] {-} aSubsetOf0(xT,szNzAzT0).
% 5.57/5.79 98 [] {-} aElementOf0(szmzizndt0(xS),xT).
% 5.57/5.79 99 [] {-} aElementOf0(szmzizndt0(xT),xS).
% 5.57/5.79 100 [] {-} A=A.
% 5.57/5.79 556 [hyper,98,68,97,100,unit_del,76] {-} sdtlseqdt0(szmzizndt0(xT),szmzizndt0(xS)).
% 5.57/5.79 559 [hyper,98,8,93,97] {-} aElementOf0(szmzizndt0(xS),szNzAzT0).
% 5.57/5.79 1002 [hyper,99,68,96,100,unit_del,75] {-} sdtlseqdt0(szmzizndt0(xS),szmzizndt0(xT)).
% 5.57/5.79 1005 [hyper,99,8,93,96] {-} aElementOf0(szmzizndt0(xT),szNzAzT0).
% 5.57/5.79 11684 [hyper,1002,53,1005,559,556] {-} szmzizndt0(xT)=szmzizndt0(xS).
% 5.57/5.79 11686 [binary,11684.1,78.1] {-} $F.
% 5.57/5.79
% 5.57/5.79 % SZS output end Refutation
% 5.57/5.79 ------------ end of proof -------------
% 5.57/5.79
% 5.57/5.79
% 5.57/5.79 Search stopped by max_proofs option.
% 5.57/5.79
% 5.57/5.79
% 5.57/5.79 Search stopped by max_proofs option.
% 5.57/5.79
% 5.57/5.79 ============ end of search ============
% 5.57/5.79
% 5.57/5.79 That finishes the proof of the theorem.
% 5.57/5.79
% 5.57/5.79 Process 14751 finished Thu Jul 7 01:33:59 2022
%------------------------------------------------------------------------------