TSTP Solution File: NUM617+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : NUM617+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n007.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:20:05 EDT 2022
% Result : Theorem 2.11s 2.35s
% Output : Refutation 2.11s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : NUM617+1 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n007.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jul 5 08:18:42 EDT 2022
% 0.12/0.35 % CPUTime :
% 0.12/0.39 ----- Otter 3.2, August 2001 -----
% 0.12/0.39 The process was started by sandbox on n007.cluster.edu,
% 0.12/0.39 Tue Jul 5 08:18:42 2022
% 0.12/0.39 The command was "./sos". The process ID is 15689.
% 0.12/0.39
% 0.12/0.39 set(prolog_style_variables).
% 0.12/0.39 set(auto).
% 0.12/0.39 dependent: set(auto1).
% 0.12/0.39 dependent: set(process_input).
% 0.12/0.39 dependent: clear(print_kept).
% 0.12/0.39 dependent: clear(print_new_demod).
% 0.12/0.39 dependent: clear(print_back_demod).
% 0.12/0.39 dependent: clear(print_back_sub).
% 0.12/0.39 dependent: set(control_memory).
% 0.12/0.39 dependent: assign(max_mem, 12000).
% 0.12/0.39 dependent: assign(pick_given_ratio, 4).
% 0.12/0.39 dependent: assign(stats_level, 1).
% 0.12/0.39 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.39 dependent: assign(sos_limit, 5000).
% 0.12/0.39 dependent: assign(max_weight, 60).
% 0.12/0.39 clear(print_given).
% 0.12/0.39
% 0.12/0.39 formula_list(usable).
% 0.12/0.39
% 0.12/0.39 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=9.
% 0.12/0.39
% 0.12/0.39 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.39 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.39 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.39 clauses in usable.
% 0.12/0.39
% 0.12/0.39 dependent: set(knuth_bendix).
% 0.12/0.39 dependent: set(para_from).
% 0.12/0.39 dependent: set(para_into).
% 0.12/0.39 dependent: clear(para_from_right).
% 0.12/0.39 dependent: clear(para_into_right).
% 0.12/0.39 dependent: set(para_from_vars).
% 0.12/0.39 dependent: set(eq_units_both_ways).
% 0.12/0.39 dependent: set(dynamic_demod_all).
% 0.12/0.39 dependent: set(dynamic_demod).
% 0.12/0.39 dependent: set(order_eq).
% 0.12/0.39 dependent: set(back_demod).
% 0.12/0.39 dependent: set(lrpo).
% 0.12/0.39 dependent: set(hyper_res).
% 0.12/0.39 dependent: set(unit_deletion).
% 0.12/0.39 dependent: set(factor).
% 0.12/0.39
% 0.12/0.39 ------------> process usable:
% 0.12/0.39 Following clause subsumed by 139 during input processing: 0 [] {-} xK!=sz00.
% 0.12/0.39 177 back subsumes 176.
% 0.12/0.39
% 0.12/0.39 ------------> process sos:
% 0.12/0.39 Following clause subsumed by 241 during input processing: 0 [] {-} aSet0(xO).
% 0.12/0.39 Following clause subsumed by 274 during input processing: 0 [copy,274,flip.1] {-} A=A.
% 0.12/0.39 274 back subsumes 203.
% 0.12/0.39 274 back subsumes 187.
% 0.12/0.39 274 back subsumes 182.
% 0.12/0.39 274 back subsumes 181.
% 0.12/0.39 274 back subsumes 179.
% 0.12/0.39 274 back subsumes 175.
% 0.12/0.39 274 back subsumes 169.
% 0.12/0.39
% 0.12/0.39 ======= end of input processing =======
% 0.55/0.75
% 0.55/0.75 Stopped by limit on insertions
% 0.55/0.75
% 0.55/0.75
% 0.55/0.75 Failed to model usable list: disabling FINDER
% 0.55/0.75
% 0.55/0.75
% 0.55/0.75
% 0.55/0.75 -------------- Softie stats --------------
% 0.55/0.75
% 0.55/0.75 UPDATE_STOP: 300
% 0.55/0.75 SFINDER_TIME_LIMIT: 2
% 0.55/0.75 SHORT_CLAUSE_CUTOFF: 4
% 0.55/0.75 number of clauses in intial UL: 188
% 0.55/0.75 number of clauses initially in problem: 253
% 0.55/0.75 percentage of clauses intially in UL: 74
% 0.55/0.75 percentage of distinct symbols occuring in initial UL: 95
% 0.55/0.75 percent of all initial clauses that are short: 100
% 0.55/0.75 absolute distinct symbol count: 67
% 0.55/0.75 distinct predicate count: 10
% 0.55/0.75 distinct function count: 39
% 0.55/0.75 distinct constant count: 18
% 0.55/0.75
% 0.55/0.75 ---------- no more Softie stats ----------
% 0.55/0.75
% 0.55/0.75
% 0.55/0.75
% 0.55/0.75 =========== start of search ===========
% 1.13/1.33
% 1.13/1.33
% 1.13/1.33 Changing weight limit from 60 to 30.
% 1.13/1.33
% 1.13/1.33 Resetting weight limit to 30 after 40 givens.
% 1.13/1.33
% 1.51/1.73
% 1.51/1.73
% 1.51/1.73 Changing weight limit from 30 to 23.
% 1.51/1.73
% 1.51/1.73 Resetting weight limit to 23 after 45 givens.
% 1.51/1.73
% 1.80/2.01
% 1.80/2.01
% 1.80/2.01 Changing weight limit from 23 to 20.
% 1.80/2.01
% 1.80/2.01 Resetting weight limit to 20 after 50 givens.
% 1.80/2.01
% 1.94/2.14
% 1.94/2.14
% 1.94/2.14 Changing weight limit from 20 to 19.
% 1.94/2.14
% 1.94/2.14 Resetting weight limit to 19 after 60 givens.
% 1.94/2.14
% 2.11/2.35
% 2.11/2.35 -------- PROOF --------
% 2.11/2.35 % SZS status Theorem
% 2.11/2.35 % SZS output start Refutation
% 2.11/2.35
% 2.11/2.35 ----> UNIT CONFLICT at 1.96 sec ----> 9578 [binary,9577.1,168.1] {-} $F.
% 2.11/2.35
% 2.11/2.35 Length of proof is 3. Level of proof is 3.
% 2.11/2.35
% 2.11/2.35 ---------------- PROOF ----------------
% 2.11/2.35 % SZS status Theorem
% 2.11/2.35 % SZS output start Refutation
% 2.11/2.35
% 2.11/2.35 7 [] {+} -aSet0(A)| -aSubsetOf0(B,A)|aSet0(B).
% 2.11/2.35 8 [] {+} -aSet0(A)| -aSubsetOf0(B,A)| -aElementOf0(C,B)|aElementOf0(C,A).
% 2.11/2.35 14 [] {+} -aSet0(A)| -aSet0(B)| -aSet0(C)| -aSubsetOf0(A,B)| -aSubsetOf0(B,C)|aSubsetOf0(A,C).
% 2.11/2.35 168 [] {+} -aElementOf0(xx,szNzAzT0).
% 2.11/2.35 205 [] {-} aSet0(szNzAzT0).
% 2.11/2.35 241 [] {-} aSet0(xO).
% 2.11/2.35 248 [] {-} aSubsetOf0(xQ,xO).
% 2.11/2.35 249 [] {-} aSubsetOf0(xQ,szNzAzT0).
% 2.11/2.35 255 [] {-} aSet0(xP).
% 2.11/2.35 261 [] {-} aSubsetOf0(xP,xQ).
% 2.11/2.35 273 [] {-} aElementOf0(xx,xP).
% 2.11/2.35 3118 [hyper,248,7,241] {-} aSet0(xQ).
% 2.11/2.35 4585 [hyper,261,14,255,3118,205,249] {-} aSubsetOf0(xP,szNzAzT0).
% 2.11/2.35 9577 [hyper,4585,8,205,273] {-} aElementOf0(xx,szNzAzT0).
% 2.11/2.35 9578 [binary,9577.1,168.1] {-} $F.
% 2.11/2.35
% 2.11/2.35 % SZS output end Refutation
% 2.11/2.35 ------------ end of proof -------------
% 2.11/2.35
% 2.11/2.35
% 2.11/2.35 Search stopped by max_proofs option.
% 2.11/2.35
% 2.11/2.35
% 2.11/2.35 Search stopped by max_proofs option.
% 2.11/2.35
% 2.11/2.35 ============ end of search ============
% 2.11/2.35
% 2.11/2.35 That finishes the proof of the theorem.
% 2.11/2.35
% 2.11/2.35 Process 15689 finished Tue Jul 5 08:18:44 2022
%------------------------------------------------------------------------------